Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows

Computers and Operations Research

Volumn 37, Issue 11, 2010, Pages 1870-1876

  Vansteenwegen, Pieter ^a   Souffriau, Wouter ^a,b   Sörensen, Kenneth ^c  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b Information Technology   (Belgium)

^c UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Arc routing; Mobile mapping van; Soft time windows; Tele Atlas; Vehicle routing

Indexed keywords

ARC ROUTING; CAPACITATED ARC ROUTING PROBLEM; DIGITAL MAP; ITERATED LOCAL SEARCH; LINEAR PROGRAMMING SOLVERS; LOCAL SEARCH; MAP DATA; METAHEURISTIC; MOBILE MAPPING; REAL-LIFE PROBLEMS; ROAD SIGNS; TELE ATLAS; TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

CAVITY RESONATORS; FLEET OPERATIONS; HEURISTIC METHODS; LINEARIZATION; MAPPING; MAPS; ROADS AND STREETS; VEHICLE ROUTING; VEHICLES;

CABS (TRUCK);

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

References (21)

1. Aminu U.F., and Eglese R.W. A constraint programming approach to the Chinese postman problem with time windows. Computers & Operations Research 33 12 (2006) 3423-3431
2. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 (2006) 52-60
3. Belenguer J.M., Benavent E., Lacomme P., and Prins C. Lower and upper bounds for the mixed capacitated arc routing problem. Computers & Operations Research 33 12 (2006) 3363-3383
4. Brandáo J., and Eglese R.W. A deterministic tabu search algorithm for the capacitated arc routing problem. Computers & Operations Research 35 4 (2008) 1112-1126
5. Bräysÿ O., and Gendreau M. Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transportation Science 39 1 (2005) 104-118
6. Bräysÿ O., and Gendreau M. Vehicle routing problem with time windows, part II: metaheuristics. Transportation Science 39 1 (2005) 119-139
7. Calvete H.I., Galé C., Oliveros M.J., and Sánchez-Valverde B. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operational Research 177 3 (2007) 1720-1733
8. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to algorithms (2001), MIT Press, Cambridge, MA
9. Hashimoto H., Yagiura M., and Ibaraki T. An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optimization 5 2 (2008) 434-456
10. Ibaraki T., Imahoria S., Kubo M., Masuda T., Uno T., and Yagiura M. Effective local search algorithms for routing and scheduling with general time-window constraints. Transportation Science 39 2 (2005) 206-232
11. Ioannou G., Kritikos M., and Prastacos G. A problem generator-solver heuristic for vehicle routing with soft time windows. Omega 31 1 (2003) 41-53
12. Labadi N, Prins C, Reghioui M. GRASP with path relinking for the capacitated arc routing problem with time windows. Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management 2008: 111.
13. Longo H., de Aragǎo M.P., and Uchoa E. Solving capacitated arc routing problems using a transformation to the CVRP. Computers & Operations Research 33 6 (2006) 1823-1837
14. Lourenço H, Martin O, Stützle T. Iterated Local Search 2003: 321-53.
15. Min H. A multiobjective vehicle routing problem with soft time windows: the case of a public library distribution system. Socio-Economic Planning Science 25 3 (1991) 179-188
16. Or I. Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL; 1976.
17. Pearn W., Assad A., and Golden B.L. Transforming arc routing into node routing problems. Computers & Operations Research 14 4 (1987) 285-288
18. Potvin J.Y., and Rousseau J.M. An exchange heuristic for routing problems with time windows. Journal of the Operational Research Society 46 (1995) 1433-1446
19. Savelsbergh M. The vehicle routing problem with time windows: minimizing route duration. Journal of Computing 4 (1992) 146-154
20. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 2 (1987) 254-265
21. Taillard E., Badeau P., Gendreau M., Guertin F., and Potvin J.-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science 31 2 (1997) 170-186