{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T17:18:07Z","timestamp":1711473487939},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T00:00:00Z","timestamp":1522454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10479-018-2825-z","type":"journal-article","created":{"date-parts":[[2018,3,31]],"date-time":"2018-03-31T08:17:05Z","timestamp":1522484225000},"page":"667-692","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bi-criteria transportation problem with multiple parameters"],"prefix":"10.1007","volume":"269","author":[{"given":"Sonia","family":"Singh","sequence":"first","affiliation":[]},{"given":"Shalabh","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"issue":"4","key":"2825_CR1","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1002\/nav.3800330415","volume":"33","author":"RK Ahuja","year":"1986","unstructured":"Ahuja, R. K. (1986). Algorithms for the minimax transportation problem. Naval Research Logistics Quarterly, 33(4), 725\u2013739.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"2825_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/mnsc.25.1.73","volume":"25","author":"YP Aneja","year":"1979","unstructured":"Aneja, Y. P., & Nair, K. P. K. (1979). Bicriteria transportation problem. Management Science, 25(1), 73\u201378.","journal-title":"Management Science"},{"key":"2825_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1057\/jors.1973.10","volume":"24","author":"GM Appa","year":"1973","unstructured":"Appa, G. M. (1973). The transportation problem and its variants. Operational Research Quarterly, 24, 79\u201399.","journal-title":"Operational Research Quarterly"},{"issue":"8","key":"2825_CR4","first-page":"920","volume":"8","author":"HL Bhatia","year":"1977","unstructured":"Bhatia, H. L., Swarup, K., & Puri, M. C. (1977). A procedure for time minimization transportation problem. Indian Journal of Pure and Applied Mathematics, 8(8), 920\u2013929.","journal-title":"Indian Journal of Pure and Applied Mathematics"},{"issue":"1","key":"2825_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.amc.2008.12.080","volume":"210","author":"MP Biswal","year":"2009","unstructured":"Biswal, M. P., & Acharya, S. (2009). Transformation of a multi-choice linear programming problem. Applied Mathematics and Computation, 210(1), 182\u2013188.","journal-title":"Applied Mathematics and Computation"},{"issue":"5","key":"2825_CR6","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.mcm.2011.04.009","volume":"54","author":"MP Biswal","year":"2011","unstructured":"Biswal, M. P., & Acharya, S. (2011). Solving multi-choice linear programming problems by interpolating polynomials. Mathematical and Computer Modelling, 54(5), 1405\u20131412.","journal-title":"Mathematical and Computer Modelling"},{"issue":"2","key":"2825_CR7","doi-asserted-by":"crossref","first-page":"843","DOI":"10.3233\/IFS-141366","volume":"28","author":"D Chakraborty","year":"2015","unstructured":"Chakraborty, D., Jana, D. K., & Roy, T. K. (2015). A new approach to solve multi-objective multi-choice multi-item Atanassov\u2019s intuitionistic fuzzy transportation problem using chance operator. Journal of Intelligent and Fuzzy Systems, 28(2), 843\u2013865.","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"issue":"4","key":"2825_CR8","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.omega.2005.07.009","volume":"35","author":"CT Chang","year":"2007","unstructured":"Chang, C. T. (2007). Multi-choice goal programming. Omega, 35(4), 389\u2013396.","journal-title":"Omega"},{"issue":"12","key":"2825_CR9","doi-asserted-by":"publisher","first-page":"2587","DOI":"10.1016\/j.apm.2007.09.008","volume":"32","author":"CT Chang","year":"2008","unstructured":"Chang, C. T. (2008). Revised multi-choice goal programming. Applied Mathematical Modelling, 32(12), 2587\u20132595.","journal-title":"Applied Mathematical Modelling"},{"issue":"2","key":"2825_CR10","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1016\/j.cie.2011.11.027","volume":"62","author":"CT Chang","year":"2012","unstructured":"Chang, C. T., Chen, H. M., & Zhuang, Z. Y. (2012). Multi-coefficients goal programming. Computers and Industrial Engineering, 62(2), 616\u2013623.","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"2825_CR11","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/nav.3800180404","volume":"18","author":"RS Garfinkel","year":"1971","unstructured":"Garfinkel, R. S., & Rao, M. R. (1971). The bottleneck transportation problem. Naval Research Logistics Quarterly, 18(4), 465\u2013472.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"2825_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1287\/opre.25.1.163","volume":"25","author":"TS Glickman","year":"1977","unstructured":"Glickman, T. S., & Berger, P. D. (1977). Technical notecost\/completion-date tradeoffs in the transportation problem. Operations Research, 25(1), 163\u2013168.","journal-title":"Operations Research"},{"issue":"3","key":"2825_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/nav.3800160307","volume":"16","author":"PL Hammer","year":"1969","unstructured":"Hammer, P. L. (1969). Time-minimizing transportation problems. Naval Research Logistics Quarterly, 16(3), 345\u2013357.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"4","key":"2825_CR14","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/nav.3800180406","volume":"18","author":"PL Hammer","year":"1971","unstructured":"Hammer, P. L. (1971). Communication on the bottleneck transportation problem and some remarks on the time transportation problem. Naval Research Logistics Quarterly, 18(4), 487\u2013490.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"1","key":"2825_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1287\/opre.12.1.122","volume":"12","author":"WC Healy Jr","year":"1964","unstructured":"Healy, W. C, Jr. (1964). Multiple choice programming (A procedure for linear programming with zero-one variables). Operations Research, 12(1), 122\u2013138.","journal-title":"Operations Research"},{"issue":"1","key":"2825_CR16","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.cie.2008.04.007","volume":"56","author":"CN Liao","year":"2009","unstructured":"Liao, C. N. (2009). Formulating the multi-segment goal programming. Computers and Industrial Engineering, 56(1), 138\u2013141.","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"2825_CR17","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1016\/j.apm.2012.04.024","volume":"37","author":"DR Mahapatra","year":"2013","unstructured":"Mahapatra, D. R., Roy, S. K., & Biswal, M. P. (2013). Multi-choice stochastic transportation problem involving extreme value distribution. Applied Mathematical Modelling, 37(4), 2230\u20132240.","journal-title":"Applied Mathematical Modelling"},{"issue":"1","key":"2825_CR18","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/2195-5468-2-11","volume":"2","author":"G Maity","year":"2014","unstructured":"Maity, G., & Roy, S. K. (2014). Solving multi-choice multi-objective transportation problem: a utility function approach. Journal of Uncertainty Analysis and Applications, 2(1), 11.","journal-title":"Journal of Uncertainty Analysis and Applications"},{"issue":"2","key":"2825_CR19","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin, J. B. (1993). A faster strongly polynomial minimum cost flow algorithm. Operations Research, 41(2), 338\u2013350.","journal-title":"Operations Research"},{"issue":"2","key":"2825_CR20","first-page":"126","volume":"25","author":"S Prakash","year":"1998","unstructured":"Prakash, S., Agarwal, A. K., & Shah, S. (1998). Nondominated solutions of cost\u2013time trade-off transportation and assignment problems. Opsearch, 25(2), 126\u2013131.","journal-title":"Opsearch"},{"issue":"1","key":"2825_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ejor.2007.03.040","volume":"188","author":"S Prakash","year":"2008","unstructured":"Prakash, S., Kumar, P., Prasad, B., & Gupta, A. (2008). Pareto optimal solutions of a cost\u2013time trade-off bulk transportation problem. European Journal of Operational Research, 188(1), 85\u2013100.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2825_CR22","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s10479-016-2283-4","volume":"253","author":"SK Roy","year":"2017","unstructured":"Roy, S. K., Maity, G., Weber, G. W., & G\u00f6k, S. Z. A. (2017). Conic scalarization approach to solvemulti-choice multi-objective transportation problem with interval goal. Annals of Operations Research, 253(1), 599\u2013620.","journal-title":"Annals of Operations Research"},{"issue":"6","key":"2825_CR23","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF03046907","volume":"86","author":"JK Sharma","year":"1977","unstructured":"Sharma, J. K., & Swarup, K. (1977). Time minimizing transportation problems. Proceedings of the Indian Academy of Sciences-Section A, 86(6), 513\u2013518.","journal-title":"Proceedings of the Indian Academy of Sciences-Section A"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2825-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2825-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2825-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T18:02:38Z","timestamp":1604080958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2825-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,31]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["2825"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2825-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,31]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}