Solving Dynamic Full-Truckload Vehicle Routing Problem Using an Agent-Based Approach

Selin Çabuk () and Rızvan Erol
Additional contact information
Selin Çabuk: Department of Industrial Engineering, Faculty of Engineering, Cukurova University, Sarıcam, 01330 Adana, Turkey
Rızvan Erol: Department of Industrial Engineering, Faculty of Engineering, Cukurova University, Sarıcam, 01330 Adana, Turkey

Mathematics, 2024, vol. 12, issue 13, 1-21

Abstract: In today’s complex and dynamic transportation networks, increasing energy costs and adverse environmental impacts necessitate the efficient transport of goods or raw materials across a network to minimize all related costs through vehicle assignment and routing decisions. Vehicle routing problems under dynamic and stochastic conditions are known to be very challenging in both mathematical modeling and computational complexity. In this study, a special variant of the full-truckload vehicle assignment and routing problem was investigated. First, a detailed analysis of the processes in a liquid transportation logistics firm with a large fleet of tanker trucks was conducted. Then, a new original problem with distinctive features compared with similar studies in the literature was formulated, including pickup/delivery time windows, nodes with different functions (pickup/delivery, washing facilities, and parking), a heterogeneous truck fleet, multiple trips per truck, multiple trailer types, multiple freight types, and setup times between changing freight types. This dynamic optimization problem was solved using an intelligent multi-agent model with agent designs that run on vehicle assignment and routing algorithms. To assess the performance of the proposed approach under varying environmental conditions (e.g., congestion factors and the ratio of orders with multiple trips) and different algorithmic parameter levels (e.g., the latest response time to orders and activating the interchange of trip assignments between vehicles), a detailed scenario analysis was conducted based on a set of designed simulation experiments. The simulation results indicate that the proposed dynamic approach is capable of providing good and efficient solutions in response to dynamic conditions. Furthermore, using longer latest response times and activating the interchange mechanism have significant positive impacts on the relevant costs, profitability, ratios of loaded trips over the total distance traveled, and the acceptance ratios of customer orders.

Keywords: dynamic optimization; vehicle routing; full-truck load; multi-agent modeling (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/13/2138/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/13/2138/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:13:p:2138-:d:1430577

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().