Multiobjective shortest path problems with lexicographic goal-based preferences
DOI10.1016/J.EJOR.2014.05.008zbMATH Open1339.90287OpenAlexW2060912974MaRDI QIDQ297067FDOQ297067
Authors: Francisco-Javier Pulido, Lawrence Mandow, José Luis Pérez de la Cruz 
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.05.008
Recommendations
- An improved multiobjective shortest path algorithm
- A multi-objective shortest path problem
- An aggregate label setting policy for the multi-objective shortest path problem
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
- Speeding up Martins' algorithm for multiple objective shortest path problems
combinatorial optimizationheuristic searchgoal programminglabel-setting searchmultiobjective shortest path problem
Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A multicriteria Pareto-optimal path algorithm
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- A review of goal programming and its applications
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Multi-objective vehicle routing problems
- A case of pathology in multiobjective heuristic search
- Multiobjective \(\mathrm{A}^\ast\) search with consistent heuristics
- Title not available (Why is that?)
- Multiobjective A*
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- A bicriterion approach for routing problems in multimedia networks
- Title not available (Why is that?)
- On a multicriteria shortest path problem
- A comparison of solution strategies for biobjective shortest path problems
Cited In (8)
- Theory and application of reciprocal transformation of “path problem” and “time float problem”
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Lower bound sets for biobjective shortest path problems
- Dimensionality reduction in multiobjective shortest path search
- An aggregate label setting policy for the multi-objective shortest path problem
- Hierarchical multiobjective shortest path problems
- Targeted multiobjective Dijkstra algorithm
- An improved multiobjective shortest path algorithm
This page was built for publication: Multiobjective shortest path problems with lexicographic goal-based preferences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297067)
