Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup
Author(s)
Manuel Laguna
Dan Abensur Gandelman
Annibal Parracho Sant’Anna
Date Issued
1 de abril de 2011
Type
Article
Volume
2
Issue
2
Start Page
1
End Page
20
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.
Subjects