{"id":"https://openalex.org/W2128852582","doi":"https://doi.org/10.1109/cso.2009.340","title":"Multiple Trajectory Search for Uncapacitated Facility Location Problems","display_name":"Multiple Trajectory Search for Uncapacitated Facility Location Problems","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2128852582","doi":"https://doi.org/10.1109/cso.2009.340","mag":"2128852582"},"language":"en","primary_location":{"id":"doi:10.1109/cso.2009.340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cso.2009.340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Joint Conference on Computational Sciences and Optimization","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/A5034146966","display_name":"Lin\u2010Yu Tseng","orcid":"https://orcid.org/0000-0003-3704-3947"},"institutions":[{"id":"https://openalex.org/I162838928","display_name":"National Chung Hsing University","ror":"https://ror.org/05vn3ca78","country_code":"TW","type":"education","lineage":["https://openalex.org/I162838928"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Lin-Yu Tseng","raw_affiliation_strings":["Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan","Dept. of Computer Science and Engineering National Chung-Hsing University Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan","institution_ids":["https://openalex.org/I162838928"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering National Chung-Hsing University Taichung, Taiwan","institution_ids":["https://openalex.org/I162838928"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069147683","display_name":"Chih-Sheng Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I162838928","display_name":"National Chung Hsing University","ror":"https://ror.org/05vn3ca78","country_code":"TW","type":"education","lineage":["https://openalex.org/I162838928"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chih-Sheng Wu","raw_affiliation_strings":["Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan","Dept. of Computer Science and Engineering National Chung-Hsing University Taichung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Chung Hsing University, Taichung, Taiwan","institution_ids":["https://openalex.org/I162838928"]},{"raw_affiliation_string":"Dept. of Computer Science and Engineering National Chung-Hsing University Taichung, Taiwan","institution_ids":["https://openalex.org/I162838928"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034146966"],"corresponding_institution_ids":["https://openalex.org/I162838928"],"apc_list":null,"apc_paid":null,"fwci":0.7505,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78712741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2462","issue":null,"first_page":"965","last_page":"968"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9993000030517578,"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.9993000030517578,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11502","display_name":"Facility Location and Emergency Management","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.8448907732963562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6301396489143372},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5857698321342468},{"id":"https://openalex.org/keywords/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.5818331241607666},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.554695188999176},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5486489534378052},{"id":"https://openalex.org/keywords/facility-location-problem","display_name":"Facility location problem","score":0.5131900906562805},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.4787037670612335},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.46265560388565063},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4319138824939728},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4317159056663513},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41184529662132263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28003841638565063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2689995765686035}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.8448907732963562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6301396489143372},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5857698321342468},{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.5818331241607666},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.554695188999176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5486489534378052},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.5131900906562805},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.4787037670612335},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.46265560388565063},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4319138824939728},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4317159056663513},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41184529662132263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28003841638565063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2689995765686035},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cso.2009.340","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cso.2009.340","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 International Joint Conference on Computational Sciences and Optimization","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1696776098","https://openalex.org/W1803694112","https://openalex.org/W1998208600","https://openalex.org/W2003244395","https://openalex.org/W2006514056","https://openalex.org/W2010410498","https://openalex.org/W2049967755","https://openalex.org/W2062545539","https://openalex.org/W2081029938","https://openalex.org/W2100844228","https://openalex.org/W2126424258","https://openalex.org/W2195412851","https://openalex.org/W4252732074"],"related_works":["https://openalex.org/W2028764438","https://openalex.org/W1537780499","https://openalex.org/W1521720388","https://openalex.org/W1533229056","https://openalex.org/W1516893820","https://openalex.org/W2087594839","https://openalex.org/W1990372046","https://openalex.org/W1843628981","https://openalex.org/W2901129955","https://openalex.org/W2492630225"],"abstract_inverted_index":{"In":[0],"this":[1],"study,":[2],"a":[3,27,34],"novel":[4],"metaheuristic":[5],"called":[6],"the":[7,16,43,48,65],"multiple":[8,23,44],"trajectory":[9,24,45],"search":[10,25,29,36,46],"(MTS)":[11],"is":[12,68],"proposed":[13,66],"to":[14,47],"solve":[15],"uncapacitated":[17],"facility":[18],"location":[19],"problem":[20],"(UFLP).":[21],"The":[22,40,56],"hybridizes":[26],"global":[28],"method":[30,37,67],"(the":[31,38],"Trajectory_Search)":[32],"and":[33,51],"local":[35],"Variable_Neighborhood_Search).":[39],"application":[41],"of":[42],"benchmarks":[49],"ORLIB":[50],"GHOSH":[52],"had":[53],"been":[54],"conducted.":[55],"performance":[57],"comparison":[58],"with":[59],"other":[60],"state-of-the-art":[61],"methods":[62],"reveals":[63],"that":[64],"very":[69],"competitive.":[70]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}