An effective memetic algorithm for the cumulative capacitated vehicle routing problem

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1877-1885

  Ngueveu, Sandra Ulrich ^a   Prins, Christian ^a   Wolfler Calvo, Roberto ^b  

^a UNIVERSITÉ DE TECHNOLOGIE DE TROYES   (France)

^b UNIVERSITÉ PARIS 13   (France)

Author keywords

Cumulative capacitated vehicle routing problem; Memetic algorithm; Metaheuristic; Routing for relief; Traveling repairman problem

Indexed keywords

ARRIVAL TIME; BOUNDING PROCEDURES; CAPACITATED VEHICLE ROUTING PROBLEM; CAPACITY CONSTRAINTS; COST VARIATIONS; CUSTOMER NEED; LOCAL SEARCH; LOWER BOUNDS; MEMETIC ALGORITHMS; METAHEURISTIC; NATURAL DISASTERS; NON-TRIVIAL; NP-HARD; ROUTE LENGTH; TRANSPORTATION PROBLEM; UPPER BOUND; VEHICLE CAPACITY CONSTRAINTS; VEHICLE FLEETS;

CUSTOMER SATISFACTION; HEURISTIC METHODS; ROUTING ALGORITHMS; VEHICLES;

FLEET OPERATIONS;

EID: 77951101612     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.06.014     Document Type: Article

References (21)

1. Archer A., Levin A., and Williamson D.P. A faster, better approximation algorithm for the minimum latency problem. SIAM Journal on Computing 5 37 (2008) 1473-1498
2. Arkin E.M., Hassin R., and Levin A. Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms 59 1 (2006) 1-18
3. Bertacco L., Brunetta L., and Fischetti M. The linear ordering problem with cumulative costs. European Journal of Operational Research 189 3 (2008) 1345-1357
4. Bianco L., Mingozzi A., and Ricciardelli S. The traveling salesman problem with cumulative costs. Networks 23 2 (1993) 81-91
5. Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M. The minimum latency problem. In: Proceedings of the twenty-sixth annual ACM symposium on theory of computing (STOC '94); 1994. p. 163-71.
6. Campbell A.M., Vandenbussche D., and Hermann W. Routing for relief efforts. Transportation Science 42 2 (2008) 127-145
7. Chaudhuri K, Godfrey B, Rao S, Talwar K. Paths, trees, and minimum latency tours. In: FOCS '03: proceedings of the 44th annual IEEE symposium on foundations of computer science, Washington, DC, USA. Spring, MD: IEEE Computer Society Press Silver; 2003. p. 36.
8. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., and Sandi L. (Eds). Combinatorial optimization (1979), Wiley, Chichester 315-338
9. Cordone R, Wolfler Calvo R. Note on time window constraints in routing problems. Internal Report 96.005, Dipartimento di Electronica e Informazione, Politechnico di Milano, Milan, Italy; 1996.
10. Fischetti M., Laporte G., and Martello S. The delivery man problem and cumulative matroids. Operations Research 6 (1993) 1055-1064
11. Kallehauge B., Larsen J., and Madsen O.B.G. Lagrangian duality applied to the vehicle routing problem with time windows. Computers and Operations Research 33 (2006) 1464-1487
12. Kara I., Yetis B.K., and Yetis K. Energy minimizing vehicle routing problem. In: Dress A., and Zhu B. (Eds). Combinatorial optimization and applications (2007), Springer, Berlin, Heidelberg 62-71
13. Kindervater G., and Savelsbergh M. Vehicle routing: handling edge exchanges. In: Lenstra J., and Aarts E. (Eds). Local search in combinatorial optimization (1997), Wiley, Chichester 337-360
14. Letchford A.N., Lysgaard J., and Eglese R.W. A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society 58 (2007) 1642-1651
15. Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31 (2004) 1985-2002
16. Reinelt G. 〈http://www.iwr.uniheidelberg.de/groups/comopt/software/TSPLIB95/〉; 1995.
17. Sahni S, Gonzalez T. P-complete problems and approximate solutions. In: 15th annual symposium on switching and automata theory. London: IEEE, October 1974. p. 28-32.
18. Salehipour A, Sörensen K, Goos P, Bräysy O. An efficient GRASP + VND metaheuristic for the traveling repairman problem. Working paper, University of Antwerp, Faculty of Applied Economics, May 2008.
19. Sarubbi J, Luna H, Miranda G. Minimum latency problem as a shortest path problem with side constraints. In: XIV latin Ibero-American congress on operations research (CLAIO); 2008.
20. Savelsbergh M.W.P. The vehicle routing problem with time windows: minimizing route duration. INFORMS Journal on Computing 4 (1992) 146-154
21. Wu B.Y., Huang Z.-N., and Zhan F.-J. Exact algorithms for the minimum latency problem. Information Processing Letters 92 6 (2004) 303-309