IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v21y2004i04ns0217595904000333.html
   My bibliography  Save this article

Experimental Analysis Of Some Variants Of Vogel'S Approximation Method

Author

Listed:
  • M. MATHIRAJAN

    (Department of Management Studies, Indian Institute of Science, Bangalore 560 012, India)

  • B. MEENAKSHI

    (Department of Management Studies, Indian Institute of Science, Bangalore 560 012, India)

Abstract

This paper presents a variant of Vogel's approximation method (VAM) for transportation problems. The importance of determining efficient solutions for large sized transportation problems is borne out by many practical problems in industries, the military, etc. With this motivation, a few variants of VAM incorporating the total opportunity cost (TOC) concept were investigated to obtain fast and efficient solutions. Computational experiments were carried out to evaluate these variants of VAM. The quality of solutions indicates that the basic version of the VAM coupled with total opportunity cost (called the VAM–TOC) yields a very efficient initial solution. In these experiments, on an average, about 20% of the time the VAM–TOC approach yielded the optimal solution and about 80% of the time it yielded a solution very close to optimal (0.5% loss of optimality). The CPU time required for the problem instances tested was very small (on an average, less than 10 s on a 200 MHz Pentium machine with 64 MB RAM).

Suggested Citation

  • 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.
    • Handle: RePEc:wsi:apjorx:v:21:y:2004:i:04:n:s0217595904000333
    DOI: 10.1142/S0217595904000333
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595904000333
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595904000333?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. Joanna Szkutnik-Rogoż & Jarosław Ziółkowski & Jerzy Małachowski & Mateusz Oszczypała, 2021. "Mathematical Programming and Solution Approaches for Transportation Optimisation in Supply Network," Energies, MDPI, vol. 14(21), pages 1-32, October.
    4. 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.

    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:wsi:apjorx:v:21:y:2004:i:04:n:s0217595904000333. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.