A comparison of solution strategies for biobjective shortest path problems

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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & operations research Ročník 36; číslo 4; s. 1299 - 1331
Hlavní autori: Raith, Andrea, Ehrgott, Matthias
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier Ltd 01.04.2009
Elsevier
Pergamon Press Inc
Predmet:
Applied sciences
Artificial Intelligence
Biobjective shortest path problem
Comparative analysis
Computer Science
Exact sciences and technology
Flows in networks. Combinatorial problems
Ground, air and sea transportation, marine construction
Label correcting algorithm
Label setting algorithm
Near shortest path algorithm
Operational research and scientific management
Operational research. Management science
Operations Research
Optimization techniques
Road transportation and traffic
Shortest path algorithms
Studies
Two phase method
Label correcting algorithm
Near shortest path algorithm
Label setting algorithm
Biobjective shortest path problem
Two phase method
Network structure
Hierarchical classification
Shortest path
Road network
Dynamical system
Efficiency
NP hard problem
Problem solving
ISSN:0305-0548, 1873-765X, 0305-0548
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2008.02.002