{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T16:37:36Z","timestamp":1771864656079,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:00:00Z","timestamp":1660348800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:00:00Z","timestamp":1660348800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11590-022-01912-7","type":"journal-article","created":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T15:02:54Z","timestamp":1660402974000},"page":"1049-1068","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Conveyor operations in distribution centers: modeling and optimization"],"prefix":"10.1007","volume":"17","author":[{"given":"Farzaneh","family":"Karami","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3476-4722","authenticated-orcid":false,"given":"Mahdi","family":"Fathi","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,13]]},"reference":[{"key":"1912_CR1","unstructured":"(2017). The State of Ecommerce Order Fulfillment & Shipping"},{"key":"1912_CR2","unstructured":"(2019). 5 ways to shorten last mile delivery"},{"issue":"3\u20134","key":"1912_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G Baier","year":"2005","unstructured":"Baier, G., K\u00f6hler, E., Skutella, M.: The k-splittable flow problem. Algorithmica 42(3\u20134), 231\u2013248 (2005)","journal-title":"Algorithmica"},{"key":"1912_CR4","doi-asserted-by":"crossref","unstructured":"Boysen, N., Briskorn, D., Fedtke, S., and Schmickerath, M.: Automated sortation conveyors: A survey from an operational research perspective (2018). EJOR","DOI":"10.1016\/j.ejor.2018.08.014"},{"key":"1912_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2020.102192","volume":"106","author":"T-L Chen","year":"2021","unstructured":"Chen, T.-L., Chen, J.C., Huang, C.-F., Chang, P.-C.: Solving the layout design problem by simulation-optimization approach-a case study on a sortation conveyor system. Simul. Modell. Pract Theory 106, 102192 (2021)","journal-title":"Simul. Modell. Pract Theory"},{"issue":"2","key":"1912_CR6","first-page":"153","volume":"17","author":"YL Chen","year":"1990","unstructured":"Chen, Y.L., Chin, Y.H.: The quickest path problem. COR 17(2), 153\u2013161 (1990)","journal-title":"The quickest path problem. COR"},{"issue":"3","key":"1912_CR7","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.013","volume":"181","author":"JCN Cl\u00edmaco","year":"2007","unstructured":"Cl\u00edmaco, J.C.N., Pascoal, M.M.B., Craveirinha, J.M.F., Captivo, M.E.V.: Internet packet routing: application of a k-quickest path algorithm. Eur. J. Op. Res. 181(3), 1045\u20131054 (2007)","journal-title":"Eur. J. Op. Res."},{"issue":"1","key":"1912_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/trsc.2014.0540","volume":"51","author":"S Fedtke","year":"2017","unstructured":"Fedtke, S., Boysen, N.: Layout planning of sortation conveyors in parcel distribution centers. Transport. Sci. 51(1), 3\u201318 (2017)","journal-title":"Transport. Sci."},{"issue":"3","key":"1912_CR9","first-page":"115","volume":"38","author":"LK Fleischer","year":"2001","unstructured":"Fleischer, L.K.: Universally maximum flow with piecewise-constant capacities. Netw. An Int. J 38(3), 115\u2013125 (2001)","journal-title":"Netw. An Int. J"},{"key":"1912_CR10","first-page":"22","volume":"276","author":"JLR Ford","year":"1962","unstructured":"Ford, J.L.R., Fulkerson, D.R.: Flows in networks princeton university press. Princet. New Jersey 276, 22 (1962)","journal-title":"Princet. New Jersey"},{"issue":"1","key":"1912_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1007445629340","volume":"30","author":"ME Johnson","year":"1997","unstructured":"Johnson, M.E.: The impact of sorting strategies on automated sortation system performance. IIE trans. 30(1), 67\u201377 (1997)","journal-title":"IIE trans."},{"key":"1912_CR12","unstructured":"Kappmeier, J.-P.: Generalizations of flows over time with applications in evacuation optimization. epubli (2015)"},{"key":"1912_CR13","unstructured":"Kolliopoulos, S.\u00a0G. (2018). Disjoint paths and unsplittable flow"},{"key":"1912_CR14","doi-asserted-by":"crossref","unstructured":"Martens, M. and Skutella, M.: Length-bounded and dynamic k-splittable flows. In Operations Research Proceedings 2005, pages 297\u2013302(2006) Springer","DOI":"10.1007\/3-540-32539-5_47"},{"key":"1912_CR15","first-page":"756","volume":"10","author":"A Melchiori","year":"2015","unstructured":"Melchiori, A., Sgalambro, A.: Optimizing emergency transportation through multicommodity quickest paths. Trans. Res. Proc. 10, 756\u2013765 (2015)","journal-title":"Trans. Res. Proc."},{"key":"1912_CR16","doi-asserted-by":"crossref","unstructured":"Mor, A., Speranza, M. G.: Vehicle routing problems over time: a survey. Annals of Operations Research, pages 1\u201321(2022)","DOI":"10.1007\/s10479-021-04488-0"},{"issue":"2","key":"1912_CR17","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s11750-007-0033-0","volume":"15","author":"M Pascoal","year":"2007","unstructured":"Pascoal, M., Captivo, M., Cl\u00edmaco, J.: Computational experiments with a lazy version of a k quickest simple path ranking algorithm. Top 15(2), 372\u2013382 (2007)","journal-title":"Top"},{"issue":"1","key":"1912_CR18","first-page":"1","volume":"22","author":"K Salimifard","year":"2022","unstructured":"Salimifard, K., Bigharaz, S.: The multicommodity network flow problem: state of the art classification, applications, and solution methods. Op. Res. 22(1), 1\u201347 (2022)","journal-title":"Op. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01912-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01912-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01912-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,12]],"date-time":"2023-04-12T13:19:14Z","timestamp":1681305554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01912-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,13]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1912"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01912-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,13]]},"assertion":[{"value":"29 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}