{"id":"https://openalex.org/W2391596415","doi":null,"title":"Genetic algorithm for a special pickup and delivery traveling salesman problem","display_name":"Genetic algorithm for a special pickup and delivery traveling salesman problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2391596415","mag":"2391596415"},"language":"en","primary_location":{"id":"mag:2391596415","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-JSGG200902073.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764896880","display_name":"Computer Engineering and Applications Journal","issn_l":"2252-4274","issn":["2252-4274","2252-5459"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315074","host_organization_name":"Sriwijaya University","host_organization_lineage":["https://openalex.org/P4310315074"],"host_organization_lineage_names":["Sriwijaya University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Engineering and Applications Journal","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5100512008","display_name":"Jiangsheng Sun","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I92403157","display_name":"University of Science and Technology Beijing","ror":"https://ror.org/02egmk993","country_code":"CN","type":"education","lineage":["https://openalex.org/I92403157"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiangsheng Sun","raw_affiliation_strings":["Department of Logistics Engineering,University of Science and Technology Beijing,Beijing 100083,China 2"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Logistics Engineering,University of Science and Technology Beijing,Beijing 100083,China 2","institution_ids":["https://openalex.org/I92403157"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100512008"],"corresponding_institution_ids":["https://openalex.org/I92403157"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.56486603,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"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.9990000128746033,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0007999999797903001,"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"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.796999990940094},{"id":"https://openalex.org/keywords/local-search","display_name":"local search","score":0.7250000238418579},{"id":"https://openalex.org/keywords/crossover-and-mutation-operators","display_name":"crossover and mutation operators","score":0.7509999871253967},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7139999866485596},{"id":"https://openalex.org/keywords/mathematical-model","display_name":"mathematical model","score":0.4729999899864197}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9234374761581421},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.875219464302063},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.8260222673416138},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6991477012634277},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.6699362993240356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6365582942962646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5547369122505188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5357346534729004},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.5032522082328796},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4240642189979553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39003241062164307},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18900629878044128},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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":"mag:2391596415","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-JSGG200902073.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764896880","display_name":"Computer Engineering and Applications Journal","issn_l":"2252-4274","issn":["2252-4274","2252-5459"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315074","host_organization_name":"Sriwijaya University","host_organization_lineage":["https://openalex.org/P4310315074"],"host_organization_lineage_names":["Sriwijaya University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Computer Engineering and Applications Journal","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2356976268","https://openalex.org/W1998191041","https://openalex.org/W819010695","https://openalex.org/W2146824046","https://openalex.org/W1499685530","https://openalex.org/W2014986500","https://openalex.org/W2333613315","https://openalex.org/W7097690255","https://openalex.org/W7095306650","https://openalex.org/W202821475"],"abstract_inverted_index":{"The":[0],"mathematical":[1],"model":[2],"of":[3,15,23,36,43,48],"one-commodity":[4],"Pickup":[5],"and":[6,33],"Delivery":[7],"Traveling":[8],"Salesman":[9],"Problem(1-PDTSP),which":[10],"is":[11],"a":[12],"new":[13],"variant":[14],"the":[16,21,27,46,49],"classical":[17],"TSP,is":[18],"established.According":[19],"to":[20],"characteristic":[22],"this":[24],"problem,and":[25],"combining":[26],"local":[28],"search":[29],"op-timize":[30],"algorithm,the":[31],"crossover":[32],"mutation":[34],"operations":[35],"genetic":[37,51],"algorithm":[38,52],"are":[39],"improved.The":[40],"computational":[41],"results":[42],"instances":[44],"prove":[45],"superiority":[47],"improved":[50],"in":[53],"solving":[54],"1-PDTSP.":[55]},"counts_by_year":[],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}