Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Solving k-shortest and constrained shortest path problems efficiently
Annals of Operations Research
Computers and Operations Research
Disjoint paths in a planar graph—a general theorem
SIAM Journal on Discrete Mathematics
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
SIAM Journal on Computing
On the sum-max bicriterion path problem
Computers and Operations Research
Analysis of multi-path routing
IEEE/ACM Transactions on Networking (TON)
An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
Computers and Operations Research
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An improved FPTAS for restricted shortest path
Information Processing Letters
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multi-Path Routing combined with Resource Reservation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
Combinatorial optimization in system configuration design
Automation and Remote Control
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
WaveMin: a fine-grained clock buffer polarity assignment combined with buffer sizing
Proceedings of the 48th Design Automation Conference
Four-layer framework for combinatorial optimization problems domain
Advances in Engineering Software
Skynets: searching for minimum trees in graphs with incomparable edge weights
Proceedings of the 20th ACM international conference on Information and knowledge management
Convergence method, properties and computational complexity for Lyapunov games
International Journal of Applied Mathematics and Computer Science - SPECIAL SECTION: Efficient Resource Management for Grid-Enabled Applications
Multi-objective optimal path selection in electric vehicles
Artificial Life and Robotics
A Multi-objective Incremental Path Planning Algorithm for Mobile Agents
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Tour suggestion for outdoor activities
W2GIS'13 Proceedings of the 12th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.00 |
The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra's algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.