Lower bounds for the mixed capacitated arc routing problem

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 692-699

  Gouveia, Luís ^a,c   Mourão, Maria Cândida ^b,c   Pinto, Leonor Santiago ^b,d  

^a UNIVERSITY OF LISBON   (Portugal)

^b UNIVERSITY OF LISBON   (Portugal)

^c Centro de Investigação Operacional   (Portugal)

^d CEMAPRE Centro de Matematica Aplicada a Previsao e Decisao Economica   (Portugal)

Author keywords

Formulations; Lower bounds; Mixed capacitated arc routing

Indexed keywords

CAPACITATED ARC ROUTING PROBLEM; FLOW BASED; FORMULATIONS; LIMITED CAPACITY; LOWER BOUNDS; MIXED CAPACITATED ARC ROUTING; ORIGINAL MODEL; REALISTIC SCENARIO; VALID INEQUALITY;

BENCHMARKING; CONTROL THEORY; LINEARIZATION;

CAVITY RESONATORS;

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

References (30)

1. Amaya A., Langevin A., and Trépanier M. The capacitated arc routing problem with refill points. Operations Research Letters 35 (2007) 45-53
2. Amposah S.K., and Salhi S. The investigation of a class of capacitated arc routing problems: the collection of garbage in developing countries. Waste Management 24 (2004) 711-721
3. Assad A.A., and Golden B.L. Arc routing methods and applications. In: Ball M.O., Magnanti T.L., Monma C.L., and Nemhauser G.L. (Eds). Handbooks in operations research and management science, vol. 8, network routing (1995), Elsevier, Amsterdam 375-483
4. Baldacci R., and Maniezzo V. Exact methods based on node-routing formulations for undirected arc routing problems. Networks 47 (2006) 52-60
5. Bautista J., Fernández E., and Pereira J. Solving an urban waste collection problem using ants heuristics. Computers & Operations Research 35 (2008) 3020-3033
6. Belenguer J.M., and Benavent E. The capacitated arc routing problem: valid inequalities and facets. Computational Optimization and Applications 10 (1998) 165-187
7. Belenguer J.M., and Benavent E. A cutting plane algorithm for the capacitated arc routing problem. Computers & Operations Research 30 (2003) 705-728
8. 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 (2006) 3363-3383
9. Corberán A., Romero A., and Sanchis J.M. The mixed general routing polyhedron. Mathematical Programming 96 (2003) 103-137
10. Del Pia A., and Filippi C. A variable neighbourhood descent algorithm for a real waste collection problem with mobile depots. International Transactions in Operational Research 13 (2006) 125-141
11. In: Dror M. (Ed). Arc routing: theory, solutions and applications (2000), Kluwer Academic Publishers, Boston
12. Eglese R.W., and Letchford A.N. Polyhedral theory for arc routing problems. In: Dror M. (Ed). Arc routing: theory, solutions and applications (2000), Kluwer Academic Publishers, Boston 199-230
13. Eiselt H.A., Gendreau M., and Laporte G. Arc routing problems, part I: the Chinese postman problem. Operations Research 43 (1995) 231-242
14. Eiselt H.A., Gendreau M., and Laporte G. Arc routing problems, part II: the rural postman problem. Operations Research 43 (1995) 399-414
15. Gavish B, Graves SC. The travelling salesman problem and related problems. Working paper no. 7905, Graduate School of Management, University of Rochester; 1979.
16. Gavish B, Graves C. Scheduling and routing in transportation and distribution systems: formulations and new relaxations. Working paper, Graduate School of Management, University of Rochester; 1982.
17. Ghiani G., Guerreiro F., Improta G., and Musmanno R. Waste collection in Southern Italy: solution of a real-life arc routing problem. International Transactions in Operational Research 12 (2005) 135-144
18. Ghiani G., Improta G., and Laporte G. The capacitated arc routing problem with intermediate facilities. Networks 37 (2001) 134-143
19. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
20. Irnich S. Solution of real-world postman problems. European Journal of Operational Research 190 (2008) 52-67
21. Lacomme P, Prins C, Ramdane-Cherif W. An integer linear model for general arc routing problems. Working paper, Université Technologie de Troyes; 2003.
22. Longo H., Poggi de Aragão M., and Uchoa E. Solving capacitated arc routing problems using a transformation to the CVRP. Computers & Operations Research 33 (2006) 1823-1837
23. Magnanti T.L. Combinatorial optimization and vehicle fleet planning: perspectives and prospects. Networks 11 (1981) 179-213
24. Maniezzo V. Algorithms for large directed CARP instances: urban solid waste collection operational support. Technical report UBLCS-2004-16, Department of Computer Science, University of Bologna, Italy; 2004.
25. Moreira L.M., Oliveira J.F., Gomes A.M., and Ferreira J.S. Heuristics for a dynamic rural postman problem. Computers & Operations Research 34 (2007) 3281-3294
26. Mourão M.C., and Almeida M.T. Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. European Journal of Operational Research 121 (2000) 420-434
27. Mourão M.C., and Amado L. Heuristic method for a mixed capacitated arc routing problem: a refuse collection application. European Journal of Operational Research 160 (2005) 139-153
28. Nobert Y., and Picard J.C. An optimal algorithm for the mixed Chinese postman problem. Networks 27 (1996) 95-108
29. Pearn W.L., Assad A., and Golden B.L. Transforming arc routing into node routing problems. Computers & Operations Research 14 (1987) 285-288
30. Wøhlk S. A decade of capacitated arc routing. In: Golden B., Raghavan S., and Wasil E. (Eds). The vehicle routing problem-latest advances and new challenges, operations research/computer science interfaces (2008), Springer, Berlin 29-48