Multiobjective shortest path problems with lexicographic goal-based preferences
DOI10.1016/j.ejor.2014.05.008zbMath1339.90287OpenAlexW2060912974MaRDI QIDQ297067
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
combinatorial optimizationgoal programmingheuristic searchlabel-setting searchmultiobjective shortest path problem
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- On a multicriteria shortest path problem
- A comparison of solution strategies for biobjective shortest path problems
- 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 A * search with consistent heuristics
- Multiobjective A*
- A bicriterion approach for routing problems in multimedia networks
This page was built for publication: Multiobjective shortest path problems with lexicographic goal-based preferences