Reliable production process design problem: compact MILP model and ALNS-based primal heuristic

DOI10.1007/978-3-031-47859-8_13zbMATH Open1545.90055MaRDI QIDQ6588744

Daniil Mikhaĭlovich Khachaĭ, Mikhail Yu. Khachay, Roman Rudakov, Yuri Ogorodnikov

Publication date: 16 August 2024

zbMATH Keywords

adaptive large neighborhood searchMILP modelsreliable production process design problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Linear programming (90C05) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• New formulations for the elementary shortest-path problem visiting a given set of nodes
• The constrained shortest path tour problem
• The Euclidean traveling salesman problem is NP-complete
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Approximation schemes for the generalized traveling salesman problem
• The precedence-constrained asymmetric traveling salesman polytope
• Branch-and-bound for the precedence constrained generalized traveling salesman problem
• Constrained shortest path tour problem: branch-and-price algorithm
• Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters
• The traveling salesman problem and its variations.
• An exact algorithm with linear complexity for a problem of visiting megalopolises
• PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem
• Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
• Branch-and-Bound Strategies for Dynamic Programming
• An efficient exact approach for the constrained shortest path tour problem
• The Routing Problem with “K” Specified Nodes
• Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm

This page was built for publication: Reliable production process design problem: compact MILP model and ALNS-based primal heuristic