Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery: A Cooperative Approach

Resolution of a Vehicle Routing Problem with Simultaneous Pickup and Delivery: A Cooperative Approach

Meryem Berghida (University of Sciences and Technology Houari Boumedienne (USTHB), Algiers, Algeria) and Abdelmadjid Boukra (University of Sciences and Technology Houari Boumedienne (USTHB), Algiers, Algeria)
Copyright: © 2015 |Pages: 16
DOI: 10.4018/ijamc.2015070103
OnDemand PDF Download:
$37.50

Abstract

This document deals with a variant of the famous NP-hard () vehicle routing problem called the Vehicle Routing Problem with Simultaneous Pickup and Delivery VRPSPD. In VRPSPD, the customer makes simultaneous demand of pickup and delivery. The delivery is made from a single depot, while the collection is done throughout the trip. Vehicles providing the service have limited capacities. In each route, the charge of a vehicle must not exceed its capacity at any time. The authors will present the work that has led to the development of a technique for solving VRPSPD. This technique is based on a cooperative approach reaping the benefits of three metaheuristics to reach a solution to the problem of advantageous quality.
Article Preview

After its introduction in 1989 by Min (Min, 1989), the VRPSPD problem has been absent from the research works for about an entire decade. In 2001 Dethloff (Dethloff, 2001) strove to bring to the surface the problem by proposing a precise formulation of the problem and developed insertion heuristics using four different criteria to solve the problem. In 2007, Ping Chen et al. (Chen, Huang, & Dong, 2007) propose a heuristic algorithm to solve VRPSPD problem based on the Ant Colony System (ACS). In their algorithm, the classical construction phase of the ACS is replaced by an alternative insertion procedure.

A new hybrid metaheuristics is proposed in (Meng & Guo, 2008). Firstly, the revised tour-partitioning algorithm is used to get the initial solution of the VRPSPD. Secondly, the reactive tabu search modules are proposed to improve the results. A review on VRPPD problem is found on two parts in (Parragh, Doerner, & Hartl, 2008).

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing