Abstract
Urban waste collection is a problem that has been widely studied in the last decades. In this work, this problem is analysed and it is shown how traffic direction restrictions may be treated using work levels, so the obtained solutions are similar to those provided by experts. Also a genetic algorithm is introduced, which uses operators based on work levels and a fitness function based on an expansive competitive learning that characterises the optimal solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Assad, A. and B. Golden, “Vehicle Routing: Methods and Studies”, North Holland, Amsterdam, 1988.
Gilbert Laporlc. “The Vehicle Routing Problem: An overview of exact and approsimate algorithms”. European Journal of Operational Research, 59, 1992.
Gilbert Laportc, Yves Nobert, Martin Dcsrocher. “Optimal Routing under Capacity and Distance Restrictions”. Operations Research. 1984.
Lamata, M.T. Peláez, J.I. “A Genetic Algorithm for Decision of the Number Sectors of Urban Waste Collection”. Seventh IFSA World Congress, Prague 1997.
Miller D. “A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems”. Orsa Journal on Computing. Vol 7. No 1. 1995.
Oliver, I. M, D.J. Smith and J.R.C. D. Holland, “A study of permutation crossover operators on the travelling salesman problem”. Proc. Of the second Int. Conf. On Genetic Algorithms, Lawrence Erlbaum Assoc. Pp. 224–230, 1987.
Péiez J. “ Aprendizaje Competitivo para la Cuantificación Vectorial”. CAEPIA’97. Málaga. Spain.
Sam R. Thangiak, Kendall E. Nygard, Paul L. Juell, “Gideon: Agenetic Algorithm System for Vehicle routing with time windows”. IEEE. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamata, M.T., Pcláez, J.I., Sierra, J.C., Bravo, J.M. (1999). A Sectoring Genetic Algorithm for the Urban Waste Collection Problem. In: Reusch, B. (eds) Computational Intelligence. Fuzzy Days 1999. Lecture Notes in Computer Science, vol 1625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48774-3_69
Download citation
DOI: https://doi.org/10.1007/3-540-48774-3_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66050-7
Online ISBN: 978-3-540-48774-6
eBook Packages: Springer Book Archive