Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem

European Journal of Operational Research

Volumn 249, Issue 1, 2016, Pages 93-104

  Rivera, Juan Carlos ^a,b   Murat Afsar, H ^a   Prins, Christian ^a  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b UNIVERSIDAD EAFIT   (Colombia)

Author keywords

Disaster logistics; Multitrip cumulative capacitated Single vehicle routing problem; Resource constrained shortest path problem

Indexed keywords

DIRECTED GRAPHS; DISASTERS; GRAPH ALGORITHMS; INTEGER PROGRAMMING; ROUTING ALGORITHMS; VEHICLES;

BELLMAN-FORD ALGORITHMS; COMPUTATIONAL RESULTS; CONSTRAINED SHORTEST PATH; DIRECTED ACYCLIC GRAPH (DAG); MATHEMATICAL FORMULATION; MIXED INTEGER LINEAR PROGRAM; RESOURCE CONSTRAINT; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 84948719285     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2015.08.067     Document Type: Article

References (31)

1. Altay N., and Green III W.G. OR/MS research in disaster operations management European Journal of Operational Research 175 1 2006 475 493
2. Angel-Bello F., Martínez-Salazar I., and Alvarez A. Minimizing waiting times in a route design problem with multiple use of a single vehicle Electronic Notes in Discrete Mathematics 41 2013 269 276
3. Applegate D., Cook W., Dash S., and Rohe A. Solution of a min-max vehicle routing problem INFORMS Journal on Computing 14 2002 132 143
4. Archer A., and Williamson D.P. Faster approximation algorithms for the minimum latency problem Proceedings of the fourteenth annual acm-siam symposium on discrete algorithms (soda) 2003
5. Azi N., Gendreau M., and Potvin J.-Y. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes European Journal of Operational Research 178 3 2007 755 766 http://dx.doi.org/10.1016/j.ejor.2006.02.019
6. Bianco L., Mingozzi A., and Ricciardelli S. The traveling salesman problem with cumulative costs Networks 23 2 1993 81 91
7. Blum A., Chalasani P., Coppersmith D., Pulleyblank B., Raghavan P., and Sudan M. The minimum latency problem Proceedings of the 26th annual acm symposium on theory of computing (stoc'94) 1994 163 171
8. Boland N., Clarke L., and Nemhauser G. The asymmetric traveling salesman problem with replenishment arcs European Journal of Operational Research 123 2 2000 408 427
9. Campbell A.M., Vandenbussche D., and Hermann W. Routing for relief efforts Transportation Science 42 2 2008 127 145
10. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem N. Christofides, A. Mingozzi, P. Toth, L. Sandi, Proceedings of the Combinatorial optimization 1979 Wiley, Chichester 315 338
11. Dell R.F., Batta R., and Karwan M.H. The multiple vehicle TSP with time windows and equity constraints over a multiple day horizon Transportation Science 30 2 1996 120 133
12. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems Networks 44 3 2004 216 229 10.1002/net.20033
13. Fischetti M., Laporte G., and Martello S. The delivery man problem and cumulative matroids Operations Research 41 6 1993 1055 1064
14. Fleischmann B. The vehicle routing problem with multiple use of vehicles Working paper 1990 Department of Economics, University of Hamburg
15. Galindo G., and Batta R. Review of recent developments in OR/MS research in disaster operations management European Journal of Operational Research 230 2 2013 201 211
16. Gouveia L., and Voss S. A classification of formulations for the (time-dependent) traveling salesman problem European Journal of Operational Research 83 1 1995 69 82
17. Hemel, T., van Erk, S. Jenniskens, P.(1996). The Manhattan project, URL http://www.win.tue.nl/whizzkids/1996/tsp.html.
18. Jothi R., and Raghavachari B. Approximating the k-traveling repairman problem with repairtimes Journal of Discrete Algorithms 5 2 2007 293 303
19. Ke L., and Feng Z. A two-phase metaheuristic for the cumulative capacitated vehicle routing problem Computers & OR 40 2013 633 638
20. Lucena A. Time-dependent traveling salesman problem: The deliveryman case Networks 20 1990 753 763
21. Lysgaard J., and Wøhlk S. A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem European Journal of Operational Research 236 3 2014 800 810
22. Mak V., and Boland N. Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs International Transactions in Operational Research 7 4-5 2000 431 447
23. Ngueveu S.U., Prins C., and Calvo R.W. An effective memetic algorithm for the cumulative capacitated vehicle routing problem Computers & Operations Research 37 11 2010 1877 1885
24. Picard J.-C., and Queyranne M. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling Operations Research 26 1 1978 86 110
25. Ribeiro G.M., and Laporte G. An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem Computers & Operations Research 39 3 2012 728 735
26. Rivera J., Afsar H., and Prins C. Multistart evolutionary local search for a disaster relief problem P. Legrand, M.-M. Corsini, J.-K. Hao, N. Monmarché, E. Lutton, M. Schoenauer, Artificial evolution Lecture Notes in Computer Science 8752 2014 Springer International Publishing 129 141
27. Rivera J., Afsar H., and Prins C. A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem Computational Optimization and Applications 61 1 2015 159 187
28. Rivera J.C., Afsar M.H., and Prins C. A multi-start iterated local search for the multitrip cumulative capacitated vehicle routing problem Technical Report UTT-LOSI-13001 2013 Troyes University of Technology
29. Salehipour A., Sörensen K., Goos P., and Bräysy O. An efficient GRASP + VND metaheuristic for the traveling repairman problem Working paper 2008 University of Antwerp, Faculty of Applied Economics
30. Silva M.M., Subramanian A., Vidal T., and Ochi L.S. A simple and effective metaheuristic for the minimum latency problem European Journal of Operational Research 221 3 2012 513 520
31. Tsitsiklis J.N. Special cases of traveling salesman and repairman problems with time windows Networks 22 1992 263 282