We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
OPTIMIZATION ALGORITHMS FOR ADAPTATIVE ROUTE SEQUENCING ON REAL-WORLD LAST-MILE DELIVERIES.
- Authors
Hernández Gobertti, Fernando; Sotelo, Rafael; Forets, Marcelo
- Abstract
This article explores the design and application of machine learning techniques to enhance traditional approaches for solving NP-hard optimization problems. Specifically, it focuses on the Last-Mile Routing Research Challenge (LMRRC), supported by Amazon and MIT, which sought innovative solutions for cargo routing optimization. While the challenge provided travel times and zone identifiers, the dependency on these factors raises concerns about the algorithms' generalizability to different contexts and regions with standard delivery services registries. To address these concerns, this study proposes personalized cost matrices that incorporate both distance and time models, along with the relationships between delivery stops. Additionally, it presents an improved approach to sequencing stops by combining exact and approximate algorithms, utilizing a customized regression technique alongside fine-tuned metaheuristics and heuristics refinements. The resulting methodology achieves competitive scores on the LMRRC validation dataset, which comprises routes from the USA. By carefully delineating route characteristics, the study enables the selection of specific technique combinations for each route, considering its geometrical and geographical attributes. Furthermore, the proposed methodologies are successfully applied to real-case scenarios of last-mile deliveries in Montevideo (Uruguay), demonstrating similar average scores and accuracy on new testing routes. This research contributes to the advancement of last-mile delivery optimization by leveraging personalized cost matrices and algorithmic refinements. The findings highlight the potential for improving existing approaches and their adaptability to diverse geographic contexts, paving the way for more efficient and effective delivery services in the future.
- Subjects
MONTEVIDEO (Uruguay); DELIVERY of goods; OPTIMIZATION algorithms; MASSACHUSETTS Institute of Technology; NP-hard problems; METAHEURISTIC algorithms; MACHINE learning; UNITS of time
- Publication
Ingenius, Revista Ciencia y Tecnología, 2024, Issue 31, p64
- ISSN
1390-650X
- Publication type
Article
- DOI
10.17163/ings.n31.2024.06