A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

  • Authors:

  • A. Subramanian;L. M. A. Drummond;C. Bentes;L. S. Ochi;R. Farias

  • Affiliations:

  • Universidade Federal Fluminense, Instituto de Computação, Rua Passo da Pátria, 156 - Bloco E, 3o andar, São Domingos, Niterói-RJ 24210-240, Brazil;Universidade Federal Fluminense, Instituto de Computação, Rua Passo da Pátria, 156 - Bloco E, 3o andar, São Domingos, Niterói-RJ 24210-240, Brazil;Universidade Estadual do Rio de Janeiro, Departmento de Engenharia de Sistemas, Rua São Francisco Xavier, 524 - Bloco D, 5o andar, Rio de Janeiro-RJ 20550-900, Brazil;Universidade Federal Fluminense, Instituto de Computação, Rua Passo da Pátria, 156 - Bloco E, 3o andar, São Domingos, Niterói-RJ 24210-240, Brazil;Universidade Federal do Rio de Janeiro, Centro de Tecnologia - Bloco H, sala 319, Cidade Universitária, Rio de Janeiro-RJ 21945-970, Brazil

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents a parallel approach for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). The parallel algorithm is embedded with a multi-start heuristic which consists of a variable neighborhood descent procedure, with a random neighborhood ordering (RVND), integrated in an iterated local search (ILS) framework. The experiments were performed in a cluster with a multi-core architecture using up to 256 cores. The results obtained on the benchmark problems, available in the literature, show that the proposed algorithm not only improved several of the known solutions, but also presented a very satisfying scalability.