{"id":"https://openalex.org/W2790473805","doi":"https://doi.org/10.1080/01605682.2018.1447255","title":"Two heuristics for the capacitated minimum spanning tree problem with time windows","display_name":"Two heuristics for the capacitated minimum spanning tree problem with time windows","publication_year":2018,"publication_date":"2018-03-20","ids":{"openalex":"https://openalex.org/W2790473805","doi":"https://doi.org/10.1080/01605682.2018.1447255","mag":"2790473805"},"language":"en","primary_location":{"id":"doi:10.1080/01605682.2018.1447255","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2018.1447255","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-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/A5062572892","display_name":"Manolis N. Kritikos","orcid":"https://orcid.org/0000-0002-4687-4171"},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Manolis N. Kritikos","raw_affiliation_strings":["Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090518366","display_name":"George Ioannou","orcid":"https://orcid.org/0000-0002-6153-7712"},"institutions":[{"id":"https://openalex.org/I73142707","display_name":"Athens University of Economics and Business","ror":"https://ror.org/03s262162","country_code":"GR","type":"education","lineage":["https://openalex.org/I73142707"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"George Ioannou","raw_affiliation_strings":["Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Management Science Laboratory, Department of Management Science and Technology, Athens University of Economics and Business, Athens, Greece","institution_ids":["https://openalex.org/I73142707"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062572892"],"corresponding_institution_ids":["https://openalex.org/I73142707"],"apc_list":null,"apc_paid":null,"fwci":0.4866,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70392869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"70","issue":"4","first_page":"555","last_page":"567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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.9997000098228455,"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.9965000152587891,"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"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9747999906539917,"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/heuristics","display_name":"Heuristics","score":0.7491714954376221},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6842662692070007},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6374707818031311},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.568734884262085},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.562785267829895},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5400908589363098},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5095439553260803},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.49780917167663574},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46875524520874023},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46609652042388916},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.46443068981170654},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4090241491794586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28678154945373535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24675768613815308},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06316155195236206}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7491714954376221},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6842662692070007},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6374707818031311},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.568734884262085},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.562785267829895},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5400908589363098},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5095439553260803},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.49780917167663574},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46875524520874023},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46609652042388916},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.46443068981170654},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4090241491794586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28678154945373535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24675768613815308},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06316155195236206},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/01605682.2018.1447255","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01605682.2018.1447255","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:tjorxx:v:70:y:2019:i:4:p:555-567","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/01605682.2018.1447255","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1967987311","https://openalex.org/W1980076975","https://openalex.org/W1982713256","https://openalex.org/W2001126996","https://openalex.org/W2027278505","https://openalex.org/W2077823485","https://openalex.org/W2079583273","https://openalex.org/W2086725572","https://openalex.org/W2092700130","https://openalex.org/W2096305430","https://openalex.org/W2108270582","https://openalex.org/W2165842651","https://openalex.org/W2323511514","https://openalex.org/W2566560803","https://openalex.org/W4247609441","https://openalex.org/W4248274944"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2138987445","https://openalex.org/W1842018596","https://openalex.org/W4302939663"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,20,35,41,48,69,74,87,91,101,110,119,122],"capacitated":[3],"minimum":[4],"spanning":[5],"tree":[6],"problem":[7],"with":[8],"time":[9],"windows":[10],"(CMSTPTW)":[11],"and":[12,58,80],"propose":[13],"an":[14],"enhancement":[15],"of":[16,23,43,63,77,90,121],"greedy":[17],"heuristic":[18],"for":[19,61,73,118],"uncapacitated":[21,75],"version":[22,76],"it,":[24],"showing":[25],"that":[26],"our":[27,44],"algorithm":[28],"significantly":[29],"outperforms":[30],"Solomon\u2019s":[31],"one":[32],"based":[33],"on":[34],"R7":[36],"test":[37],"problem.":[38],"To":[39],"examine":[40],"performance":[42],"approach,":[45,100],"we":[46,67,71,95],"convert":[47],"vehicle":[49],"routing":[50],"data":[51,112],"sets":[52,113],"to":[53,85,109],"appropriately":[54],"model":[55],"CMSTPTW":[56,123],"instances":[57,79],"provide":[59],"solutions":[60,70,117],"all":[62,78],"them;":[64],"in":[65,115],"addition,":[66],"compare":[68],"reach":[72],"those":[81],"obtained":[82],"by":[83],"Solomon":[84],"demonstrate":[86],"consistent":[88],"superiority":[89],"proposed":[92],"method.":[93],"Finally,":[94],"develop":[96],"a":[97],"second":[98],"solution":[99],"local":[102],"domain":[103],"priority":[104],"heuristic,":[105],"which":[106],"when":[107],"applied":[108],"same":[111],"results":[114],"better":[116],"majority":[120],"instances,":[124],"without":[125],"excessive":[126],"computational":[127],"effort.":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}