DocumentCode
2319164
Title
A hybrid heuristics for vehicle routing problem with simultaneous pickup and delivery service
Author
Liu, Chang-shi ; Tang, Qi-Jin
Author_Institution
Sch. of Manage., Hunan Univ. of Commerce, Changsha, China
Volume
3
fYear
2010
fDate
9-10 Jan. 2010
Firstpage
1422
Lastpage
1426
Abstract
The vehicle routing problem with simultaneous delivery and pick-up service (VRPSPD) was considered in this paper. A hybrid heurictics was proposed to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. An extensive numerical experiment was performed on benchmark problem instances available in literature. It is found that the proposed approach gives good results compared to the existing algorithms.
Keywords
search problems; transportation; Tabu search; customer population; hybrid heurictics; pick-up service; simultaneous delivery; sweeping algorithm; vehicle routing problem; Business; Cost function; Educational institutions; Educational programs; Heuristic algorithms; Libraries; Minimization methods; Reverse logistics; Routing; Vehicles; Simultaneous Pickup and Delivery; Sweeping Algorithm; Tabu Search; Vehicle Routing Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Logistics Systems and Intelligent Management, 2010 International Conference on
Conference_Location
Harbin
Print_ISBN
978-1-4244-7331-1
Type
conf
DOI
10.1109/ICLSIM.2010.5461201
Filename
5461201
Link To Document