New exact method for large asymmetric distance-constrained vehicle routing problem

European Journal of Operational Research

Volumn 226, Issue 3, 2013, Pages 386-394

  Almoustafa, Samira ^a   Hanafi, Said ^b   Mladenović, Nenad ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b LAMIH   (France)

Author keywords

Assignment; Branch and bound; Combinatorial optimization; Vehicle routing problem

Indexed keywords

ASSIGNMENT; ASSIGNMENT PROBLEMS; BEST-FIRST STRATEGY; BOUNDING PROCEDURES; BRANCH AND BOUNDS; BRANCHING RULES; DISTANCE CONSTRAINED VEHICLE ROUTING PROBLEM; EXACT METHODS; OPTIMAL SOLUTIONS; OPTIMALITY; SEARCH TREES; TRAVELLING SALESMAN PROBLEM; VEHICLE ROUTING PROBLEMS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; LINEAR PROGRAMMING; ROUTING ALGORITHMS; TRAVELING SALESMAN PROBLEM;

NETWORK ROUTING;

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

References (36)

1. S. Almoustafa, B. Goldengorin, M. Tso, and N. Mladenović Two new exact methods for asymmetric distance-constrained vehicle routing problem Proceedings of SYM-OP-IS 2009 297 300
2. R. Baldacci, P. Toth, and D. Vigo Recent advances in vehicle routing exact algorithms 4OR 5 4 2007 269 298
3. R. Baldacci, and A. Mingozzi An unified exact method for solving different classes of vehicle routing problems Mathematical Programming Series A 120 2 2009 347 380
4. R. Baldacci, A. Mingozzi, and R. Roberti Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (invited review) European Journal of Operational Research 218 1 2012 1 6
5. E. Balas, and P. Toth Branch and bound methods Lawer The Traveling Salesman Problem 1985 Wiley Chichester 361 401
6. J. Brimberg, P. Hansen, and N. Mladenovic Attraction probabilities in variable neighborhood search 4OR 8 2010 181 194
7. E. Carrizosa, N. Mladenovic, and R. Todosijevic Sum-of-squares clustering on networks Yugoslav Journal of Operations Research 21 2011 157 161
8. G. Clarke, and J.V. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
9. N. Christofides, A. Mingozzi, and P. Toth State space relaxation procedures for the comuptation of bounds to routing problems Networks 11 2 1981 145 164
10. G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson Solution of a large-scale traveling salesman problem Operations Research 2 1954 393 410
11. B. Goldengorin, G. Jager, and P. Molitor Tolerances applied in combinatorial optimization Journal of Computer Science 2 9 2006 716 734
12. J. Gondzio, P. Gonzlez-Brevis, and P. Munari New developments in the primal-dual column generation techniqu European Journal of Operational Research 224 1 2013 41 51
13. M. Haimovich, A.H.G. Rinnooy Kan, and L. Stougie Analysis of heuristic routing problems Golden Vehicle Routing: Methods and Studies 1988 North Holland Amsterdam 47 61
14. P. Hansen, N. Mladenović, and J.A. Moreno Prez Variable neighbourhood search: methods and applications Annals of Operations Research 175 1 2010 367 407
15. R. Jonker, and A. Volgenant Improving the hungarian assignment algorithm Operations Research Letters 5 4 1986 171 175
16. Kara, I.; Kara, B.Y.; Yetis, M.K.; 2007. Energy minimizing vehicle routing problem. In: Dress et al.; (Eds.), Combinatorial Optimization and Applications, vol. 4616. LNCS, pp. 62-71.
17. Kara, I.; 2011. Arc based integer programming formulations for the distance constrained vehicle routing problem. In: 3rd IEEE International Symposium on Logistics and Industrial Informatics (LINDI). pp. 33-38, doi: 10.1109/LINDI.2011.6031159.
18. T. Koltai, and T. Terlaky The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming International Journal of Production Economics 65 3 2000 257 274
19. H.W. Kuhn The hungarian method for the assignment problem Naval Research Logistics Quarterly 2 1955 83 97
20. G. Laporte, Y. Nobert, and M. Desrochers Optimal routing under capacity and distance restractions Operations Research 33 5 1985 1050 1073
21. G. Laporte, and Y. Nobert Exact algorithms for the vehicle routing problem Annals of Discrete Mathematics 31 1987 147 184
22. G. Laporte, Y. Nobert, and S. Taillefer A branch and bound algorithm for the asymmetrical distance-constrained vehicle routing problem Mathematical Modelling 9 12 1987 857 868
23. G. Laporte The vehicle routing problem: An overview of exact and approximate algorithms European Journal of Operational Research 59 3 1992 345 358
24. G. Laporte What you should know about the vehicle routing problem Naval Research Logistics 54 8 2007 811 819
25. E.L. Lawer, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization Wiley-Interscience Series in Discrete Mathematics 1985 Wiley Chichester
26. J.K. Lenstra, and A.H.G. Rinnooy Kan Some simple applications of the traveling salesman problem Operational Research Quaterly 26 4 1975 717 734
27. A.N. Letchford, and J.J. Salazar-Gonźalez Projection results for vehicle routing Mathematical Programming, Series B 105 2006 251 274
28. C. Lin, and U. Wen Sensitivity analysis of the optimal assignment Discrete Optimization 149 1 2003 35 46
29. N. Mladenovic, R. Todosijevic, and D. Urosevic An efficient general variable neighborhood search for large TSP problem with time windows Yugoslav Journal of Operations Research 22 2012 141 151 10.2298/YJOR120530015M
30. N. Mladenovic, D. Urosevic, S. Hanafi, and A. Ilic A General variable neighborhood search for the One-commodity pickup-and-delivery travelling salesman problem European Journal of Operational Research 220 1 2012 270 285
31. G.L. Nemhauser, and L.A. Wolsey Integer and Combinatorial Optimization Discrete Mathematics and Optimization 1988 Wiley New York, Chichester
32. V.Th. Paschos An overview on polynomial approximation of NP-hard problems Yugoslav Journal of Operations Research 19 1 2009 3 40
33. Pessoa. A.; Poggi de Arago, M.; Uchoa, E.; 2008. Robust branch-cut-and-price algorithms for vehicle routing problems. In: Golden, B.; et al. (Eds.), The Vehicle Routing Problem Latest Advances and New Challenges. Operations Research/Computer Science Interfaces Series, vol. 43, Part II, pp. 297-325.
34. P. Toth, and D. Vigo The Vehicle Routing Problem SIAM Monographs on Discrete Mathematics and Applications 2002 Society for Industrial and Applied Mathematics Philadelphia, PA
35. M. Turkensteen, D. Ghosh, B. Goldengorin, and G. Sierksma Tolerance-based branch and bound algorithms for the ATSP European Journal of Operational Research 189 2008 775 788
36. A. Volgenant An addendum on sensitivity analysis of the optimal assignment European Journal of Operational Research 169 1 2006 338 339