Article
Economics
Hang Zhou, Hu Qin, Chun Cheng, Louis-Martin Rousseau
Summary: This study focuses on a new variant of the vehicle routing problem with drones, the two-echelon vehicle routing problem with drones, where multiple vehicles and drones collaborate to serve customers. The study considers practical constraints such as delivery deadlines and energy capacity of drones. Unlike previous research, the number of drones taken by each vehicle is treated as a decision variable, providing flexibility in planning vehicle and drone routes. The study proposes a mixed-integer linear programming model and an exact branch-and-price algorithm to solve the problem efficiently, and the results demonstrate the effectiveness of the algorithm in optimizing routes and the potential for further improvements.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(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
Computer Science, Interdisciplinary Applications
Xi-Dan Tian, Zhi-Hua Hu
Summary: This paper proposes a method to address the two-echelon location routing problem in city logistics by selecting recommended satellites from customers to enhance network adaptability. By using a mixed-integer linear program and a column-generation algorithm, the distribution cost is effectively reduced.
COMPUTERS & INDUSTRIAL ENGINEERING
(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
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
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
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
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)
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
Computer Science, Artificial Intelligence
Zhiguo Wu, Juliang Zhang
Summary: Motivated by distribution practices in express and e-commerce companies, this study focuses on a two-echelon electric vehicle routing problem. A branch-and-price algorithm is proposed to solve the problem, and its effectiveness is demonstrated through comparisons with existing methods. This research provides insights into optimizing distribution practices using electric vehicles.
COMPLEX & INTELLIGENT SYSTEMS
(2023)
Article
Economics
Lele Zhang, Pengyuan Ding, Russell G. Thompson
Summary: This paper examines a goods delivery problem for multiple courier companies in central city areas combined with a loading bay scheduling problem. Stochastic programming and a hybrid genetic algorithm are utilized to find the optimal vehicle routing and loading bay reservation strategy. The results show that the reservation system effectively coordinates deliveries and improves overall efficiency and space utilization.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2023)
Article
Economics
Hasan Murat Afsar, Sezin Afsar, Juan Jose Palacios
Summary: This paper studies the vehicle routing problem with zone-based pricing, proposing a mathematical model and a branch-and-price algorithm to maximize profit by serving customers in geographical zones at personalized prices. Promising numerical analysis results are demonstrated on the proposed set of instances.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Transportation Science & Technology
Wenqi Gao, Zhixing Luo, Houcai Shen
Summary: In this study, an exact branch-and-price-and-cut algorithm is proposed to solve the time-dependent pollution routing problem. The algorithm tackles the route selection problem and the time-dependent elementary shortest path problem to find the optimal solution. Compared to a commercial solver, the algorithm shows better performance and finds optimal solutions for more instances in less time.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2023)
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
Agricultural Engineering
Jin Xin Cao, Xiangting Wang, Jiachen Gao
Summary: Biomass as an important renewable energy source has gained attention, but inefficient biomass logistics systems hinder biomass utilization. This study proposes a hybrid heuristic algorithm to address the biomass resource location-routing problem, and tests its effectiveness and efficiency through computational examples.
BIOSYSTEMS ENGINEERING
(2021)
Article
Operations Research & Management Science
Luis Henrique Bicalho, Alexandre Salles da Cunha, Abilio Lucena
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
(2016)
Article
Computer Science, Interdisciplinary Applications
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
COMPUTERS & OPERATIONS RESEARCH
(2015)
Article
Management
Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2015)
Article
Computer Science, Hardware & Architecture
Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha
Article
Operations Research & Management Science
Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha
TRANSPORTATION SCIENCE
(2015)
Article
Management
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2017)
Article
Computer Science, Hardware & Architecture
Dilson Lucas Pereira, Alexandre Salles da Cunha
Article
Computer Science, Interdisciplinary Applications
Dilson Lucas Pereira, Alexandre Salles da Cunha
COMPUTERS & OPERATIONS RESEARCH
(2018)
Article
Management
Rosklin Juliano Chagas, Cristiano Arbex Valle, Alexandre Salles da Cunha
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2018)
Article
Management
Dilson Almeida Guimaraes, Alexandre Salles da Cunha, Dilson Lucas Pereira
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2020)
Article
Computer Science, Interdisciplinary Applications
Alexandre Salles da Cunha, Abilio Lucena
COMPUTERS & OPERATIONS RESEARCH
(2019)
Article
Management
Dilson Lucas Pereira, Alexandre Salles da Cunha
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2020)
Article
Mathematics, Applied
Dilson Almeida Guimaraes, Alexandre Salles da Cunha
Summary: This paper introduces Integer Programming (IP) methods for the Minimum Area Spanning Tree Problem (MASTP) and branch-and-cut algorithms using Benders Decomposition. By utilizing an early branching strategy, the algorithms successfully solved difficult instances and demonstrated that MASTP is challenging to solve in practice.
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
(2021)
Article
Computer Science, Interdisciplinary Applications
Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti
Summary: This article investigates a formulation, a heuristic, and branch-and-cut algorithms for the chordless cycle problem. Extensive computational results show that certified optimal solutions can be obtained for graphs with up to 100 vertices in acceptable CPU times.
INFORMS JOURNAL ON COMPUTING
(2022)
Proceedings Paper
Computer Science, Theory & Methods
Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha
COMBINATORIAL OPTIMIZATION, ISCO 2016
(2016)
