Article
Transportation Science & Technology
Nicolas Cabrera, Jean-Francois Cordeau, Jorge E. Mendoza
Summary: The park-and-loop routing problem is a variation of the vehicle routing problem that requires scheduling and optimization between vehicle and walking. In this study, we propose an exact solution method based on the branch-price-and-cut framework, and comparative experiments show that our method performs well in terms of solution quality and computational time efficiency.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES
(2023)
Article
Computer Science, Interdisciplinary Applications
Hongyuan Luo, Mahjoub Dridi, Olivier Grunder
Summary: This paper investigates a time-dependent green vehicle routing problem (TDGVRP) considering traffic congestion. The objective is to design a vehicle scheduling plan that reduces carbon emissions, which are directly related to vehicle fuel consumption. To mathematically model traffic congestion, the study considers time-dependent travel speed, resulting in time-dependent travel time and carbon emissions. A set partitioning formulation (SPF) and a branch-price-and-cut (BPC) algorithm, incorporating a tailored labeling algorithm for the pricing problem, are proposed. Valid inequalities are also used to strengthen the SPF, leading to a more accurate lower bound. Extensive computational experiments demonstrate the effectiveness of the proposed BPC algorithm. This study contributes to the theoretical research on vehicle routing problems (VRPs) and provides a mathematical and reasonable method for logistics companies to formulate logistics plans considering fuel consumption, climate change, and carbon emissions reduction.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Engineering, Multidisciplinary
Maximiliano R. Bordon, Jorge M. Montagna, Gabriela Corsano
Summary: This article discusses the key issue of log transportation in the forest industry, focusing on transportation planning decisions such as determining truck fleet routes and harvest areas for raw material supply. It presents an efficient Integer Programming model and a Column Generation based approach to solve this problem, evaluating the benefits of each approach through examples.
APPLIED MATHEMATICAL MODELLING
(2021)
Article
Computer Science, Interdisciplinary Applications
Li Zhang, Zhongshan Liu, Wenxuan Shan, Bin Yu
Summary: In the context of waste classification, split transportation allows for flexible combinations of routes and helps to save on operational costs. This paper presents a novel waste transportation problem that extends the traditional waste transportation problem by introducing the concept of split transportation. A mixed integer programming formulation and a branch-and-price-and-cut algorithm are developed to solve the investigated problem. The impact of split transportation, demand intervals, and trailer capacity are discussed to provide managerial insights.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
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
Operations Research & Management Science
Caio Marinho Damiao, Joao Marcos Pereira Silva, Eduardo Uchoa
Summary: This article proposes a model for solving the Cumulative Capacitated Vehicle Routing Problem, which calculates the contribution of the travel time of an edge to the arrival times of remaining customers using position indexes. Computational experiments show that the proposed model outperforms other methods and is applicable to the Multi-Depot variant of the problem.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Shurui Zhu, Huijun Sun, Xin Guo
Summary: This research focuses on the practical challenges of airport ground-handling vehicle services, integrating vehicles with different service objects and utilizing methods such as multi-objective mixed integer programming to optimize service priorities and time windows, effectively improving service performance.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Engineering, Industrial
Ece Naz Duman, Duygu Tas, Bulent Catay
Summary: This paper addresses the electric vehicle routing problem with time windows and proposes two methods based on a column generation algorithm. Experimental results indicate that the heuristic algorithm outperforms the exact algorithm in terms of computational time and number of instances solved, especially for larger instances. Both algorithms introduce new solutions to the literature.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2022)
Article
Management
Stephen J. Maher
Summary: Benders' decomposition is a popular algorithm for mathematical and constraint programming, but traditionally viewed as problem specific. This paper introduces a general purpose algorithm capable of handling various types of problems and providing flexibility. A branch-and-cut approach for Benders' decomposition was implemented in the SCIP solver, allowing for extensions and customisations. The effectiveness of the algorithm and enhancement techniques was assessed through comprehensive computational study.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Patrick Healy, Nicolas Jozefowiez, Pierre Laroche, Franc Marchetti, Sebastien Martin, Zsuzsanna Roka
Summary: The Connected Max-k-Cut Problem is an extension of the well-known Max-Cut Problem, where the objective is to partition a graph into k connected subgraphs by maximizing the cost of inter-partition edges. The researchers propose a new integer linear program and a branch-and-cut algorithm for this problem, and also use graph isomorphism to structure the instances and facilitate their resolution. Extensive computational experiments show that, if k > 2, their approach outperforms existing algorithms in terms of quality.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2024)
Article
Economics
Menglei Jia, Feng Chen
Summary: Motivated by a famous automobile manufacturing company, this study addresses the upward scalable vehicle routing problem with time windows (USVRPTW) in the context of inbound logistics. The researchers propose a branch-and-price algorithm to solve the problem exactly and design a tree search algorithm based on the consideration of resource allocation. They also develop a heuristic algorithm for generating initial columns in the column generation process. Numerical experiments demonstrate the superiority of their algorithm compared to a commercial solver. Additionally, real-data experiments show that a slight increase in driving cost can greatly improve vehicle utilization, highlighting the significance of flexibility. The study provides management insights on reducing logistics cost through adopting the proposed flexibility mechanism.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2023)
Article
Computer Science, Artificial Intelligence
Xinxin Su, Gangyan Xu, Nan Huang, Hu Qin
Summary: This paper presents a solution to the manpower allocation and vehicle routing problem with staff qualifications and time windows (MAVRP-SQTW). The developed method, based on arc-flow and set-packing models, involves a branch-and-price-and-cut algorithm to optimize staff assignment and vehicle routing. Numerical results indicate that the set-packing model outperforms the arc-flow model, and sensitivity analyses highlight the significant effects of vehicle and staff numbers on the branch-and-price-and-cut algorithm. A primal heuristic is then proposed to improve the efficiency of solving large-scale instances.
ADVANCED ENGINEERING INFORMATICS
(2023)
Article
Computer Science, Software Engineering
Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan
Summary: Branch and cut is a dominant paradigm that combines efficient search and relaxation-tightening procedures for solving a wide range of mathematical programming problems. However, there is a lack of theoretical explanations for the choices made in cutting strategies and the tradeoffs involved. This paper provides a framework for analyzing the impact of cuts on the size of branch-and-cut trees and their effect on solution time.
MATHEMATICAL PROGRAMMING
(2023)
Article
Economics
Weibo Yang, Liangjun Ke, David Z. W. Wang, Jasmine Siu Lee Lam
Summary: This paper investigates the new variant of vehicle routing problem - VRPRD, aiming to minimize the total routing and weighted tardiness costs. By developing a new algorithm, the exact optimal solutions for over 75% of benchmark instances can be obtained within a short period of time.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Management
Borzou Rostami, Guy Desaulniers, Fausto Errico, Andrea Lodi
Summary: This paper discusses a variant of the capacitated vehicle routing problem where travel times are uncertain and statistically correlated. By adopting a mean-variance approach, the aim is to plan reliable vehicle routes by penalizing routes with high travel time variability to reduce time variability.
OPERATIONS RESEARCH
(2021)
Article
Operations Research & Management Science
Yongjia Song, Minjiao Zhang
NAVAL RESEARCH LOGISTICS
(2015)
Article
Mathematics, Applied
Yongjia Song, James Luedtke
SIAM JOURNAL ON OPTIMIZATION
(2015)
Article
Computer Science, Software Engineering
Shabbir Ahmed, James Luedtke, Yongjia Song, Weijun Xie
MATHEMATICAL PROGRAMMING
(2017)
Article
Economics
Ricardo Fukasawa, Qie He, Yongjia Song
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2016)
Article
Computer Science, Interdisciplinary Applications
Xiao Lei, Siqian Shen, Yongjia Song
COMPUTERS & OPERATIONS RESEARCH
(2018)
Article
Automation & Control Systems
Bowen Pang, Xiaolei Xie, Yongjia Song, Li Luo
IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING
(2019)
Article
Computer Science, Hardware & Architecture
Babak Saleck Pay, Jason R. W. Merrick, Yongjia Song
Article
Food Science & Technology
Ling Xie, Jun Yi, Yongjia Song, Mengyao Zhao, Liqiang Fan, Liming Zhao
Summary: GOLM1 has been identified as a prime target for cancer therapy, and EGCG is the first natural product found to downregulate GOLM1 expression, inhibiting MDA-MB-231 cell migration through the HGF/HGFR/AKT/GSK-3/ beta-catenin/c-Myc signaling pathway.
FOOD AND CHEMICAL TOXICOLOGY
(2021)
Article
Public, Environmental & Occupational Health
Mecca Burris, Laura Kihlstrom, Karen Serrano Arce, Kim Prendergast, Jessica Dobbins, Emily McGrath, Andrew Renda, Elisa Shannon, Tristan Cordier, Yongjia Song, David Himmelgreen
Summary: Loneliness and lack of social support are significantly associated with food insecurity among older adults. The study found that food insecurity is influenced by various underlying determinants, including psychosocial factors.
JOURNAL OF HUNGER & ENVIRONMENTAL NUTRITION
(2021)
Article
Computer Science, Interdisciplinary Applications
Ricardo Fukasawa, Qie He, Fernando Santos, Yongjia Song
INFORMS JOURNAL ON COMPUTING
(2018)
Article
Computer Science, Interdisciplinary Applications
Wim van Ackooij, Welington de Oliveira, Yongjia Song
INFORMS JOURNAL ON COMPUTING
(2018)
Article
Computer Science, Interdisciplinary Applications
Qiong Zhang, Yongjia Song
ACM TRANSACTIONS ON MODELING AND COMPUTER SIMULATION
(2017)
Article
Computer Science, Interdisciplinary Applications
Yongjia Song, Siqian Shen
INFORMS JOURNAL ON COMPUTING
(2016)
Proceedings Paper
Computer Science, Hardware & Architecture
Yongjia Song, Thang N. Dinh
COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2014)
(2014)