Enhanced solution representations for vehicle routing problems with split deliveries  

作　　者：Wenbin ZHU Zhuoran AO Roberto BALDACCI Hu QIN Zizhen ZHANG 

机构地区：[1]School of Business Administration,South China University of Technology,Guangzhou 510640,China [2]Thrust of Intelligent Transportation,The Hong Kong University of Science and Technology(Guangzhou),Guangzhou 511466,China [3]College of Science and Engineering(CSE),Hamad Bin Khalifa University(HBKU),Doha 5825,Qatar [4]School of Management,Huazhong University of Science and Technology,Wuhan 430074,China [5]School of Data and Computer Science,Sun Yat-sen University,Guangzhou 510275,China

出　　处：《Frontiers of Engineering Management》2023年第3期483-498,共16页工程管理前沿（英文版）

摘　　要：In this study,we investigate a forest-based solution representation for split delivery vehicle routing problems(SDVRPs),which have several practical applications and are among the most difficult vehicle routing problems.The new solution representation fully reflects the nature of split delivery,and can help reduce the search space when used in heuristic algorithms.Based on the forest structure,we devise three neighborhood search operators.To highlight the effectiveness of this solution representation,we integrate these operators into a standard tabu search framework.We conduct extensive experiments on three main SDVRPs addressed in the literature:The basic SDVRP,the multidepot SDVRP,and the SDVRP with time windows.The experimental results show that the new forest-based solution representation is particularly effective in designing and implementing neighborhood operators,and that our new approach outperforms state-of-the-art algorithms on standard datasets.

关 键 词：vehicle routing multidepot time windows tabu search split delivery 

分 类 号：O17[理学—数学]