{"id":"https://openalex.org/W2288729106","doi":"https://doi.org/10.1109/taai.2015.7407130","title":"Multiobjective orienteering problem with time windows: An ant colony optimization algorithm","display_name":"Multiobjective orienteering problem with time windows: An ant colony optimization algorithm","publication_year":2015,"publication_date":"2015-11-01","ids":{"openalex":"https://openalex.org/W2288729106","doi":"https://doi.org/10.1109/taai.2015.7407130","mag":"2288729106"},"language":"en","primary_location":{"id":"doi:10.1109/taai.2015.7407130","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taai.2015.7407130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","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/A5100650504","display_name":"Yuhan Chen","orcid":"https://orcid.org/0000-0002-5136-6788"},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yu-Han Chen","raw_affiliation_strings":["Dept. of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I134161618"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079048467","display_name":"Wei-Ju Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Wei-Ju Sun","raw_affiliation_strings":["Dept. of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I134161618"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069510989","display_name":"Tsung-Che Chiang","orcid":"https://orcid.org/0000-0001-8253-795X"},"institutions":[{"id":"https://openalex.org/I134161618","display_name":"National Taiwan Normal University","ror":"https://ror.org/059dkdx38","country_code":"TW","type":"education","lineage":["https://openalex.org/I134161618"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tsung-Che Chiang","raw_affiliation_strings":["Dept. of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Information Engineering, National Taiwan Normal University, Taipei, Taiwan, R.O.C","institution_ids":["https://openalex.org/I134161618"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100650504"],"corresponding_institution_ids":["https://openalex.org/I134161618"],"apc_list":null,"apc_paid":null,"fwci":1.6975,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.86586871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":null,"first_page":"128","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.8613827228546143},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.734878659248352},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6959986686706543},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5957006812095642},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.569424569606781},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.48622027039527893},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4682617783546448},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.46070778369903564},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4432864487171173},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43526941537857056},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.421017050743103},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3585818111896515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2743595540523529}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.8613827228546143},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.734878659248352},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6959986686706543},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5957006812095642},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.569424569606781},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.48622027039527893},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4682617783546448},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.46070778369903564},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4432864487171173},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43526941537857056},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.421017050743103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3585818111896515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2743595540523529},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"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/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/taai.2015.7407130","is_oa":false,"landing_page_url":"https://doi.org/10.1109/taai.2015.7407130","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1033426349","https://openalex.org/W1696102839","https://openalex.org/W1965603691","https://openalex.org/W1973751736","https://openalex.org/W1983566109","https://openalex.org/W1987423474","https://openalex.org/W1996723851","https://openalex.org/W2002420134","https://openalex.org/W2003281104","https://openalex.org/W2014979043","https://openalex.org/W2022487853","https://openalex.org/W2073478661","https://openalex.org/W2075600171","https://openalex.org/W2097082129","https://openalex.org/W2113873983","https://openalex.org/W2125281003","https://openalex.org/W2143381319","https://openalex.org/W2149285341","https://openalex.org/W2155836455","https://openalex.org/W2159248543","https://openalex.org/W2889871839","https://openalex.org/W6627049929","https://openalex.org/W6754661131"],"related_works":["https://openalex.org/W1675419291","https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W2462483068","https://openalex.org/W1588949866","https://openalex.org/W46882622","https://openalex.org/W2090178682","https://openalex.org/W2001591765"],"abstract_inverted_index":{"The":[0],"orienteering":[1],"problem":[2,10,62,132],"with":[3,8,43,93,117,140],"time":[4,29],"windows":[5],"(OPTW)":[6],"deals":[7],"the":[9,22,28,33,48,53,61,89,94,98,110,115,129,162],"about":[11],"selecting":[12],"a":[13,44,124],"set":[14,99],"of":[15,17,39,77,96,100,164],"points":[16],"interest":[18,40],"and":[19,47,63,146,160],"then":[20],"determining":[21],"route":[23],"to":[24,51,67,87,113,154,167],"visit":[25],"them":[26],"under":[27],"window":[30],"constraints.":[31],"In":[32,56],"classical":[34],"OPTW":[35,91],"each":[36,65],"candidate":[37],"point":[38,66],"is":[41,50,109,123],"associated":[42,139],"profit":[45,70],"value,":[46],"objective":[49],"maximize":[52],"total":[54],"profit.":[55],"this":[57,108],"study,":[58],"we":[59],"extend":[60],"allow":[64],"have":[68],"multiple":[69],"values,":[71],"which":[72,127],"could":[73],"reflect":[74],"different":[75],"aspects":[76],"consideration.":[78],"We":[79,142,150],"propose":[80,147],"an":[81],"ant":[82],"colony":[83],"optimization":[84,131],"(ACO)":[85],"algorithm":[86,122,153],"solve":[88,155],"multiobjective":[90,130],"(MOOPTW)":[92],"goal":[95],"finding":[97],"Pareto":[101],"optimal":[102],"solutions.":[103],"To":[104],"our":[105,152],"best":[106],"knowledge,":[107],"first":[111],"study":[112],"address":[114],"MOOPTW":[116],"comprehensive":[118],"numerical":[119],"experiments.":[120],"Our":[121],"decomposition-based":[125],"one,":[126],"decomposes":[128],"into":[133],"single-objective":[134],"sub-problems.":[135,141],"Pheromone":[136],"matrices":[137],"are":[138],"also":[143],"incorporate":[144],"path-relinking":[145],"several":[148],"strategies.":[149],"apply":[151],"76":[156],"public":[157],"benchmark":[158],"instances":[159],"offer":[161],"list":[163],"non-dominated":[165],"solutions":[166],"facilitate":[168],"performance":[169],"comparison":[170],"in":[171],"future":[172],"researches.":[173]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}