{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:09:12Z","timestamp":1745467752855,"version":"3.40.4"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031838873","type":"print"},{"value":"9783031838859","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-83885-9_23","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:33:50Z","timestamp":1745397230000},"page":"252-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Handling Uncertainties on\u00a0the\u00a0Right-Hand Side of\u00a0a\u00a0Classical Transportation Model by\u00a0Stochastic Optimisation and\u00a0a\u00a0Matheuristic Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0383-0379","authenticated-orcid":false,"given":"Abtin","family":"Nourmohammadzadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Abdelati, M.H., Khalil, M.I., Abdelgawwad, K.A., Rabie, M.: Alternative algorithms for solving classical transportation problems. J. Adv. Eng. Trends 39(1), 13\u201321 (2020). https:\/\/doi.org\/10.21608\/jaet.2020.73323","DOI":"10.21608\/jaet.2020.73323"},{"key":"23_CR2","doi-asserted-by":"publisher","unstructured":"Arsham, H., Kahn, A.: A refined simplex algorithm for the classical transportation problem with application to parametric analysis. Math. Comput. Model. 12(8), 1035\u20131044 (1989). https:\/\/doi.org\/10.1016\/0895-7177(89)90209-4","DOI":"10.1016\/0895-7177(89)90209-4"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/s0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999). https:\/\/doi.org\/10.1016\/s0167-6377(99)00016-4","journal-title":"Oper. Res. Lett."},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-52307-6_8","volume-title":"Multiple Hypothesenpr\u00fcfung \/ Multiple Hypotheses Testing","author":"B Bergmann","year":"1988","unstructured":"Bergmann, B., Hommel, G.: Improvements of general multiple test procedures for redundant systems of hypotheses. In: Bauer, P., Hommel, G., Sonnemann, E. (eds.) Multiple Hypothesenpr\u00fcfung \/ Multiple Hypotheses Testing, pp. 100\u2013115. Springer, Berlin, Heidelberg (1988). https:\/\/doi.org\/10.1007\/978-3-642-52307-6_8"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1016\/j.eswa.2009.06.048","volume":"37","author":"A Chen","year":"2010","unstructured":"Chen, A., Kim, J., Lee, S., Kim, Y.: Stochastic multi-objective models for network design problem. Expert Syst. Appl. 37(2), 1608\u20131619 (2010). https:\/\/doi.org\/10.1016\/j.eswa.2009.06.048","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3\u201318 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol. Comput."},{"key":"23_CR7","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2021). https:\/\/www.gurobi.com\/?s=optimizer+reference+manual"},{"key":"23_CR8","doi-asserted-by":"publisher","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.: Variable neighbourhood search: methods and applications. 4OR 6(4), 319\u2013360 (2008). https:\/\/doi.org\/10.1007\/s10288-008-0089-1","DOI":"10.1007\/s10288-008-0089-1"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley (2003). https:\/\/doi.org\/10.1002\/0471671746","DOI":"10.1002\/0471671746"},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Hitchcock, F.L.: The distribution of a product from several sources to numerous localities. J. Math. Phys. 20(1\u20134), 224\u2013230 (1941). https:\/\/doi.org\/10.1002\/sapm1941201224","DOI":"10.1002\/sapm1941201224"},{"key":"23_CR11","doi-asserted-by":"publisher","unstructured":"Hussein, H.A., Shiker, M.A.K., Zabiba, M.S.M.: A new revised efficient of VAM to find the initial solution for the transportation problem. J. Phys: Conf. Ser. 1591(1), 012032 (2020). https:\/\/doi.org\/10.1088\/1742-6596\/1591\/1\/012032","DOI":"10.1088\/1742-6596\/1591\/1\/012032"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Intrator, J., Paroush, J.: Sensitivity analysis of the classical transportation problem. A combinatorial approach. Comput. Oper. Res. 4(3), 213\u2013226 (1977). https:\/\/doi.org\/10.1016\/0305-0548(77)90016-8","DOI":"10.1016\/0305-0548(77)90016-8"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 63\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05983-5_5","DOI":"10.1007\/978-3-030-05983-5_5"},{"issue":"3","key":"23_CR14","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/18m1174428","volume":"33","author":"Y Kawase","year":"2019","unstructured":"Kawase, Y., Sumita, H., Fukunaga, T.: Submodular maximization with uncertain knapsack capacity. SIAM J. Discret. Math. 33(3), 1121\u20131145 (2019). https:\/\/doi.org\/10.1137\/18m1174428","journal-title":"SIAM J. Discret. Math."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"136","DOI":"10.2307\/1907301","volume":"17","author":"TC Koopmans","year":"1949","unstructured":"Koopmans, T.C.: Optimum utilization of the transportation system. Econometrica 17, 136\u2013146 (1949). https:\/\/doi.org\/10.2307\/1907301","journal-title":"Econometrica"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Kumar, A., Kaur, A.: Application of classical transportation methods to find the fuzzy optimal solution of fuzzy transportation problems. Fuzzy Inf. Eng. 3(1), 81\u201399 (2011). https:\/\/doi.org\/10.1007\/s12543-011-0068-7","DOI":"10.1007\/s12543-011-0068-7"},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-010-9645-2","volume":"49","author":"M Minoux","year":"2011","unstructured":"Minoux, M.: On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Global Optim. 49(3), 521\u2013537 (2011). https:\/\/doi.org\/10.1007\/s10898-010-9645-2","journal-title":"J. Global Optim."},{"issue":"7","key":"23_CR18","doi-asserted-by":"publisher","first-page":"1463","DOI":"10.1007\/s11590-011-0341-z","volume":"6","author":"M Minoux","year":"2011","unstructured":"Minoux, M.: Two-stage robust LP with ellipsoidal right-hand side uncertainty is NP-hard. Optim. Lett. 6(7), 1463\u20131475 (2011). https:\/\/doi.org\/10.1007\/s11590-011-0341-z","journal-title":"Optim. Lett."},{"key":"23_CR19","doi-asserted-by":"publisher","unstructured":"Nourmohammadzadeh, A., Vo\u00df, S.: An effective matheuristic approach for robust bus driver rostering with uncertain daily working hours. In: LNCS, vol. 14239, pp. 365\u2013380. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43612-3_23","DOI":"10.1007\/978-3-031-43612-3_23"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Olson, D.L., Wu, D.: Chance constrained programming. In: Enterprise risk management models, pp. 143\u2013157. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11474-8_11","DOI":"10.1007\/978-3-642-11474-8_11"},{"issue":"4","key":"23_CR21","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.orl.2010.04.005","volume":"38","author":"OY \u00d6zalt\u0131n","year":"2010","unstructured":"\u00d6zalt\u0131n, O.Y., Prokopyev, O.A., Schaefer, A.J.: The bilevel knapsack problem with stochastic right-hand sides. Oper. Res. Lett. 38(4), 328\u2013333 (2010). https:\/\/doi.org\/10.1016\/j.orl.2010.04.005","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40819-021-01131-1","volume":"7","author":"S Singh","year":"2021","unstructured":"Singh, S., Pradhan, A., Biswal, M.P.: Computation of some stochastic transportation problems using Essen inequality. Int. J. Appl. Comput. Math. 7(6), 1\u201326 (2021). https:\/\/doi.org\/10.1007\/s40819-021-01131-1","journal-title":"Int. J. Appl. Comput. Math."},{"key":"23_CR23","doi-asserted-by":"publisher","unstructured":"Taillard, \u00c9.D., Voss, S.: POPMUSIC \u2014 partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 613\u2013629. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_27","DOI":"10.1007\/978-1-4615-1507-4_27"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Vo\u00df, S.: Successfully using ChatGPT in logistics: are we there yet? Lect. Notes Comput. Sci. 14239, 3\u201317 (2023). https:\/\/doi.org\/10.1007\/978-3-031-43612-3_1","DOI":"10.1007\/978-3-031-43612-3_1"},{"issue":"5","key":"23_CR25","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1287\/opre.11.5.759","volume":"11","author":"AC Williams","year":"1963","unstructured":"Williams, A.C.: A stochastic transportation problem. Oper. Res. 11(5), 759\u2013770 (1963). https:\/\/doi.org\/10.1287\/opre.11.5.759","journal-title":"Oper. Res."},{"issue":"8","key":"23_CR26","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1057\/palgrave.jors.2600031","volume":"49","author":"JM Wilson","year":"1998","unstructured":"Wilson, J.M.: Introduction to stochastic programming. J. Oper. Res. Soc. 49(8), 897\u2013898 (1998). https:\/\/doi.org\/10.1057\/palgrave.jors.2600031","journal-title":"J. Oper. Res. Soc."},{"key":"23_CR27","doi-asserted-by":"publisher","unstructured":"Zabiba, M.S.M., Al-Dallal, H.A.H., Hashim, K.H., Mahdi, M.M., Shiker, M.A.K.: A new technique to solve the maximization of the transportation problems. In: AIP Conference Proceedings, vol.\u00a02414, p. 040042. AIP Publishing (2023). https:\/\/doi.org\/10.1063\/5.0114806","DOI":"10.1063\/5.0114806"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83885-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:33:53Z","timestamp":1745397233000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83885-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031838873","9783031838859"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83885-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCAST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Systems Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Las Palmas de Canaria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19th","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocast2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocast2024.fulp.ulpgc.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}