การแก้ปัญหาการจัดเส้นทางการนําส่งสินค้าของธุรกิจขนส่งโดยวิธีการหาค่าที่เหมาะสมที่สุดแบบฝูงอนุภาค

Abstract

This study focuses on delivery routing problem faced by a transport company located in Phuket, Thailand. The goal is to minimize the total transportation cost, which is comprised of fixed costs associated with vehicle rental and variable costs calculated based on factors such as traveling distance, oil price, and fuel consumption rate. This study addresses a complex issue arising from multiple constraints, including truck loading limitations, multiple trips, and time-window restrictions for delivery. To tackle this problem, the research formulates a mathematical model for the Multiple Trip Vehicle Routing Problem with Time Window (MTVRPTW) using the exact method on Lingo version 14.0. However, since MTVRPTW is an NP-hard problem, the exact method is unable to determine the optimal solution within a reasonable time frame. Consequently, the study employs a meta-heuristic to improve efficiency in searching for a solution by utilizing the particle swarm optimization, PSO method. Additionally, the algorithm is customized to accommodate the specific challenges of MTVRPTW through the NNIMSPSO algorithm. The proposed methodology yields promising results, with a cost reduction from actual operation 47,537.30 to 44,632.49 Baht, a reduction of 2,904.81 Baht or 6.11%, and a distribution distance reduction from 2,255.89 km to 1,847.30 km, a reduction of 408.59 km or 18.12% compared to the actual operation along 21 days.