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

Maquera Sosa, Nelida Gladys; Laguna, Manuel; Gandelman, Dan Abensur; Sant’Anna, Annibal Parracho

doi:10.4018/978-1-4666-2145-9.ch010

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

Author(s)

Maquera Sosa, Nelida Gladys

Universidad Peruana Unión

Laguna, Manuel

Gandelman, Dan Abensur

Universidade Federal do Rio de Janeiro

Sant’Anna, Annibal Parracho

Universidade Federal Fluminense

Date Issued

15 de agosto de 2012

Type

Book chapter

Series/Report No.

Trends in Developing Metaheuristics, Algorithms, and Optimization Approaches

Start Page

149

End Page

168

DOI

10.4018/978-1-4666-2145-9.ch010

ISBN

9781466621459

9781466621466

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.