online read us now
Paper details
Number 1 - March 2017
Volume 27 - 2017
A relation of dominance for the bicriterion bus routing problem
Jacek Widuch
Abstract
A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the
final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop
is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest
path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant
weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only
for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated
final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a
non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods
is proposed and the results of experimental tests are presented.
Keywords
multicriteria optimization, set of non-dominated solutions, bicriterion shortest path problem, variable weights, label correcting algorithm, transportation problem