A numerical comparison between two exact simplicial methods for solving a capacitated 4-index transportation problem
DOI:
https://doi.org/10.33993/jnaat462-1116Keywords:
Capacitated transportation problem, four-index transportation problem, linear programming, simplicial algorithmsAbstract
In this paper, we deal with a numerical comparison between two exact simplicial methods for solving a capacitated four-index transportation problem. The first method was developed by R. Zitouni and A. Keraghel for solving this problem [Resolution of a capacitated transportation problem with four subscripts, Kybernetes, Emerald journals, 32, 9/10: 1450-1463 (2003)]. The second approach is the well-known simplex method.
We show across some obtained numerical results that the first algorithm competes well with the simplex method.
Downloads
References
G. B. Dantzig, Linear Programming and Extensions, Linear Programming and Extensions, 1963, https://doi.org/10.1515/9781400884179 DOI: https://doi.org/10.1515/9781400884179
G. B. Dantzig, Application of the Simplex Method to a Transportation Problem, Activity Analysis of Production and Allocation. Koopmans, T.C., Ed., John Wiley and Sons, New York, 1951.
K. B. Haley, The multi-index transportation problem, Oper. Res.,11 (1963), pp. 368-379, https://doi.org/10.1287/opre.11.3.368 DOI: https://doi.org/10.1287/opre.11.3.368
L.V. Kantorovich and M.K. Gavurin, Application of mathematical methods to problems of analysis of freight flows, Problems of raising the efficiency of transport performance, Moscow-Leningrad, (in Russian), 1949.
M.K. Kravtsov, A Counter example to the Hypothesis of Maximum Number of Integer Vertices of the Multi-index Axial Transportation Polyhedron, Discrete Math. Appl.,10 (2000) no. 1, pp. 109–114, https://doi.org/10.1515/dma.2000.10.1.109 DOI: https://doi.org/10.1515/dma.2000.10.1.109
M.K. Kravtsov and E.V. Lukshin, On the non-integer polyhedron vertices of the three-index axial transportation problem, Autom. Remote Control,65 (2004) no. 3, pp. 422-430, https://doi.org/10.1023/b:aurc.0000019374.29519.c2 DOI: https://doi.org/10.1023/B:AURC.0000019374.29519.c2
M. Queyranne and F. C. R. Spieksma, Approximation algorithms for multi-index transportation problems with decomposable costs, Discrete Appl. Math.,76 (1997), pp. 239-253, https://doi.org/10.1016/S0166-218X(96)00128-X DOI: https://doi.org/10.1016/S0166-218X(96)00128-X
R.R.K. Sharma and Saumya Prasad, Obtaining a good primal solution to the un-capacitated transportation problem, European J. Oper. Res., 144 (2003), pp. 560-564, https://doi.org/10.1016/s0377-2217(01)00396-4 DOI: https://doi.org/10.1016/S0377-2217(01)00396-4
Tuyet-Hoa Pham and Philippe Dott, An exact method for solving the four index transportation problem and industrial application, American Journal of Operational Research, 3 (2013) no. 2, pp. 28-44, https://doi.org/10.5923/j.ajor.20130302.02
R. Zitouni and A. Keraghel, Resolution of a capacitated transportation problem with four subscripts, Kybernetes, (Emerald journals), 32 (2003) no. 9/10, pp. 1450-1463, https://doi.org/10.1108/03684920310493341 DOI: https://doi.org/10.1108/03684920310493341
R. Zitouni and A. Keraghel, A note on the algorithm of resolution of a capacitated transportation problem with four subscripts, Far East Journal of Mathematical Sciences (FJMS), 26 (2007) no. 3, pp. 769-778, http://www.pphmj.com/abstract/2672.htm
R. Zitouni, A. Keraghel and D. Benterki, Elaboration and implementation of an algorithm solving a capacitated four-index transportation problem, Appl. Math. Sci. (Ruse), 1 (2007) no. 53, pp. 2643-2657, http://www.pphmj.com/abstract/2672.htm
R. Zitouni, Etude qualitative de modeles de transport et localisation, These de Doctorat d’etat, Universite ferhat Abbas-Setif 1, Setif, Algerie. 2007.
Published
How to Cite
Issue
Section
License
Copyright (c) 2017 Journal of Numerical Analysis and Approximation Theory
This work is licensed under a Creative Commons Attribution 4.0 International License.
Open Access. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.