{"id":"https://openalex.org/W2068853955","doi":"https://doi.org/10.1109/cipls.2013.6595207","title":"Solving the biobjective selective pickup and delivery problem with memetic algorithm","display_name":"Solving the biobjective selective pickup and delivery problem with memetic algorithm","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2068853955","doi":"https://doi.org/10.1109/cipls.2013.6595207","mag":"2068853955"},"language":"en","primary_location":{"id":"doi:10.1109/cipls.2013.6595207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2013.6595207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","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 and Advanced Institute of Manufacturing with High-tech Innovations, National Chung Cheng University, Chiayi, Taiwan","Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering and Advanced Institute of Manufacturing with High-tech Innovations, National Chung Cheng University, Chiayi, Taiwan","institution_ids":["https://openalex.org/I148099254"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#","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 and Advanced Institute of Manufacturing with High-tech Innovations, National Chung Cheng University, Chiayi, Taiwan","Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering and Advanced Institute of Manufacturing with High-tech Innovations, National Chung Cheng University, Chiayi, Taiwan","institution_ids":["https://openalex.org/I148099254"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Information Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan#TAB#","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":2.097,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88287116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"107","last_page":"114"},"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.9990000128746033,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9911999702453613,"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/pickup","display_name":"Pickup","score":0.9298865795135498},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.7275151610374451},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6524929404258728},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6490011811256409},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6425303816795349},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6282539367675781},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5780332684516907},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5547389984130859},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.42523807287216187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3731052875518799},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3593716323375702},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2785947918891907},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27822941541671753},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09269753098487854}],"concepts":[{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.9298865795135498},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.7275151610374451},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6524929404258728},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6490011811256409},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6425303816795349},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6282539367675781},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5780332684516907},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5547389984130859},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.42523807287216187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3731052875518799},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3593716323375702},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2785947918891907},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27822941541671753},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09269753098487854},{"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cipls.2013.6595207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cipls.2013.6595207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS)","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"},{"id":"https://openalex.org/F4320325394","display_name":"Ministry of Minority Affairs","ror":"https://ror.org/050kded90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W3920387","https://openalex.org/W151239635","https://openalex.org/W1525106674","https://openalex.org/W1969191070","https://openalex.org/W1977251261","https://openalex.org/W1993112650","https://openalex.org/W2006538209","https://openalex.org/W2008499862","https://openalex.org/W2011884974","https://openalex.org/W2016908591","https://openalex.org/W2019567064","https://openalex.org/W2020320008","https://openalex.org/W2023445393","https://openalex.org/W2046876986","https://openalex.org/W2059810217","https://openalex.org/W2072003508","https://openalex.org/W2078190972","https://openalex.org/W2082772228","https://openalex.org/W2089031378","https://openalex.org/W2093647432","https://openalex.org/W2097843939","https://openalex.org/W2100664047","https://openalex.org/W2106334424","https://openalex.org/W2126105956","https://openalex.org/W2129360191","https://openalex.org/W2137609793","https://openalex.org/W2139110007","https://openalex.org/W2166484956","https://openalex.org/W2335471126","https://openalex.org/W4232385207"],"related_works":["https://openalex.org/W2360254753","https://openalex.org/W1499685530","https://openalex.org/W2774602532","https://openalex.org/W2277326438","https://openalex.org/W2741596907","https://openalex.org/W4248894450","https://openalex.org/W2385780082","https://openalex.org/W2163647484","https://openalex.org/W1977672343","https://openalex.org/W4293253022"],"abstract_inverted_index":{"The":[0,31,74],"pickup":[1,33,49,72,96],"and":[2,14,28,34,82,97,106,124],"delivery":[3,35,65,98],"problem":[4,17,22,36,99],"(PDP)":[5],"arises":[6],"in":[7,78,88,152],"many":[8],"real-world":[9],"scenarios":[10],"such":[11],"as":[12],"logistics":[13],"robotics.":[15],"This":[16,90],"combines":[18],"the":[19,24,43,55,79,93,112,134,138,146,149,154,161,164,167],"traveling":[20],"salesman":[21],"(or":[23],"vehicle":[25,83,107,141],"routing":[26],"problem)":[27],"object":[29],"distribution.":[30],"selective":[32,95],"(SPDP)":[37],"is":[38,131],"a":[39,58,86,116,128],"novel":[40],"variant":[41],"of":[42,48,103,148,157,166],"PDP":[44],"that":[45,61],"enables":[46],"selectivity":[47],"nodes":[50,66],"for":[51,101,133],"particular":[52],"applications.":[53],"Specifically,":[54],"SPDP":[56],"seeks":[57],"shortest":[59],"route":[60],"can":[62],"supply":[63],"all":[64],"with":[67],"required":[68],"commodities":[69],"from":[70],"some":[71],"nodes.":[73],"two":[75],"key":[76],"factors":[77],"SPDP-travel":[80],"distance":[81,105],"capacity":[84,108],"required-form":[85],"tradeoff":[87],"essence.":[89],"study":[91],"formulates":[92],"biobjective":[94],"(BSPDP)":[100],"minimization":[102],"travel":[104],"required.":[109],"To":[110],"resolve":[111],"BSPDP,":[113],"we":[114],"propose":[115],"multiobjective":[117],"memetic":[118],"algorithm":[119,151],"(MOMA)":[120],"based":[121],"on":[122,140],"NSGA-II":[123],"local":[125],"search.":[126],"Furthermore,":[127],"repair":[129],"strategy":[130],"developed":[132],"MOMA":[135],"to":[136],"handle":[137],"constraint":[139],"load.":[142],"Experimental":[143],"results":[144,162],"validate":[145],"efficacy":[147],"proposed":[150],"approaching":[153],"lower":[155],"bounds":[156],"both":[158],"objectives.":[159],"Moreover,":[160],"demonstrate":[163],"characteristics":[165],"BSPDP.":[168]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}