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

DOI10.1016/J.INS.2019.07.014zbMATH Open1453.90177OpenAlexW2955720331WikidataQ127596022 ScholiaQ127596022MaRDI QIDQ2224924FDOQ2224924

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on two problems in connexion with graphs
• Recent advances in robust optimization: an overview
• Robust solutions to multi-objective linear programs with uncertain data
• 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
• An exact method for the biobjective shortest path problem for large-scale road networks
• Vehicle routing problems with alternative paths: an application to on-demand transportation
• Bi-objective robust optimisation
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
• Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
• 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
• Robust shortest path problem based on a confidence interval in fuzzy bicriteria decision making
• Variations on the Stochastic Shortest Path Problem
• 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
• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
• An ensemble framework for assessing solutions of interval programming problems

Cited In (1)

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

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)