<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

A Relation of Dominance for the Bicriterion Bus Routing Problem

International Journal of Applied Mathematics and Computer Science

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"A Relation of Dominance for the Bicriterion Bus Routing Problem"}

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...

A Relation of Dominance for the Bicriterion Bus Routing Problem

Data publikacji: 04 maj 2017

Zakres stron: 133 - 155

Otrzymano: 25 sty 2016

Przyjęty: 10 lis 2016

DOI: https://doi.org/10.1515/amcs-2017-0010

Słowa kluczowe
multicriteria optimization, set of non-dominated solutions, bicriterion shortest path problem, variable weights, label correcting algorithm, transportation problem

© by Jacek Widuch

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

A Relation of Dominance for the Bicriterion Bus Routing Problem

Data publikacji: 04 maj 2017

Zakres stron: 133 - 155

Otrzymano: 25 sty 2016

Przyjęty: 10 lis 2016

DOI: https://doi.org/10.1515/amcs-2017-0010

Słowa kluczowemulticriteria optimization, set of non-dominated solutions, bicriterion shortest path problem, variable weights, label correcting algorithm, transportation problem

© by Jacek Widuch

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Słowa kluczowe
multicriteria optimization, set of non-dominated solutions, bicriterion shortest path problem, variable weights, label correcting algorithm, transportation problem