{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:28:54Z","timestamp":1772807334104,"version":"3.50.1"},"reference-count":41,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0377-2217(99)00234-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"289-309","source":"Crossref","is-referenced-by-count":76,"title":["Planning models for long-haul operations of postal and express shipment companies"],"prefix":"10.1016","volume":"122","author":[{"given":"Tore","family":"Gr\u00fcnert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-J\u00fcrgen","family":"Sebastian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00234-9_BIB1","series-title":"Network Flows","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB2","unstructured":"A. Balakrishnan, T.L. Magnanti, P. Mirchandani, Network design, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, ch. 18, Wiley, Chichester, 1997, pp. 311\u2013334"},{"issue":"6","key":"10.1016\/S0377-2217(99)00234-9_BIB3","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1287\/opre.44.6.852","article-title":"Air network design for express shipment service","volume":"44","author":"Barnhart","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","article-title":"An algorithm for solving large capacitated warehouse location problems","volume":"33","author":"Beasley","year":"1988","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00234-9_BIB5","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/trsc.27.3.298","article-title":"Variable-depth search for the single-vehicle pickup and delivery problem with time windows","volume":"27","author":"van der Bruggen","year":"1993","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB6","unstructured":"K. B\u00fcdenbender, T. Gr\u00fcnert, H.-J. Sebastian, A tabu search algorithm for the direct flight network design problem, Technical Report, Department of Operations Research, RWTH Aachen, 1998"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB7","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0377-2217(91)90261-S","article-title":"A comparison of heuristics and relaxations for the capacitated plant location problem","volume":"50","author":"Cornuejols","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB8","unstructured":"CPLEX, Using the CPLEX Callable Library, version 5.0, Technical Report, CPLEX, Division of ILOG, 1997"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB9","unstructured":"T. Crainic, A. Frangioni, B. Gendron, Bundle-based relaxation methods for multicommodity capacitated network design, Technical Report, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montreal, 1998"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB10","doi-asserted-by":"crossref","unstructured":"T.G. Crainic, Service network design in freight transportation, European Journal of Operaions Research 122 (2000) this issue","DOI":"10.1016\/S0377-2217(99)00233-7"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0377-2217(96)00298-6","article-title":"Planning models for freight transportation","volume":"97","author":"Crainic","year":"1997","journal-title":"European Journal of Operaions Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00234-9_BIB12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0191-2615(86)90019-6","article-title":"Multicommodity multimode freight transportation: a general modeling and algorithmic framework for the network desgin problem","volume":"20B","author":"Crainic","year":"1986","journal-title":"Transportation Research. Part B"},{"issue":"4","key":"10.1016\/S0377-2217(99)00234-9_BIB13","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/trsc.26.4.280","article-title":"Design of regular intercity driver routes for the LTL motor carrier industry","volume":"26","author":"Crainic","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB14","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/S0377-2217(99)00234-9_BIB15","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1287\/trsc.21.4.227","article-title":"A review of empty flow and fleet management models in freight transportation","volume":"21","author":"Dejax","year":"1987","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB16","doi-asserted-by":"crossref","unstructured":"J. Desrosiers, Y. Dumas, M.M. Solomon, F. Soumis, Time constrained routing and scheduling, in: M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Eds), Handbooks in Operations Research and Management Science, vol. 8, Network Routing, ch. 2, Elsevier, Amsterdam, 1995, pp. 135\u2013139","DOI":"10.1016\/S0927-0507(05)80106-9"},{"issue":"3\/4","key":"10.1016\/S0377-2217(99)00234-9_BIB17","first-page":"301","article-title":"A dynamic programming solution of the large-scale single-vehicle dial-a-ride problem with time windows","volume":"6","author":"Desrosiers","year":"1986","journal-title":"American Journal of Mathematical and Management Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB18","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pick-up and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(99)00234-9_BIB19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/opre.43.2.231","article-title":"Arc routing problems. Part I: The Chinese postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00234-9_BIB20","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.43.3.399","article-title":"Arc routing problems. Part II: The rural postman problem","volume":"43","author":"Eiselt","year":"1995","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(99)00234-9_BIB21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.19.2.127","article-title":"Airline scheduling: An overview","volume":"19","author":"Etschmaier","year":"1988","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/S0377-2217(99)00234-9_BIB22","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/trsc.28.3.256","article-title":"Subgradient methods for the service network design problem","volume":"28","author":"Farvolden","year":"1994","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB23","unstructured":"B. Gendron, T. Crainic. Relaxations for multicommodity network design problems, Technical Report, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montreal, 1994"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB24","doi-asserted-by":"crossref","unstructured":"B. Gendron, T. Crainic, A. Frangioni, Multicommodity capacitated network design, in: B. Sanso, P. Soriano (Eds.), Telecommunications Network Planning, Kluwer Academic Publishers, Norwell, MA, 1998","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB25","doi-asserted-by":"crossref","unstructured":"T. Gr\u00fcnert, H.-J. Sebastian, M. Th\u00e4rigen, The design of a letter-mail transportation network by intelligent techniques, in: R. Sprague (Ed.), Proceedings of the Hawaii International Conference on System Sciences, 1999","DOI":"10.1109\/HICSS.1999.772628"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB26","unstructured":"K. Holmberg, D. Yuan. A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem, Technical Report, Department of Mathematics, Institute of Technology, Link\u00f6ping, 1986"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB27","unstructured":"S. Irnich. A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles, Technical Report, Department of Operations Research, RWTH Aachen, 1998"},{"issue":"2","key":"10.1016\/S0377-2217(99)00234-9_BIB28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.26.2.69","article-title":"An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints","volume":"26","author":"Koskosidis","year":"1992","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S0377-2217(99)00234-9_BIB29","first-page":"1","article-title":"The hub network design problem with stopovers and feeders: The case of federal express","volume":"27A","author":"Kuby","year":"1993","journal-title":"Transportation Research. Part A"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB30","unstructured":"M. Labb\u00e9, F.V. Louveaux, Location problems, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, ch. 16, Wiley, Chichester, 1997, pp. 261\u2013281"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/S0377-2217(99)00234-9_BIB32","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","article-title":"Optimal routing under capacity and distance restrictions","volume":"33","author":"Laporte","year":"1985","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/S0377-2217(99)00234-9_BIB33","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0191-2615(85)90052-9","article-title":"A warehouse location-routing problem","volume":"19B","author":"Perl","year":"1985","journal-title":"Transportation Research. Part B"},{"issue":"2","key":"10.1016\/S0377-2217(99)00234-9_BIB34","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/trsc.14.2.130","article-title":"A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem","volume":"14","author":"Psaraftis","year":"1980","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB35","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","article-title":"A column generation approach to the multiple depot vehicle scheduling problem","volume":"42","author":"Ribeiro","year":"1994","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(99)00234-9_BIB36","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1287\/inte.22.3.31","article-title":"Improving intercity freight routing with a tactical planning model","volume":"22","author":"Roy","year":"1992","journal-title":"Interfaces"},{"issue":"1","key":"10.1016\/S0377-2217(99)00234-9_BIB37","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1985","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/S0377-2217(99)00234-9_BIB38","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","article-title":"Drive dynamic routing of independent vehicles","volume":"46","author":"Savelsbergh","year":"1998","journal-title":"Operations Research"},{"issue":"3\/4","key":"10.1016\/S0377-2217(99)00234-9_BIB39","first-page":"369","article-title":"Pickup and delivery of partial loads with soft time windows","volume":"6","author":"Sexton","year":"1986","journal-title":"American Journal of Mathematical and Management Science"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB40","unstructured":"H. Wilson, J. Sussman, H. Wang, B. Higonnet, Scheduling algorithms for dial-a-ride systems, Technical Report, Urban Systems Laboratory Report USL TR-70-13, MIT, 1971"},{"key":"10.1016\/S0377-2217(99)00234-9_BIB41","doi-asserted-by":"crossref","unstructured":"H.-J. Zimmermann, Fuzzy mathematical programming, in: T. Gal, H.J. Greenberg (Eds.), Advances in Sensitivity Analysis and Parametric Programming, ch. 15, Kluwer Academic Publishers, Boston, 1997, pp. 1\u201340","DOI":"10.1007\/978-1-4615-6103-3_15"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002349?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799002349?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:00:00Z","timestamp":1579024800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799002349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0377221799002349"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00234-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}