A method for optimizing waste collection using mathematical programming: A Buenos Aires case study

A method is proposed that uses operations research techniques to optimize the routes of waste collection vehicles servicing dumpster or skip-type containers. The waste collection problem is reduced to the classic travelling salesman problem, which is then solved using the Concorde solver program. A...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Bonomo, F., Durán, G., Larumbe, F., Marenco, J.
Formato: JOUR
Materias:
Environment
mathematical programming
TSP
vehicle routing
waste collection
Buenos Aires
Collection systems
Collection vehicles
Data corrections
Driver fatigue
In-vehicle
Mechanical work
Minimum distance
Optimization problems
Solution approach
Traffic disruption
Travelling salesman problem
Wear and tear
Graph theory
Refuse collection
Research
Traveling salesman problem
Vehicle routing
Mathematical programming
automobile
graphical method
numerical method
optimization
pollution control
savings
traffic congestion
waste management
wear
algorithm
article
mathematical analysis
pollution
priority journal
sensitivity analysis
traffic and transport
travel
Argentina
Cities
Models, Theoretical
Refuse Disposal
Sensitivity and Specificity
Transportation
Buenos Aires [Argentina]
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_0734242X_v30_n3_p311_Bonomo
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares