Traveling salesperson problem with unique pricing and stochastic thresholds

被引:4
作者
Afsar, Hasan Murat [1 ]
机构
[1] Univ Technol Troyes, LIST3N, 12 Rue Marie Curie, F-10010 Troyes, France
关键词
Traveling Salesperson Problem; Unique Pricing; Random thresholds; Chance-constrained model; Logic Based Benders Decomposition; VEHICLE-ROUTING PROBLEM; INVENTORY; LOCATION;
D O I
10.1016/j.cie.2022.108696
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this variant of traveling salesperson person problem, only the customers who accept to pay a unique service fee are serviced. Each customer has a random price acceptance threshold and accepts to pay any fee lower than this threshold. To address this issue, a chance-constrained stochastic model is developed and two exact methods, one based on a Branch & Cut scheme, and the other on Logic Based Benders Decomposition, are built. Numerical tests show that, on small instances both methods are efficient but on larger instances with 100 customers, Logic Based Benders Decomposition dominates clearly the Branch & Cut method.
引用
收藏
页数:16
相关论文
共 34 条
[1]   Vehicle routing problem with zone-based pricing [J].
Afsar, Hasan Murat ;
Afsar, Sezin ;
Jose Palacios, Juan .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2021, 152
[2]   A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm [J].
Ahmadi-Javid, Amir ;
Amiri, Elahe ;
Meskar, Mahla .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 271 (03) :866-881
[3]   Incorporating location, inventory and price decisions into a supply chain distribution network design problem [J].
Ahmadi-Javid, Amir ;
Hoseinpour, Pooya .
COMPUTERS & OPERATIONS RESEARCH, 2015, 56 :110-119
[4]   The probabilistic orienteering problem [J].
Angelelli, Enrico ;
Archetti, Claudia ;
Filippi, Carlo ;
Vindigni, Michele .
COMPUTERS & OPERATIONS RESEARCH, 2017, 81 :269-281
[5]  
Applegate D, 2006, Concorde tsp solver
[6]  
Applegate DL., 2011, The Traveling Salesman Problem
[7]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[8]  
Berman B., 2005, Business Horizons, V48, P169, DOI [https://doi.org/10.1016/j.bushor.2004.10.015, DOI 10.1016/J.BUSHOR.2004.10.015]
[9]   The team orienteering problem [J].
Chao, IM ;
Golden, BL ;
Wasil, EA .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 88 (03) :464-474
[10]   The probabilistic vehicle routing problem with service guarantees [J].
Chen, Lijian ;
Chiang, Wen-Chyuan ;
Russell, Robert ;
Chen, Jun ;
Sun, Dengfeng .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2018, 111 :149-164