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ženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 36; číslo 4; s. 1299 - 1331
Hlavní autoři:	Raith, Andrea, Ehrgott, Matthias
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Kidlington Elsevier Ltd 01.04.2009 Elsevier Pergamon Press Inc
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!