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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 36; H. 4; S. 1299 - 1331
Hauptverfasser:	Raith, Andrea, Ehrgott, Matthias
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Kidlington Elsevier Ltd 01.04.2009 Elsevier Pergamon Press Inc
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	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.
AbstractList	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. -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. 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. [PUBLICATION ABSTRACT] 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.
Author	Ehrgott, Matthias Raith, Andrea
Author_xml	– sequence: 1 givenname: Andrea surname: Raith fullname: Raith, Andrea email: a.raith@auckland.ac.nz organization: Department of Engineering Science, The University of Auckland, New Zealand – sequence: 2 givenname: Matthias surname: Ehrgott fullname: Ehrgott, Matthias email: m.ehrgott@auckland.ac.nz, matthias.ehrgott@univ-nantes.fr organization: Department of Engineering Science, The University of Auckland, New Zealand
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21234090$$DView record in Pascal Francis https://hal.science/hal-00466664$$DView record in HAL
BookMark	eNp9kc1q3DAUhUVJoZOkD9CdKbTQhZ2rH8syXQ0hbVoGummhOyHLUkfGY011NQN5-2iYtIsscjcS4juXo3MuycUSF0fIOwoNBSpvpsbG1DAA1QBrANgrsqKq43Un298XZAUc2hpaod6QS8QJynSMrsj3dWXjbm9SwLhU0VcY50MO5Y45mez-BIeVj6kaQhwmZ3M4ugq3MWWHudqbvK32KQ6z2-E1ee3NjO7t03lFfn25-3l7X29-fP12u97UVkiWa0WVGEw_UjaMEiQHozrmueGO9XwYgHeWUzFY2ytvey9617KRsx58S5kcFb8in857t2bW-xR2Jj3oaIK-X2_06Q1AyDLiSAv78cwWk38PxbLeBbRuns3i4gE1b2WnBO8K-P4ZOMVDWso_NO1bJUqWskAfniCD1sw-mcUG_O-BUcYF9FC47szZFBGT89qGbE6plkzDrCnoU2l60qU0fSpNAyu2WVHSZ8p_y1_SfD5rXAn9GFzSaINbrBtDKoXpMYYX1I8_b6_F
CODEN	CMORAP
CitedBy_id	crossref_primary_10_1287_ijoc_2021_1081 crossref_primary_10_1287_ijoc_2021_1085 crossref_primary_10_1016_j_trb_2023_04_007 crossref_primary_10_1002_net_22174 crossref_primary_10_1177_0954407019892171 crossref_primary_10_1016_j_cor_2022_105723 crossref_primary_10_1016_j_tra_2011_11_015 crossref_primary_10_1007_s11590_016_1073_x crossref_primary_10_3390_s21010203 crossref_primary_10_1111_tgis_12699 crossref_primary_10_1002_mcda_1541 crossref_primary_10_1111_j_1475_3995_2011_00815_x crossref_primary_10_1016_j_trc_2020_102734 crossref_primary_10_1002_net_22182 crossref_primary_10_1016_j_cie_2014_02_013 crossref_primary_10_1016_j_orhc_2018_04_001 crossref_primary_10_1016_j_comnet_2022_109015 crossref_primary_10_1007_s10288_013_0229_0 crossref_primary_10_1002_ett_3538 crossref_primary_10_1007_s10845_012_0632_y crossref_primary_10_1162_EVCO_a_00014 crossref_primary_10_1002_net_21815 crossref_primary_10_1016_j_cor_2015_04_007 crossref_primary_10_3390_a14020043 crossref_primary_10_1007_s00773_014_0295_9 crossref_primary_10_1109_TEVC_2021_3089050 crossref_primary_10_3390_su12072951 crossref_primary_10_1016_j_engappai_2019_08_023 crossref_primary_10_1177_1550147719881116 crossref_primary_10_1007_s10922_016_9367_y crossref_primary_10_1287_mnsc_2013_1802 crossref_primary_10_1111_itor_13120 crossref_primary_10_1016_j_comnet_2010_05_017 crossref_primary_10_1109_TIV_2018_2873922 crossref_primary_10_1016_j_cor_2016_06_022 crossref_primary_10_1016_j_cor_2008_06_008 crossref_primary_10_1016_j_cor_2020_104977 crossref_primary_10_1016_j_ejor_2011_08_030 crossref_primary_10_1080_03155986_2016_1214448 crossref_primary_10_1111_j_1467_8667_2011_00720_x crossref_primary_10_1016_j_cor_2021_105587 crossref_primary_10_1007_s10479_017_2667_0 crossref_primary_10_1002_net_21909 crossref_primary_10_1016_j_apm_2013_10_059 crossref_primary_10_1016_j_ejor_2018_01_017 crossref_primary_10_1016_j_eswa_2012_07_052 crossref_primary_10_1111_itor_13114 crossref_primary_10_1007_s00291_018_0543_1 crossref_primary_10_1016_j_ejor_2010_06_035 crossref_primary_10_1109_ACCESS_2022_3212797 crossref_primary_10_1016_j_eswa_2021_115193 crossref_primary_10_1016_j_swevo_2018_11_009 crossref_primary_10_1016_j_cor_2012_03_013 crossref_primary_10_1016_j_amc_2012_04_002 crossref_primary_10_1016_j_trb_2012_03_005 crossref_primary_10_1109_ACCESS_2018_2822824 crossref_primary_10_1109_JLT_2017_2711658 crossref_primary_10_1016_j_eswa_2021_115228 crossref_primary_10_1016_j_envsoft_2013_03_007 crossref_primary_10_1016_j_swevo_2021_100908 crossref_primary_10_1080_20476965_2023_2174454 crossref_primary_10_1080_21680566_2023_2165192 crossref_primary_10_1155_2017_9685125 crossref_primary_10_1080_03155986_2023_2228021 crossref_primary_10_1109_TKDE_2023_3274528 crossref_primary_10_1016_j_trb_2016_09_009 crossref_primary_10_1287_ijoc_2016_0721 crossref_primary_10_1016_j_ejor_2014_05_008 crossref_primary_10_3390_math12050624 crossref_primary_10_1016_j_ejor_2022_10_038 crossref_primary_10_1186_s42787_019_0063_4 crossref_primary_10_1007_s10957_011_9838_y crossref_primary_10_1016_j_ejor_2014_11_003 crossref_primary_10_1016_j_cor_2016_04_027 crossref_primary_10_1007_s11067_019_09454_9 crossref_primary_10_1016_j_cor_2015_05_007 crossref_primary_10_1287_trsc_2020_0981 crossref_primary_10_51551_verimlilik_1539618 crossref_primary_10_1007_s10479_012_1284_1 crossref_primary_10_1016_j_cor_2025_107254 crossref_primary_10_1080_15568318_2018_1540734 crossref_primary_10_1111_itor_13060 crossref_primary_10_1016_j_ejco_2021_100004 crossref_primary_10_1016_j_trb_2020_03_001 crossref_primary_10_1016_j_cor_2014_11_010 crossref_primary_10_1016_j_ejor_2019_01_007 crossref_primary_10_1016_j_cor_2010_01_005 crossref_primary_10_1016_j_cor_2014_06_022 crossref_primary_10_1007_s10898_015_0324_1 crossref_primary_10_1016_j_cor_2021_105424 crossref_primary_10_1080_15472450_2013_856712 crossref_primary_10_1016_j_is_2015_10_005 crossref_primary_10_1007_s10288_013_0232_5 crossref_primary_10_1142_S0217595916500056 crossref_primary_10_1007_s11590_014_0742_x crossref_primary_10_3390_a17060222 crossref_primary_10_1002_mcda_1803 crossref_primary_10_1109_TEVC_2023_3262743 crossref_primary_10_1016_j_cor_2018_12_021 crossref_primary_10_1016_j_tre_2019_11_013 crossref_primary_10_1016_j_eswa_2011_12_022 crossref_primary_10_3390_math10050804 crossref_primary_10_1145_3450524 crossref_primary_10_1177_0160017613507772 crossref_primary_10_1016_j_ejor_2019_08_008 crossref_primary_10_3141_2276_07 crossref_primary_10_1007_s12159_011_0055_8 crossref_primary_10_1016_j_ejor_2016_01_015 crossref_primary_10_1016_j_artint_2022_103807 crossref_primary_10_1016_j_ejor_2020_07_005 crossref_primary_10_1016_j_trb_2017_10_011 crossref_primary_10_1080_15568318_2020_1770906
Cites_doi	10.1016/0377-2217(91)90094-C 10.1007/978-3-642-46618-2_15 10.1002/net.20077 10.1090/qam/253822 10.1007/s002910000046 10.1287/mnsc.20.5.814 10.1007/978-3-642-48782-8_9 10.1016/0377-2217(89)90215-4 10.1016/S0927-0507(05)80119-7 10.1007/BF02288320 10.1007/BF02592101 10.1016/0377-2217(92)90248-8 10.1016/S0305-0548(99)00037-4 10.1287/trsc.32.1.65 10.1023/A:1012602011914 10.1007/BF03398701 10.1007/BF00938761 10.1016/0377-2217(86)90092-5 10.1016/0377-2217(82)90205-3 10.1007/s10479-006-0072-1 10.1007/BF01580379 10.1016/S0377-2217(01)00188-6 10.1016/0377-2217(84)90077-8 10.1016/j.ejor.2006.12.054
ContentType	Journal Article
Copyright	2008 Elsevier Ltd 2009 INIST-CNRS Copyright Pergamon Press Inc. Apr 2009 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: 2008 Elsevier Ltd – notice: 2009 INIST-CNRS – notice: Copyright Pergamon Press Inc. Apr 2009 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D 1XC
DOI	10.1016/j.cor.2008.02.002
DatabaseName	CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL)
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business Applied Sciences
EISSN	1873-765X 0305-0548
EndPage	1331
ExternalDocumentID	oai:HAL:hal-00466664v1 1595620141 21234090 10_1016_j_cor_2008_02_002 S0305054808000233
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 7SC 8FD JQ2 L7M L~C L~D 1XC
ID	FETCH-LOGICAL-c462t-8184ba9d12bd60630a872f3a3e293bb037c314bcc98fc9f49e52d3290f5126d83
ISICitedReferencesCount	148
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000262843100020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Sat Nov 29 15:06:02 EST 2025 Sat Sep 27 20:09:24 EDT 2025 Sun Nov 30 05:22:55 EST 2025 Mon Jul 21 09:17:24 EDT 2025 Sat Nov 29 03:23:33 EST 2025 Tue Nov 18 22:12:51 EST 2025 Fri Feb 23 02:33:26 EST 2024
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	4
Keywords	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
Language	English
License	https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c462t-8184ba9d12bd60630a872f3a3e293bb037c314bcc98fc9f49e52d3290f5126d83
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
OpenAccessLink	https://www.sciencedirect.com/science/article/pii/S0305054808000233
PQID	195841876
PQPubID	45870
PageCount	33
ParticipantIDs	hal_primary_oai_HAL_hal_00466664v1 proquest_miscellaneous_35678437 proquest_journals_195841876 pascalfrancis_primary_21234090 crossref_citationtrail_10_1016_j_cor_2008_02_002 crossref_primary_10_1016_j_cor_2008_02_002 elsevier_sciencedirect_doi_10_1016_j_cor_2008_02_002
PublicationCentury	2000
PublicationDate	2009-04-01
PublicationDateYYYYMMDD	2009-04-01
PublicationDate_xml	– month: 04 year: 2009 text: 2009-04-01 day: 01
PublicationDecade	2000
PublicationPlace	Kidlington
PublicationPlace_xml	– name: Kidlington – name: New York
PublicationTitle	Computers & operations research
PublicationYear	2009
Publisher	Elsevier Ltd Elsevier Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Elsevier – name: Pergamon Press Inc
References	Henig (bib31) 1985; 25 Cherkassy, Goldberg, Radzik (bib2) 1996; 73 Martins (bib10) 1984; 16 Przybylski, Gandibleux, Ehrgott (bib21) 2008; 185 Cunningham (bib34) 1976; 11 Martins EQV, Dos Santos JLE. The labelling algorithm for the multiobjective shortest path problem. Technical Report, Departamento de Matématica, Universidade de Coimbra, Portugal Gallo, Pallotino (bib1) 1988; 13 Hartley (bib30) 1985 Hansen P. Bicriterion path problems. In: Fandel G, Gal T, editors. Multiple criteria decision making, theory and application. Proceedings of the 3rd international conference, Hagen/Königswinter 1979, Lecture Notes in Economics and Mathematical Systems, vol. 177. Berlin: Springer; 1980. p. 109–27. Mote, Murthy, Olson (bib18) 1991; 53 Pallottino, Scutellà (bib3) 1998 Huarng, Pulat, Shih (bib15) 1996; 13 Ehrgott, Gandibleux (bib23) 2000; 22 Skriver (bib16) 2000; 17 Zhan, Noon (bib20) 1998; 32 Tung, Chew (bib11) 1988; 5 Ahuja, Magnati, Orlin (bib32) 1993 Helgason, Kennington (bib22) 1995 2005. Weiss MA. Binary Heap Implementation in C. Brumbaugh-Smith, Shier (bib9) 1989; 43 Müller-Hannemann, Weihe (bib4) 2006; 147 Sastry, Janakiraman, Mohideen (bib27) 2003; 40 Klingman, Napier, Stutz (bib35) 1974; 20 Skriver, Andersen (bib8) 2000; 27 2000. Ehrgott, Gandibleux (bib24) 2002 Yen (bib29) 1970; 27 Tung, Chew (bib12) 1992; 62 Ulungu, Teghem (bib19) 1995; 20 Löbel A. MCF, version 1.3. A network simplex implementation. Available for academic use free of charge via WWW at Files binheap.c and binheap.h. Guerriero, Musmanno (bib26) 2001; 111 Corley, Moon (bib28) 1985; 46 Gabrel, Vanderpooten (bib5) 2002; 139 US Census. US Census 2000 TIGER/Line Files. Serafini P. Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn J, Krabs W, editors. Recent advances and historical development of vector optimization. Lecture Notes in Economics and Mathematical Systems, vol. 294. Berlin: Springer; 1986. Clímaco, Martins (bib13) 1982; 11 Carlyle, Wood (bib17) 2005; 46 2004. Bertsekas (bib14) 1998 Schultes D. Tiger Road Networks for 9th DIMACS implementation challenge—shortest path. Skriver (10.1016/j.cor.2008.02.002_bib8) 2000; 27 Hartley (10.1016/j.cor.2008.02.002_bib30) 1985 Yen (10.1016/j.cor.2008.02.002_bib29) 1970; 27 Gallo (10.1016/j.cor.2008.02.002_bib1) 1988; 13 Ehrgott (10.1016/j.cor.2008.02.002_bib24) 2002 10.1016/j.cor.2008.02.002_bib25 Helgason (10.1016/j.cor.2008.02.002_bib22) 1995 Cherkassy (10.1016/j.cor.2008.02.002_bib2) 1996; 73 Sastry (10.1016/j.cor.2008.02.002_bib27) 2003; 40 Corley (10.1016/j.cor.2008.02.002_bib28) 1985; 46 Müller-Hannemann (10.1016/j.cor.2008.02.002_bib4) 2006; 147 10.1016/j.cor.2008.02.002_bib7 Brumbaugh-Smith (10.1016/j.cor.2008.02.002_bib9) 1989; 43 10.1016/j.cor.2008.02.002_bib6 Martins (10.1016/j.cor.2008.02.002_bib10) 1984; 16 Tung (10.1016/j.cor.2008.02.002_bib12) 1992; 62 Henig (10.1016/j.cor.2008.02.002_bib31) 1985; 25 Pallottino (10.1016/j.cor.2008.02.002_bib3) 1998 Carlyle (10.1016/j.cor.2008.02.002_bib17) 2005; 46 Ehrgott (10.1016/j.cor.2008.02.002_bib23) 2000; 22 Bertsekas (10.1016/j.cor.2008.02.002_bib14) 1998 Cunningham (10.1016/j.cor.2008.02.002_bib34) 1976; 11 Ulungu (10.1016/j.cor.2008.02.002_bib19) 1995; 20 10.1016/j.cor.2008.02.002_bib33 Klingman (10.1016/j.cor.2008.02.002_bib35) 1974; 20 Tung (10.1016/j.cor.2008.02.002_bib11) 1988; 5 Mote (10.1016/j.cor.2008.02.002_bib18) 1991; 53 10.1016/j.cor.2008.02.002_bib36 Clímaco (10.1016/j.cor.2008.02.002_bib13) 1982; 11 10.1016/j.cor.2008.02.002_bib38 Ahuja (10.1016/j.cor.2008.02.002_bib32) 1993 10.1016/j.cor.2008.02.002_bib37 Guerriero (10.1016/j.cor.2008.02.002_bib26) 2001; 111 Gabrel (10.1016/j.cor.2008.02.002_bib5) 2002; 139 Skriver (10.1016/j.cor.2008.02.002_bib16) 2000; 17 Huarng (10.1016/j.cor.2008.02.002_bib15) 1996; 13 Zhan (10.1016/j.cor.2008.02.002_bib20) 1998; 32 Przybylski (10.1016/j.cor.2008.02.002_bib21) 2008; 185
References_xml	– start-page: 85 year: 1995 end-page: 133 ident: bib22 article-title: Primal simplex algorithms for minimum cost network flows publication-title: Network models, Handbooks in operations research and management science – volume: 13 start-page: 3 year: 1988 end-page: 79 ident: bib1 article-title: Shortest path algorithms publication-title: Annals of Operations Research – volume: 147 start-page: 269 year: 2006 end-page: 286 ident: bib4 article-title: On the cardinality of the Pareto set in bicriteria shortest path problems publication-title: Annals of Operations Research – volume: 185 start-page: 509 year: 2008 end-page: 533 ident: bib21 article-title: Two-phase algorithms for the bi-objective assignment problem publication-title: European Journal of Operational Research – reference: . Files binheap.c and binheap.h. – reference: Weiss MA. Binary Heap Implementation in C. – volume: 11 start-page: 399 year: 1982 end-page: 404 ident: bib13 article-title: A bicriterion shortest path problem publication-title: European Journal of Operational Research – reference: ; 2004. – reference: ; 2005. – volume: 16 start-page: 236 year: 1984 end-page: 245 ident: bib10 article-title: On a multicriteria shortest path problem publication-title: European Journal of Operational Research – volume: 46 start-page: 79 year: 1985 end-page: 86 ident: bib28 article-title: Shortest paths in networks with vector weights publication-title: Journal of Optimization Theory and Applications – volume: 73 start-page: 129 year: 1996 end-page: 174 ident: bib2 article-title: Shortest path algorithms: theory and experimental evaluation publication-title: Mathematical Programming – reference: Serafini P. Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn J, Krabs W, editors. Recent advances and historical development of vector optimization. Lecture Notes in Economics and Mathematical Systems, vol. 294. Berlin: Springer; 1986. – volume: 20 start-page: 814 year: 1974 end-page: 821 ident: bib35 article-title: NETGEN: a program for generating large scale assignment, transportation, and minimum cost flow problems publication-title: Management Science – reference: Löbel A. MCF, version 1.3. A network simplex implementation. Available for academic use free of charge via WWW at – year: 1998 ident: bib14 article-title: Network optimization continuous and discrete models – volume: 43 start-page: 216 year: 1989 end-page: 224 ident: bib9 article-title: An empirical investigation of some shortest path algorithms publication-title: European Journal of Operational Research – volume: 111 start-page: 589 year: 2001 end-page: 613 ident: bib26 article-title: Label correcting methods to solve multicriteria shortest path problems publication-title: Journal of Optimization Theory and Applications – volume: 27 start-page: 507 year: 2000 end-page: 524 ident: bib8 article-title: A label correcting approach for solving bicriterion shortest-path problems publication-title: Computers & Operations Research – volume: 62 start-page: 203 year: 1992 end-page: 209 ident: bib12 article-title: A multicriteria Pareto-optimal path algorithm publication-title: European Journal of Operational Research – volume: 20 start-page: 149 year: 1995 end-page: 165 ident: bib19 article-title: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems publication-title: Foundations of Computing and Decision Sciences – volume: 40 start-page: 278 year: 2003 end-page: 298 ident: bib27 article-title: New algorithms for multi objective shortest path problem publication-title: Opsearch – volume: 27 start-page: 526 year: 1970 end-page: 530 ident: bib29 article-title: An algorithm for finding shortest routes from all source nodes to a given destination in general networks publication-title: Quarterly of Applied Mathematics – volume: 5 start-page: 166 year: 1988 end-page: 172 ident: bib11 article-title: A bicriterion Pareto-optimal path algorithm publication-title: Asia-Pacific Journal of Operational Research – volume: 13 start-page: 121 year: 1996 end-page: 125 ident: bib15 article-title: A computational comparison of some bicriterion shortest path algorithms publication-title: Journal of the Chinese Institute of Industrial Engineers – reference: US Census. US Census 2000 TIGER/Line Files. – volume: 139 start-page: 533 year: 2002 end-page: 542 ident: bib5 article-title: Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite publication-title: European Journal of Operational Research – volume: 22 start-page: 425 year: 2000 end-page: 460 ident: bib23 article-title: A survey and annotated bibliography of multiobjective combinatorial optimization publication-title: OR Spektrum – year: 1993 ident: bib32 article-title: Network flows: theory, algorithms, and applications – reference: Hansen P. Bicriterion path problems. In: Fandel G, Gal T, editors. Multiple criteria decision making, theory and application. Proceedings of the 3rd international conference, Hagen/Königswinter 1979, Lecture Notes in Economics and Mathematical Systems, vol. 177. Berlin: Springer; 1980. p. 109–27. – volume: 32 start-page: 65 year: 1998 end-page: 73 ident: bib20 article-title: Shortest path algorithms: an evaluation using real road networks publication-title: Transportation Science – reference: Martins EQV, Dos Santos JLE. The labelling algorithm for the multiobjective shortest path problem. Technical Report, Departamento de Matématica, Universidade de Coimbra, Portugal, – start-page: 215 year: 1985 end-page: 224 ident: bib30 article-title: Vector optimal routing by dynamic programming publication-title: Mathematics of Multiobjective Optimization, CISM International Centre for Mechanical Sciences—Courses and Lectures – volume: 25 start-page: 281 year: 1985 end-page: 291 ident: bib31 article-title: The shortest path problem with two objective functions publication-title: European Journal of Operational Research – reference: Schultes D. Tiger Road Networks for 9th DIMACS implementation challenge—shortest path. – reference: ; 2000. – start-page: 245 year: 1998 end-page: 281 ident: bib3 article-title: Shortest path algorithms in transportation models: classical and innovative aspects publication-title: Equilibrium and advanced transportation modelling – volume: 17 start-page: 199 year: 2000 end-page: 212 ident: bib16 article-title: A classification of bicriterion shortest path (BSP) algorithms publication-title: Asia-Pacific Journal of Operational Research – volume: 46 start-page: 98 year: 2005 end-page: 109 ident: bib17 article-title: Near-shortest and publication-title: Networks – start-page: 369 year: 2002 end-page: 444 ident: bib24 article-title: Multiobjective combinatorial optimization—theory, methodology, and applications publication-title: Multiple criteria optimization: state of the art annotated bibliographic surveys, International Series in Operations Research & Management Science – volume: 11 start-page: 105 year: 1976 end-page: 116 ident: bib34 article-title: A network simplex method publication-title: Mathematical Programming – volume: 53 start-page: 81 year: 1991 end-page: 92 ident: bib18 article-title: A parametric approach to solving bicriterion shortest path problems publication-title: European Journal of Operational Research – volume: 53 start-page: 81 year: 1991 ident: 10.1016/j.cor.2008.02.002_bib18 article-title: A parametric approach to solving bicriterion shortest path problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90094-C – volume: 5 start-page: 166 year: 1988 ident: 10.1016/j.cor.2008.02.002_bib11 article-title: A bicriterion Pareto-optimal path algorithm publication-title: Asia-Pacific Journal of Operational Research – ident: 10.1016/j.cor.2008.02.002_bib38 – ident: 10.1016/j.cor.2008.02.002_bib6 doi: 10.1007/978-3-642-46618-2_15 – volume: 13 start-page: 121 issue: 2 year: 1996 ident: 10.1016/j.cor.2008.02.002_bib15 article-title: A computational comparison of some bicriterion shortest path algorithms publication-title: Journal of the Chinese Institute of Industrial Engineers – start-page: 245 year: 1998 ident: 10.1016/j.cor.2008.02.002_bib3 article-title: Shortest path algorithms in transportation models: classical and innovative aspects – volume: 46 start-page: 98 issue: 2 year: 2005 ident: 10.1016/j.cor.2008.02.002_bib17 article-title: Near-shortest and k-shortest simple paths publication-title: Networks doi: 10.1002/net.20077 – volume: 27 start-page: 526 issue: 4 year: 1970 ident: 10.1016/j.cor.2008.02.002_bib29 article-title: An algorithm for finding shortest routes from all source nodes to a given destination in general networks publication-title: Quarterly of Applied Mathematics doi: 10.1090/qam/253822 – ident: 10.1016/j.cor.2008.02.002_bib25 – volume: 22 start-page: 425 year: 2000 ident: 10.1016/j.cor.2008.02.002_bib23 article-title: A survey and annotated bibliography of multiobjective combinatorial optimization publication-title: OR Spektrum doi: 10.1007/s002910000046 – volume: 20 start-page: 814 year: 1974 ident: 10.1016/j.cor.2008.02.002_bib35 article-title: NETGEN: a program for generating large scale assignment, transportation, and minimum cost flow problems publication-title: Management Science doi: 10.1287/mnsc.20.5.814 – ident: 10.1016/j.cor.2008.02.002_bib7 doi: 10.1007/978-3-642-48782-8_9 – start-page: 369 year: 2002 ident: 10.1016/j.cor.2008.02.002_bib24 article-title: Multiobjective combinatorial optimization—theory, methodology, and applications – volume: 20 start-page: 149 issue: 2 year: 1995 ident: 10.1016/j.cor.2008.02.002_bib19 article-title: The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems publication-title: Foundations of Computing and Decision Sciences – volume: 43 start-page: 216 issue: 2 year: 1989 ident: 10.1016/j.cor.2008.02.002_bib9 article-title: An empirical investigation of some shortest path algorithms publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(89)90215-4 – start-page: 85 year: 1995 ident: 10.1016/j.cor.2008.02.002_bib22 article-title: Primal simplex algorithms for minimum cost network flows doi: 10.1016/S0927-0507(05)80119-7 – year: 1998 ident: 10.1016/j.cor.2008.02.002_bib14 – volume: 13 start-page: 3 year: 1988 ident: 10.1016/j.cor.2008.02.002_bib1 article-title: Shortest path algorithms publication-title: Annals of Operations Research doi: 10.1007/BF02288320 – ident: 10.1016/j.cor.2008.02.002_bib36 – volume: 73 start-page: 129 year: 1996 ident: 10.1016/j.cor.2008.02.002_bib2 article-title: Shortest path algorithms: theory and experimental evaluation publication-title: Mathematical Programming doi: 10.1007/BF02592101 – volume: 62 start-page: 203 year: 1992 ident: 10.1016/j.cor.2008.02.002_bib12 article-title: A multicriteria Pareto-optimal path algorithm publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(92)90248-8 – volume: 27 start-page: 507 year: 2000 ident: 10.1016/j.cor.2008.02.002_bib8 article-title: A label correcting approach for solving bicriterion shortest-path problems publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(99)00037-4 – volume: 32 start-page: 65 issue: 1 year: 1998 ident: 10.1016/j.cor.2008.02.002_bib20 article-title: Shortest path algorithms: an evaluation using real road networks publication-title: Transportation Science doi: 10.1287/trsc.32.1.65 – volume: 17 start-page: 199 year: 2000 ident: 10.1016/j.cor.2008.02.002_bib16 article-title: A classification of bicriterion shortest path (BSP) algorithms publication-title: Asia-Pacific Journal of Operational Research – ident: 10.1016/j.cor.2008.02.002_bib37 – volume: 111 start-page: 589 issue: 3 year: 2001 ident: 10.1016/j.cor.2008.02.002_bib26 article-title: Label correcting methods to solve multicriteria shortest path problems publication-title: Journal of Optimization Theory and Applications doi: 10.1023/A:1012602011914 – volume: 40 start-page: 278 issue: 4 year: 2003 ident: 10.1016/j.cor.2008.02.002_bib27 article-title: New algorithms for multi objective shortest path problem publication-title: Opsearch doi: 10.1007/BF03398701 – volume: 46 start-page: 79 issue: 1 year: 1985 ident: 10.1016/j.cor.2008.02.002_bib28 article-title: Shortest paths in networks with vector weights publication-title: Journal of Optimization Theory and Applications doi: 10.1007/BF00938761 – volume: 25 start-page: 281 year: 1985 ident: 10.1016/j.cor.2008.02.002_bib31 article-title: The shortest path problem with two objective functions publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(86)90092-5 – start-page: 215 year: 1985 ident: 10.1016/j.cor.2008.02.002_bib30 article-title: Vector optimal routing by dynamic programming – year: 1993 ident: 10.1016/j.cor.2008.02.002_bib32 – volume: 11 start-page: 399 year: 1982 ident: 10.1016/j.cor.2008.02.002_bib13 article-title: A bicriterion shortest path problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(82)90205-3 – ident: 10.1016/j.cor.2008.02.002_bib33 – volume: 147 start-page: 269 year: 2006 ident: 10.1016/j.cor.2008.02.002_bib4 article-title: On the cardinality of the Pareto set in bicriteria shortest path problems publication-title: Annals of Operations Research doi: 10.1007/s10479-006-0072-1 – volume: 11 start-page: 105 year: 1976 ident: 10.1016/j.cor.2008.02.002_bib34 article-title: A network simplex method publication-title: Mathematical Programming doi: 10.1007/BF01580379 – volume: 139 start-page: 533 issue: 2 year: 2002 ident: 10.1016/j.cor.2008.02.002_bib5 article-title: Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00188-6 – volume: 16 start-page: 236 year: 1984 ident: 10.1016/j.cor.2008.02.002_bib10 article-title: On a multicriteria shortest path problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(84)90077-8 – volume: 185 start-page: 509 issue: 2 year: 2008 ident: 10.1016/j.cor.2008.02.002_bib21 article-title: Two-phase algorithms for the bi-objective assignment problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.12.054
SSID	ssj0000721
Score	2.366718
Snippet	We consider the biobjective shortest path (BSP) problem as the natural extension of the single-objective shortest path problem. BSP problems arise in various...
SourceID	hal proquest pascalfrancis crossref elsevier
SourceType	Open Access Repository Aggregation Database Index Database Enrichment Source Publisher
StartPage	1299
SubjectTerms	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
Title	A comparison of solution strategies for biobjective shortest path problems
URI	https://dx.doi.org/10.1016/j.cor.2008.02.002 https://www.proquest.com/docview/195841876 https://www.proquest.com/docview/35678437 https://hal.science/hal-00466664
Volume	36
WOSCitedRecordID	wos000262843100020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZgQwiEuBQQYTAsxBNVpMR2Ln6MUNGY0ITQkPpm2bnQViip4mzaz-c4sdNs0yb2QB-iys2lyfl8zon9-TsIfSoriCKUpT6Ev9gsycl96EXEJ7KIqyiHN2da9cUmkpOTdLnkPyx_XvflBJK6Ti8u-Pa_mhrawNhm6ewdzD2eFBrgOxgdtmB22P6T4TPLK7e1BefuanPdOVmIgaO5btRmcHdzvTKcW90ZmdXV3BaZ0dPE1VV_0D1Wmm3ZWg6dVQsaR5V_SjtU01MlR6e_WLW_HTfElBhfy8sDDnzCU7ELrQzfLxoEMp0THVRMLFjYxCNCPsEn0TW0C7Suee5hEGEDD761DFejpEp2YcpNzV-JXiOn0NHVNgJOYatrEtELje6TJOLgtfezb4vl8S5QJ_2yvPF-3KR3T_-78j9uSlvurwx_9slWauhS1VAL5VpY73OV0-foqX3JwNkAjhfoXlnP0EO3xmGGnjlrYuvaZ-jxRJjyJTrO8A5EuKmwAxHegQgDiPAERNiBCBsQYQeiV-jX18XplyPfVt3wcxaTzocMjinJi5CoIjaKbDJNSEUlLSEzVCqgSU5DpvKcp1XOK8bLiBSU8MD0-rhI6Wu0Vzd1-QZhJSE7r9IyzqWC11yeShUWNFCRjLmiKfVQ4B6qyK0kvamM8kfcaEwPfR4P2Q56LLftzJylhE0oh0RRAOpuO-wjWHU8vRFgP8q-C9NmhpPgw85DDx1eMvq4u8kFWcADDx04FAjrHrQw0k4shAzEQx_GX8Ghm1k6WZfNmRY0gvyR0eTtXe70AD3addV3aK9rz8r36EF-3q11e2iB_xejksJx
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+comparison+of+solution+strategies+for+biobjective+shortest+path+problems&rft.jtitle=Computers+%26+operations+research&rft.au=Raith%2C+Andrea&rft.au=Ehrgott%2C+Matthias&rft.date=2009-04-01&rft.issn=0305-0548&rft.volume=36&rft.issue=4&rft.spage=1299&rft.epage=1331&rft_id=info:doi/10.1016%2Fj.cor.2008.02.002&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2008_02_002
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon