{"id":"https://openalex.org/W2000418469","doi":"https://doi.org/10.1109/cec.2012.6252884","title":"Evolutionary algorithms using adaptive mutation for the selective pickup and delivery problem","display_name":"Evolutionary algorithms using adaptive mutation for the selective pickup and delivery problem","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2000418469","doi":"https://doi.org/10.1109/cec.2012.6252884","mag":"2000418469"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6252884","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","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/A5082908093","display_name":"Xin-Lan Liao","orcid":null},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Xin-Lan Liao","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan","Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi 621, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan","institution_ids":["https://openalex.org/I148099254"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi 621, Taiwan","institution_ids":["https://openalex.org/I148099254"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040962428","display_name":"Chuan-Kang Ting","orcid":"https://orcid.org/0000-0002-0838-3320"},"institutions":[{"id":"https://openalex.org/I148099254","display_name":"National Chung Cheng University","ror":"https://ror.org/0028v3876","country_code":"TW","type":"education","lineage":["https://openalex.org/I148099254"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chuan-Kang Ting","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan","Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi 621, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan","institution_ids":["https://openalex.org/I148099254"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chung Cheng University, Chia-Yi 621, Taiwan","institution_ids":["https://openalex.org/I148099254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6943,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75167544,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2570","issue":null,"first_page":"1","last_page":"8"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9926000237464905,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9884999990463257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.9749422073364258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6383598446846008},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6173774600028992},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.5869307518005371},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.5856145620346069},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5789387822151184},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.507670521736145},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49193906784057617},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4196528196334839},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4100203812122345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26743748784065247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2154625654220581},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14206025004386902},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06671175360679626}],"concepts":[{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.9749422073364258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6383598446846008},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6173774600028992},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.5869307518005371},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.5856145620346069},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5789387822151184},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.507670521736145},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49193906784057617},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4196528196334839},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4100203812122345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26743748784065247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2154625654220581},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14206025004386902},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06671175360679626},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2012.6252884","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6252884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W295083746","https://openalex.org/W1525106674","https://openalex.org/W1573534773","https://openalex.org/W1661890235","https://openalex.org/W1965292088","https://openalex.org/W1971641481","https://openalex.org/W1990771923","https://openalex.org/W1993112650","https://openalex.org/W2000702178","https://openalex.org/W2023445393","https://openalex.org/W2040546552","https://openalex.org/W2046876986","https://openalex.org/W2072003508","https://openalex.org/W2082772228","https://openalex.org/W2145479420","https://openalex.org/W2146879413","https://openalex.org/W2335471126","https://openalex.org/W2769848025","https://openalex.org/W4301523125","https://openalex.org/W6610411662"],"related_works":["https://openalex.org/W2185313546","https://openalex.org/W2185850456","https://openalex.org/W2994962043","https://openalex.org/W2351571732","https://openalex.org/W1496169957","https://openalex.org/W2324305961","https://openalex.org/W4293253022","https://openalex.org/W2243298209","https://openalex.org/W2147204676","https://openalex.org/W2787833928"],"abstract_inverted_index":{"The":[0],"selective":[1],"pickup":[2,13,24,52,56,95,131],"and":[3,14,74,107],"delivery":[4,15,44],"problem":[5,18],"(SPDP)":[6],"is":[7,58],"a":[8],"novel":[9],"variant":[10],"of":[11,55,60,93,130],"the":[12,20,30,33,38,62,66,71,78,91,98,111,121,142,146],"problem.":[16],"This":[17],"relaxes":[19],"constraint":[21],"that":[22,41,88,120],"all":[23],"nodes":[25,45,57,96,132],"must":[26],"be":[27],"visited":[28],"along":[29],"route.":[31],"Specifically,":[32],"SPDP":[34,112],"aims":[35],"to":[36,127],"find":[37],"shortest":[39],"route":[40],"can":[42,125],"supply":[43],"with":[46],"required":[47],"commodities":[48],"from":[49],"some":[50],"selected":[51],"nodes.":[53],"Selection":[54],"capable":[59],"reducing":[61],"transportation":[63],"cost;":[64],"on":[65,90,140],"other":[67],"hand,":[68],"it":[69],"increases":[70],"search":[72],"space":[73],"difficulty":[75],"in":[76],"resolving":[77],"SPDP.":[79,99,147],"In":[80],"this":[81],"study,":[82],"we":[83],"propose":[84],"an":[85],"adaptive":[86,123],"mutation":[87,124],"focuses":[89],"selection":[92,129],"proper":[94],"for":[97,110,133,145],"Two":[100],"evolutionary":[101],"algorithms":[102],"(EAs),":[103],"namely":[104],"genetic":[105],"algorithm":[106],"memetic":[108],"algorithm,":[109],"are":[113],"developed":[114],"as":[115],"well.":[116],"Experimental":[117],"results":[118],"show":[119],"proposed":[122],"lead":[126],"better":[128],"shorter":[134],"routes,":[135],"which":[136],"validates":[137],"its":[138],"effectiveness":[139],"improving":[141],"two":[143],"EAs":[144]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}