Solving an urban waste collection problem using ants heuristics

Computers and Operations Research

Volumn 35, Issue 9, 2008, Pages 3020-3033

  Bautista, Joaquín ^a   Fernández, Elena ^a   Pereira, Jordi ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Ants heuristics; Arc routing; Urban waste management

Indexed keywords

HEURISTIC ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; URBAN PLANNING; VEHICLE ROUTING;

ANTS HEURISTICS; ARC ROUTING; URBAN WASTE COLLECTION;

WASTE MANAGEMENT;

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

References (26)

1. Bautista J. Proyecto integral de gestión de de residuos urbanos en el municipio de Sant Boi de Llobregat [in Spanish] (2001), CPDA, Barcelona
2. Dror M, editor. Arc routing: theory, solutions and applications, Boston: Kluwer; 2000.
3. Golden B.L., and Wong R.T. Capacitated arc routing problems. Networks 11 (1981) 305-315
4. Laporte G., and Nobert Y. A branch and bound algorithm for the capacitated vehicle routing problem. Operations Research Spektrum 5 (1983) 77-85
5. Letchford AN. Polyhedral results for some constrained arc-routing problems. PhD thesis, Departament of Management Science, Lancaster University, 1997.
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. Bodin L., and Kursh S.A. A computer-assisted system for the routing and scheduling of street sweepers. Operations Research 26 4 (1978) 525-537
8. Bodin L., and Kursh S.A. A detailed description of a computer system for the routing and scheduling of street sweepers. Computers and Operations Research 6 (1979) 181-198
9. Corberán A., Martí R., Martínez E., and Soler D. The rural postman problem on mixed graphs with turn penalties. Computers and Operations Research 29 (2002) 887-903
10. Roy S., and Rousseau J.M. The capacitated canadian postman problem. INFOR 27 1 (1989) 58-73
11. Laporte G. Modeling and solving several classes of arc routing problems as traveling salesman problems. Computers and Operations Research 24 11 (1997) 1057-1061
12. Dorigo M., and Stüzle T. Ant colony optimization (2004), MIT Press, Cambridge, MA
13. Pereira J. Modelización y resolución de problemas de diseño de sistemas de recogida de residuos urbanos [in Spanish]. PhD thesis, Universitat Politènica de Catalunya, 2004.
14. Floyd R.W. Algorithm 97: shortest path. Communications of the ACM 5 6 (1962) 345
15. Warshall S. A theorem on Boolean matrices. Journal of the ACM 9 1 (1962) 11-12
16. Boroujerdi A., and Uhlmann J. An efficient algorithm for computing least cost paths with turn constraints. Information Processing Letters 67 (1998) 317-321
17. Laporte G. Location-routing problems. In: Golden B.L., and Assad A.A. (Eds). Vehicle routing: methods and studies (1988), North-Holland, Amsterdam 163-197
18. Ghiani G., and Improta G. An efficient transformation of the generalized vehicle routing problem. European Journal of Operational Research 122 (2000) 11-17
19. Noon E., and Bean J.C. An efficient transformation of the generalized traveling salesman problem. INFOR 31 (1993) 39-44
20. Desrochers M., and Laporte G. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10 (1991) 27-36
21. Miller C.E., Tucker A.W., and Zemlin R.A. Integer programming formulations and traveling salesman problems. Journal of the Association for Computing Machinery 7 (1960) 326-329
22. Johnson D., Gutin G., McGeoch L.A., Yeo A., Zhang W., and Zverovitch A. Experimental analysis of heuristics of the atsp. In: Gutin G., and Punen A. (Eds). The traveling salesman problem and its variations (2002), Kluwer Academic Publishers, Dordrecht 445-487
23. Dorigo M., Maniezzo V., and Colorni A. The ant system: optimization by ant colony of cooperating agents. IEEE Transactions on Systems, Man Cybernetics-Part B 26 (1996) 29-41
24. Benavent E., Campos V., Corberán A., and Mota E. The capacitated arc routing problem lower bounds. Networks 22 (1992) 669-690
25. Lacome P, Prins C, Ramdane-Chérif W. A genetic algorithm for the capacitated arc routing problem and its extensions. In: Boers EJW et al., editor. Lecture Notes in Computer Science, vol. 2037, Berlin: Springer; 2001. p. 473-83.
26. Belenguer J., Benavent E., Lacomme P., and Prins C. Lower and upper bounds for the mixed capacitated arc routing problem. Computers and Operations Research 33 12 (2006) 3363-3383