{"id":"https://openalex.org/W4312198743","doi":"https://doi.org/10.1109/ieem55944.2022.9989602","title":"An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint","display_name":"An Iterated Local Search Algorithm for Commuting Bus Routing Problem with Latest Arrival Time Constraint","publication_year":2022,"publication_date":"2022-12-07","ids":{"openalex":"https://openalex.org/W4312198743","doi":"https://doi.org/10.1109/ieem55944.2022.9989602"},"language":"en","primary_location":{"id":"doi:10.1109/ieem55944.2022.9989602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem55944.2022.9989602","pdf_url":null,"source":{"id":"https://openalex.org/S4363607849","display_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084267191","display_name":"Hideki Hashimoto","orcid":"https://orcid.org/0000-0003-4771-1240"},"institutions":[{"id":"https://openalex.org/I48840829","display_name":"Tokyo University of Marine Science and Technology","ror":"https://ror.org/048nxq511","country_code":"JP","type":"education","lineage":["https://openalex.org/I48840829"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"H. Hashimoto","raw_affiliation_strings":["Tokyo University of Marine Science and Technology,Dept. Logistics and Information Engineering,Tokyo,Japan","Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Tokyo University of Marine Science and Technology,Dept. Logistics and Information Engineering,Tokyo,Japan","institution_ids":["https://openalex.org/I48840829"]},{"raw_affiliation_string":"Dept. Logistics and Information Engineering, Tokyo University of Marine Science and Technology, Tokyo, Japan","institution_ids":["https://openalex.org/I48840829"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108412538","display_name":"Yannan Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I161296585","display_name":"Tokyo University of Science","ror":"https://ror.org/05sj3n476","country_code":"JP","type":"education","lineage":["https://openalex.org/I161296585"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Y. Hu","raw_affiliation_strings":["Tokyo University of Science,Dept. Applied Mathematics,Tokyo,Japan","Dept. Applied Mathematics, Tokyo University of Science, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Tokyo University of Science,Dept. Applied Mathematics,Tokyo,Japan","institution_ids":["https://openalex.org/I161296585"]},{"raw_affiliation_string":"Dept. Applied Mathematics, Tokyo University of Science, Tokyo, Japan","institution_ids":["https://openalex.org/I161296585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072739061","display_name":"Takuya Sugiura","orcid":"https://orcid.org/0009-0002-7952-4175"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Sugiura","raw_affiliation_strings":["Nagoya University,Graduate School of Information Science,Dept. Computer Science and Mathematical Informatics,Nagoya,Japan","Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya University,Graduate School of Information Science,Dept. Computer Science and Mathematical Informatics,Nagoya,Japan","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082865897","display_name":"Yosuke TAKADA","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Y. Takada","raw_affiliation_strings":["Nagoya University,Graduate School of Information Science,Dept. Computer Science and Mathematical Informatics,Nagoya,Japan","Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya University,Graduate School of Information Science,Dept. Computer Science and Mathematical Informatics,Nagoya,Japan","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046237399","display_name":"Mutsunori Yagiura","orcid":"https://orcid.org/0000-0003-0970-9414"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"M. Yagiura","raw_affiliation_strings":["Nagoya University,Graduate School of Information Science,Dept. Computer Science and Mathematical Informatics,Nagoya,Japan","Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya University,Graduate School of Information Science,Dept. Computer Science and Mathematical Informatics,Nagoya,Japan","institution_ids":["https://openalex.org/I60134161"]},{"raw_affiliation_string":"Dept. Computer Science and Mathematical Informatics, Graduate School of Information Science, Nagoya University, Nagoya, Japan","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5084267191"],"corresponding_institution_ids":["https://openalex.org/I48840829"],"apc_list":null,"apc_paid":null,"fwci":0.6935,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61562392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"0791","last_page":"0795"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9915000200271606,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.7964730262756348},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6742808818817139},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6723029017448425},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6411426663398743},{"id":"https://openalex.org/keywords/arrival-time","display_name":"Arrival time","score":0.5376758575439453},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.532181978225708},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5282121300697327},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.49271896481513977},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.4886520206928253},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39092832803726196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37505465745925903},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24712851643562317},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17163410782814026},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.14019978046417236},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12149077653884888}],"concepts":[{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.7964730262756348},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6742808818817139},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6723029017448425},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6411426663398743},{"id":"https://openalex.org/C3017552255","wikidata":"https://www.wikidata.org/wiki/Q4135208","display_name":"Arrival time","level":2,"score":0.5376758575439453},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.532181978225708},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5282121300697327},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.49271896481513977},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.4886520206928253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39092832803726196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37505465745925903},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24712851643562317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17163410782814026},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.14019978046417236},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12149077653884888},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieem55944.2022.9989602","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieem55944.2022.9989602","pdf_url":null,"source":{"id":"https://openalex.org/S4363607849","display_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1978887754","https://openalex.org/W2246405718","https://openalex.org/W2498394120"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2384925093","https://openalex.org/W1992742448","https://openalex.org/W2998423674","https://openalex.org/W2005660029","https://openalex.org/W2887485518","https://openalex.org/W2010567643","https://openalex.org/W1996453501","https://openalex.org/W4394238759","https://openalex.org/W1666350026"],"abstract_inverted_index":{"Given":[0],"a":[1,7,61,82,145,151],"set":[2,8,83],"of":[3,9,26,37,84,118,129,159,176],"bus":[4,13,39,58,98,146],"stops":[5,40],"and":[6,59,100,123,135,169],"employees,":[10],"the":[11,33,38,57,73,87,157,174,177],"commuting":[12],"routing":[14],"problem":[15],"with":[16,86],"latest":[17,74,101],"arrival":[18,75,102],"time":[19,63,103],"constraint":[20],"(CBRP-LATC)":[21],"aims":[22],"to":[23,28,35,45,51,67,80,137,144,155],"determine":[24],"routes":[25,85,160],"buses":[27],"carry":[29],"every":[30],"employee":[31,49],"from":[32,142],"company":[34],"one":[36],"at":[41],"which":[42,70,113],"he/she":[43,65],"wants":[44,66],"get":[46],"off.":[47],"Each":[48],"walks":[50],"his/her":[52],"destination":[53],"after":[54],"getting":[55],"off":[56],"has":[60],"desired":[62],"when":[64],"arrive":[68],"there,":[69],"is":[71,79,150],"called":[72,121],"time.":[76],"The":[77,125,148],"objective":[78],"find":[81],"minimum":[88],"total":[89],"traveling":[90],"cost":[91],"that":[92],"covers":[93],"all":[94],"employees\u2019":[95],"destinations":[96],"under":[97],"capacity":[99],"constraints.":[104],"We":[105],"propose":[106],"an":[107],"iterated":[108],"local":[109,152],"search":[110,153],"algorithm":[111,154],"in":[112],"we":[114],"use":[115],"two":[116,178],"kinds":[117],"neighborhood":[119,131,164,179],"operations":[120],"set-del/1-ins":[122],"VRP-OPT*.":[124],"set-del/1ins":[126],"operation":[127],"consists":[128],"three":[130],"operations,":[132,165],"setdel,":[133],"1-ins":[134],"set-del-ins":[136],"remove":[138],"or":[139,143],"assign":[140],"employees":[141],"route.":[147],"VRP-OPT*":[149],"improve":[156],"distances":[158],"based":[161],"on":[162],"four":[163],"2-opt,":[166],"2-opt*,":[167],"relocate":[168],"cross-exchange.":[170],"Computational":[171],"results":[172],"show":[173],"effectiveness":[175],"operations.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}