Article
Economics
Yun Hui Lin, Yuan Wang, Loo Hay Lee, Ek Peng Chew
Summary: This study investigates a pure e-retail company's implementation of an omnichannel distribution strategy by introducing offline physical stores. By using a discrete choice model and optimization framework, the research aims to maximize profit for large-scale problems efficiently.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
(2022)
Article
Computer Science, Artificial Intelligence
Telmo Matos, Oscar Oliveira, Dorabela Gamboa
Summary: In this paper, we propose both sequential and parallel Relaxation Adaptive Memory Programming approaches for the Capacitated Facility Location Problem (CFLP), integrating information from both primal and dual solution spaces to create advanced memory structures. Computational experiments are presented to demonstrate the effectiveness of this approach.
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
(2021)
Article
Engineering, Industrial
Kyosang Hwang, Tooba Binte Asif, Taesik Lee
Summary: Improving access to care in medically under-served areas is crucial for public health policy. The establishment of new service providers can enhance geographic accessibility, but it is important to consider consumer preferences and decisions to achieve effective improvements.
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL
(2022)
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
Management
Ningxuan Kang, Hao Shen, Ye Xu
Summary: An optimization model was developed to automatically make annual plans of delivery stations that minimize operational costs, adopting a mixed-integer linear programming method and proposing applicable techniques to solve the model. The results showed that compared with manual planning, the model generated improved plans in terms of operational cost and delivery distance. The tool described in the study helps JD.com save on delivery costs and gain operational benefits in designing delivery networks.
INFORMS JOURNAL ON APPLIED ANALYTICS
(2022)
Article
Management
Chun Cheng, Yossiri Adulyasak, Louis-Martin Rousseau
Summary: Facility location decision is strategic and should consider uncertainties; Solutions to fixed charge location problems and facility fortification problems were studied and compared; Experimental results show that robust models can better handle problems under uncertainties, assisting managers in making more informed decisions.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
(2021)
Article
Management
Robert Aboolian, Oded Berman, Dmitry Krass
Summary: The paper introduces a generalized framework and methodology for optimizing both location and design decisions for multiple facilities simultaneously. Research results demonstrate that combining design and location decisions can lead to better optimization outcomes, while not combining them may result in significant optimality gaps.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Operations Research & Management Science
Ralf Krohn, Sven Mueller, Knut Haase
Summary: This study introduces an approach to increase expected participation in preventive healthcare programs and successfully applies a mixed-integer linear program to optimize solutions for instances involving demand nodes and candidate locations. Benders decomposition is found to reduce computational effort by more than 50%, with the research revealing a nonlinear relationship between participation and the number of established facilities.
Article
Economics
Oliver Bluemke
Summary: This paper discusses the accounting standard requirement for financial institutions to measure default risk with respect to the full maturity of a financial instrument, and proposes an extension of existing models to forecast future default probabilities. The study finds that default probabilities change in different patterns over time depending on the initial rating grade, and introduces a shape parameter to improve prediction accuracy.
JOURNAL OF FORECASTING
(2022)
Article
Management
Yun Hui Lin, Qingyun Tian
Summary: This paper studies exact solution approaches for a generalized competitive facility location problem and proposes a branch-and-cut algorithm based on the generalized Benders decomposition scheme (B&C-Benders). Computational experiments show that B&C-Benders outperforms state-of-the-art exact approaches in terms of computational time and number of instances solved to optimality, especially for large-scale instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2021)
Article
Computer Science, Interdisciplinary Applications
Cheng-Nan Kang, Ling-Chieh Kung, Po-Hsuan Chiang, Jiun-Yu Yu
Summary: Most facility location models do not consider customer preferences, making them inadequate for service facility applications. We develop a model to account for customer preferences and maximize customer service. Using a heuristic algorithm based on maximum flow, we address the NP-hard problem. Numerical analysis demonstrates the algorithm's average performance and widespread applicability.
COMPUTERS & INDUSTRIAL ENGINEERING
(2023)
Article
Computer Science, Software Engineering
Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger
Summary: The study focuses on a continuous facility location problem on undirected graphs, aiming to cover the entire graph with a minimum number of facilities. The problem is proven to be polynomially solvable when delta is a unit fraction. However, it becomes NP-hard for all non unit fractions delta. Moreover, the parametrized complexity is analyzed, showing that the problem is fixed parameter tractable for delta < 3/2 and W[2]-hard for delta >= 3/2.
MATHEMATICAL PROGRAMMING
(2022)
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
Chemistry, Multidisciplinary
Xuehong Gao, Chanseok Park, Xiaopeng Chen, En Xie, Guozhong Huang, Dingli Zhang
Summary: This study proposes a new method for globally optimal solutions to continuous-space facility location problems, different from previous clustering algorithms. By extending the method to multi-facility problems and transferring the continuous-space problem to discrete-space, its effectiveness and efficiency are demonstrated through benchmark comparisons.
APPLIED SCIENCES-BASEL
(2021)
Article
Operations Research & Management Science
Pascual Fernandez, Algirdas Lancinskas, Blas Pelegrin, Julius Zilinskas
Summary: This paper focuses on the discrete competitive facility location problem and considers different customer behavior models. Customers distribute their buying power among all facilities within an attraction area according to a proportional choice rule, except when there are no nearby facilities, in which case they choose a single attractive facility outside the attraction area based on a binary rule. The proposed model is formulated as a nonlinear binary programming problem and an heuristic optimization algorithm is applied to find the optimal solutions using real geographical coordinates and population data of municipalities in Spain.
OPTIMIZATION LETTERS
(2023)
Article
Management
Victor Blanco, Justo Puerto
Summary: This paper presents an extension of the uncapacitated hub location problem where potential hub positions are allowed to belong to a region around initial nodes. Two alternative mathematical programming formulations are proposed with one being compact and the other involving a family of constraints. Results from extensive computational experiments demonstrate the advantages of each approach.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
(2022)
Article
Management
Justo Puerto, Carlos Valverde
Summary: This paper explores an extension of the crossing postman problem to design routes that visit various shapes of spatial elements, using mathematical programming and a heuristic algorithm. The results show that the models and formulations are effective for solving medium-sized instances, and the algorithm performs well in providing feasible solutions.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Management
Stefano Benati, Diego Ponce, Justo Puerto, Antonio M. Rodriguez-Chia
Summary: This paper explores the Graph-Connected Clique-Partitioning Problem (GCCP) and introduces new Integer Linear Programming (ILP) formulation and heuristic algorithms. The new methods outperform previous algorithms, offering faster and more accurate solutions for the problem.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2022)
Article
Physics, Multidisciplinary
Stefano Benati, Justo Puerto, Antonio M. Rodriguez-Chia, Francisco Temprano
Summary: In this article, a new optimization model is proposed to detect overlapping communities in networks. The model not only addresses the biases of previous models but also reveals additional structural properties. Furthermore, two heuristic algorithms are introduced to handle larger instances, which show favorable performance compared to other methodologies.
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS
(2022)
Article
Management
Victor Blanco, Ricardo Gazquez, Diego Ponce, Justo Puerto
Summary: This paper addresses the Continuous Multifacility Monotone Ordered Median Problem and proposes a new branch-and-price procedure and three families of matheuristics. The study shows that the branch-and-price approach outperforms the compact formulation in medium-sized instances, while the matheuristics yield satisfactory results for larger instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Victor Blanco, Alberto Japon, Justo Puerto
Summary: In this paper, novel methodologies are proposed to construct Support Vector Machine-based classifiers that take into account label noise in the training sample. Different alternatives are proposed, including incorporating relabeling directly in the SVM model and combining clustering with classification. Extensive computational experiments demonstrate the effectiveness of the proposed approaches.
COMPUTERS & INDUSTRIAL ENGINEERING
(2022)
Article
Management
Yolanda Hinojosa, Alfredo Marin, Justo Puerto
Summary: This paper focuses on the Dynamically Second-preferred p-center Problem (DSpP), considering customers' preferences and subsets of acceptable service centers. It proposes three mixed-integer linear programming formulations and a heuristic algorithm to solve the NP-hard problem, aiming to minimize the distances and evaluate the usefulness of the formulations with extensive computational experiments. The research provides valuable insights for solving DSpP efficiently.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
Victor Blanco, Gabriel Gonzalez, Yolanda Hinojosa, Diego Ponce, Miguel A. Pozo, Justo Puerto
Summary: In this paper, a general methodology is proposed for the optimal automatic routing of spatial pipelines, inspired by a collaboration with Ghenova, a leading Naval Engineering company. A minimum cost multicommodity network flow model is provided, incorporating all the technical requirements for a feasible pipeline routing. A branch-and-cut approach is designed, and various matheuristic algorithms are derived for efficient problem-solving. Computational experiments are conducted to evaluate the performance of the problem, along with a case study of a real-world naval instance provided by the partner company.
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
(2022)
Article
Computer Science, Interdisciplinary Applications
I. Espejo, R. Paez, J. Puerto, A. M. Rodriguez-Chia
Summary: This paper investigates variants of classical facility location problems on graphs with non-convex neighborhoods for customers and facilities. The p-median, p-center, and p-maximal covering versions of this problem are analyzed. The lengths of arcs depend on the locations of points in the neighborhoods, and different mixed-integer non-linear programming formulations are proposed assuming the neighborhoods are Mixed-Integer Second Order Cone representable. Solution procedures providing bounds and a preprocessing phase are developed to reduce variables and constraints. Extensive computational experiments are reported.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Lavinia Amorosi, Justo Puerto, Carlos Valverde
Summary: This paper addresses the optimization problems in coordinating a mothership vehicle and a fleet of drones. The goal is to minimize the mothership's overall travel time while satisfying requirements in terms of fractions of visits to target graphs. Exact formulations and a matheuristic algorithm are developed and compared on test instances, demonstrating the usefulness of the methodology in different scenarios.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Hardware & Architecture
Elena Fernandez, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari
Summary: This article addresses the problem of partitioning a graph into p connected components by optimizing balancing objective functions related to vertex weights. It introduces the notion of aggregated gap, which is the sum of the differences between vertex weights and the minimum weight of a vertex in a component. New connected p-partitioning problems based on aggregated gap are studied, and their NP-hardness results on general graphs are given. Mathematical programming formulations, adopting flow-based constraints for connectivity modeling, are proposed for these problems. Extensive computational tests on squared grids and randomly generated graphs are conducted to compare the performance of different formulations.
Article
Management
Miguel A. Pozo, Justo Puerto, Ignacio Roldan
Summary: This paper addresses the biobjective versions of the perfect matching problem (PMP) and the Chinese postman problem (CPP). It solves both problems using integer formulations or separating blossom inequalities, taking advantage of the PMP relationship with the CPP. The authors first find the set of supported nondominated solutions and use them to obtain the nonsupported ones. The supported nondominated solutions are obtained by solving scalarized integer formulations. To obtain the nonsupported solutions, lexicographic problems based on adding additional linear constraints to the original problems are solved.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Victor Blanco, Elena Fernandez, Yolanda Hinojosa
Summary: This paper introduces two optimization models for the hub location problem under interhub link failures, which construct hub backbone networks protected under interhub link disruptions. The first model explicitly builds alternative routing paths, while the second model guarantees the existence of at least one alternative path using connectivity constraints. Extensive computational testing results allow us to evaluate the performance of the two models and the extra cost required to design a robust backbone network under interhub link failures.
INFORMS JOURNAL ON COMPUTING
(2023)
Article
Computer Science, Artificial Intelligence
Lavinia Amorosi, Tullia Padellini, Justo Puerto, Carlos Valverde
Summary: This article discusses recent developments in the interplay between Operational Research and Statistics and how it utilizes advances in Mixed-Integer Optimisation solvers to improve the quality of statistical analysis. The authors propose a new technique for encoding sparsity in Canonical Correlation Analysis and evaluate its performance on multiple datasets. The results highlight that the proposed approach outperforms other conventional methods in finding optimal solutions.
EXPERT SYSTEMS WITH APPLICATIONS
(2024)
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)
