DocumentCode
1636876
Title
The harmony search for the routing optimization in fourth party logistics with time windows
Author
Bo, Guihua ; Huang, Min ; Ip, W.H. ; Wang, Xingwei
Author_Institution
Fac. of Inf. Sci. & Eng., Northeastern Univ., Shenyang
fYear
2009
Firstpage
962
Lastpage
967
Abstract
Recently, fourth party logistics (4PL) is receiving more and more attentions in manufacturing and retail industries. However, the research on the fourth party logistics routing problems (4PLRP) has just begun. In this paper, the mathematical model of the point to point single task path optimization of 4PLRP with time windows (4PLRPTW) is established based on multi-graph. The objective is to find minimum cost routes from the start node to the destination node within the pre-specified time windows. A recently-developed meta-heuristic optimization method, harmony search, is suggested for solving 4PLRPTW. The results of the numerical experiments demonstrate that the harmony search is effective and could find near optimal solution within the reasonable amount of time and computation.
Keywords
graph theory; logistics; optimisation; fourth party logistics routing problems; harmony search; manufacturing industries; mathematical model; meta-heuristic optimization method; minimum cost routes; multi-graph; point-to-point single task path optimization; retail industries; routing optimization; time windows; Algorithm design and analysis; Costs; Large-scale systems; Linear programming; Logistics; Mathematical model; Routing; Supply chains; Time factors; Vehicles;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2009. CEC '09. IEEE Congress on
Conference_Location
Trondheim
Print_ISBN
978-1-4244-2958-5
Electronic_ISBN
978-1-4244-2959-2
Type
conf
DOI
10.1109/CEC.2009.4983049
Filename
4983049
Link To Document