An Agent for Collaborative Optimization of Route Planning and Three-Dimensional Loading in Land Logistics
Main Article Content
Keywords
intelligent logistics, agent, vehicle routing problem, QUBO, three-dimensional bin packing
Abstract
Cross-border trade is growing fast. The same is true for urban distribution, e-commerce fulfillment, port transfer, and cold-chain transportation. Because of that, land-logistics decisions need to be workable in practice and flexible enough to adjust, especially in heavy-traffic places like Singapore. This study sets out to build an intelligent agent that plans vehicle routes and handles three-dimensional cargo loading at the same time. The agent treats routing as a capacitated vehicle routing problem with time windows. For small and medium cases, it turns the subproblems into quadratic unconstrained binary optimization so simulated-annealing or a quantum-inspired solver can be used. Bigger cases rely on heuristics and metaheuristics instead. The approach uses Solomon I1 insertion and 2-opt. Relocate is applied too. On top of that, it runs adaptive large neighborhood search and genetic algorithms. For cargo loading, the setup follows a three-dimensional bin-packing problem. An extreme-point heuristic checks cargo dimensions and weight. It considers orientation as well. The method accounts for stacking rules, non-overlap, load balance, and unloading-order constraints. It uses a feedback loop too. That loop sends the reasons for loading infeasibility back to the routing module, which then regroups customers or assigns a different vehicle. In a 50-customer routing case, Solomon I1 with local search found a feasible plan with nine vehicles and a total travel time of 129.0. Adaptive large neighborhood search kept the fleet at nine vehicles but cut total travel time to 92.0. This is about a 28.7% improvement. The results suggest that tying routing and loading together in a closed-loop setup makes plans easier to carry out. It improves vehicle utilization and delivery punctuality, and it makes the decisions easier to explain. This proposed agent offers a practical way to manage land-logistics optimization in one integrated system that can be adjusted on the fly.
References
- [1] Group 4. (2026). Agentic AI for transportation [Course lecture material].
- [2] MC2602690. (2026). Modeling and optimization of a vehicle routing problem with time-window constraints based on quantum computing [MathorCup Mathematical Application Challenge, Problem A material].
- [3] Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91. https://doi.org/10.1287/mnsc.6.1.80
- [4] Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254-265. https://doi.org/10.1287/opre.35.2.254
- [5] Bräysy, O., & Gendreau, M. (2005). Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Science, 39(1), 104-118. https://doi.org/10.1287/trsc.1030.0056
- [6] Kirkpatrick, S., Gelatt, C. D., Jr., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671-680. https://doi.org/10.1126/science.220.4598.671
- [7] Pisinger, D., & Røpke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403-2435. https://doi.org/10.1016/j.cor.2005.09.012
- [8] Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9780898718515
- [9] Desaulniers, G., Desrosiers, J., & Solomon, M. M. (Eds.). (2005). Column generation. Springer. https://doi.org/10.1007/0-387-25486-2
- [10] Goldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley.
- [11] Røpke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455-472. https://doi.org/10.1287/trsc.1050.0135
- [12] Crainic, T. G., Perboli, G., & Tadei, R. (2008). Extreme point-based heuristics for three-dimensional bin packing. INFORMS Journal on Computing, 20(3), 368-384. https://doi.org/10.1287/ijoc.1070.0250
