1,843 research outputs found
Constrained Local Search for Last-Mile Routing
Last-mile routing refers to the final step in a supply chain, delivering
packages from a depot station to the homes of customers. At the level of a
single van driver, the task is a traveling salesman problem. But the choice of
route may be constrained by warehouse sorting operations, van-loading
processes, driver preferences, and other considerations, rather than a
straightforward minimization of tour length. We propose a simple and efficient
penalty-based local-search algorithm for route optimization in the presence of
such constraints, adopting a technique developed by Helsgaun to extend the LKH
traveling salesman problem code to general vehicle-routing models. We apply his
technique to handle combinations of constraints obtained from an analysis of
historical routing data, enforcing properties that are desired in high-quality
solutions. Our code is available under the open-source MIT license. An earlier
version of the code received the $100,000 top prize in the Amazon Last Mile
Routing Research Challenge organized in 2021
Adaptive large neighborhood search algorithm – performance evaluation under parallel schemes & applications
Adaptive Large Neighborhood Search (ALNS) is a fairly recent yet popular single-solution heuristic for solving discrete optimization problems. Even though the heuristic has been a popular choice for researchers in recent times, the parallelization of this algorithm is not widely studied in the literature compared to the other classical metaheuristics. To extend the existing literature, this study proposes several different parallel schemes to parallelize the basic/sequential ALNS algorithm. More specifically, seven different parallel schemes are employed to target different characteristics of the ALNS algorithm and the capability of the local computers. The schemes of this study are implemented in a master-slave architecture to manage and assign loads in processors of the local computers. The overall goal is to simultaneously explore different areas of the search space in an attempt to escape the local minima, taking effective steps toward the optimal solution and, to the end, accelerating the convergence of the ALNS algorithm. The performance of the schemes is tested by solving a capacitated vehicle routing problem (CVRP) with available wellknown test instances. Our computational results indicate that all the parallel schemes are capable of providing a competitive optimality gap in solving CVRP within our investigated test instances. However, the parallel scheme (scheme 1), which runs the ALNS algorithm independently within different slave processors (e.g., without sharing any information with other slave processors) until the synchronization occurs only when one of the processors meets its predefined termination criteria and reports the solution to the master processor, provides the best running time with solving the instances approximately 10.5 times faster than the basic/sequential ALNS algorithm. These findings are applied in a real-life fulfillment process using mixed-mode delivery with trucks and drones. Complex but optimized routes are generated in a short time that is applicable to perform last-mile delivery to customers
Application of Saving Matrix Approach for Minimize Distribution Cost and Route Optimization: A Literature Review
The objective of this research is to review the application of the savings method, to obtain optimal distribution routes. Data collection and observation of this literature review were obtained from scientific publications that were published from 2014 to 2022. The main purpose of this review study is to investigate, discuss, analyze, and the existence of various types of distribution routes problems and their solving methods. The application of the research methodology resulted in 20 articles, which aimed to identify the saving algorithms used, over the last decade. As a result, these articles were reviewed and selected using a table for further analysis This paper also presents the results of a quantitative and qualitative literature review and discusses scientific publications that have had a significant impact on logistics companies. Finally, findings show that using the savings matrix method, it is proven that this method generates a better route distribution
Electric vehicle routing, arc routing, and team orienteering problems in sustainable transportation
[EN] The increasing use of electric vehicles in road and air transportation, especially in last-mile delivery and city mobility, raises new operational challenges due to the limited capacity of electric batteries. These limitations impose additional driving range constraints when optimizing the distribution and mobility plans. During the last years, several researchers from the Computer Science, Artificial Intelligence, and Operations Research communities have been developing optimization, simulation, and machine learning approaches that aim at generating efficient and sustainable routing plans for hybrid fleets, including both electric and internal combustion engine vehicles. After contextualizing the relevance of electric vehicles in promoting sustainable transportation practices, this paper reviews the existing work in the field of electric vehicle routing problems. In particular, we focus on articles related to the well-known vehicle routing, arc routing, and team orienteering problems. The review is followed by numerical examples that illustrate the gains that can be obtained by employing optimization methods in the aforementioned field. Finally, several research opportunities are highlighted.This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities (PID2019-111100RB-C21-C22/AEI/10.13039/501100011033, RED2018-102642-T), the SEPIE Erasmus+Program (2019-I-ES01-KA103-062602), and the IoF2020-H2020 (731884) project.Do C. Martins, L.; Tordecilla, RD.; Castaneda, J.; Juan-Pérez, ÁA.; Faulin, J. (2021). Electric vehicle routing, arc routing, and team orienteering problems in sustainable transportation. Energies. 14(16):1-30. https://doi.org/10.3390/en14165131130141
Arc routing problems: A review of the past, present, and future
[EN] Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emerging applicationsThis research was supported by the Ministerio de Economia y Competitividad and Fondo Europeo de Desarrollo Regional, Grant/Award Number: PGC2018-099428-B-I00. The Research Council of Norway, Grant/Award Numbers: 246825/O70 (DynamITe), 263031/O70 (AXIOM).Corberán, Á.; Eglese, R.; Hasle, G.; Plana, I.; Sanchís Llopis, JM. (2021). Arc routing problems: A review of the past, present, and future. Networks. 77(1):88-115. https://doi.org/10.1002/net.21965S8811577
- …