More-for-Less Paradox in Time Minimization Transportation Problem with Mixed Constraints

被引:2
|
作者
Agarwal S. [1 ,2 ]
Sharma S. [2 ]
机构
[1] Institute of Applied Sciences, Mangalayatan University, Aligarh
[2] Department of Mathematics, Faculty of Science, Dayalbagh Educational Institute, Agra
关键词
more-for-less; optimal solution; paradox; parametric approach; Time minimization transportation problem;
D O I
10.1080/01966324.2022.2027302
中图分类号
学科分类号
摘要
In emergency situations, such as at the time of the outbreak of infectious viruses (COVID-19, SARS, Ebola, MERS, etc.), strike of natural disasters (Earthquakes, tsunamis, cyclones, etc.), wars, terrorist attacks, etc., where distributing essential goods and services in minimum possible time is a major logistical challenge, the concept of more-for-less paradox could be helpful. In a minimization type transportation problem, this paradoxical situation occurs when the value of objective function falls below the optimum value by shipping a large number of total goods. In this article, a unified algorithm is developed to identify and resolve the existence of paradoxical situation in the time minimization transportation problem with mixed constraints using right-hand side parametric formulation. Using this prior approach, the paradoxical solution (if exists) can be found first, followed by an optimal solution. If the paradoxical part does not exist, it gets neglected. The conditions governing the existence of more transportation flow in less shipping time enable the decision-maker to extend the optimal solution in search of more-for-less opportunity at the time of emergency. The validity of an algorithm has been tested through numerical illustrations and by computational observations on matlab. © 2022 Taylor & Francis Group, LLC.
引用
收藏
页码:69 / 85
页数:16
相关论文
共 50 条
  • [1] More-for-less paradox in the fixed-charge transportation problem
    Adlakha, V
    Kowalski, K
    DECISION SCIENCES INSTITUTE 1998 PROCEEDINGS, VOLS 1-3, 1998, : 1041 - 1043
  • [2] A quick sufficient solution to the more-for-less paradox in the transportation problem
    Adlakha, V
    Kowalski, K
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 1998, 26 (04): : 541 - 547
  • [3] A quick sufficient solution to the more-for-less paradox in the transportation problem
    Adlakha, Veena
    Kowalski, Krzysztof
    Omega, 1998, 26 (04): : 541 - 547
  • [4] Identifying More-for-Less Paradox in the Linear Fractional Transportation Problem Using Objective Matrix
    Joshi, Vishwas Deep
    Gupta, Nilama
    MATEMATIKA, 2012, 28 (02) : 173 - 180
  • [5] THE MORE-FOR-LESS PARADOX IN LINEAR-PROGRAMMING
    CHARNES, A
    DUFFUAA, S
    RYAN, M
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1987, 31 (02) : 194 - 197
  • [6] The more-for-less paradox in fuzzy posynomial geometric programming
    Cao, Bing-yuan
    INFORMATION SCIENCES, 2012, 211 : 81 - 92
  • [7] An alternate method for finding more for less solution to fuzzy transportation problem with mixed constraints
    V. Vidhya
    P. Uma Maheswari
    K. Ganesan
    Soft Computing, 2021, 25 : 11989 - 11996
  • [8] An alternate method for finding more for less solution to fuzzy transportation problem with mixed constraints
    Vidhya, V.
    Maheswari, P. Uma
    Ganesan, K.
    SOFT COMPUTING, 2021, 25 (18) : 11989 - 11996
  • [9] More-for-less algorithm for fixed-charge transportation problems
    Adlakha, Veena
    Kowalski, Krzysztof
    Vemuganti, R. R.
    Lev, Benjamin
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2007, 35 (01): : 116 - 127
  • [10] A note on the procedure MFL for a more-for-less solution in transportation problems
    Adlakha, V
    Kowalski, K
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2000, 28 (04): : 481 - 483