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 条
  • [31] An Efficient Procedure to Determine the Initial Basic Feasible Solution of Time Minimization Transportation Problem
    Khan, Aminur Rahman
    Vilcu, Adrian
    Uddin, Md. Sharif
    Istrate, Cristiana
    EXPLORING SERVICES SCIENCE (IESS 2016), 2016, 247 : 201 - 212
  • [32] An alternate approach to solve two-level hierarchical time minimization transportation problem
    Prabhjot Kaur
    Anuj Sharma
    Vanita Verma
    Kalpana Dahiya
    4OR, 2022, 20 : 23 - 61
  • [33] A DECISION PLANNING MODEL FOR TOTAL TIME MINIMIZATION SOLID TRANSPORTATION PROBLEM UNDER UNCERTAINTY
    Javaid, Shakeel
    Hashmi, Nausheen
    Jalil, Syed Aqib
    INTERNATIONAL JOURNAL OF AGRICULTURAL AND STATISTICAL SCIENCES, 2019, 15 (01): : 27 - 34
  • [34] An iterative solution technique for capacitated two-stage time minimization transportation problem
    Xie F.
    Li Z.
    4OR, 2022, 20 (4) : 637 - 684
  • [35] An alternate approach to solve two-level hierarchical time minimization transportation problem
    Kaur, Prabhjot
    Sharma, Anuj
    Verma, Vanita
    Dahiya, Kalpana
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2022, 20 (01): : 23 - 61
  • [36] A solution technique for capacitated two-level hierarchical time minimization transportation problem
    Ding, Hui
    Xie, Fanrong
    COMPUTERS & OPERATIONS RESEARCH, 2023, 151
  • [37] The Pickup and Delivery Problem with Time Windows and Incompatibility Constraints in Cold Chain Transportation
    Deng, Faheng
    Qin, Hu
    Li, Jiliu
    Cheng, Chun
    TRANSPORTATION SCIENCE, 2022, 57 (02) : 444 - 462
  • [38] An efficient algorithm for two-stage capacitated time minimization transportation problem with restricted flow
    Kaur, Supinder
    Jain, Ekta
    Sharma, Anuj
    Dahiya, Kalpana
    RAIRO-OPERATIONS RESEARCH, 2024, 58 (04) : 2733 - 2766
  • [39] An efficient solution approach to capacitated three-level hierarchical time minimization transportation problem
    Zhang, Wenqing
    Xie, Fanrong
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 249
  • [40] Transportation and carbon emissions costs minimization for time-dependent vehicle routing problem with drones
    Peng, Yong
    Ren, Zhi
    Yu, Dennis Z.
    Zhang, Yonghui
    COMPUTERS & OPERATIONS RESEARCH, 2025, 176