{"id":"https://openalex.org/W2023589711","doi":"https://doi.org/10.1002/net.3230190505","title":"A branch and bound algorithm for the multiple depot vehicle scheduling problem","display_name":"A branch and bound algorithm for the multiple depot vehicle scheduling problem","publication_year":1989,"publication_date":"1989-08-01","ids":{"openalex":"https://openalex.org/W2023589711","doi":"https://doi.org/10.1002/net.3230190505","mag":"2023589711"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230190505","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230190505","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5085840667","display_name":"G. Carpaneto","orcid":null},"institutions":[{"id":"https://openalex.org/I122346577","display_name":"University of Modena and Reggio Emilia","ror":"https://ror.org/02d4c4y02","country_code":"IT","type":"education","lineage":["https://openalex.org/I122346577"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"G. Carpaneto","raw_affiliation_strings":["Dipartimento di Economia Politica, University of Modena, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Economia Politica, University of Modena, Italy","institution_ids":["https://openalex.org/I122346577"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086489073","display_name":"Mauro Dell\u2019Amico","orcid":"https://orcid.org/0000-0002-3283-6131"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Dell'amico","raw_affiliation_strings":["DEIS, University of Bologna, Italy","[DEIS University of Bologna, Italy]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"[DEIS University of Bologna, Italy]","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019439480","display_name":"Matteo Fischetti","orcid":"https://orcid.org/0000-0001-6601-0568"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"M. Fischetti","raw_affiliation_strings":["DEIS, University of Bologna, Italy","[DEIS University of Bologna, Italy]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"[DEIS University of Bologna, Italy]","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084320669","display_name":"Paolo Toth","orcid":"https://orcid.org/0000-0001-6846-5814"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P. Toth","raw_affiliation_strings":["DEIS, University of Bologna, Italy","[DEIS University of Bologna, Italy]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"[DEIS University of Bologna, Italy]","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":6.6347,"has_fulltext":false,"cited_by_count":142,"citation_normalized_percentile":{"value":0.95858202,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"19","issue":"5","first_page":"531","last_page":"548"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9994999766349792,"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.9987999796867371,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9957000017166138,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.8267626166343689},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6318846940994263},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6027027368545532},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5990268588066101},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.580689013004303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4866829514503479},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4861311614513397},{"id":"https://openalex.org/keywords/dominance","display_name":"Dominance (genetics)","score":0.4171752333641052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.300045907497406}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.8267626166343689},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6318846940994263},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6027027368545532},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5990268588066101},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.580689013004303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4866829514503479},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4861311614513397},{"id":"https://openalex.org/C151913843","wikidata":"https://www.wikidata.org/wiki/Q3454555","display_name":"Dominance (genetics)","level":3,"score":0.4171752333641052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.300045907497406},{"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230190505","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230190505","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:www.research.unipd.it:11577/2499240","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2499240","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W15274158","https://openalex.org/W574510877","https://openalex.org/W1982444996","https://openalex.org/W2000200530","https://openalex.org/W2017548615","https://openalex.org/W2063961786","https://openalex.org/W2078928589","https://openalex.org/W2140784080","https://openalex.org/W2789334210","https://openalex.org/W4254510866"],"related_works":["https://openalex.org/W2132137594","https://openalex.org/W2069783012","https://openalex.org/W2085967955","https://openalex.org/W3146908064","https://openalex.org/W4256335355","https://openalex.org/W3098612666","https://openalex.org/W2235461833","https://openalex.org/W197700457","https://openalex.org/W2138867060","https://openalex.org/W2182290077"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Vehicle":[2],"Scheduling":[3],"Problem":[4],"concerns":[5],"the":[6,26],"assigning":[7],"of":[8,11],"a":[9,20],"set":[10],"time\u2010tabled":[12],"trips":[13],"to":[14,18,37,40],"vehicles":[15,39],"so":[16],"as":[17],"minimize":[19],"given":[21],"cost":[22],"function.":[23],"We":[24],"consider":[25],"NP\u2010hard":[27],"Multiple":[28],"Depot":[29],"case":[30],"in":[31,33,57],"which,":[32],"addition,":[34],"one":[35],"has":[36],"assign":[38],"depots.":[41],"Different":[42],"lower":[43],"bounds":[44],"based":[45],"on":[46,50],"assigment":[47],"relaxation":[48],"and":[49,55,75],"connectivity":[51],"constraints":[52],"are":[53,83],"presented":[54],"combined":[56],"an":[58],"effective":[59],"bounding":[60],"procedure.":[61],"A":[62,73],"strong":[63],"dominance":[64,69],"procedure":[65],"derived":[66],"from":[67],"new":[68],"criteria":[70],"also":[71],"described.":[72],"branch":[74],"bound":[76],"algorithm":[77],"is":[78],"finally":[79],"proposed.":[80],"Computational":[81],"results":[82],"given.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}