{"id":"https://openalex.org/W2894131086","doi":"https://doi.org/10.1109/icis.2018.8466547","title":"New Model for the Multiple Vehicle Path Planning Problem and GA-based Solutions","display_name":"New Model for the Multiple Vehicle Path Planning Problem and GA-based Solutions","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2894131086","doi":"https://doi.org/10.1109/icis.2018.8466547","mag":"2894131086"},"language":"en","primary_location":{"id":"doi:10.1109/icis.2018.8466547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2018.8466547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","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/A5065169686","display_name":"Yuxin Niu","orcid":null},"institutions":[{"id":"https://openalex.org/I25355098","display_name":"Chang'an University","ror":"https://ror.org/05mxya461","country_code":"CN","type":"education","lineage":["https://openalex.org/I25355098"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuxin Niu","raw_affiliation_strings":["School of Highway, Chang’an University Xi’an, China","School of Highway, Chang'an University Xi'an, China, Shanxi Province"],"affiliations":[{"raw_affiliation_string":"School of Highway, Chang’an University Xi’an, China","institution_ids":["https://openalex.org/I25355098"]},{"raw_affiliation_string":"School of Highway, Chang'an University Xi'an, China, Shanxi Province","institution_ids":["https://openalex.org/I25355098"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065169686"],"corresponding_institution_ids":["https://openalex.org/I25355098"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10570917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"798","last_page":"801"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9984999895095825,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9922000169754028,"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/crossover","display_name":"Crossover","score":0.8227871656417847},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.691033124923706},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6828815340995789},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6565103530883789},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5800268650054932},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5276635885238647},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5117771029472351},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4463445842266083},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.42128604650497437},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4198588728904724},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41770219802856445},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2656616270542145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22939085960388184},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18655046820640564},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15113189816474915},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08084383606910706}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.8227871656417847},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.691033124923706},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6828815340995789},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6565103530883789},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5800268650054932},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5276635885238647},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5117771029472351},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4463445842266083},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.42128604650497437},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4198588728904724},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41770219802856445},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2656616270542145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22939085960388184},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18655046820640564},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15113189816474915},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08084383606910706},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icis.2018.8466547","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icis.2018.8466547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2034470238","https://openalex.org/W2058044254","https://openalex.org/W2068878490","https://openalex.org/W2104734478","https://openalex.org/W4382892785","https://openalex.org/W6659096416","https://openalex.org/W6684706888"],"related_works":["https://openalex.org/W2347477706","https://openalex.org/W1943663474","https://openalex.org/W4299389082","https://openalex.org/W2306830238","https://openalex.org/W2110294633","https://openalex.org/W1829715381","https://openalex.org/W2962747841","https://openalex.org/W2630967916","https://openalex.org/W2014162767","https://openalex.org/W2153702122"],"abstract_inverted_index":{"Recent":[0],"years,":[1],"research":[2],"on":[3,104],"intelligent":[4],"transportation":[5],"systems":[6],"(ITS)":[7],"attracts":[8],"a":[9,41,74,94,105],"lot":[10],"of":[11,14,17,55,76],"attention.":[12],"One":[13],"key":[15],"problems":[16],"ITS":[18],"is":[19,73,86,129],"the":[20,52,77,100],"multiple":[21,36],"vehicle":[22],"path":[23,33,79],"planning":[24],"(MVFP)":[25],"problem,":[26,80],"which":[27],"requires":[28],"to":[29,60],"find":[30],"(nearly)":[31],"optimal":[32],"schedules":[34],"for":[35,98],"vehicles,":[37],"might":[38],"unmanned,":[39],"over":[40],"directed":[42],"graph":[43],"such":[44],"that":[45,62,126],"all":[46],"target":[47,69],"points":[48],"are":[49,122],"covered":[50],"by":[51],"union":[53],"paths":[54],"these":[56],"vehicles":[57,64],"and":[58,85,115,118],"meanwhile":[59],"ensure":[61],"each":[63],"has":[65],"visited":[66],"its":[67],"own":[68],"points.":[70],"This":[71],"problem":[72,102],"generalization":[75],"Hamiltonian":[78],"with":[81],"more":[82],"complex":[83],"constraints,":[84],"obviously":[87],"NP-hard.":[88],"In":[89],"this":[90],"paper,":[91],"we":[92],"propose":[93],"novel":[95],"genetic":[96,110],"algorithm":[97],"solving":[99],"MVPP":[101],"based":[103],"Lagrangian":[106],"relaxation":[107],"technique.":[108],"New":[109],"operators,":[111],"including":[112],"crossover,":[113],"mutation,":[114],"adaptive":[116],"penalty":[117],"mature-degree":[119],"control":[120],"strategies":[121],"proposed.":[123],"Experiments":[124],"show":[125],"our":[127],"proposal":[128],"effective.":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}