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

Meryem Berghida and Abdelmadjid Boukra
Additional contact information
Meryem Berghida: University of Sciences and Technology Houari Boumedienne (USTHB), Algiers, Algeria
Abdelmadjid Boukra: University of Sciences and Technology Houari Boumedienne (USTHB), Algiers, Algeria

International Journal of Applied Metaheuristic Computing (IJAMC), 2015, vol. 6, issue 3, 53-68

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.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/ijamc.2015070103 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:6:y:2015:i:3:p:53-68

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().