Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 305-326 |
| Number of pages | 22 |
| Journal | Fundamenta Informaticae |
| Volume | 118 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2012 |
Keywords
- bicriterion shortest path problem
- bus routing problem
- directed weighted graph
- label correcting algorithm
- multicriteria optimization
- relation of dominance
- set of non-dominated solutions
- shortest path
- variable weights
ASJC Scopus subject areas
- Theoretical Computer Science
- Algebra and Number Theory
- Information Systems
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'A label correcting algorithm for the bus routing problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver