Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup

Authors:
Gladys Maquera;Manuel Laguna;Dan Abensur Gandelman;Annibal Parracho Sant'Anna
Affiliations:
Universidad Peruana Unión, Peru;University of Colorado, USA;Universidade Federal do Rio de Janeiro, Brasil;Universidade Federal Fluminense, Brasil
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2011

Citing 6
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
The vehicle routing problem

The vehicle routing problem
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service

Computers and Operations Research
A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Though its origins can be traced back to 1977, the development and application of the metaheuristic Scatter Search (SS) has stayed dormant for 20 years. However, in the last 10 years, research interest has positioned SS as one of the recognizable methodologies within the umbrella of evolutionary search. This paper presents an application of SS to the problem of routing vehicles that are required both to deliver and pickup goods (VRPSDP). This specialized version of the vehicle routing problem is particularly relevant to organizations that are concerned with sustainable and environmentally-friendly business practices. In this work, the efficiency of SS is evaluated when applied to this problem. Computational results of the application to instances in the literature are presented.