Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Communications of the ACM
Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Multicriteria Optimization
A comparison of solution strategies for biobjective shortest path problems
Computers and Operations Research
Heuristics for the bi-objective path dissimilarity problem
Computers and Operations Research
Graphs, Networks and Algorithms
Graphs, Networks and Algorithms
Frontier Search for Bicriterion Shortest Path Problems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Characterization of Pareto dominance
Operations Research Letters
| Hi-index | 0.00 |
This paper proposes a label correcting algorithm for solving the bus routing problem (BRP). The goal of the BRP is finding a route from the start stop to the final stop minimizing the time and the cost of travel. Additionally the time of starting travel at the start stop is given. The problem belongs to the group of multicriteria optimization problems (MOP), whose the solution is a set of non-dominated solutions. The algorithm makes possible to find all routes which belong to the set of non-dominated solutions. Apart from that the results of experimental tests are presented.