{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T04:11:30Z","timestamp":1773547890575,"version":"3.50.1"},"reference-count":11,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":6280,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1989,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Vehicle Scheduling Problem concerns the assigning of a set of time\u2010tabled trips to vehicles so as to minimize a given cost function. We consider the NP\u2010hard Multiple Depot case in which, in addition, one has to assign vehicles to depots. Different lower bounds based on assigment relaxation and on connectivity constraints are presented and combined in an effective bounding procedure. A strong dominance procedure derived from new dominance criteria also described. A branch and bound algorithm is finally proposed. Computational results are given.<\/jats:p>","DOI":"10.1002\/net.3230190505","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T03:28:34Z","timestamp":1178940514000},"page":"531-548","source":"Crossref","is-referenced-by-count":106,"title":["A branch and bound algorithm for the multiple depot vehicle scheduling problem"],"prefix":"10.1002","volume":"19","author":[{"given":"G.","family":"Carpaneto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Dell'amico","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Fischetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170303"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110204"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(83)90030-8"},{"key":"e_1_2_1_5_2","first-page":"47","article-title":"UCOST. A micro approach to a transit planning problem","volume":"5","author":"Bodin L.","year":"1978","journal-title":"J. Urban Anal."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.26.7.736"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90068-7"},{"key":"e_1_2_1_8_2","first-page":"121","article-title":"Optimization models in mass transit resources management","volume":"38","author":"Carraresi P.","year":"1986","journal-title":"Ricerca Operativa"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.2.319"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(88)90025-9"},{"key":"e_1_2_1_11_2","first-page":"97","volume-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","author":"Smith B.","year":"1981"},{"key":"e_1_2_1_12_2","first-page":"3","volume-title":"Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling","author":"Wren A.","year":"1981"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230190505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230190505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T08:43:46Z","timestamp":1697964226000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230190505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["10.1002\/net.3230190505"],"URL":"https:\/\/doi.org\/10.1002\/net.3230190505","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}