Genetic algorithms as a promising tool for optimisation of the MSW collection routes

Waste Management and Research

Volumn 21, Issue 4, 2003, Pages 292-298

  Viotti, Paulo ^a   Polettini, Alessandra ^a   Pomi, Rafaella ^a   Innocenti, Carlo ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b NONE

Author keywords

Genetic algorithm; Minimum length route; Operational research; Solid waste collection system; wmr 574 4

Indexed keywords

GENETIC ALGORITHMS; OPERATIONS RESEARCH; SOLID WASTES;

SOLID WASTE (SW) COLLECTION ROUTES;

WASTEWATER TREATMENT;

FUEL;

ACCURACY; ARTICLE; CALCULATION; COST; GENETIC ALGORITHM; LABOR; MATHEMATICAL COMPUTING; METHODOLOGY; MOTOR VEHICLE; MUNICIPAL SOLID WASTE; PRIORITY JOURNAL; PROCESS OPTIMIZATION; QUALITY CONTROL; RESEARCH; SIMULATION; SOLID WASTE MANAGEMENT; TRAFFIC; URBAN AREA; VALIDATION PROCESS;

EID: 0141717052     PISSN: 0734242X     EISSN: None     Source Type: Journal    
DOI: 10.1177/0734242X0302100402     Document Type: Article

References (11)

1. Barboni, A., Ceccotto, D., Malagò, L., Sunseri, M. & Viotti, P. (1999) Individuazione computerizzata dei percorsi di raccolta caratterizzanti il nuovo sistema di gestione dei rifiuti solidi urbani applicato dal consorzio A.R.E.A. di Coppano (FE), ("Computer-aided research of Municipal Solid Wastes collection routes in the A.R.E.A. Consortium, Ferrara, Italy), Ricicla 1999, Maggioli editore, Rimini.
2. Cairns, S. (1998) Promise and problems: using GIS to analyse shopping travel, Journal of Transport Geography, Vol. 6 (4), Elsevier Science, pp. 273-284.
3. Corberan, A., Martu, R. & Romero, A. (2000) Heuristic for the Mixed Rural Postman Problem, Computers & operations research, Vol. 27, Elsevier Science.
4. Fuh-hwa Franklin Liu & Sheng-Yuan Shen (1999) An overview of heuristic for vehicle routing problem with time windows, Computers & industrial engineering, Elsevier Science, pp. 331-334.
5. Garey, M. & Johnson, D. (1979) In: Computers and intractability, W.H. Freeman (Ed.).
6. Holland, J. (1975) Adaption in natural and artificial systems. University of Michigan Press, Ann Arbor.
7. Misiti, A., Molinas, G. & Viotti, P. (1995) Metodologie euristiche per la risoluzione del problema della ricerca di un percorso ottimale: applicazione ad una zona della città di Roma, (Heuristic Procedures for optimisation of routing problems: application to a suburb in Rome) In: Proceedings of III International Congress on Energy, Environment and Technological Innovation, November 5-11, Caracas (Venezuela).
8. Mitchell, M. (1996) An introduction to genetic algorithms, Cambridge, MA (USA), MIT press, ISBN 0-262-13316-4.
9. Mourao, M.C. & Almeida, M.T. (2000) Lower-bounding and heuristic methods for a refuse collection vehicle routing problem. European journal of operations research, Elsevier Science, pp. 420-434.
10. Pearn, W.L. & Chou, J.B. (1999) Improved solutions for the Chinese Postman Problem on mixed networks. Computers & operations research, Elsevier Science, pp. 819-827.
11. Tchobanoglous, G., Theisen, H. & Vigil, S.A. (1993) Integrated solid waste management, Mc.Graw Hill.