Solving an urban waste collection problem using ants heuristics

[1]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[2]  Stephen Warshall,et al.  A Theorem on Boolean Matrices , 1962, JACM.

[3]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[4]  Lawrence Bodin,et al.  A Computer-Assisted System for the Routing and Scheduling of Street Sweepers , 1978, Oper. Res..

[5]  Lawrence Bodin,et al.  A detailed description of a computer system for the routing and scheduling of street sweepers , 1979, Comput. Oper. Res..

[6]  Bruce L. Golden,et al.  Capacitated arc routing problems , 1981, Networks.

[7]  G. Laporte,et al.  A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .

[8]  Gilbert Laporte,et al.  Location routing problems , 1987 .

[9]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[10]  Jean-Marc Rousseau,et al.  The Capacitated Canadian Postman Problem , 1989 .

[11]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[12]  Ángel Corberán,et al.  The Capacitated Arc Routing Problem: Lower bounds , 1992, Networks.

[13]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[14]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[15]  Adam N. Letchford.  Polyhedral Results for Some Constrained Arc-Routing Problems , 1996 .

[16]  Gilbert Laporte,et al.  Modeling and solving several classes of arc routing problems as traveling salesman problems , 1997, Comput. Oper. Res..

[17]  Jeffrey K. Uhlmann,et al.  An Efficient Algorithm for Computing Least Cost Paths with Turn Constraints , 1998, Inf. Process. Lett..

[18]  José-Manuel Belenguer,et al.  The Capacitated Arc Routing Problem: Valid Inequalities and Facets , 1998, Comput. Optim. Appl..

[19]  M. Dror.  Arc Routing : Theory, Solutions and Applications , 2000 .

[20]  Gianpaolo Ghiani,et al.  An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..

[21]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[22]  Philippe Lacomme,et al.  A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions , 2001, EvoWorkshops.

[23]  Ángel Corberán,et al.  The Rural Postman Problem on mixed graphs with turn penalties , 2002, Comput. Oper. Res..

[24]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[25]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[26]  Jordi Pereira Gude.  Modelización y resolución de problemas de diseño de sistemas de recogida de residuos urbanos , 2004 .

[27]  José-Manuel Belenguer,et al.  Lower and upper bounds for the mixed capacitated arc routing problem , 2006, Comput. Oper. Res..

[28]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .