IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v8y2017i1d10.1007_s13198-015-0396-9.html
   My bibliography  Save this article

A node merging approach to the transhipment problem

Author

Listed:
  • Trust Tawanda

    (National University of Science and Technology)

Abstract

In this paper, a new approach for solving transhipment model as a transportation model is developed and illustrated. The objective is to expose the transhipment problem to algorithms and methods that are transportation problem (TP) based. The principle of this method consists in merging source nodes with transhipment nodes, through utilization of all possible combination connections, transportation costs are summed up respectively. A numerical example is used to illustrate the approach. The least cost method (LCM) is used to solved the TP resulted from a transformed transhipment problem. Linear programming (LP) models are used as proof of correctness, thus we solve the original transhipment model as an LP problem. This study revealed that solutions from LCM are the same as that of LP formulated from the original transhipment model.

Suggested Citation

  • Trust Tawanda, 2017. "A node merging approach to the transhipment problem," 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(1), pages 370-378, January.
    • Handle: RePEc:spr:ijsaem:v:8:y:2017:i:1:d:10.1007_s13198-015-0396-9
    DOI: 10.1007/s13198-015-0396-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-015-0396-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-015-0396-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Y. P. Aneja & K. P. K. Nair, 1979. "Bicriteria Transportation Problem," Management Science, INFORMS, vol. 25(1), pages 73-78, January.
    2. M. Mathirajan & B. Meenakshi, 2004. "Experimental Analysis Of Some Variants Of Vogel'S Approximation Method," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 21(04), pages 447-462.
    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. Sharma, R. R. K. & Sharma, K. D., 2000. "A new dual based procedure for the transportation problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 611-624, 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. Md. Ashraful Babu & M. A. Hoque & Md. Sharif Uddin, 2020. "A heuristic for obtaining better initial feasible solution to the transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 221-245, March.
    2. M. Mathirajan & Sujan Reddy & M. Vimala Rani, 2022. "An experimental study of newly proposed initial basic feasible solution methods for a transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 102-145, March.
    3. S. Dutta & S. Acharya & Rajashree Mishra, 2016. "Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 835-872, December.
    4. Britta Schulze & Kathrin Klamroth & Michael Stiglmayr, 2019. "Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions," Journal of Global Optimization, Springer, vol. 74(3), pages 495-522, July.
    5. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    6. Yang, X. Q. & Goh, C. J., 1997. "A method for convex curve approximation," European Journal of Operational Research, Elsevier, vol. 97(1), pages 205-212, February.
    7. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
    8. Pravash Kumar Giri & Manas Kumar Maiti & Manoranjan Maiti, 2023. "Profit maximization fuzzy 4D-TP with budget constraint for breakable substitute items: a swarm based optimization approach," OPSEARCH, Springer;Operational Research Society of India, vol. 60(2), pages 571-615, June.
    9. Abhijit Baidya & Uttam Kumar Bera & Manoranjan Maiti, 2016. "The grey linear programming approach and its application to multi-objective multi-stage solid transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 500-522, September.
    10. Punnen, Abraham P. & Aneja, Y. P., 1995. "Minmax combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 81(3), pages 634-643, March.
    11. Ali Ebrahimnejad & Jose Luis Verdegay, 2018. "A new approach for solving fully intuitionistic fuzzy transportation problems," Fuzzy Optimization and Decision Making, Springer, vol. 17(4), pages 447-474, December.
    12. Alvaro Sierra Altamiranda & Hadi Charkhgard, 2019. "A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 823-840, October.
    13. KIKOMBA KAHUNGU, Michaël & MABELA MAKENGO MATENDO, Rostin & M. NGOIE, Ruffin-Benoît & MAKENGO MBAMBALU, Fréderic & OKITONYUMBE Y.F, Joseph, 2013. "Les fondements mathématiques pour une aide à la décision du réseau de transport aérien : cas de la République Démocratique du Congo [Mathematical Foundation for Air Traffic Network Decision Aid : C," MPRA Paper 68533, University Library of Munich, Germany, revised Mar 2013.
    14. A. Rufián-Lizana & Y. Chalco-Cano & G. Ruiz-Garzón & H. Román-Flores, 2014. "On some characterizations of preinvex fuzzy mappings," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 771-783, July.
    15. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    16. Singh, Preetvanti & Saxena, P. K., 2003. "The multiple objective time transportation problem with additional restrictions," European Journal of Operational Research, Elsevier, vol. 146(3), pages 460-476, May.
    17. Pankaj Gupta & Mukesh Mehlawat, 2007. "An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 114-137, July.
    18. Díaz-Madroñero, Manuel & Peidro, David & Mula, Josefa & Ferriols, Francisco J., 2010. "Enfoques de programación matemática fuzzy multiobjetivo para la planificación operativa del transporte en una cadena de suministro del sector del automóvil = Fuzzy Multiobjective Mathematical Programm," Revista de Métodos Cuantitativos para la Economía y la Empresa = Journal of Quantitative Methods for Economics and Business Administration, Universidad Pablo de Olavide, Department of Quantitative Methods for Economics and Business Administration, vol. 9(1), pages 44-68, June.
    19. Sharma, R. R. K. & Prasad, Saumya, 2003. "Obtaining a good primal solution to the uncapacitated transportation problem," European Journal of Operational Research, Elsevier, vol. 144(3), pages 560-564, February.
    20. Özgür Özpeynirci & Murat Köksalan, 2010. "An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs," Management Science, INFORMS, vol. 56(12), pages 2302-2315, December.

    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:spr:ijsaem:v:8:y:2017:i:1:d:10.1007_s13198-015-0396-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.