A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery

  • Authors:

  • Fatma Pinar Goksal;Ismail Karaoglan;Fulya Altiparmak

  • Affiliations:

  • Department of Industrial Engineering, Baskent University, Ankara, Turkey;Department of Industrial Engineering, Selcuk University, Konya, Turkey;Department of Industrial Engineering, Gazi University, Ankara, Turkey

  • Venue:
  • Computers and Industrial Engineering
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Vehicle routing problem (VRP) is an important and well-known combinatorial optimization problem encountered in many transport logistics and distribution systems. The VRP has several variants depending on tasks performed and on some restrictions, such as time windows, multiple vehicles, backhauls, simultaneous delivery and pick-up, etc. In this paper, we consider vehicle routing problem with simultaneous pickup and delivery (VRPSPD). The VRPSPD deals with optimally integrating goods distribution and collection when there are no precedence restrictions on the order in which the operations must be performed. Since the VRPSPD is an NP-hard problem, we present a heuristic solution approach based on particle swarm optimization (PSO) in which a local search is performed by variable neighborhood descent algorithm (VND). Moreover, it implements an annealing-like strategy to preserve the swarm diversity. The effectiveness of the proposed PSO is investigated by an experiment conducted on benchmark problem instances available in the literature. The computational results indicate that the proposed algorithm competes with the heuristic approaches in the literature and improves several best known solutions.