{"id":"https://openalex.org/W2054586884","doi":"https://doi.org/10.1162/10636560152642869","title":"Evolutionary Driver Scheduling with Relief Chains","display_name":"Evolutionary Driver Scheduling with Relief Chains","publication_year":2001,"publication_date":"2001-12-01","ids":{"openalex":"https://openalex.org/W2054586884","doi":"https://doi.org/10.1162/10636560152642869","mag":"2054586884","pmid":"https://pubmed.ncbi.nlm.nih.gov/11709104"},"language":"en","primary_location":{"id":"doi:10.1162/10636560152642869","doi":"https://doi.org/10.1162/10636560152642869","is_oa":false,"landing_page_url":"https://doi.org/10.1162/10636560152642869","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","medline","norway-2","poland-100","russia-white-list-1"],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","pubmed"],"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/A5113786251","display_name":"Raymond S. K. Kwan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Raymond S. K. Kwan","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043485094","display_name":"Ann S. K. Kwan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ann S. K. Kwan","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012970784","display_name":"Anthony Wren","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anthony Wren","raw_affiliation_strings":["School of Computing, University of Leeds, Leeds, LS2 9JT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Leeds, Leeds, LS2 9JT, UK","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":null,"apc_paid":null,"fwci":3.9632,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.93073665,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"9","issue":"4","first_page":"445","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9901999831199646,"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"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9901999831199646,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.00559999980032444,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/driver-scheduling","display_name":"driver scheduling","score":0.8299999833106995},{"id":"https://openalex.org/keywords/public-transport","display_name":"public transport","score":0.9290000200271606},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8550000190734863},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.6449999809265137},{"id":"https://openalex.org/keywords/schedule-construction","display_name":"schedule construction","score":0.703000009059906},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.7350000143051147},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.7360000014305115}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6735836863517761},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6307671070098877},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6282085180282593},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6279788017272949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6110166311264038},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5323420166969299},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5104016661643982},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5094626545906067},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4879138171672821},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.467395156621933},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4397602677345276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23608940839767456},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15594664216041565},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[{"descriptor_ui":"D000465","descriptor_name":"Algorithms","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D006801","descriptor_name":"Humans","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false},{"descriptor_ui":"D009874","descriptor_name":"Operations Research","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D010561","descriptor_name":"Personnel Staffing and Scheduling","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D014186","descriptor_name":"Transportation","qualifier_ui":null,"qualifier_name":null,"is_major_topic":true},{"descriptor_ui":"D018986","descriptor_name":"Motor Vehicles","qualifier_ui":null,"qualifier_name":null,"is_major_topic":false}],"locations_count":3,"locations":[{"id":"doi:10.1162/10636560152642869","doi":"https://doi.org/10.1162/10636560152642869","is_oa":false,"landing_page_url":"https://doi.org/10.1162/10636560152642869","pdf_url":null,"source":{"id":"https://openalex.org/S38677346","display_name":"Evolutionary Computation","issn_l":"1063-6560","issn":["1063-6560","1530-9304"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-b","cwts-core","dongbi-b","jufo-2","medline","norway-2","poland-100","russia-white-list-1"],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary Computation","raw_type":"journal-article"},{"id":"pmid:11709104","doi":null,"is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/11709104","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Evolutionary computation","raw_type":"Journal Article"},{"id":"pmh:hdl:10068/623624","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/623624","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4943999946117401,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"sustainable_development_goals_aurora":[{"score":0.6299999952316284,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W3485423","https://openalex.org/W319116493","https://openalex.org/W1496258238","https://openalex.org/W1528211715","https://openalex.org/W1531162979","https://openalex.org/W1559215823","https://openalex.org/W1581884105","https://openalex.org/W1582220695","https://openalex.org/W1585326783","https://openalex.org/W2016207616","https://openalex.org/W2016929496","https://openalex.org/W2027291572","https://openalex.org/W2058140821","https://openalex.org/W2135093217","https://openalex.org/W2157054705","https://openalex.org/W2162259238","https://openalex.org/W2339500526","https://openalex.org/W2501462509"],"related_works":["https://openalex.org/W2027291572","https://openalex.org/W7096427533","https://openalex.org/W2139657787","https://openalex.org/W2031087569","https://openalex.org/W2135093217","https://openalex.org/W1581884105","https://openalex.org/W7057156819","https://openalex.org/W319116493","https://openalex.org/W1576574041","https://openalex.org/W1968781756"],"abstract_inverted_index":{"Public":[0],"transport":[1,21],"driver":[2],"scheduling":[3],"problems":[4],"are":[5,16,108,118],"well":[6],"known":[7],"to":[8,44,52,120],"be":[9],"NP-hard.":[10],"Although":[11],"some":[12,98,129],"mathematically":[13],"based":[14],"methods":[15],"being":[17],"used":[18,81],"in":[19],"the":[20,41,78,83,135],"industry,":[22],"there":[23],"is":[24,36,43,67,74],"room":[25],"for":[26,85],"improvement.":[27],"A":[28,59],"hybrid":[29],"approach":[30,90],"incorporating":[31],"a":[32,46,54,64],"genetic":[33],"algorithm":[34],"(GA)":[35],"presented.":[37],"The":[38,71,88,106],"role":[39],"of":[40,49,61,99],"GA":[42,84],"derive":[45],"small":[47],"selection":[48],"good":[50],"shifts":[51,62],"seed":[53],"greedy":[55],"schedule":[56,86],"construction":[57],"heuristic.":[58],"group":[60],"called":[63],"relief":[65,72],"chain":[66,73],"identified":[68],"and":[69,80,117],"recorded.":[70],"then":[75],"inherited":[76],"by":[77,82,114,123],"offspring":[79],"construction.":[87],"new":[89],"has":[91],"been":[92],"tested":[93],"using":[94],"real-life":[95],"data":[96],"sets,":[97],"which":[100],"represent":[101],"very":[102],"large":[103],"problem":[104],"instances.":[105],"results":[107],"generally":[109],"better":[110],"than":[111],"those":[112],"compiled":[113],"experienced":[115],"schedulers":[116],"comparable":[119],"solutions":[121,131],"found":[122],"integer":[124],"linear":[125],"programming":[126],"(ILP).":[127],"In":[128],"cases,":[130],"were":[132],"obtained":[133],"when":[134],"ILP":[136],"failed":[137],"within":[138],"practical":[139],"computational":[140],"limits.":[141]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-31T12:09:11.096373","created_date":"2016-06-24T00:00:00"}