Journal
KNOWLEDGE-BASED SYSTEMS
Volume 50, Issue -, Pages 14-24Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2013.04.020
Keywords
Fourth party logistics; Routing problem; Chance constrained programming; Memetic algorithm; Local search
Categories
Funding
- National Natural Science Foundation of China [71071028, 71021061, 70931001, 61070162]
- National Science Foundation for Distinguished Young Scholars of China [61225012]
- Specialized Research Fund of the Doctoral Program of Higher Education for the Priority Development Areas [20120042130003]
- Specialized Research Fund for the Doctoral Program of Higher Education [20110042110024, 20100042110025]
- Specialized Development Fund for the Internet of Things from the ministry of industry and information technology of the P.R. China
- Fundamental Research Funds for the Central Universities [N110204003, N120104001]
- Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning
Ask authors/readers for more resources
In this paper, from the viewpoint of a fourth party logistics (4PL) provider, a multi-source single-destination 4PL routing problem with fuzzy duration time and cost discount (M-S 4PLRPFC) is described considering the comprehensive ability of 3PL suppliers and nodes. A chance-constrained programming model is established for the M-S 4PLRPFC. Next, a memetic algorithm (MA) with a fuzzy simulation method is designed to solve the problem. Based on a set of problem instances as the test bed, experiments are performed to compare the performance of the proposed MA with those of the enumeration method and a standard genetic algorithm (SGA). The experimental results show that the proposed MA obtains the same results as the enumeration method and that it is than the SGA. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
