Article
Computer Science, Artificial Intelligence
Yong Wang, Qin Li, Xiangyang Guan, Maozeng Xu, Yong Liu, Haizhong Wang
Summary: This study addresses the issue of collaboration across multiple time periods in logistics operations and proposes a new model for resource sharing across different service time periods. Results show that this collaborative mechanism can improve the synchronization within a logistics network and contribute to the sustainable development of urban logistics distribution networks.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Operations Research & Management Science
M. Tadaros, A. Migdalas, B. Samuelsson
Summary: This paper introduces a new variant of the Vehicle Routing Problem called the Hierarchical Multi-Switch Multi-Echelon Vehicle Routing Problem. It analyzes the problem and proposes a mixed-integer formulation. The paper compares the proposed variant with other known VRP variants and presents the solution concept through an illustrative instance and computational experiments. Due to the computational difficulty of the problem, the development of heuristics and metaheuristics is deemed important for solving real case instances.
OPTIMIZATION LETTERS
(2023)
Article
Management
Yunqiang Yin, Dongwei Li, Dujuan Wang, Joshua Ignatius, T. C. E. Cheng, Sutong Wang
Summary: Increasing e-commerce activities have led to the need for efficient logistics distribution. To address this challenge, firms are exploring the use of drones for parcel delivery. We propose a truck-based drone delivery routing problem with time windows, where drones collaborate with trucks to serve customers within specified time frames. We develop an enhanced algorithm incorporating a bounded bidirectional labelling algorithm to solve the pricing problem, and perform extensive numerical studies to evaluate the algorithm's performance and provide managerial insights.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Vinicius Martins Santos Gandra, Hatice Calik, Tony Wauters, Tulio A. M. Toffolo, Marco Antonio M. Carvalho, Greet Vanden Berghe
Summary: The paper introduces a generalized 2E-LRP with two-dimensional loading restrictions (2E-LRP2L) and evaluates its performance using a heuristic optimization method combined with different loading strategies on real-world data. The proposed method is compared against state-of-the-art 2E-LRP methods on benchmark instances, showing that it is highly competitive and able to find most best-known solutions as well as providing some new ones.
COMPUTERS & INDUSTRIAL ENGINEERING
(2021)
Article
Computer Science, Interdisciplinary Applications
Yong Wang, Xiuwen Wang, Yuanhan Wei, Yaoyao Sun, Jianxin Fan, Haizhong Wang
Summary: Efficient logistics network designs can be achieved by optimizing periodic location decisions and routing schemes. This study proposes a two-echelon multi-depot multi-period location-routing problem with pickup and delivery (2EMDMPLRPPD) and develops a hybrid multiobjective particle swarm optimization (HMOPSO) algorithm to solve it. The proposed model and algorithm have been successfully applied to a real-world case study, demonstrating significant cost savings and efficiency improvements.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Engineering, Industrial
Eduyn Lopez-Santana, German Mendez, Carlos Franco
Summary: This paper addresses the problem of combined maintenance and routing optimization for a set of geographically distributed machines in a multi-period environment. It proposes a two-step approach based on column generation, where the first step determines the optimal time until the next preventive maintenance operation and each machine's maintenance frequency, while the second step assigns and schedules maintenance operations for each technician over the planning horizon. The proposed approach balances maintenance cost, routing cost, and failure probabilities.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Operations Research & Management Science
Guillaume Marques, Ruslan Sadykov, Remy Dupas, Jean-Christophe Deschamps
Summary: This paper studies the two-echelon capacitated vehicle routing problem with time windows and proposes a branch-cut-and-price algorithm to efficiently solve the problem. The experimental results show that the algorithm outperforms other methods in terms of computational efficiency.
TRANSPORTATION SCIENCE
(2022)
Article
Management
Dorian Dumez, Christian Tilk, Stefan Irnich, Fabien Lehuede, Katharina Olkis, Olivier Peton
Summary: This paper addresses the logistic challenges in last-mile collection and delivery services and proposes a mathematical model and heuristic algorithm to solve the problem.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Economics
Yuzhuo Qiu, Dan Zhou, Yanan Du, Jie Liu, Panos M. Pardalos, Jun Qiao
Summary: This paper presents a mixed integer programming model for the two-echelon production routing problem with cross-docking satellites, demonstrating a branch-and-cut algorithm and a matheuristic approach for solving it. Extensive computational results are provided, derived from benchmarks for production routing problems and two echelon vehicle routing problems. Insights on dynamic balance among handling costs, inventory costs, and routing costs are drawn from sensitivity analysis.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Economics
Jiliu Li, Min Xu, Peng Sun
Summary: This paper investigates a new variant of the two-echelon capacitated vehicle routing problem (2E-VRP) called the two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery (2E-VRPGS). A tailored branch-and-cut-and-price algorithm is developed to solve this problem and two related variants. Extensive numerical experiments show the efficacy of the algorithm and its competitiveness with existing algorithms.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2022)
Article
Engineering, Industrial
Katyanne Farias, Khaled Hadj-Hamou, Claude Yugma
Summary: This paper introduces a new version of the Inventory Routing Problem which considers a two-echelon system with indirect deliveries and routing decisions at both levels. It presents a mathematical formulation, a branch-and-cut algorithm, and a two-step matheuristic to solve the problem for different inventory policies and routing configurations, while introducing new valid inequalities for the two-echelon system. Computational experiments demonstrate the efficiency of the proposed method in solving small to medium-scale instances and finding feasible solutions for all instances.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2021)
Article
Chemistry, Multidisciplinary
Anita Agardi, Laszlo Kovacs, Tamas Banyai
Summary: The paper investigates the basin of attraction map of a complex Vehicle Routing Problem using random walk analysis. Different neighborhood operators are compared, with 2-opt and Partially Matched Crossover found to be more efficient.
APPLIED SCIENCES-BASEL
(2021)
Review
Management
Natasja Sluijk, Alexandre M. Florio, Joris Kinable, Nico Dellaert, Tom Van Woensel
Summary: The two-echelon vehicle routing problem (2E-VRP) involves splitting the distribution network into two levels. This review examines the literature on 2E-VRP, including mathematical formulations, solution methods, and benchmark datasets, emphasizing the academic and practical significance of 2E-VRP.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Automation & Control Systems
Yao Liu, Zhong Liu, Jianmai Shi, Guohua Wu, Witold Pedrycz
Summary: A new variant of the two-echelon routing problem is investigated, where both a truck and a drone are used for parcel deliveries in cooperation. The energy consumption model for the drone's routing process is analyzed, with a two-stage route-based modeling approach proposed for optimization. A hybrid heuristic integrating nearest neighbor and cost saving strategies, along with simulated annealing algorithm with Tabu search, is developed for quickly constructing feasible solutions. A case study in Changsha, China, is presented to conduct sensitivity analysis on critical factors.
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
(2021)
Article
Computer Science, Interdisciplinary Applications
Wenjuan Gu, Claudia Archetti, Diego Cattaruzza, Maxime Ogier, Frederic Semet, M. Grazia Speranza
Summary: This paper addresses a Multi-Commodity two-echelon Distribution Problem (MC2DP) involving suppliers, distribution centers, and customers. The goal is to minimize transportation cost from suppliers to customers by using consolidation at distribution centers. The paper proposes two sequential schemes to solve the problem and evaluates different strategies.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Computer Science, Interdisciplinary Applications
Frederic Quesnel, Alice Wu, Guy Desaulniers, Francois Soumis
Summary: A new partial pricing scheme is proposed in this paper for the personalized crew rostering problem, utilizing a deep neural network trained on historical data to select pairings likely to be included in an optimal or near-optimal solution. Testing on large instances shows that the method achieves solutions of similar quality as the classical algorithm in less computational time.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Management
Marilene Cherkesly, Timo Gschwind
Summary: This paper introduces, models and solves the pickup and delivery problem with time windows, multiple stacks, and handling operations. It proposes a solution methodology and conducts extensive tests and evaluations.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Interdisciplinary Applications
Thomas Reiten Bovim, Anders N. Gullhav, Henrik Andersson, Jostien Dale, Kjetil Karlsen
Summary: This paper presents the work conducted at St. Olavs Hospital in Norway, which is based on two projects aiming to prepare for the COVID-19 pandemic. Three discrete event simulation models are provided to evaluate the resource requirements during the pandemic peak. The study estimates the number of beds needed in the emergency department, the number of ambulances required to maintain pre-pandemic response times, and the effects of ED boarding time for COVID-19 patients. The analysis shows that strict testing policies increase the bed requirements but decrease the ambulance demand.
JOURNAL OF SIMULATION
(2023)
Article
Computer Science, Interdisciplinary Applications
Edward Lam, Guy Desaulniers, Peter J. Stuckey
Summary: This paper addresses the Electric Vehicle Routing Problem with multiple constraints and proposes a hybrid algorithm combining integer programming and constraint programming to solve the problem. Experimental results show promising performance for a large number of instances.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Management
Jorgen Skalnes, Henrik Andersson, Guy Desaulniers, Magnus Stalhane
Summary: This paper discusses the classic Inventory Routing Problem (IRP) and proposes a branch-and-cut algorithm based on a new mathematical formulation. The algorithm improves the lower bounds by using a convex combination of extreme points, called customer schedules, to deal with time-varying demands.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Health Care Sciences & Services
Thomas Reiten Bovim, Anita Abdullahu, Henrik Andersson, Anders N. Gullhav
Summary: This paper studies the integrated master surgery and outpatient clinic scheduling problem, proposes an optimization model, and conducts computational and simulation studies to demonstrate the advantages of the proposed model.
OPERATIONS RESEARCH FOR HEALTH CARE
(2022)
Article
Computer Science, Interdisciplinary Applications
Lasse Frigstad, Vegard Furu, Sigve Kristiansen Svenkerud, Andreas Claesson, Henrik Andersson, Tobias Andersson Granberg
Summary: Various initiatives have been implemented worldwide to reduce the time between out-of-hospital cardiac arrest and initiation of CPR and AED defibrillation. These initiatives include using nearby volunteers dispatched via mobile phones and delivering AEDs through drones. This study investigates the potential of integrating volunteers and AED delivering drones through joint planning and dispatching, and the results show that this approach can help reduce defibrillation time and improve the survival probability from out-of-hospital cardiac arrest.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Computer Science, Interdisciplinary Applications
Jurgen Skalnes, Simen T. Vadseth, Henrik Andersson, Magnus Stalhane
Summary: This paper presents an improved solution method for the inventory routing problem, which won the 12th DIMACS Implementation Challenge. The method uses a branch-and-cut embedded matheuristic, including a construction heuristic and an improvement heuristic, to generate promising routes and find optimal solutions. The proposed method outperforms previously published methods and achieves the best-known solutions for a large number of instances.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Adil Tahir, Guy Desaulniers, Issmail El Hallaoui
Summary: This paper introduces a generalized version of the integral column generation algorithm (ICG) called I2CG, which efficiently solves large-scale set partitioning problems with side constraints. Computational experiments show that I2CG outperforms other heuristics in solving the airline crew pairing problem and the multidepot vehicle routing problem with time windows.
INFORMS JOURNAL ON COMPUTING
(2022)
Article
Computer Science, Interdisciplinary Applications
Luciano Costa, Claudio Contardo, Guy Desaulniers, Julian Yarkony
Summary: Column generation (CG) algorithms are known to have convergence issues due to degenerate master problem structure and unstable dual variables. In this paper, a new stabilization framework is proposed to dynamically generate aggregated rows from the CG master problem, improving efficiency in solving various problems.
INFORMS JOURNAL ON COMPUTING
(2022)
Article
Computer Science, Interdisciplinary Applications
Alexander Jungwirth, Guy Desaulniers, Markus Frey, Rainer Kolisch
Summary: We propose an exact branch-price-and-cut (BPC) algorithm for the therapist scheduling and routing problem (ThSRP), a daily planning problem in hospitals. The algorithm can effectively solve realistic hospital instances and help hospital planners derive better schedules, showing that time window branching can be a valid alternative to cutting planes in addressing synchronization constraints within a BPC algorithm.
INFORMS JOURNAL ON COMPUTING
(2022)