IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v13y2021i3p1372-d488811.html
   My bibliography  Save this article

Detecting All Non-Dominated Points for Multi-Objective Multi-Index Transportation Problems

Author

Listed:
  • Abd Elazeem M. Abd Elazeem

    (High Institute of Marketing, Commerce, and Information System, Cairo 11865, Egypt)

  • Abd Allah A. Mousa

    (Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia)

  • Mohammed A. El-Shorbagy

    (Department of Mathematics, College of Science and Humanities in Al-Kharj, Prince Sattam bin Abdulaziz University, Al-Kharj 11942, Saudi Arabia
    Department of Basic Engineering Science, Faculty of Engineering, Menofia University, Shebin El-Kom 32511, Egypt)

  • Sayed K. Elagan

    (Department of Mathematics and Statistics, College of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia)

  • Yousria Abo-Elnaga

    (Department of Basic Science, Higher Technological Institute, Tenth of Ramadan City 44629, Egypt)

Abstract

Multi-dimensional transportation problems denoted as multi-index are considered as the extension of classical transportation problems and are appropriate practical modeling for solving real–world problems with multiple supply, multiple demand, as well as different modes of transportation demands or delivering different kinds of commodities. This paper presents a method for detecting the complete nondominated set (efficient solutions) of multi-objective four-index transportation problems. The proposed approach implements weighted sum method to convert multi-objective four-index transportation problem into a single objective four-index transportation problem, that can then be decomposed into a set of two-index transportation sub-problems. For each two-index sub-problem, parametric analysis was investigated to determine the range of the weights values that keep the efficient solution unchanged, which enable the decision maker to detect the set of all nondominated solutions for the original multi-objective multi-index transportation problem, and also to find the stability set of the first kind for each efficient solution. Finally, an illustrative example is presented to illustrate the efficiency and robustness of the proposed approach. The results demonstrate the effectiveness and robustness for the proposed approach to detect the set of all nondominated solutions.

Suggested Citation

  • Abd Elazeem M. Abd Elazeem & Abd Allah A. Mousa & Mohammed A. El-Shorbagy & Sayed K. Elagan & Yousria Abo-Elnaga, 2021. "Detecting All Non-Dominated Points for Multi-Objective Multi-Index Transportation Problems," Sustainability, MDPI, vol. 13(3), pages 1-18, January.
    • Handle: RePEc:gam:jsusta:v:13:y:2021:i:3:p:1372-:d:488811
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/13/3/1372/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/13/3/1372/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Khurana, Archana & Adlakha, Veena & Lev, Benjamin, 2018. "Multi-index constrained transportation problem with bounds on availabilities, requirements and commodities," Operations Research Perspectives, Elsevier, vol. 5(C), pages 319-333.
    2. K. B. Haley, 1963. "The Multi-Index Problem," Operations Research, INFORMS, vol. 11(3), pages 368-379, June.
    3. Dalbinder Kaur & Sathi Mukherjee & Kajla Basu, 2015. "Solution of a Multi-Objective and Multi-Index Real-Life Transportation Problem Using Different Fuzzy Membership Functions," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 666-678, February.
    4. Junginger, Werner, 1993. "On representatives of multi-index transportation problems," European Journal of Operational Research, Elsevier, vol. 66(3), pages 353-371, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kravtsov, M.K. & Lukshin, E.V., 2008. "Polyhedral combinatorics of multi-index axial transportation problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 920-938, September.
    2. Singh, Bikramjit & Singh, Amarinder, 2023. "Hybrid particle swarm optimization for pure integer linear solid transportation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 207(C), pages 243-266.
    3. Jimenez, F. & Verdegay, J. L., 1999. "Solving fuzzy solid transportation problems by an evolutionary algorithm based parametric approach," European Journal of Operational Research, Elsevier, vol. 117(3), pages 485-510, September.
    4. Tzeng, Gwo-Hshiung & Teodorovic, Dusan & Hwang, Ming-Jiu, 1996. "Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower," European Journal of Operational Research, Elsevier, vol. 95(1), pages 62-72, November.
    5. Khurana, Archana & Adlakha, Veena & Lev, Benjamin, 2018. "Multi-index constrained transportation problem with bounds on availabilities, requirements and commodities," Operations Research Perspectives, Elsevier, vol. 5(C), pages 319-333.
    6. Dalbinder Kour & Sathi Mukherjee & Kajla Basu, 2017. "Solving intuitionistic fuzzy transportation problem using linear programming," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1090-1101, November.
    7. Deepika Rani & T. R. Gulati, 2016. "Application of intuitionistic fuzzy optimization technique in transportation models," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 761-777, December.
    8. Dalbinder Kaur & Sathi Mukherjee & Kajla Basu, 2015. "Solution of a Multi-Objective and Multi-Index Real-Life Transportation Problem Using Different Fuzzy Membership Functions," Journal of Optimization Theory and Applications, Springer, vol. 164(2), pages 666-678, February.
    9. Drexl, Andreas & Salewski, Frank, 1997. "Distribution requirements and compactness constraints in school timetabling," European Journal of Operational Research, Elsevier, vol. 102(1), pages 193-214, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:13:y:2021:i:3:p:1372-:d:488811. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.