By Topic

A new hybrid metaheuristics for the vehicle routing problem with simultaneous pick-up and delivery

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lijun Meng ; Dept. of Manage., Zhejiang Univ., Hangzhou ; Xiaochai Guo

The vehicle routing problem with simultaneous pickup and delivery is the problem of optimally integrating goods distribution and waste collection. We analyze the vehicle routing problem in which, a single depot can offer service to many customers that may both receive and send good by multiple vehicles, customers strictly require that their delivery and pickup is to be served in a single visit by a vehicle simultaneously. The objective of the problem is to minimize the total distance to service all customers, each with a single stop, without violating the capacity of each vehicle. Firstly, the revised tour-partitioning algorithm is used to get the initial solution of the vehicle routing problem with simultaneous pick-up and delivery In the reactive tabu search phase, variable neighborhood search modules are also proposed to improve the results. Finally, computational experiments show that the proposed hybrid heuristic is able to obtaining optimal solutions very efficiently.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:1 )

Date of Conference:

12-15 Oct. 2008