چکیده مقاله
This article presents an innovative approach to solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Occasional Drivers VRPSPDOD This problem involves minimizing the cost of servicing customer pickup and/or delivery requests using limited capacity regular vehicles and single service occasional drivers To tackle this complicated problem, we introduce a novel Greedy Randomized Adaptive Search Procedure GRASP algorithm Our method is characterized by its dynamic adjustment of the restricted candidate list size and implementation of problem specific local search moves, ensuring a highly flexible and adaptive search process The proposed algorithm outperforms the existing state of the art method and achieves the best known solutions for 23 out of 32 benchmark instances This represents a significant average improvement of 1 266% over best known solutions, demonstrating the practical efficacy of our methodology Our research paves the way for further advancements in the field and provides practical insights and solutions for real world logistics and supply chain management challenges
کلیدواژهها
نویسندگان
Ali Zamanian
Department of Engineering and Computer Science and Information Technology, Shiraz University, Shiraz, Iran
Koorush Ziarati
Department of Engineering and Computer Science and Information Technology, Shiraz University, Shiraz, Iran
شیوه ارجاع
Zamanian, Ali and Ziarati, Koorush,1403,Optimizing Routing Solutions for Simultaneous Pickup and Delivery with Occasional Drivers,The 10th International Conference on Industrial and Systems Engineering,Mashhad
ارائهشده در
مجموعه مقالات دهمین کنفرانس بین المللی مهندسی صنایع و سیستم ها28 شهریور 1403 · مشهد