Article
Operations Research & Management Science
Panagiotis Karakostas, Angelo Sifaleras, Michael C. Georgiadis
Summary: This work presents efficient solution approaches for the Pollution Location Inventory Routing problem, which considers both economic and environmental issues, using mixed-integer linear programming and General Variable Neighborhood Search-based metaheuristic algorithms.
OPTIMIZATION LETTERS
(2022)
Article
Computer Science, Interdisciplinary Applications
Baybars Ibroska, Selin Ozpeynirci, Ozgur Ozpeynirci
Summary: The use of unmanned aerial vehicles plays a key role in the development of new technologies in various fields. With the growth of e-commerce and the impact of the pandemic, cargo transportation has become more complex. By utilizing unmanned aerial vehicles in cargo transportation and reducing reliance on trucks through proper planning, some of the challenges can be addressed.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Mathematics
Yusuf Yilmaz, Can B. Kalayci
Summary: This paper addresses the Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery, proposing an efficient solution using an integer linear model and variable neighborhood search algorithm to minimize total distance traveled. Experimental results show that the proposed method achieves efficient solutions in terms of solution quality and time.
Article
Management
Luca Bertazzi, Geoffrey A. Chua, Demetrio Lagana, Rosario Paradiso
Summary: This study investigates an Inventory Routing Problem at the tactical planning level, where inventory levels are decision variables. By designing effective subsets of routes, the periodic problem is solved, and the effectiveness of matheuristics is proven in the worst case.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Chemistry, Multidisciplinary
Mehmet Anil Akbay, Can Berk Kalayci, Christian Blum, Olcay Polat
Summary: This paper proposes a method to solve the two-echelon electric vehicle routing problem, aiming to reduce the negative impact in urban areas through multi-echelon distribution networks and environmentally friendly vehicles. A mixed-integer linear programming model is developed, and a variable neighborhood search metaheuristic is proposed to improve the solution quality.
APPLIED SCIENCES-BASEL
(2022)
Article
Computer Science, Interdisciplinary Applications
Amro M. El-Adle, Ahmed Ghoniem, Mohamed Haouari
Summary: This study presents a variable neighborhood search (VNS) heuristic for the Traveling Salesman Problem with Drone (TSP-D) to minimize the return time of both the vehicle and drone. The VNS explores the feasible space and allows for intervening visits to customers and multiple drone cycles. The results show significant improvements in optimization and delivery times.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Multidisciplinary Sciences
Ayyuce Aydemir-Karadag
Summary: This paper discusses the importance of managing healthcare waste during the COVID-19 pandemic and presents a bi-objective mixed-integer nonlinear programming model. A two-step approach is proposed to address the complexity of the problem and the algorithm outperforms other search algorithms in performance evaluation metrics.
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING
(2022)
Article
Computer Science, Artificial Intelligence
Ran Liu, Shan Jiang
Summary: This paper discusses the two-echelon vehicle routing problem with simultaneous delivery and pickup demands (2E-VRPSDP), which differs from classic transportation and vehicle routing problems. A variable neighborhood search algorithm is proposed to solve the problem, and numerical results show that the algorithm can provide reasonable solutions within an acceptable computational time.
Article
Computer Science, Artificial Intelligence
Junchuang Cai, Qingling Zhu, Qiuzhen Lin
Summary: This paper introduces a new Dynamic Pickup and Delivery Problem (DPDP) and proposes an algorithm called VNSME to solve it. The algorithm performs well in practical scenarios and achieves the first place in the ICAPS 2021 competition.
SWARM AND EVOLUTIONARY COMPUTATION
(2022)
Article
Management
Theo Le Colleter, Dorian Dumez, Fabien Lehuede, Olivier Peton
Summary: This paper presents a variant of the vehicle routing problem that focuses on combining walking and driving for product delivery in congested cities. The paper introduces the concept of finding parking spaces or loading zones before walking trips to deliver goods, and presents an efficient technique for selecting parking spots. The results show that combining walking and driving can save an average of 19% working time compared to traditional vehicle routing approaches.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Economics
Mir Ehsan Hesam Sadati, Bulent Catay
Summary: The Multi-Depot Green Vehicle Routing Problem extends the well-known GVRP and proposes new neighborhood structures to effectively solve the problem. Evaluation using literature dataset shows high performance of the method in providing high quality solutions in short computation times.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Management
Omer Berk Olmez, Ceren Gultekin, Burcu Balcik, Ali Ekici, Okan Orsan Ozener
Summary: This study focuses on designing an efficient waste cooking oil collection network, using it as raw material for biodiesel production. By applying a mathematical heuristic algorithm, the number and location of collection centers, allocation of households, number of bins, and vehicle routes can be determined to minimize costs and provide superior solutions.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Computer Science, Artificial Intelligence
Sheng Su, Dongwen Xiong, Haijie Yu, Xiaohua Dong
Summary: This paper studies a multiobjective carpooling problem for people working in the same industrial park and proposes a novel multiple leaders particle swarm optimization algorithm MPSO-VNS which can effectively solve the problem. Experimental results show that the algorithm performs well in terms of solution efficiency and multiobjective optimization performance.
SWARM AND EVOLUTIONARY COMPUTATION
(2022)
Article
Computer Science, Interdisciplinary Applications
Sinaide Nunes Bezerra, Marcone Jamilson Freitas, Sergio Ricardo de Souza
Summary: This article addresses the MDVRPTW* problem and proposes an algorithm called SGVNSALS to solve it. The algorithm outperforms other algorithms in terms of the number of used vehicles and covered distance.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Mathematics
Lamiaa Dahite, Abdeslam Kadrani, Rachid Benmansour, Rym Nesrine Guibadj, Cyril Fonlupt
Summary: This paper addresses the problem faced by maintenance service providers in performing maintenance activities on geographically distributed machines. It proposes a new bi-objective mathematical model and algorithms to determine the optimal maintenance and routing plan simultaneously. The efficiency of the approach is demonstrated through experiments.
Article
Operations Research & Management Science
Martin W. P. Savelsbergh, Marlin W. Ulmer
Summary: Crowdsourced delivery is a mode of delivering goods by enlisting individuals via the internet. It challenges the traditional delivery models that rely on company employees and introduces new challenges.
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
(2022)
Article
Management
David Wolfinger, Margaretha Gansterer, Karlf. Doerner, Nikolas Popper
Summary: This article addresses the logistics problem in COVID-19 testing, introduces the contagious disease testing problem (CDTP), and presents a solution. By optimizing the opening of test centers and routes of mobile test teams to minimize costs, the efficiency of public health response to pandemics can be improved.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
Yu Yang, Natashia Boland, Bistra Dilkina, Martin Savelsbergh
Summary: This article investigates the impact of branching on a set of variables on search tree size and bounds. It introduces the concept of generalized strong branching and trains a model using extreme gradient boosting to predict the ranking of candidate variable sets. Experimental results demonstrate that branching on sets of variables outperforms branching on a single variable in terms of the number of nodes explored in the search tree and the time required for exploration.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Management
Ian Herszterg, Yassine Ridouane, Natashia Boland, Alan Erera, Martin Savelsbergh
Summary: This study designs and implements decision support technology to assist dispatchers in managing loadplans in less-than-truckload service networks. It demonstrates the effectiveness of near real-time loadplan adjustments in improving on-time performance without incurring additional cost, using existing capacity in the service network.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Management
Baris Yildiz, Martin Savelsbergh
Summary: We explore a novel optimization model for planning and operating an air service network at a package express carrier in China. The model considers various factors such as ground and air transportation, aircraft capacity, package service classes, and timely package availability. A column generation based algorithm is devised to solve real-life problems, and the results show the importance of considering ground transportation in improving operational efficiency, maximizing profits, and extending service coverage. Additionally, the study suggests that a single-flight shipment based air service network design can be more effective than the commonly used star network design with multi-flight shipments.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Engineering, Industrial
Richard F. Hartl, Peter M. Kort, Stefan Wrzaczek
Summary: This paper studies the trade-off between durability and reputation for a firm, and analyzes the impact of government policy on firm decision making. The research finds that the length of warranty period, consumer awareness of warranty, and uncertainty about product breakdown all have effects on product lifetime.
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
(2023)
Article
Management
Georg E. A. Froehlich, Margaretha Gansterer, Karl F. Doerner
Summary: This study reviews and categorizes literature on safe and secure vehicle routing problems and provides a starting point for researchers in this field. The study reveals that the majority of related articles have been published in the last five years and cover various aspects such as transportation of hazardous materials, patrol routing, cash-in-transit, dissimilar routing problems, and modeling of multi-graphs. The paper also discusses relevant methods and instances, along with identifying future research directions.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
(2023)
Article
Operations Research & Management Science
Gustav Feichtinger, Richard F. Hartl, Peter M. Kort, Andrea Seidl, Stefan Wrzaczek
Summary: This paper examines the impact of a firm's own capital stock and its competitor's capital stock on investment in a capital accumulation game. The study finds that if a firm acknowledges that its own capital stock increases the efficiency of the competitor's investments, the firm will invest less.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
(2022)
Article
Operations Research & Management Science
Mohammadmehdi Hakimifar, Vera C. Hemmelmayr, Fabien Tricoire
Summary: Max-min approaches are widely used in humanitarian operations to address equity, but they have a drawback when handling solutions with the same minimum values. To overcome this, we propose the lexicographic maximin approach and apply it to the rapid needs assessment process. By constructing routes and maximizing the coverage ratio vector, we cover community groups with different characteristics in the assessment plan.
Article
Operations Research & Management Science
Haotian Wu, Ian Herszterg, Martin Savelsbergh, Yixiao Huang
Summary: This study addresses the service network design problem in an urban same-day delivery system with limited vehicle capacities at hubs. The researchers propose three heuristics and demonstrate their effectiveness through a computational study using real-world instances.
TRANSPORTATION SCIENCE
(2023)
Article
Computer Science, Interdisciplinary Applications
Emilio J. Alarcon Ortega, Karl F. Doerner
Summary: This article addresses a continuous-time variant of the inventory routing problem under stochastic demands. The problem at hand considers continuous decrease of inventory during the period due to customer demand. A two-stage mathematical program is formulated to manage replenishment decisions and reduce costs. An adaptive large neighborhood search algorithm is developed to find solutions, and the impact of using recourse actions to handle lost sales is evaluated. The algorithm's performance is compared with other algorithms from the literature, considering stochastic demands, and efficiency and levels of stochasticity are analyzed.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Management
Alexandre M. Florio, Michel Gendreau, Richard F. Hartl, Stefan Minner, Thibaut Vidal
Summary: This paper examines the stochastic variant of the Vehicle Routing Problem (VRP) called VRPSD, where demands are only revealed upon vehicle arrival at each customer. The paper summarizes recent progress in VRPSD research and introduces two major contributions: a branch-price-and-cut algorithm for optimal restocking and a demand model for correlated customer demands. Computational results demonstrate the effectiveness of the new algorithm and the potential cost savings of over 10% when considering demand correlation.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
J. P. Caulkins, D. Grass, G. Feichtinger, R. F. Hartl, P. M. Kort, M. Kuhn, A. Prskawetz, M. Sanchez-Romero, A. Seidl, S. Wrzaczek
Summary: This paper explores the variation of lockdown policies during the gap between vaccine approval and complete vaccination. The study finds that the intensity and duration of lockdowns may increase or decrease as the rate of vaccine deployment increases, depending on other model parameters. Vaccines and lockdowns can act as substitutes or complements, depending on the specific conditions.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Hardware & Architecture
Georg E. A. Frohlich, Margaretha Gansterer, Karl F. Doerner
Summary: In this study, we propose a novel time-dependent multi-visit dynamic safe street snow plowing problem and develop an adaptive large neighborhood search method to solve it. By examining real-world-based instances for Vienna, we find that different snowstorm movements do not significantly affect the choice of rolling horizon settings. Our findings also suggest that larger updating intervals are beneficial when prediction errors are low, and larger look-aheads are better suited for larger updating intervals.
Article
Operations Research & Management Science
Haotian Wu, Ian Herszterg, Martin Savelsbergh, Yixiao Huang
Summary: This study focuses on a service network design problem for an urban same-day delivery system with limited vehicle capacity at hubs. The researchers propose three heuristics and conduct extensive computational experiments using real-world instances to demonstrate their effectiveness.
TRANSPORTATION SCIENCE
(2023)
