Article
Computer Science, Interdisciplinary Applications
Bencomo Dominguez-Martin, Hipolito Hernandez-Perez, Jorge Riera-Ledesma, Inmaculada Rodriguez-Martin
Summary: This paper introduces a new problem that combines characteristics of the Location and Routing Problem and the One-commodity Pickup and Delivery Traveling Salesman Problem. The problem is solved by proposing two mathematical formulations and a branch-and-cut algorithm, and the results show that the algorithm is able to solve instances with up to 100 nodes.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Construction & Building Technology
Yuhe Shi, Yun Lin, Songyi Wang, Haolin Wen, Ming K. Lim, Yan Li
Summary: This paper discusses the importance of environmental pollution caused by express packaging waste on the development of sustainable city logistics and proposes a joint optimization approach for express parcel delivery and recyclable express packaging recycling. Numerical experiments show that the proposed method provides a more feasible solution for facility location and route planning.
SUSTAINABLE CITIES AND SOCIETY
(2023)
Article
Economics
Weiwei Liu, Nan Kong, Mingzheng Wang, Lingling Zhang
Summary: In this study, a multi-commodity capacitated facility location problem with sustainability concerns and a complementarity demand function is investigated. It is shown that incorporating this demand function can lead to superior decisions both analytically and computationally. The problem is transformed into a 0-1 mixed-integer concave program using the piecewise-linear envelope method, and an efficient branch-and-refine algorithm with global convergence is proposed. Numerical examples demonstrate the impact of carbon emission limit and carbon trading on company decisions.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2021)
Article
Economics
Okan Arslan, Gul Culhan Kumcu, Bahar Yetis Kara, Gilbert Laporte
Summary: The refugee crisis is a major challenge for modern society, requiring strategic and operational decisions to plan public services to meet the sudden influx of refugees. A new algorithm has been developed to address the location of refugee camps and transportation of public service providers by considering variables such as the location of beneficiaries. This algorithm efficiently solves real-world instances with 244 nodes optimally.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2021)
Article
Management
Eleftherios Manousakis, Panagiotis Repoussis, Emmanouil Zachariadis, Christos Tarantilis
Summary: This paper explores the Inventory Routing Problem (IRP) with Maximum Level inventory policy, introducing a novel solution approach that outperforms current state-of-the-art methods in computational experiments, especially for hard-to-solve instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Management
Mengtong Wang, Canrong Zhang, Michael G. H. Bell, Lixin Miao
Summary: In response to the increasing demand for e-commerce and environmentally friendly urban delivery solutions, package delivery companies are focusing on enhancing user experience and sustainable operations. This study proposes a solution that simultaneously optimizes the location of pick-up stations and the delivery plan of green vehicles to meet customer demand while minimizing costs. The research utilizes mixed-integer programming and a branch-and-price algorithm to find an optimal solution and provides valuable insights for package delivery companies.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Management
Dieter Weninger, Laurence A. W. Olsey
Summary: This paper studies the capacitated facility location problem with (partial) single-sourcing (CFLP-SS). A natural mixed integer formulation for the problem is proposed, and three variants of a Benders' type decomposition algorithm are presented. Computational comparisons are made with a commercial solver (CPLEX) on the original formulation, a CPLEX version of Benders, and a cut-and-solve approach developed specifically for CFLP-SS. The results show that the Benders' variants achieve speedups of between 1.2 and 3.7 for CFLP-SS when the percentage of clients requiring single-sourcing is less than or equal to 25%.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Mathematics
Alejandro Moya-Martinez, Mercedes Landete, Juan Francisco Monge
Summary: This paper introduces the concept of "close-enough" in facility location, exploring the optimal solution for selecting facilities and pickup points among finite candidate sets to satisfy all demand and minimize total cost.
Article
Computer Science, Interdisciplinary Applications
Riccardo Giusti, Daniele Manerba, Teodor Gabriel Crainic, Roberto Tadei
Summary: This article presents a variant of the hub location problem faced by a logistics service provider operating in the context of synchromodal logistics. The problem involves locating transshipment facilities to manage origin-destination shipments while minimizing costs and meeting time constraints. The authors propose a time-space network representation and a mixed-integer linear programming formulation to model the problem and evaluate the potential benefits of synchromodal logistics operations.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Artificial Intelligence
Samuel Nucamendi-Guillen, Alejandra Gomez Padilla, Elias Olivares-Benitez, J. Marcos Moreno-Vega
Summary: This paper introduces the multi-depot open location routing problem (MD-OLRP) and proposes an intelligent metaheuristic to solve it, achieving high-quality solutions and saving the company 30.86% in costs.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Economics
Francisco Saldanha-da-Gama
Summary: This article aims to contribute to the celebration of the 25th Anniversary of Transportation Research Part E: Logistics and Transportation Review by providing an overview of the role of Facility Location in Logistics and Transportation. It discusses the increasing importance of Facility Location due to technological developments, economy globalization, and environmental concerns. The article also explores current trends and future challenges, including the transition from Industry 4.0 to Industry 5.0 and the impact of data-driven decision making in the era of big data.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2022)
Article
Green & Sustainable Science & Technology
Mohammad Ebrahim Tayebi Araghi, Reza Tavakkoli-Moghaddam, Fariborz Jolai, Seyyed Mohammad Hadji Molana
Summary: The GSOLRP combines location-routing problem and green vehicles to reduce costs by minimizing CO2 emissions in production systems. Robust optimization approach and hybrid meta-heuristic method are used to solve large-scale problems efficiently.
JOURNAL OF CLEANER PRODUCTION
(2021)
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
Operations Research & Management Science
Peter Egri, Balazs David, Tamas Kis, Miklos Kresz
Summary: This paper focuses on the design problem of waste wood supply network and proposes solutions through mathematical models and methods. The study includes facility location problem, economies of scale, and robustness. The experiments show that the models and methods have good performance.
ANNALS OF OPERATIONS RESEARCH
(2023)
Article
Operations Research & Management Science
Luis Gouveia, Markus Leitner, Mario Ruthmair
Summary: We have developed an exact algorithm for the multi-depot split-delivery vehicle routing problem (MDSDVRP), and proposed an integer programming formulation with effective inequalities. Experimental results demonstrate that the new inequalities strengthen the linear programming relaxation, improve algorithm performance, and reduce the number of feasibility cuts. The algorithm performs exceptionally well in MDSDVRP, significantly outperforms existing techniques in MDTSP, and remains competitive in SDVRP.
TRANSPORTATION SCIENCE
(2022)
Article
Computer Science, Interdisciplinary Applications
Rafael Praxedes, Teobaldo Bulhoes, Anand Subramanian, Eduardo Uchoa
Summary: The Vehicle Routing Problem with Simultaneous Pickup and Delivery is a classical optimization problem that aims to determine the least-cost routes while meeting pickup and delivery demands and vehicle capacity constraints. In this study, a unified algorithm is proposed to solve multiple variants of the problem, and extensive computational experiments are conducted to evaluate the algorithm's performance.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Ragheb Rahmaniani, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei
Summary: Benders decomposition (BD) is a popular solution algorithm for stochastic integer programs. However, existing parallelization methods often suffer from inefficiencies. This paper proposes an asynchronous parallel BD method and demonstrates its effectiveness through numerical studies and performance enhancement strategies.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Giulia Caselli, Maxence Delorme, Manuel Iori, Carlo Alberto Magni
Summary: This study addresses a real-world scheduling problem and proposes four exact methods to solve it. The methods are evaluated through computational experiments on different types of instances and show competitive advantages on specific subsets. The study also demonstrates the generalizability of the algorithms to related scheduling problems with contiguity constraints.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Shaowen Yao, Chao Tang, Hao Zhang, Songhuan Wu, Lijun Wei, Qiang Liu
Summary: This paper examines the problem of two-dimensional irregular multiple-size bin packing and proposes a solution that utilizes an iteratively doubling binary search algorithm to find the optimal bin combination, and further optimizes the result through an overlap minimization approach.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Decheng Wang, Ruiyou Zhang, Bin Qiu, Wenpeng Chen, Xiaolan Xie
Summary: Consideration of driver-related constraints, such as mandatory work break, in vehicle scheduling and routing is crucial for safety driving and protecting the interests of drivers. This paper addresses the drop-and-pull container drayage problem with flexible assignment of work break, proposing a mixed-integer programming model and an algorithm for solving realistic-sized instances. Experimental results show the effectiveness of the proposed algorithm in handling vehicle scheduling and routing with work break assignment.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
William N. Caballero, Jose Manuel Camacho, Tahir Ekin, Roi Naveiro
Summary: This research provides a novel probabilistic perspective on the manipulation of hidden Markov model inferences through corrupted data, highlighting the weaknesses of such models under adversarial activity and emphasizing the need for robustification techniques to ensure their security.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Davood Zaman Farsa, Shahryar Rahnamayan, Azam Asilian Bidgoli, H. R. Tizhoosh
Summary: This paper proposes a multi-objective evolutionary framework for compressing feature vectors using deep autoencoders. The framework achieves high classification accuracy and efficient image representation through a bi-level optimization scheme. Experimental results demonstrate the effectiveness and efficiency of the proposed framework in image processing tasks.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Matthew E. Scherer, Raymond R. Hill, Brian J. Lunday, Bruce A. Cox, Edward D. White
Summary: This paper discusses instance generation methods for the multidemand multidimensional knapsack problem and introduces a primal problem instance generator (PPIG) to address feasibility issues in current instance generation methods.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Yin Yuan, Shukai Li, Lixing Yang, Ziyou Gao
Summary: This paper investigates the design of real-time train regulation strategies for urban rail networks to reduce train deviations and passenger waiting times. A mixed-integer nonlinear programming (MINLP) model is used and an efficient iterative optimization (IO) approach is proposed to address the complexity. The generalized Benders decomposition (GBD) technique is also incorporated. Numerical experiments show the effectiveness and computational efficiency of the proposed method.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Xinghai Guo, Netirith Narthsirinth, Weidan Zhang, Yuzhen Hu
Summary: This study proposes a bi-level scheduling method that utilizes unmanned surface vehicles for container transportation. By formulating mission decision and path control models, efficient container transshipment and path planning are achieved. Experimental results demonstrate the effectiveness of the proposed approach in guiding unmanned surface vehicles to complete container transshipment tasks.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Review
Computer Science, Interdisciplinary Applications
Jose-Fernando Camacho-Vallejo, Carlos Corpus, Juan G. Villegas
Summary: This study aims to review the published papers on implementing metaheuristics for solving bilevel problems and performs a bibliometric analysis to track the evolution of this topic. The study provides a detailed description of the components of the proposed metaheuristics and analyzes the common combinations of these components. Additionally, the study provides a detailed classification of how crucial bilevel aspects of the problem are handled in the metaheuristics, along with a discussion of interesting findings.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Xudong Diao, Meng Qiu, Gangyan Xu
Summary: In this study, an optimization model for the design of an electric vehicle-based express service network is proposed, considering limited recharging resources and power management. The proposed method is validated through computational experiments on realistic instances.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Ramon Piedra-de-la-Cuadra, Francisco A. Ortega
Summary: This study proposes a procedure to select candidate sites optimally for ensuring energy autonomy and reinforced service coverage for electric vehicles, while considering demand and budget restrictions.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Danny Blom, Christopher Hojny, Bart Smeulders
Summary: This paper focuses on a robust variant of the kidney exchange program problem with recourse, and proposes a cutting plane method for solving the attacker-defender subproblem. The results show a significant improvement in running time compared to the state-of-the-art, and the method can solve previously unsolved instances. Additionally, a new practical policy for recourse is proposed and its tractability for small to mid-size kidney exchange programs is demonstrated.
COMPUTERS & OPERATIONS RESEARCH
(2024)
Article
Computer Science, Interdisciplinary Applications
Anqi Li, Congying Han, Tiande Guo, Bonan Li
Summary: This study proposes a general framework for designing linear programming instances based on the preset optimal solution, and validates the effectiveness of the framework through experiments.
COMPUTERS & OPERATIONS RESEARCH
(2024)