Waste Collection Vehicle Routing Problem: Literature Review

Han, Heesup; Cueto, Eva Ponce

doi:10.7307/ptt.v27i4.1616

Cited by 89 publications

(46 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Las soluciones basadas en modelos matemáticos de programación lineal han sido propuestas desde hace más de 50 años, siendo la primera la de Dantzig y Ramser en 1959 (Golden, Wasil, Kelly y Chao, 1998;Laporte, 2009). La propuesta inicial ha evolucionado para resolver problemas con mayor cantidad de restricciones (Alvarez, Lerga, Serrano, y Faulin, 2017;Laporte, 2009) y también se ha especializado con propuestas de aplicaciones concentradas en la recolección de desperdicios y modelos multiobjetivo para el transporte de ayuda en crisis humanitarias ocasionadas por desastres (Han y Cueto, 2015;Tzeng, Cheng y Huang, 2007). Además se añadió el comportamiento de los conductores como uno de los factores a ser considerados para incluirse en el diseño de rutas (Alvarez, Lerga, Serrano y Faulin, 2017;Srivatsa Srinivas y Gajanand, 2017).…”

Section: Revisión De Literaturaunclassified

Evaluación experimental de un modelo de programación lineal para el problema de ruteo de vehículos (VRP)

Pina

Dorin²,

García-Yi

2018

interfases

View full text Add to dashboard Cite

Evaluación experimental de un modelo de programación lineal INTERFASES Pág. 103 Ed. n.˚11 // Enero-diciembre 2018 // ISSN 1993-4912 Resumen Abstract Recibido: 27 de septiembre del 2018 Aceptado: 27 de octubre del 2018El presente artículo tiene como objetivo proponer un criterio cuantitativo para evaluar la viabilidad de implementar soluciones basadas en programación lineal para resolver el problema de ruteo de vehículos (VRP). Se utilizó un diseño experimental para medir el tiempo relativo de solución con un modelo de programación lineal propuesto. La muestra utilizada fue aleatoria utilizando tres escenarios de dispersión de puntos de entrega: poco dispersos, dispersos y muy dispersos. Se utilizó un solver de programación lineal con el objetivo de determinar el tiempo y las iteraciones necesarias para encontrar la solución del modelo. Como resultado se encontró el tiempo de solución en función de la cantidad de puntos de entrega, la cantidad de iteraciones para los escenarios propuestos y se pronostica el tiempo necesario para resolver el problema utilizando el modelo propuesto. Se concluye con una propuesta de cantidad de puntos viables para ser resueltos por programación lineal. Palabras clave: programación lineal, complejidad, ruteo, vehículos, puntos de entregaExperimental evaluation of a linear programming model for solving the vehicle routing problem (VRP)This article aims to propose a quantitative criterion to evaluate the feasibility of implementing solutions based on linear programming for solving the vehicle routing problem (VRP). An experimental design was used to measure the relative solution time with a proposed linear programming model. The sample was randomized employing three dispersion scenarios of the delivery points: poorly scattered, scattered and very scattered. A linear programming solver was used to determine the time and iterations necessary for solving the model. As a result, the solution time was found in terms of the number of delivery points and the number of iterations for the proposed scenarios, and the time required to solve the problem was predicted using the proposed model. The research concludes with a proposal of the number of viable points to be solved by linear programming.

show abstract

Section: Revisión De Literaturaunclassified

Evaluación experimental de un modelo de programación lineal para el problema de ruteo de vehículos (VRP)

Pina

Dorin²,

García-Yi

2018

interfases

View full text Add to dashboard Cite

show abstract

“…Waste collection routes on a door‐to‐door system are usually better handled through an ARP. Surveys on waste systems (WS), including routing collection, are conducted by Beliën et al , Ghiani et al and Han and Ponce‐Cueto , who also distinguish between collection systems based on whether they benefit from a node or an arc routing approach. Several specific cases of real‐world WS demand generalizations concerning modeling and solution methodologies.…”

Section: Arc Routing Applicationsmentioning

confidence: 99%

An updated annotated bibliography on arc routing problems

Mourão

Pinto

2017

Networks

View full text Add to dashboard Cite

The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017

show abstract

“…Minimax objectives, such as minimizing the maximum travel time (MMTT) [18] or travel length (MMTL) [19], can be useful in balancing the workload of drivers, and explicit load balancing objectives (LBTT and LBTL) [20,21] can be used for the same purpose. Depending on the problem structure, other objectives can also be considered, such as non-monetary objectives in humanitarian logistics problems [22].…”

Section: Introductionmentioning

confidence: 99%

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Taşar

Eliiyi

Kandiller

2019

PROMET

View full text Add to dashboard Cite

This study focuses on a distribution problem involving incompatible products which cannot be stored in a compartment of a vehicle. To satisfy different types of customer demand at minimum logistics cost, the products are stored in different compartments of fleet vehicles, which requires the problem to be modeled as a multiple-compartment vehicle routing problem (MCVRP). While there is an extensive literature on the vehicle routing problem (VRP) and its numerous variants, there are fewer research papers on the MCVRP. Firstly, a novel taxonomic framework for the VRP literature is proposed in this study. Secondly, new mathematical models are proposed for the basic MCVRP, together with its multiple-trip and split-delivery extensions, for obtaining exact solutions for small-size instances. Finally, heuristic algorithms are developed for larger instances of the three problem variants. To test the performance of our heuristics against optimum solutions for larger instances, a lower bounding scheme is also proposed. The results of the computational experiments are reported, indicating validity and a promising performance of an approach.

show abstract

Waste Collection Vehicle Routing Problem: Literature Review

Abstract: ABSTRACT

Cited by 89 publications

References 30 publications

Evaluación experimental de un modelo de programación lineal para el problema de ruteo de vehículos (VRP)

Evaluación experimental de un modelo de programación lineal para el problema de ruteo de vehículos (VRP)

An updated annotated bibliography on arc routing problems

Vehicle Routing with Compartments Under Product Incompatibility Constraints

Contact Info

Product

Resources

About