An Algorithm for Solving Bi-criteria Large Scale Transshipment Problems

α
A. Abed
A. Abed
σ
Khalid Alkhulaifi
Khalid Alkhulaifi
ρ
Jasem AlRajhi
Jasem AlRajhi
Ѡ
Hilal A. Abdelwali
Hilal A. Abdelwali
¥
Mohsen AlArdhi
Mohsen AlArdhi
§
Elsayed E. M. Ellaimony
Elsayed E. M. Ellaimony
ρ Public Authority for Applied Education and Training

Send Message

To: Author

An Algorithm for Solving Bi-criteria Large Scale Transshipment Problems

Article Fingerprint

ReserarchID

0T8O7

An Algorithm for Solving Bi-criteria Large Scale Transshipment Problems Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Abstract

This paper describes an algorithm for solving a certain class of bi-criteria multistage transportation problems with transshipment (BMTSP). A several bi-criteria multistage transportation problem with transshipment are formulated. The presented algorithm is mainly based on application of the methods of solving bi-criteria single stage transportation problems, utilizing available decomposition techniques for solving large-scale linear programming problems, and the methods of treating the transshipment problems. The mathematical formulation of the presented class does not affect the special structure of the transshipment problem for each of the individual stages. An illustrative example is introduced to validate that the implementation of the algorithm.

References

19 Cites in Article
  1. Alex Orden (1956). The Transhipment Problem.
  2. Gordon King,Samuel Logan (1964). Optimum Location, Number and Size of Processing Plants with Raw Product and Final Product Shipments.
  3. D Rhody (1963). Interregional competitive position of the hog-pork industry in the southeast United States.
  4. G Judge,J Hsvlicek,R Rizek (1965). An interregional model: Its formulation and application to the live-stock industry.
  5. Verner Hurt,Thomas Tramel (1965). Alternative Formulations of the Transhipment Problem.
  6. R Grag,S Parakash (1985). Time minimizing transshipment problem.
  7. Yale Herer,Michal Tzur (2001). The dynamic transshipment problem.
  8. Deniz Ozdemir,Enver Yucesan,Yale Herer (2006). Multi-Location Transshipment Problem with Capacitated Production and Lost Sales.
  9. M Osman,E Ellaimony (1984). On bicriteria multistage transportation problems.
  10. A Khurana,S Arora (2011). Solving transshipment problems with mixed constraints.
  11. A Khurana,V Tripti,S Arora (2012). An algorithm for solving time minimizing capacitated transshipment problem.
  12. A Yousria,E Bothina,Z Hanadi (2012). Trust region algorithm for multi-objective transportation, assignment, and transshipment problems.
  13. Archana Khurana (2013). Multi-index fixed charge bi-criterion transshipment problem.
  14. P Rajendran,P Pandian (2012). Solving Fully Interval Transshipment Problems.
  15. A Sayed,Zaki,Allah Abd,Mousa,M Hamdy,Adel Geneedi,Elmekawy (2012). Efficient Multiobjective Genetic Algorithm for Solving Transportation, Assignment, and Transshipment Problems.
  16. Anupam Ojha,Shyamal Kr,Manoranjan Mondal,Maiti (2011). Transportation policies for single and multi-objective transportation problem using fuzzy logic.
  17. Mansour Saraj,Feryal Mashkoorzadeh,Theodore Simos,George Psihoyios,C Tsitouras (2010). Solving a Multi Objective Transportation Problem(MOTP) Under Fuzziness on Using Interval Numbers.
  18. F Waiel,El-Wahed (2001). A multiobjective transportation problem under fuzziness.
  19. S Das,A Goswami,S Alam (1999). Multiobjective transportation problem with interval cost, source and destination parameters.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

A. Abed. 2014. \u201cAn Algorithm for Solving Bi-criteria Large Scale Transshipment Problems\u201d. Global Journal of Research in Engineering - B: Automotive Engineering GJRE-B Volume 14 (GJRE Volume 14 Issue B4): .

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjre

Print ISSN 0975-5861

e-ISSN 2249-4596

Version of record

v1.2

Issue date

December 1, 2014

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 4685
Total Downloads: 2197
2026 Trends
Related Research

Published Article

This paper describes an algorithm for solving a certain class of bi-criteria multistage transportation problems with transshipment (BMTSP). A several bi-criteria multistage transportation problem with transshipment are formulated. The presented algorithm is mainly based on application of the methods of solving bi-criteria single stage transportation problems, utilizing available decomposition techniques for solving large-scale linear programming problems, and the methods of treating the transshipment problems. The mathematical formulation of the presented class does not affect the special structure of the transshipment problem for each of the individual stages. An illustrative example is introduced to validate that the implementation of the algorithm.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Algorithm for Solving Bi-criteria Large Scale Transshipment Problems

Khalid Alkhulaifi
Khalid Alkhulaifi
Jasem AlRajhi
Jasem AlRajhi Public Authority for Applied Education and Training
Hilal A. Abdelwali
Hilal A. Abdelwali
Mohsen AlArdhi
Mohsen AlArdhi
Elsayed E. M. Ellaimony
Elsayed E. M. Ellaimony

Research Journals