Designing routes for WEEE collection: the vehicle routing problem with split loads and date windows

Authors:
Julio Mar-Ortiz;José Luis González-Velarde;Belarmino Adenso-Díaz
Affiliations:
Faculty of Engineering, Universidad Autónoma de Tamaulipas, Tampico, Mexico 89140 and Tecnológico de Monterrey, Monterrey, Mexico 64849;Tecnológico de Monterrey, Monterrey, Mexico 64849;Engineering School, Universidad de Oviedo, Gijón, Spain 33203
Venue:
Journal of Heuristics
Year:
2013

Citing 5
Cited 0

An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem

Computers and Operations Research
Survey: The vehicle routing problem: A taxonomic review

Computers and Industrial Engineering
A scatter search approach to the optimum disassembly sequence problem

Computers and Operations Research
An adaptive memory algorithm for the split delivery vehicle routing problem

Journal of Heuristics
A probabilistic heuristic for a computationally difficult set covering problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an integer programming model and describes a GRASP based algorithm to solve a vehicle routing and scheduling problem for the collection of Waste of Electric and Electronic Equipment (WEEE). The difficulty of this problem arises from the fact that it is characterized by four variants of the vehicle routing problem that have been studied independently in the literature, but not together. The experimental analysis on a large set of randomly-generated instances shows the good performance of the proposed algorithm. Moreover, computational results using real data show that the method outperforms real existing approaches to reverse logistics.