{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:52:59Z","timestamp":1757616779019,"version":"3.44.0"},"reference-count":22,"publisher":"Emerald","issue":"2-3","license":[{"start":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T00:00:00Z","timestamp":1302912000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Logist. Res."],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s12159-011-0055-8","type":"journal-article","created":{"date-parts":[[2011,4,15]],"date-time":"2011-04-15T05:58:36Z","timestamp":1302847116000},"page":"121-132","source":"Crossref","is-referenced-by-count":4,"title":["Multicriteria decentralized decision making in logistic chains: a dynamic programming approach for collaborative forwarding of air cargo freight"],"prefix":"10.1108","volume":"3","author":[{"given":"Martin","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schr\u00f6der","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2011,4,16]]},"reference":[{"issue":"3","key":"55_CR1","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1109\/TAC.1982.1102987","volume":"27","author":"J Abram","year":"1982","unstructured":"Abram J, Rhodes I (1982) Some shortest path algorithms with decentralized information and communication requirements. IEEE Trans Autom Control 27(3):570\u2013582. doi: 10.1109\/tac.1982.1102987","journal-title":"IEEE Trans Autom Control"},{"issue":"1","key":"55_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"JA Azevedo","year":"1993","unstructured":"Azevedo JA, Costa MEOS, Madeira JJERS, Martins EQV (1993) An algorithm for the ranking of shortest paths. Eur J Oper Res 69(1):97\u2013106. doi: 10.1016\/0377-2217(93)90095-5","journal-title":"Eur J Oper Res"},{"issue":"1","key":"55_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s00291-005-0019-y","volume":"29","author":"P Bartodziej","year":"2007","unstructured":"Bartodziej P, Derigs U, Zils M (2007) O&D revenue management in cargo airlines\u2014a mathematical programming approach. OR Spectr 29(1):105\u2013121. doi: 10.1007\/s00291-005-0019-y","journal-title":"OR Spectr"},{"issue":"3","key":"55_CR4","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas DP, Tsitsiklis JN (1991) An analysis of stochastic shortest path problems. Math Oper Res 16(3):580\u2013595. doi: 10.1287\/moor.16.3.580","journal-title":"Math Oper Res"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"Cho J, Kim H, Choi H (2010) An intermodal transport network planning algorithm using dynamic programming\u2014a case study: from Busan to Rotterdam in intermodal freight routing. Appl Intell 1\u201313. doi: 10.1007\/s10489-010-0223-6","DOI":"10.1007\/s10489-010-0223-6"},{"key":"55_CR6","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. 2nd edn. MIT Press, Cambridge","edition":"2"},{"key":"55_CR7","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","volume":"26","author":"JM Coutinho-Rodrigues","year":"1999","unstructured":"Coutinho-Rodrigues JM, Cl\u00edmaco JCN, Current JR (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput Oper Res 26:789\u2013798. doi: 10.1016\/s0305-0548(98)00094-x","journal-title":"Comput Oper Res"},{"key":"55_CR8","unstructured":"Crainic T (2003) Handbook of transportation science. In: International Ser Oper Res Management Sci, vol 56, 2nd edn. Chap. Long Haul Freight Transportation. Springer, New York, pp 451\u2013516"},{"issue":"3","key":"55_CR9","first-page":"191","volume":"26","author":"M Desrochers","year":"1988","unstructured":"Desrochers M, Soumis F (1988) A generalized permanent labelling algorithm for the shortest path problem with time windows. IFOR 26(3):191\u2013212","journal-title":"IFOR"},{"key":"55_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-76862-3_1","volume-title":"Dynamics in logistics","author":"NA Duffie","year":"2008","unstructured":"Duffie NA (2008) Challenges in design of heterarchical controls for dynamic logistic systems. In: Kreowski HJ, Scholz-Reiter B, Haasis HD (eds) Dynamics in logistics. Springer, Berlin, pp 3\u201324. doi: 10.1007\/978-3-540-76862-3"},{"issue":"2","key":"55_CR11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0377-2217(99)00234-9","volume":"122","author":"T Gr\u00fcnert","year":"2000","unstructured":"Gr\u00fcnert T, Sebastian HJ (2000) Planning models for long-haul operations of postal and express shipment companies. Eur J Oper Res 122(2):289\u2013309. doi: 10.1016\/s0377-2217(99)00234-9","journal-title":"Eur J Oper Res"},{"volume-title":"Understanding autonomous cooperation & control in logistics\u2014the impact on management, information and communication and material flow","year":"2007","key":"55_CR12","unstructured":"H\u00fclsmann M, Windt K (eds) (2007) Understanding autonomous cooperation & control in logistics\u2014the impact on management, information and communication and material flow. Springer, Berlin"},{"issue":"3","key":"55_CR13","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1016\/j.ejor.2010.06.035","volume":"207","author":"M Iori","year":"2010","unstructured":"Iori M, Martello S, Pretolani D (2010) An aggregate label setting policy for the multi-objective shortest path problem. Eur J Oper Res 207(3):1489\u20131496. doi: 10.1016\/j.ejor.2010.06.035","journal-title":"Eur J Oper Res"},{"issue":"2","key":"55_CR14","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1016\/j.ejor.2008.06.042","volume":"197","author":"M Krajewska","year":"2009","unstructured":"Krajewska M, Kopfer H (2009) Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res 197(2):741\u2013751","journal-title":"Eur J Oper Res"},{"issue":"11","key":"55_CR15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/mnsc.44.11.S125","volume":"44","author":"I Murthy","year":"1998","unstructured":"Murthy I, Sarkar S (1998) Stochastic shortest path problems with piecewise-linear concave utility functions. Manag Sci 44(11):125\u2013136. doi: 10.1287\/mnsc.44.11.s125","journal-title":"Manag Sci"},{"key":"55_CR16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-85646-7_6","volume-title":"Multiobjective programming and goal programming, Lecture Notes in Economics and Mathematical Systems","author":"LR Nielsen","year":"2009","unstructured":"Nielsen LR, Pretolani D, Andersen KA (2009) Bicriterion shortest paths in stochastic time-dependent networks. In: Barichard V, Ehrgott M, Gandibleux X, Tkindt V (eds) Multiobjective programming and goal programming, Lecture Notes in Economics and Mathematical Systems. vol 618, Springer, Berlin, pp 57\u201367"},{"key":"55_CR17","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.1016\/j.cor.2008.02.002","volume":"36","author":"A Raith","year":"2009","unstructured":"Raith A, Ehrgott M (2009) A comparison of solution strategies for biobjective shortest path problems. Comput Oper Res 36:1299\u20131331. doi: 10.1016\/j.cor.2008.02.002","journal-title":"Comput Oper Res"},{"key":"55_CR18","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.cor.2010.08.003","volume":"38","author":"LB Reinhardt","year":"2011","unstructured":"Reinhardt LB, Pisinger D (2011) Multi-objective and multi-constrained non-additive shortest path problems. Comput Oper Res 38:605\u2013616. doi: 10.1016\/j.cor.2010.08.003","journal-title":"Comput Oper Res"},{"key":"55_CR19","volume-title":"Operational freight carrier planning: basic concepts, optimization models and advanced memetic algorithms","author":"J Sch\u00f6nberger","year":"2005","unstructured":"Sch\u00f6nberger J (2005) Operational freight carrier planning: basic concepts, optimization models and advanced memetic algorithms. 1st edn. Springer, Berlin","edition":"1"},{"key":"55_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.2478\/v10006-007-0023-2","volume":"17","author":"Z Tarapata","year":"2007","unstructured":"Tarapata Z (2007) Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms. Int J Appl Math Comput Sci 17:269\u2013287. doi: 10.2478\/v10006-007-0023-2","journal-title":"Int J Appl Math Comput Sci"},{"key":"55_CR21","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s001860100169","volume":"54","author":"K Wakuta","year":"2001","unstructured":"Wakuta K (2001) A multi-objective shortest path problem. Math Meth Oper Res 54:445\u2013454. doi: 10.1007\/s001860100169","journal-title":"Math Meth Oper Res"},{"key":"55_CR22","doi-asserted-by":"crossref","unstructured":"Wu Y (2010) Modeling of containerized air cargo forwarding problems under uncertainty. J Oper Res Soc (to appear). doi: 10.1057\/jors.2010.84","DOI":"10.1057\/jors.2010.84"}],"container-title":["Logistics Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12159-011-0055-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12159-011-0055-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12159-011-0055-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T20:32:41Z","timestamp":1757104361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12159-011-0055-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,16]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["55"],"URL":"https:\/\/doi.org\/10.1007\/s12159-011-0055-8","relation":{},"ISSN":["1865-035X","1865-0368"],"issn-type":[{"type":"print","value":"1865-035X"},{"type":"electronic","value":"1865-0368"}],"subject":[],"published":{"date-parts":[[2011,4,16]]}}}