Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 33 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 75 tok/s Pro
Kimi K2 220 tok/s Pro
GPT OSS 120B 465 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

A Bi-Objective Approach to Last-Mile Delivery Routing Considering Driver Preferences (2405.16051v1)

Published 25 May 2024 in cs.AI and cs.LG

Abstract: The Multi-Objective Vehicle Routing Problem (MOVRP) is a complex optimization problem in the transportation and logistics industry. This paper proposes a novel approach to the MOVRP that aims to create routes that consider drivers' and operators' decisions and preferences. We evaluate two approaches to address this objective: visually attractive route planning and data mining of historical driver behavior to plan similar routes. Using a real-world dataset provided by Amazon, we demonstrate that data mining of historical patterns is more effective than visual attractiveness metrics found in the literature. Furthermore, we propose a bi-objective problem to balance the similarity of routes to historical routes and minimize routing costs. We propose a two-stage GRASP algorithm with heuristic box splitting to solve this problem. The proposed algorithm aims to approximate the Pareto front and to present routes that cover a wide range of the objective function space. The results demonstrate that our approach can generate a small number of non-dominated solutions per instance, which can help decision-makers to identify trade-offs between routing costs and drivers' preferences. Our approach has the potential to enhance the last-mile delivery operations of logistics companies by balancing these conflicting objectives.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (33)
  1. Toth P, Vigo D. Vehicle routing: problems, methods, and applications. Vigo D, Toth P, editors, Philadelphia, PA: Society for Industrial and Applied Mathematics; 2014. https://epubs.siam.org/doi/abs/10.1137/1.9781611973594.
  2. Tang H, Miller-Hooks E. Interactive Heuristic for Practical Vehicle Routing Problem with Solution Shape Constraints. Transportation Research Record 2006;1964(1):9–18. https://doi.org/10.1177/0361198106196400102.
  3. Matis P. Decision support system for solving the street routing problem. Transport 2008;23(3):230–235.
  4. Visual attractiveness in routing problems: A review. Computers & Operations Research 2019;103:13–34.
  5. Visual attractiveness in vehicle routing via bi-objective optimization. Computers & Operations Research 2022;137:105507.
  6. Krumm J. A markov model for driver turn prediction. In: Society of Automotive Engineers (SAE) 2008 World Congress, April 2008; 2008. .
  7. Decision-making process and factors affecting truck routing. In: Freight Transport Modelling Emerald Group Publishing Limited; 2013.
  8. Building efficient probability transition matrix using machine learning from big data for personalized route prediction. Procedia Computer Science 2015;53:284–291.
  9. Navigation made personal: Inferring driving preferences from gps traces. In: Proceedings of the 23rd SIGSPATIAL international conference on advances in geographic information systems; 2015. p. 1–9.
  10. Canoy R, Guns T. Vehicle routing by learning from historical solutions. In: International Conference on Principles and Practice of Constraint Programming Springer; 2019. p. 54–70.
  11. Technical Proceedings of the Amazon Last Mile Routing Research Challenge. MIT Libraries; 2021. https://hdl.handle.net/1721.1/131235.
  12. A two-stage data-driven metaheuristic to predict last-mile delivery route sequences. Engineering Applications of Artificial Intelligence 2023;125:106653. https://www.sciencedirect.com/science/article/pii/S0952197623008370.
  13. Amazon Last Mile Routing Research Challenge; 2021. https://routingchallenge.mit.edu/.
  14. A Data-Driven Metaheuristic Approach to Predict Delivery Route Sequences. In: Winkenbach M, Parks S, Noszek J, editors. Technical Proceedings of the Amazon Last Mile Routing Research Challenge MIT Libraries; 2021. p. VIII.1–VIII.12.
  15. Local Search with Learned Constraints for Last Mile Routing. In: Winkenbach M, Parks S, Noszek J, editors. Technical Proceedings of the Amazon Last Mile Routing Research Challenge MIT Libraries; 2021. p. XXI.1–XXI.12.
  16. TSP with Learned Zone Preferences for Last-Mile Vehicle Dispatching. In: Winkenbach M, Parks S, Noszek J, editors. Technical Proceedings of the Amazon Last Mile Routing Research Challenge MIT Libraries; 2021. p. XXX.1–XXX.9.
  17. 2021 Amazon last mile routing research challenge: Data set. Transportation Science 2022;https://www.amazon.science/publications/2021-amazon-last-mile-routing-research-challenge-data-set.
  18. Pareto V. Cours d’économie politique, vol. 1. Librairie Droz; 1964.
  19. https://ctl.mit.edu/pub/thesis/learning-route-plan-deviation-last-mile-delivery.
  20. Combining Markov model and prediction by partial matching compression technique for route and destination prediction. Knowledge-Based Systems 2018;154:81–92.
  21. Last-Mile Delivery Trajectory Prediction Using Hierarchical TSP with Customized Cost Matrix. In: Winkenbach M, Parks S, Noszek J, editors. Technical Proceedings of the Amazon Last Mile Routing Research Challenge MIT Libraries; 2021. p. II.1–II.12.
  22. Arslan O, Abay R. Data-Driven Vehicle Routing in Last-Mile Delivery. In: Winkenbach M, Parks S, Noszek J, editors. Technical Proceedings of the Amazon Last Mile Routing Research Challenge MIT Libraries; 2021. p. VI.1–VI.14.
  23. Multi-objective vehicle routing problems. European journal of operational research 2008;189(2):293–309.
  24. An improved multi-directional local search algorithm for the multi-objective consistent vehicle routing problem. IIE Transactions 2016;48(10):975–992.
  25. Constrained local search for last-mile routing. Transportation Science 2022;.
  26. Mladenović N, Hansen P. Variable neighborhood search. Computers & operations research 1997;24(11):1097–1100.
  27. Coca-Cola Enterprises optimizes vehicle routes for efficient product delivery. Interfaces 2008;38(1):40–50.
  28. A savings based method for real-life vehicle routing problems. Journal of the Operational Research Society 2002;53(1):57–68.
  29. Gretton C, Kilby P. A study of shape penalties in vehicle routing. In: VIII Triennial Symposium on Transportation Analysis. San Pedro de Atacama, Chile; 2013. .
  30. Bentley JL. Multidimensional Binary Search Trees Used for Associative Searching. Commun ACM 1975 Sep;18(9):509–517.
  31. Leveraging single-objective heuristics to solve bi-objective problems: heuristic box splitting and its application to vehicle routing. Networks 2019;73(4):382–400.
  32. Boost C++ Libraries; 2022. http://www.boost.org/.
  33. Levenshtein VI, et al. Binary codes capable of correcting deletions, insertions, and reversals. In: Soviet physics doklady, vol. 10 Soviet Union; 1966. p. 707–710. https://nymity.ch/sybilhunting/pdf/Levenshtein1966a.pdf.
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets