{"id":"https://openalex.org/W2933438140","doi":"https://doi.org/10.26190/unsworks/22158","title":"Localized genetic algorithm for the vehicle routing problem","display_name":"Localized genetic algorithm for the vehicle routing problem","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2933438140","doi":"https://doi.org/10.26190/unsworks/22158","mag":"2933438140"},"language":"en","primary_location":{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/43763","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/43763","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},"type":"book","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.26190/unsworks/22158","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079937487","display_name":"Ziauddin Ursani","orcid":"https://orcid.org/0000-0002-2972-4024"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ursani, Ziauddin","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079937487"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"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.9976000189781189,"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.9976000189781189,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9943000078201294,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.978600025177002,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unavailability","display_name":"Unavailability","score":0.7477703094482422},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.7273973822593689},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.695667028427124},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6472274661064148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6283519268035889},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5716285705566406},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5691338777542114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4592565894126892},{"id":"https://openalex.org/keywords/computational-problem","display_name":"Computational problem","score":0.44913071393966675},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.4420763850212097},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4335938096046448},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.36637476086616516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1988758146762848},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1784268319606781}],"concepts":[{"id":"https://openalex.org/C2780505938","wikidata":"https://www.wikidata.org/wiki/Q17093282","display_name":"Unavailability","level":2,"score":0.7477703094482422},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.7273973822593689},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.695667028427124},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6472274661064148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6283519268035889},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5716285705566406},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5691338777542114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4592565894126892},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.44913071393966675},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.4420763850212097},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4335938096046448},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.36637476086616516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1988758146762848},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1784268319606781},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:unsworks.library.unsw.edu.au:1959.4/43763","is_oa":false,"landing_page_url":"http://hdl.handle.net/1959.4/43763","pdf_url":null,"source":{"id":"https://openalex.org/S4306401737","display_name":"UNSWorks (University of New South Wales, Sydney, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40053085","host_organization_name":"Australian Defence Force Academy","host_organization_lineage":["https://openalex.org/I40053085"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"http://purl.org/coar/resource_type/c_db06"},{"id":"pmh:oai:unsworks.unsw.edu.au:1959.4/43763","is_oa":false,"landing_page_url":"http://handle.unsw.edu.au/1959.4/43763","pdf_url":null,"source":{"id":"https://openalex.org/S4377196481","display_name":"UNSWorks (UNSW Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31746571","host_organization_name":"UNSW Sydney","host_organization_lineage":["https://openalex.org/I31746571"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"doi:10.26190/unsworks/22158","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/22158","pdf_url":null,"source":{"id":"https://openalex.org/S7407053176","display_name":"University of New South Wales","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"},{"id":"mag:2933438140","is_oa":false,"landing_page_url":"https://www.knigozal.com/store/gb/book/localized-genetic-algorithm-for-the-vehicle-routing-problem/isbn/978-3-8383-6807-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306474680","display_name":"LAP LAMBERT Academic Publishing eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"LAP LAMBERT Academic Publishing eBooks","raw_type":null}],"best_oa_location":{"id":"doi:10.26190/unsworks/22158","is_oa":true,"landing_page_url":"https://doi.org/10.26190/unsworks/22158","pdf_url":null,"source":{"id":"https://openalex.org/S7407053176","display_name":"University of New South Wales","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"thesis"},"sustainable_development_goals":[{"score":0.7400000095367432,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2149110409","https://openalex.org/W2078619461","https://openalex.org/W2155502344","https://openalex.org/W3107958921","https://openalex.org/W173817477","https://openalex.org/W108911303","https://openalex.org/W2111576055","https://openalex.org/W2295960860","https://openalex.org/W206996077","https://openalex.org/W2037912047","https://openalex.org/W2366445156","https://openalex.org/W185302880","https://openalex.org/W3010321770","https://openalex.org/W2003311208","https://openalex.org/W2982321380","https://openalex.org/W1526726828","https://openalex.org/W2727720411","https://openalex.org/W2512476781","https://openalex.org/W3119963181","https://openalex.org/W1570239374"],"abstract_inverted_index":{"This":[0],"thesis":[1],"identifies":[2],"some":[3],"problems,":[4,341],"the":[5,12,29,41,89,95,103,136,145,176,200,206,210,226,231,242,249,330],"genetic":[6,77],"algorithm":[7],"(GA)":[8],"is":[9,131,157,171,189,248,304,325],"facing":[10],"in":[11,52,128,272,290],"area":[13],"of":[14,31,38,56,139,144,168,202,212,244,262,279],"vehicle":[15,339],"routing":[16,340],"and":[17,35,48,68,97,102,116,163,198,209,274,288,321,327],"proposes":[18],"various":[19,113,142,192],"methods":[20],"to":[21,233,236,241,253,256,264,281,307,332,335,344],"address":[22],"those":[23,245],"problems.":[24,239,323,347],"Those":[25],"problems":[26,55,80,115,261,278],"arise":[27],"from":[28,119],"unavailability":[30],"suitable":[32],"chromosomal":[33],"representation":[34,47],"evaluation":[36,49],"schemes":[37,50,101],"GA":[39,134,140],"for":[40,112,296,311],"Vehicle":[42],"Routing":[43],"Problem":[44],"(VRP).":[45],"The":[46,166],"already":[51],"use":[53,201],"have":[54],"high":[57],"computational":[58,213,297,309],"cost,":[59],"illegal":[60],"chromosomes":[61],"(chromosomes":[62],"not":[63,73,336],"representing":[64,75],"a":[65,121,151,179,293],"legal":[66],"tour)":[67],"wrong":[69],"fitness":[70],"assignment":[71],"(fitness":[72],"truly":[74],"chromosome":[76],"makeup).":[78],"These":[79],"are":[81,109,222],"addressed":[82],"by":[83,270,286],"several":[84],"proposed":[85],"new":[86,180],"schemes,":[87],"namely":[88],"Self":[90],"Imposed":[91],"Constraints":[92],"Evaluation":[93,100,106,301],"scheme,":[94,107],"Contour":[96,99],"Reverse":[98],"Order":[104],"Skipping":[105],"which":[108,123,203,228],"specifically":[110],"tailored":[111],"objectives,":[114],"situations.":[117],"Apart":[118],"this,":[120],"methodology,":[122],"has":[124,229,315,329],"previously":[125],"being":[126],"used":[127],"other":[129,338,345],"meta-heuristics,":[130],"incorporated":[132],"into":[133,178,225],"i.e.,":[135,299],"independent":[137],"application":[138],"on":[141,205,319],"sub-localities":[143],"problem.":[146],"We":[147],"call":[148],"this":[149],"GA,":[150],"Localized":[152],"Genetic":[153],"Algorithm":[154],"(LGA).":[155],"LGA":[156,188,232,247,314],"an":[158],"iterative":[159],"procedure":[160,167],"between":[161],"optimization":[162],"controlled":[164,169],"de-optimization.":[165],"de-optimization":[170],"also":[172,223,305,328,343],"novel.":[173],"It":[174,324],"brings":[175],"solution":[177],"search":[181,193,216],"space":[182],"while":[183],"controlling":[184],"its":[185],"cost":[186],"effectively.":[187],"introduced":[190,224,306],"with":[191],"techniques,":[194],"i.e.":[195,267],"intensive,":[196],"extensive":[197],"selective,":[199],"depends":[204],"problem":[207],"size":[208],"availability":[211],"resources.":[214],"Furthermore,":[215],"reduction":[217],"techniques":[218],"(Fitness":[219],"Approximation":[220],"Methods)":[221],"LGA,":[227],"enabled":[230],"be":[234,254,333],"applied":[235,255],"large":[237,258,275],"scale":[238,259,276],"Due":[240],"implementation":[243],"proposals,":[246],"first":[250],"GA-driven":[251],"approach":[252],"very":[257],"CVRP":[260,320],"up":[263,280],"1200":[265],"customers,":[266,283],"datasets":[268,284],"presented":[269,285],"Feiyue":[271],"2005":[273],"VRPTW":[277,322],"1000":[282],"Gehring":[287],"Homberger":[289],"1999.":[291],"Lastly,":[292],"standard":[294],"unit":[295],"comparison,":[298],"Bellman's":[300],"Units":[302],"BEUs,":[303],"facilitate":[308],"comparisons":[310],"future":[312],"researchers.":[313],"shown":[316],"promising":[317],"results":[318],"flexible":[326],"potential":[331],"extended":[334],"only":[337],"but":[342],"ordering":[346]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}