Algorithms for the minmax regret path problem with interval data

DOI10.1016/j.ins.2018.06.016zbMath1441.90171OpenAlexW2808378693MaRDI QIDQ2198244

Francisco Pérez-Galarce, Matthew Bardeen, Alfredo Candia-Véjar, César A. Astudillo

Publication date: 9 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.06.016

zbMATH Keywords

simulated annealingbranch and cutshortest path problemminmax regret model with interval dataneighbourhoods for path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem ⋮ Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients ⋮ Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Optimization by Simulated Annealing
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Minmax robustness for multi-objective optimization problems
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
• On exact solutions for the minmax regret spanning tree problem
• The robust set covering problem with interval data
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• The computational complexity of the relative robust shortest path problem with interval data
• Exact and heuristic algorithms for the interval data robust assignment problem
• Shortest path problem with uncertain arc lengths
• A survey of very large-scale neighborhood search techniques
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• Minimax regret spanning arborescences under uncertain costs
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Simulated annealing algorithm for the robust spanning tree problem
• Tuning metaheuristics. A machine learning Perspective
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• Robust discrete optimization and its applications
• On the robust shortest path problem.
• A branch and bound algorithm for the robust shortest path problem with interval data.
• A double oracle approach to minmax regret optimization problems with interval data
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems
• Interval data minmax regret network optimization problems
• An exact algorithm for the robust shortest path problem with interval data
• A Benders decomposition approach for the robust spanning tree problem with interval data
• The robust shortest path problem with interval data via Benders decomposition
• Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Extensions of labeling algorithms for multi‐objective uncertain shortest path problems
• Minmax regret combinatorial optimization problems: an Algorithmic Perspective
• Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
• Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality
• Using experimental design to find effective parameter settings for heuristics