{"id":"https://openalex.org/W2102611762","doi":"https://doi.org/10.1007/978-3-662-45237-0_49","title":"Multi\u2013criteria Route Planning in Bus Network","display_name":"Multi\u2013criteria Route Planning in Bus Network","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2102611762","doi":"https://doi.org/10.1007/978-3-662-45237-0_49","mag":"2102611762"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-45237-0_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-45237-0_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01405639","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006968377","display_name":"Vo Dang Khoa","orcid":"https://orcid.org/0000-0003-3698-4630"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Vo Dang Khoa","raw_affiliation_strings":["Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101475544","display_name":"Tran Vu Pham","orcid":"https://orcid.org/0000-0001-7580-1521"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Vu Pham","raw_affiliation_strings":["Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102296653","display_name":"Huynh Tuong Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huynh Tuong Nguyen","raw_affiliation_strings":["Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073243218","display_name":"Tr\u1ea7n V\u0103n Ho\u00e0i","orcid":"https://orcid.org/0000-0002-0602-4287"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Van Hoai","raw_affiliation_strings":["Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, Ho Chi Minh City University of Technology, 268 Ly Thuong Kiet Street, District 10, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006968377"],"corresponding_institution_ids":["https://openalex.org/I47265099"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":1.655,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88417167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"535","last_page":"546"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8358321785926819},{"id":"https://openalex.org/keywords/allowance","display_name":"Allowance (engineering)","score":0.770424485206604},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5770115256309509},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5686904788017273},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5571743249893188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5191173553466797},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4919295310974121},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.47410351037979126},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45284122228622437},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.4522632956504822},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1832292675971985},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16348952054977417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09599551558494568}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8358321785926819},{"id":"https://openalex.org/C2779268580","wikidata":"https://www.wikidata.org/wiki/Q3447087","display_name":"Allowance (engineering)","level":2,"score":0.770424485206604},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5770115256309509},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5686904788017273},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5571743249893188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5191173553466797},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4919295310974121},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.47410351037979126},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45284122228622437},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.4522632956504822},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1832292675971985},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16348952054977417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09599551558494568},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-45237-0_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-45237-0_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:HAL:hal-01405639v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01405639","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. pp.535-546, ⟨10.1007/978-3-662-45237-0_49⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01405639v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01405639","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"13th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Nov 2014, Ho Chi Minh City, Vietnam. pp.535-546, ⟨10.1007/978-3-662-45237-0_49⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W131463664","https://openalex.org/W145270132","https://openalex.org/W1483103748","https://openalex.org/W1587851010","https://openalex.org/W1964915778","https://openalex.org/W1998062665","https://openalex.org/W1998259641","https://openalex.org/W2052955852","https://openalex.org/W2068113337","https://openalex.org/W2093962468","https://openalex.org/W2099466544","https://openalex.org/W2101923813","https://openalex.org/W2110861948","https://openalex.org/W2118840184","https://openalex.org/W2169528473","https://openalex.org/W2174383934","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W2073298047","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W2033790662","https://openalex.org/W317165722","https://openalex.org/W2728870795","https://openalex.org/W312725187","https://openalex.org/W4378499136","https://openalex.org/W1999828099"],"abstract_inverted_index":{"In":[0],"this":[1,55],"paper,":[2],"we":[3,78],"consider":[4],"the":[5,39,60,63,66,70,90,96,108],"problem":[6,74],"of":[7,25,65,92,99,110],"finding":[8],"itineraries":[9],"in":[10,69],"bus":[11],"networks":[12],"under":[13],"multiple":[14],"independent":[15],"optimization":[16],"criteria,":[17],"namely":[18],"arrival":[19],"time":[20],"at":[21],"destination":[22],"and":[23,95],"number":[24],"transfers.":[26],"It":[27],"is":[28,51],"also":[29],"allowed":[30],"to":[31,36,53],"walk":[32],"from":[33],"one":[34],"stop":[35],"another":[37],"if":[38],"two":[40],"stops":[41,115],"are":[42,102],"located":[43],"within":[44],"a":[45,117],"small":[46],"distance.":[47],"A":[48],"time\u2013dependent":[49],"model":[50],"proposed":[52],"solve":[54],"problem.":[56],"While":[57],"focusing":[58],"on":[59,89],"network":[61],"where":[62],"size":[64],"Pareto":[67],"set":[68],"multi\u2013criteria":[71],"shortest":[72],"path":[73],"might":[75],"grow":[76],"exponentially,":[77],"develop":[79],"an":[80],"efficient":[81],"algorithm":[82],"with":[83],"its":[84],"speed\u2013up":[85],"techniques.":[86],"An":[87],"evaluation":[88],"qualities":[91],"found":[93],"paths":[94],"empirical":[97],"results":[98,105],"different":[100],"implementations":[101],"given.":[103],"The":[104],"show":[106],"that":[107],"allowance":[109],"walking":[111],"shortcuts":[112],"between":[113],"nearby":[114],"gives":[116],"better":[118],"route":[119],"planning.":[120]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}