{"id":"https://openalex.org/W4205797603","doi":"https://doi.org/10.1145/3491396.3506513","title":"Search Economics for Multi-Objective Vehicle Routing Problem with Time Windows","display_name":"Search Economics for Multi-Objective Vehicle Routing Problem with Time Windows","publication_year":2021,"publication_date":"2021-12-28","ids":{"openalex":"https://openalex.org/W4205797603","doi":"https://doi.org/10.1145/3491396.3506513"},"language":"en","primary_location":{"id":"doi:10.1145/3491396.3506513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3491396.3506513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM International Conference on Intelligent Computing and its Emerging Applications","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/A5049066997","display_name":"Wei-Lun Chuang","orcid":null},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Wei-Lun Chuang","raw_affiliation_strings":["Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057441996","display_name":"Chun\u2010Wei Tsai","orcid":"https://orcid.org/0000-0003-0128-4052"},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chun-Wei Tsai","raw_affiliation_strings":["Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039381934","display_name":"Ming\u2010Chao Chiang","orcid":"https://orcid.org/0000-0003-3269-5495"},"institutions":[{"id":"https://openalex.org/I142974352","display_name":"National Sun Yat-sen University","ror":"https://ror.org/00mjawt10","country_code":"TW","type":"education","lineage":["https://openalex.org/I142974352"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Ming-Chao Chiang","raw_affiliation_strings":["Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan","institution_ids":["https://openalex.org/I142974352"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049066997"],"corresponding_institution_ids":["https://openalex.org/I142974352"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27074793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"59","last_page":"64"},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9991000294685364,"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.9983999729156494,"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/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7979897260665894},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7354282736778259},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6533927917480469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6012986302375793},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5704474449157715},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5618295073509216},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5593201518058777},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4753146767616272},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4678407907485962},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.42473047971725464},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35555917024612427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27226126194000244}],"concepts":[{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7979897260665894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7354282736778259},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6533927917480469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6012986302375793},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5704474449157715},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5618295073509216},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5593201518058777},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4753146767616272},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4678407907485962},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.42473047971725464},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35555917024612427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27226126194000244},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3491396.3506513","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3491396.3506513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 ACM International Conference on Intelligent Computing and its Emerging Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W174230839","https://openalex.org/W1607104331","https://openalex.org/W1963938442","https://openalex.org/W1972645701","https://openalex.org/W1973828488","https://openalex.org/W2037932849","https://openalex.org/W2046806484","https://openalex.org/W2057559819","https://openalex.org/W2070637511","https://openalex.org/W2095028785","https://openalex.org/W2097685766","https://openalex.org/W2103480272","https://openalex.org/W2111563176","https://openalex.org/W2125899728","https://openalex.org/W2143381319","https://openalex.org/W2249776499","https://openalex.org/W2283883526","https://openalex.org/W2735676410","https://openalex.org/W2990011808","https://openalex.org/W3005965793","https://openalex.org/W3088590634","https://openalex.org/W3203465830","https://openalex.org/W4241555022"],"related_works":["https://openalex.org/W4312143452","https://openalex.org/W2018691209","https://openalex.org/W2789681586","https://openalex.org/W2794361564","https://openalex.org/W4247364272","https://openalex.org/W4243392960","https://openalex.org/W2996796639","https://openalex.org/W2972305535","https://openalex.org/W2807679627","https://openalex.org/W1511519193"],"abstract_inverted_index":{"Developing":[0],"an":[1,17,75],"effective":[2,76],"search":[3,23,86,89],"algorithm":[4,78,87,145,183],"to":[5,29,100,107,119,167],"find":[6,120,168],"out":[7,109,121],"a":[8,21,31,51,84,152],"good":[9,122,169],"solution":[10,103,114],"for":[11,20,34,79],"the":[12,38,60,65,69,92,102,110,113,126,143,156,160,181],"vehicle":[13,43],"routing":[14,44,53],"problem":[15,45,54],"is":[16,50,146],"importance":[18],"issue,":[19],"powerful":[22],"strategy":[24],"can":[25],"also":[26],"be":[27],"used":[28],"make":[30],"better":[32,185],"decision":[33],"complex":[35,173],"problems":[36],"in":[37,112,151,171,191],"real":[39],"life.":[40],"The":[41,176],"multi-objective":[42],"with":[46,116],"time":[47],"windows":[48],"(MOVRPTW)":[49],"famous":[52],"that":[55,128,180],"aims":[56],"at":[57,68],"minimizing":[58],"both":[59],"number":[61],"of":[62,95,141,148,159],"vehicles":[63],"and":[64,105],"traveling":[66],"distance":[67],"same":[70],"time.":[71],"This":[72],"paper":[73],"presents":[74],"metaheuristic":[77,189],"solving":[80,172,192],"MOVRPTW":[81],"based":[82,124],"on":[83,125,136],"new":[85],"named":[88],"economics":[90],"(SE)":[91],"key":[93],"ideas":[94],"which":[96],"are":[97],"twofold:":[98],"(1)":[99],"portray":[101],"space":[104,115],"(2)":[106],"figure":[108],"regions":[111],"higher":[117],"potential":[118],"solutions---both":[123],"solutions":[127],"have":[129],"been":[130],"searched":[131],"so":[132],"far.":[133],"By":[134],"building":[135],"these":[137],"two":[138],"distinguished":[139],"features":[140],"SE,":[142],"proposed":[144,182],"capable":[147],"avoiding":[149],"trapping":[150],"local":[153],"optimum":[154],"during":[155],"early":[157],"stage":[158],"convergence":[161],"process,":[162],"thus":[163],"making":[164],"it":[165],"possible":[166],"results":[170,178],"optimization":[174],"problems.":[175],"experimental":[177],"indicate":[179],"performs":[184],"than":[186],"other":[187],"well-known":[188],"algorithms":[190],"MOVRPTW.":[193]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}