Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions

DOI10.1016/J.INS.2019.07.014MaRDI QIDQ2224924zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 4 February 2021

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

robustnessmulti-objective optimizationtraffic road networkbi-objective shortest path

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20)

Recommendations

• Bi-objective robust optimisation
• New models for the robust shortest path problem: complexity, resolution and generalization
• Algorithms and uncertainty sets for data-driven robust shortest path problems
• Solution methods for multi-objective robust combinatorial optimization
• The minmax regret robust shortest path problem in a finite multi-scenario model

Cites work

• scientific article; zbMATH DE number 4070651 (Why is no real title available?)
• A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
• A fuzzy shortest path with the highest reliability
• A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
• A note on two problems in connexion with graphs
• An ensemble framework for assessing solutions of interval programming problems
• An exact method for the biobjective shortest path problem for large-scale road networks
• Bi-objective robust optimisation
• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
• Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems
• John von Neumann's conception of the minimax theorem: A journey through different mathematical contexts
• Minmax robustness for multi-objective optimization problems
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• Recent advances in robust optimization: an overview
• Robust optimization
• Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
• Robust solutions to multi-objective linear programs with uncertain data
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
• The minmax regret robust shortest path problem in a finite multi-scenario model
• Variations on the stochastic shortest path problem
• Vehicle routing problems with alternative paths: an application to on-demand transportation

Cited in

(1)

• General variable neighborhood search for the minimum stretch spanning tree problem

Describes a project that uses

Uses Software

• MOEA/D

This page was built for publication: Facing robustness as a multi-objective problem: a bi-objective shortest path problem in smart regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2224924)