{"id":"https://openalex.org/W2265249259","doi":"https://doi.org/10.1080/10556788.2015.1062890","title":"A heuristic algorithm for optimal fleet composition with vehicle routing considerations","display_name":"A heuristic algorithm for optimal fleet composition with vehicle routing considerations","publication_year":2015,"publication_date":"2015-07-10","ids":{"openalex":"https://openalex.org/W2265249259","doi":"https://doi.org/10.1080/10556788.2015.1062890","mag":"2265249259"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1062890","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1062890","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/37868/2/231778_231778.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050635893","display_name":"Elham Mardaneh","orcid":"https://orcid.org/0000-0002-5122-5686"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"E. Mardaneh","raw_affiliation_strings":["Department of Mathematics and Statistics, Curtin University, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Curtin University, Perth, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023320871","display_name":"Qun Lin","orcid":"https://orcid.org/0000-0003-0209-6424"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Q. Lin","raw_affiliation_strings":["Department of Mathematics and Statistics, Curtin University, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Curtin University, Perth, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066144982","display_name":"Ryan Loxton","orcid":"https://orcid.org/0000-0001-9821-2885"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"R. Loxton","raw_affiliation_strings":["Department of Mathematics and Statistics, Curtin University, Perth, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Curtin University, Perth, Australia","institution_ids":["https://openalex.org/I205640436"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066144982"],"corresponding_institution_ids":["https://openalex.org/I205640436"],"apc_list":null,"apc_paid":null,"fwci":0.5658,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74879372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"2","first_page":"272","last_page":"289"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"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.9998000264167786,"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.9973999857902527,"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"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9882000088691711,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7127996683120728},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6714282631874084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6221445798873901},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6208090782165527},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5646890997886658},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4802280068397522},{"id":"https://openalex.org/keywords/fixed-cost","display_name":"Fixed cost","score":0.45644691586494446},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4527759850025177},{"id":"https://openalex.org/keywords/total-cost","display_name":"Total cost","score":0.4510284960269928},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44080185890197754},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3660420775413513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18966862559318542}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7127996683120728},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6714282631874084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6221445798873901},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6208090782165527},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5646890997886658},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4802280068397522},{"id":"https://openalex.org/C42866809","wikidata":"https://www.wikidata.org/wiki/Q466764","display_name":"Fixed cost","level":2,"score":0.45644691586494446},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4527759850025177},{"id":"https://openalex.org/C182299520","wikidata":"https://www.wikidata.org/wiki/Q1289588","display_name":"Total cost","level":2,"score":0.4510284960269928},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44080185890197754},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3660420775413513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18966862559318542},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"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/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2015.1062890","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1062890","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/37868","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/37868","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/37868/2/231778_231778.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"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":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/37868","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11937/37868","pdf_url":"https://espace.curtin.edu.au/bitstream/20.500.11937/37868/2/231778_231778.pdf","source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"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":"Journal Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.49000000953674316,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2265249259.pdf"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W37917650","https://openalex.org/W143070698","https://openalex.org/W1502364872","https://openalex.org/W1547192778","https://openalex.org/W1577352482","https://openalex.org/W1985658808","https://openalex.org/W1987999609","https://openalex.org/W2003102401","https://openalex.org/W2043341809","https://openalex.org/W2053744879","https://openalex.org/W2060387084","https://openalex.org/W2063520056","https://openalex.org/W2076616086","https://openalex.org/W2082353113","https://openalex.org/W2114286157","https://openalex.org/W2140514839","https://openalex.org/W2317695745","https://openalex.org/W4253187718"],"related_works":["https://openalex.org/W2983685817","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W134783735","https://openalex.org/W2365237642","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455","https://openalex.org/W1998320212","https://openalex.org/W2783359165"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,9,89,152],"fast":[4],"heuristic":[5,120,171],"algorithm":[6],"for":[7,97],"solving":[8],"combined":[10],"optimal":[11,28,147],"fleet":[12,29,78,148],"composition":[13],"and":[14,47,60,162,176],"multi-period":[15],"vehicle":[16,35,48,75,134],"routing":[17],"problem.":[18],"The":[19,51],"aim":[20],"of":[21,155,182],"the":[22,33,57,66,70,81,94,112,122,129,133,142,146],"problem":[23,82,99,123],"is":[24,101,157],"to":[25,37,42,104,151],"determine":[26],"an":[27],"mix,":[30],"together":[31],"with":[32,64],"corresponding":[34,150],"routes,":[36],"minimize":[38],"total":[39,52],"cost":[40,53],"subject":[41],"various":[43],"customer":[44],"delivery":[45],"requirements":[46,76],"capacity":[49],"constraints.":[50],"includes":[54],"not":[55],"only":[56],"fixed,":[58],"variable,":[59],"transportation":[61],"costs":[62,72],"associated":[63],"operating":[65],"fleet,":[67],"but":[68],"also":[69],"hiring":[71],"incurred":[73],"whenever":[74],"exceed":[77],"capacity.":[79],"Although":[80],"under":[83],"consideration":[84],"can":[85],"be":[86],"formulated":[87],"as":[88,111],"mixed-integer":[90],"linear":[91],"program":[92],"(MILP),":[93],"MILP":[95],"formulation":[96],"realistic":[98],"instances":[100],"too":[102],"large":[103],"solve":[105],"using":[106,138,159],"standard":[107],"commercial":[108],"solvers":[109],"such":[110],"IBM":[113],"ILOG":[114],"CPLEX":[115,179],"optimization":[116],"tool.":[117],"Our":[118],"proposed":[119],"decomposes":[121],"into":[124],"two":[125],"tractable":[126],"stages:":[127],"in":[128,141,180],"first":[130],"(outer)":[131],"stage,":[132,145],"routes":[135,156],"are":[136],"optimized":[137],"cross":[139],"entropy;":[140],"second":[143],"(inner)":[144],"mix":[149],"fixed":[153],"set":[154],"determined":[158],"dynamic":[160],"programming":[161],"golden":[163],"section":[164],"search.":[165],"Numerical":[166],"results":[167],"show":[168],"that":[169],"this":[170],"approach":[172],"generates":[173],"high-quality":[174],"solutions":[175],"significantly":[177],"outperforms":[178],"terms":[181],"computational":[183],"speed.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}