{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:04:15Z","timestamp":1743055455663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030918842"},{"type":"electronic","value":"9783030918859"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91885-9_5","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T13:03:12Z","timestamp":1638450192000},"page":"56-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inverse Optimization for\u00a0Warehouse Management"],"prefix":"10.1007","author":[{"given":"Hannu","family":"Rummukainen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"issue":"5","key":"5_CR1","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja, R.K., Orlin, J.B.: Inverse optimization. Oper. Res. 49(5), 771\u2013783 (2001)","journal-title":"Oper. Res."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Doshi, P.: A survey of inverse reinforcement learning: challenges, methods and progress (2020). arXiv:1806.06877","DOI":"10.1016\/j.artint.2021.103500"},{"issue":"3","key":"5_CR3","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1287\/opre.2017.1705","volume":"66","author":"A Aswani","year":"2018","unstructured":"Aswani, A., Shen, Z.J., Siddiq, A.: Inverse optimization with noisy data. Oper. Res. 66(3), 870\u2013892 (2018)","journal-title":"Oper. Res."},{"key":"5_CR4","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1504\/IJSTL.2009.021974","volume":"1","author":"L Chen","year":"2009","unstructured":"Chen, L., Riopel, D., Langevin, A.: Minimising the peak load in a shared storage system based on the duration-of-stay of unit loads. Int. J. Shipp. Transp. Logist. 1(1), 20\u201336 (2009)","journal-title":"Int. J. Shipp. Transp. Logist."},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ejor.2006.07.009","volume":"182","author":"R De Koster","year":"2007","unstructured":"De Koster, R., Le-Duc, T., Roodbergen, K.J.: Design and control of warehouse order picking: a literature review. Eur. J. Oper. Res. 182(2), 481\u2013501 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"9","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1287\/mnsc.36.9.1120","volume":"36","author":"M Goetschalckx","year":"1990","unstructured":"Goetschalckx, M., Ratliff, H.D.: Shared storage policies based on the duration stay of unit loads. Manage. Sci. 36(9), 1120\u20131132 (1990)","journal-title":"Manage. Sci."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2006.02.025","volume":"177","author":"J Gu","year":"2007","unstructured":"Gu, J., Goetschalckx, M., McGinnis, L.F.: Research on warehouse operation: a comprehensive review. Eur. J. Oper. Res. 177, 1\u201321 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.02.025","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s00291-008-0127-6","volume":"30","author":"Y Han","year":"2008","unstructured":"Han, Y., Lee, L.H., Chew, E.P., Tan, K.C.: A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectr. 30, 697\u2013720 (2008). https:\/\/doi.org\/10.1007\/s00291-008-0127-6","journal-title":"OR Spectr."},{"issue":"6","key":"5_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1287\/mnsc.22.6.629","volume":"22","author":"WH Hausman","year":"1976","unstructured":"Hausman, W.H., Schwarz, L.B., Graves, S.C.: Optimal storage assignment in automatic warehousing systems. Manage. Sci. 22(6), 629\u2013638 (1976)","journal-title":"Manage. Sci."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"2957","DOI":"10.1007\/s00453-017-0363-8","volume":"80","author":"N Kamiyama","year":"2018","unstructured":"Kamiyama, N.: A note on submodular function minimization with covering type linear constraints. Algorithmica 80, 2957\u20132971 (2018)","journal-title":"Algorithmica"},{"issue":"3","key":"5_CR12","first-page":"111","volume":"2","author":"J Kar\u00e1sek","year":"2013","unstructured":"Kar\u00e1sek, J.: An overview of warehouse optimization. Int. J. Adv. Telecommun. Electrotech. Sig. Syst. 2(3), 111\u2013117 (2013)","journal-title":"Int. J. Adv. Telecommun. Electrotech. Sig. Syst."},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1080\/0020772031000115533","volume":"34","author":"KH Kim","year":"2003","unstructured":"Kim, K.H., Park, K.T.: Dynamic space allocation for temporary storage. Int. J. Syst. Sci. 34(1), 11\u201320 (2003)","journal-title":"Int. J. Syst. Sci."},{"key":"5_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-319-15720-7_29","volume-title":"Computational Intelligence and Efficiency in Engineering Systems","author":"M Kofler","year":"2015","unstructured":"Kofler, M., Beham, A., Wagner, S., Affenzeller, M.: Robust storage assignment in warehouses with correlated demand. In: Borowik, G., Chaczko, Z., Jacak, W., \u0141uba, T. (eds.) Computational Intelligence and Efficiency in Engineering Systems. SCI, vol. 595, pp. 415\u2013428. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15720-7_29"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s00291-006-0045-4","volume":"28","author":"LH Lee","year":"2006","unstructured":"Lee, L.H., Chew, E.P., Tan, K.C., Han, Y.: An optimization model for storage yard management in transshipment hubs. OR Spectr. 28, 539\u2013561 (2006)","journal-title":"OR Spectr."},{"issue":"9","key":"5_CR16","doi-asserted-by":"publisher","first-page":"2670","DOI":"10.1016\/j.cor.2008.11.022","volume":"36","author":"L Moccia","year":"2009","unstructured":"Moccia, L., Cordeau, J.F., Monaco, M.F., Sammarra, M.: A column generation heuristic for dynamic generalized assignment problem. Comput. Oper. Res. 36(9), 2670\u20132681 (2009). https:\/\/doi.org\/10.1016\/j.cor.2008.11.022","journal-title":"Comput. Oper. Res."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.ejor.2014.05.030","volume":"239","author":"MF Monaco","year":"2014","unstructured":"Monaco, M.F., Sammarra, M., Sorrentino, G.: The terminal-oriented ship stowage planning problem. Eur. J. Oper. Res. 239, 256\u2013265 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.omega.2007.01.006","volume":"36","author":"VR Muppani","year":"2008","unstructured":"Muppani, V.R., Adil, G.K.: Efficient formation of storage classes for warehouse storage location assignment: a simulated annealing approach. Omega 36, 609\u2013618 (2008)","journal-title":"Omega"},{"issue":"14","key":"5_CR19","doi-asserted-by":"publisher","first-page":"4035","DOI":"10.1080\/00207543.2016.1244615","volume":"55","author":"KW Pang","year":"2017","unstructured":"Pang, K.W., Chan, H.L.: Data mining-based algorithm for storage location assignment in a randomised warehouse. Int. J. Prod. Res. 55(14), 4035\u20134052 (2017). https:\/\/doi.org\/10.1080\/00207543.2016.1244615","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"5_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.9744\/jti.5.1.1-12","volume":"5","author":"B Pierre","year":"2003","unstructured":"Pierre, B., Vannieuwenhuyse, B., Domnianta, D., Dessel, H.V.: Dynamic ABC storage policy in erratic demand environments. Jurnal Teknik Industri 5(1), 1\u201312 (2003)","journal-title":"Jurnal Teknik Industri"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0377-2217(99)00020-X","volume":"122","author":"B Rouwenhorst","year":"2000","unstructured":"Rouwenhorst, B., Reuter, B., Stockrahm, V., van Houtum, G.J., Mantel, R.J., Zijm, W.H.M.: Warehouse design and control: framework and literature review. Eur. J. Oper. Res. 122, 515\u2013533 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s11590-009-0131-z","volume":"3","author":"AJ Schaefer","year":"2009","unstructured":"Schaefer, A.J.: Inverse integer programming. Optim. Lett. 3, 483\u2013489 (2009)","journal-title":"Optim. Lett."},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/mnsc.1050.0445","volume":"52","author":"MD Troutt","year":"2006","unstructured":"Troutt, M.D., Pang, W.K., Hou, S.H.: Behavioral estimation of mathematical programming objective function coefficients. Manage. Sci. 52(3), 422\u2013434 (2006)","journal-title":"Manage. Sci."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1016\/j.trb.2015.12.006","volume":"93","author":"L Zhen","year":"2016","unstructured":"Zhen, L., Xu, Z., Wang, K., Ding, Y.: Multi-period yard template planning in container terminals. Transp. Res. Part B 93, 700\u2013719 (2016)","journal-title":"Transp. Res. Part B"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91885-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T14:09:11Z","timestamp":1699884551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91885-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030918842","9783030918859"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91885-9_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bragan\u00e7a","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt\/EN_index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"134","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}