Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Label correcting methods to solve multicriteria shortest path problems
Journal of Optimization Theory and Applications
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
A two-phase algorithm for the biobjective integer minimum cost flow problem
Computers and Operations Research
Find multi-objective paths in stochastic networks via chaotic immune PSO
Expert Systems with Applications: An International Journal
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
Computers and Operations Research
A memory-efficient search strategy for multiobjective shortest path problems
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
An empirical comparison of some multiobjective graph search algorithms
KI'10 Proceedings of the 33rd annual German conference on Advances in artificial intelligence
Exploring the runtime of an evolutionary algorithm for the multi-objective shortest path problem**
Evolutionary Computation
GRACE: a generational randomized ACO for the multi-objective shortest path problem
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Multiobjective heuristic search in road maps
Expert Systems with Applications: An International Journal
An analysis of multiobjective search algorithms and heuristics
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Expert Systems with Applications: An International Journal
A Label Correcting Algorithm for the Bus Routing Problem
Fundamenta Informaticae
A comparison of multiobjective depth-first algorithms
Journal of Intelligent Manufacturing
Routing directions: keeping it fast and simple
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.01 |
We consider the biobjective shortest path (BSP) problem as the natural extension of the single-objective shortest path problem. BSP problems arise in various applications where networks usually consist of large numbers of nodes and arcs. Since obtaining the set of efficient solutions to a BSP problem is more difficult (i.e. NP-hard and intractable) than solving the corresponding single-objective problem there is a need for fast solution techniques. Our aim is to compare different strategies for solving the BSP problem. We consider a standard label correcting and label setting method, a purely enumerative near shortest path approach, and the two phase method, investigating different approaches to solving problems arising in phases 1 and 2. In particular, we investigate the two phase method with ranking in phase 2. In order to compare the different approaches, we investigate their performance on three different types of networks. We employ grid networks and random networks, as is generally done in the literature. Furthermore, road networks are utilized to compare performance on networks with a structure that is more likely to actually arise in applications.