Journal
IEEE TRANSACTIONS ON CYBERNETICS
Volume 46, Issue 3, Pages 582-594Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2015.2409837
Keywords
Bi-directional logistics; multiobjective optimization; simultaneous delivery and pickup; vehicle routing problem with time windows (VRPTW)
Categories
Funding
- National High-Technology Research and Development Program (863 Program) of China [2013AA01A212]
- National Natural Science Foundation of China (NSFC) for Distinguished Young Scholars [61125205]
- NSFC [61332002, 61300044, 61273314]
- Program for New Century Excellent Talents in University [NCET-13-0596]
Ask authors/readers for more resources
This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances.
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