Skip to main content
SpringerLink
Log in

Multi-index transport problems with decomposition structure

  • System Analysis and Operations Research
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

Consideration was given to the multi-index problems of linear and integer linear programming of the transport type. An approach based on the study of reducibility of the multi-index transport problems to that of seeking a flow on the network was proposed. For the multi-index problems with decomposition structure, a reduction scheme enabling one to solve the original multi-index problem using the cyclic decomposition of the minimum-cost flow of the auxiliary flow problem was constructed. The developed method underlies the heuristic algorithm to solve the NP-hard integer multi-index problem with a system of constraints featuring decompositional properties and general cost matrix.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Afraimovich, L.G. and Prilutskii, M.Kh., Multiindex Resource Distributions for Hierarchical Systems, Autom. Remote Control, 2006, vol. 67, no. 6, pp. 1007–1016.

    Article  MATH  Google Scholar 

  2. Afraimovich, L.G. and Prilutskii, M.Kh., Multi-product Flows in Tree-like Networks, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2008, no. 2, pp. 57–63.

  3. Prilutskii, M.Kh., Multi-criteria Multi-index Problems of Volume-Calendar Planning, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2007, no. 1, pp. 78–82.

  4. Prilutskii, M.Kh., Multicriteria Distribution of a Homogeneous Resource in Hierarchical Systems, Autom. Remote Control, 1996, vol. 57, no. 2, part 2, pp. 266–271.

    Google Scholar 

  5. Kostyukov, V.E. and Prilutskii, M.Kh., Raspredelenie resursov v ierarkhicheskikh sistemakh. Optimizatsionnye zadachi dobychi, transporta gaza i pererabotki gazovogo kondensata (Resource Assignment in Hierarchical Systems. Optimization Problems of Gas Extraction and Transportation and Processing of the Gas Condensate), Nizhni Novgorod: Nizhegorod. Gos. Univ., 2010.

    Google Scholar 

  6. Lim, A., Rodrigues, B., and Zhang, X., Scheduling Sports Competitions at Multiple Venues-Revisited, Eur. J. Oper. Res., 2006, vol. 175, pp. 171–186.

    Article  MATH  MathSciNet  Google Scholar 

  7. Gunawan, A., Ng, K.M., and Poh, K.L., Solving the Teacher Assignment-Course Scheduling Problem by a Hybrid Algorithm, Int. J. Comput. Inf. Eng., 2007, vol. 1, no. 2, pp. 137–142.

    Google Scholar 

  8. Storms, P.P.A. and Spieksma, F.C.R., An LP-based Algorithm for the Data Association Problem in Multitarget Tracking, Comput. Oper. Res., 2003, vol. 30, no. 7, pp. 1067–1085.

    Article  MATH  MathSciNet  Google Scholar 

  9. Poore, A.B., Multidimensional Assignment Formulation of Data Association Problems Arising from Multitarget and Multisensor Tracking, Comput. Optim. Appl., 1994, vol. 3, no. 1, pp. 27–57.

    Article  MATH  MathSciNet  Google Scholar 

  10. Schrijver, A., Theory of Linear and Integer Programming, New York: Wiley, 1986. Translated under the title Teoriya lineinogo i tselochislennogo programmirovaniya, Moscow: Mir, 1991.

    MATH  Google Scholar 

  11. Papadimitrou, Ch. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Englewood Cliffs: Prentice Hall, 1982. Translated under the title Kombinatornaya optimizatsiya: algoritmy i slozhnost’, Moscow: Mir, 1985.

    Google Scholar 

  12. Gale, D., The Theory of Linear Economic Models, New York: McGraw-Hill, 1960. Translated under the title Teoriya lineinykh ekonomicheskikh modelei, Moscow: Mir, 1969.

    Google Scholar 

  13. Raskin, L.G. and Kirichenko I.O., Mnogoindeksnye zadachi lineinogo programmirovaniya (Multi-index Problems of Linear Programming), Moscow: Radio i Svyaz’, 1982.

    Google Scholar 

  14. Emelichev, V.A., Kovalev, M.M., and Kravtsov, M.K., Mnogogranniki, grafy, optimizatsiya (Polyhedra, Graphs, Optimization), Moscow: Nauka, 1981.

    MATH  Google Scholar 

  15. Bandopadhyaya, L. and Puri, M.C., Impaired Flow Multi-Index Transportation Problem with Axial Constraints, J. Austral. Math. Society, Ser. B, 1988, vol. 29(3), pp. 296–309.

    Article  MathSciNet  Google Scholar 

  16. Junginger, W., On Representatives of Multi-index Transportation Problems, Eur. J. Oper. Res., 1993, vol. 66(3), pp. 353–371.

    Article  MATH  Google Scholar 

  17. De Loera, J.A., Kim, E.D., Onn, S., and Santos, F., Graphs of Transportation Polytopes, J. Combinat. Theory, Ser. A., 2009, vol. 116, no. 8, pp. 1306–1325.

    Article  MATH  Google Scholar 

  18. Kravtsov, M.A. and Krachkovskii, A.P., On Some Properties of the Three-index Transport Polyhedra, Diskretn. Mat., 1999, vol. 11, no. 3, pp. 109–125.

    MathSciNet  Google Scholar 

  19. Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye machiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

    MATH  Google Scholar 

  20. Crama, Y. and Spieksma, F.C.R., Approximation Algorithms for Three-Dimensional Assignment Problems with Triangle Inequalities, Eur. J. Oper. Res., 1992, vol. 60, pp. 273–279.

    Article  MATH  Google Scholar 

  21. Finkel’shtein, Yu.Yu., Priblizhennye metody i prikladnye zadachi diskretnogo programmirovaniya (Approximate Methods and Applied Problems of Discrete Programming), Moscow: Nauka, 1976.

    Google Scholar 

  22. Spieksma, F.C.R., Multi Index Assignment Problems: Complexity, Approximation, Applications, in Nonlinear Assignment Problems. Algorithms and Applications, Pardalos, P.M. and Pitsoulis, L.S., Eds., Dordrecht: Kluwer, 2000, pp. 1–11.

    Google Scholar 

  23. Gimadi, E.Kh. and Korkishko, N.M., On One Algorithm for Solution of the Three-index Axial Assignment Problem on One-Cycle Permutations, Diskret. Anal. Issled. Oper., Ser. 1, 2003, vol. 10, no. 2, pp. 56–65.

    MATH  MathSciNet  Google Scholar 

  24. Gimadi, E.Kh. and Glazkov, Yu.V., On Asymptotically Precise Algorithm for Solution of One Modification of the Three-index Planar Assignment Problem, Diskret. Anal. Issled. Oper., Ser. 2, 2006, vol. 13, no. 1, pp. 10–26.

    MathSciNet  Google Scholar 

  25. Sergeev, S.I., New Lower Bounds for the Triplanar Assignment Problem. Use of the Classical Model, Autom. Remote Control, 2008, vol. 69, no. 12, pp. 2039–2060.

    Article  MATH  MathSciNet  Google Scholar 

  26. Ahuja, R.K., Magnati, T.L., and Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, New Jersey: Prentice Hall, 1993.

    MATH  Google Scholar 

  27. Galil, Z. and Tardos, E., An Mincost Flow Algorithm, J. ACM, 1988, vol. 35, no. 2, pp. 374–386.

    Article  MATH  MathSciNet  Google Scholar 

  28. Goldberg, A.V. and Rao, S., Beyond the Flow Decomposition Barrier, J. ACM, 1998, vol. 45, no. 5, pp. 783–797.

    Article  MATH  MathSciNet  Google Scholar 

  29. Litvak, B.G. and Rappoport, A.M., Problems of Linear Programming Admitting Network Formulation, Ekon. Mat. Metody, 1970, vol. 6, no. 4, pp. 594–604.

    MathSciNet  Google Scholar 

  30. Lin, Y., A Recognition Problem in Converting Linear Programming to Network Flow Models, Appl. Math. J. Chinese Univ., 1993, vol. 8, no. 1, pp. 76–85.

    Article  MATH  Google Scholar 

  31. Kovalev, M.M., Matroidy v diskretnoi optimizatsii (Matroids in Discrete Optimization), Moscow: Editorial URSS, 2003.

    Google Scholar 

  32. Gülpinar, N., Gutin, G., Mitra, G., and Zverovitch, A., Extracting Pure Network Submatrices in Linear Programs Using Signed Graphs, Discret. Appl. Math., 2004, vol. 137, no. 3, pp. 359–372.

    Article  MATH  Google Scholar 

  33. Afraimovich, L.G., Three-Index Linear Programs with Nested Structure, Autom. Remote Control, 2011, vol. 72, no. 8, pp. 1679–1689.

    Article  Google Scholar 

  34. Afraimovich, L.G., Cyclic Reducibility of the Multi-index Systems of the Transport-type Linear Inequalities, Izv. Ross. Akad. Nauk, Teor. Sist. Upravlen., 2010, no. 4, pp. 83–90.

  35. Burkard, R.E., Rudolf, R., and Woeginger, G.J., Three-dimensional Axial Assignment Problems with Decomposable Cost Coefficients, Discret. Appl. Math., 1996, vol. 65, pp. 123–139.

    Article  MATH  MathSciNet  Google Scholar 

  36. Bandelt, H.J., Crama, Y., and Spieksma, F.C.R., Approximation Algorithms for Multidimensional Assignment Problems with Decomposable Costs, Discret. Appl. Math., 1994, vol. 49, pp. 25–50.

    Article  MATH  MathSciNet  Google Scholar 

  37. Queyranne, M. and Spieksma, F.C.R., Approximation Algorithms for Multi-Index Transportation Problems with Decomposable Costs, Discret. Appl. Math., 1997, vol. 76, pp. 239–253.

    Article  MATH  MathSciNet  Google Scholar 

  38. Chen, B., Potts, C.N., and Woeginger, G.J., A Review of Machine Scheduling. Complexity, Algorithms and Approximability, in Handbook of Combinatorial Optimization, New York: Kluwer, 1998, vol. 3, pp. 21–169.

    Google Scholar 

  39. Kanatnikov, A.N. and Krishchenko, A.P., Lineinaya algebra (Linear Algebra), Moscow: MGTU, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lobachevskii State University, Nizhni Novgorod, Russia

    L. G. Afraimovich

Authors
  1. L. G. Afraimovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © L.G. Afraimovich, 2012, published in Avtomatika i Telemekhanika, 2012, No. 1, pp. 130–147.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Afraimovich, L.G. Multi-index transport problems with decomposition structure. Autom Remote Control 73, 118–133 (2012). https://doi.org/10.1134/S0005117912010092

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117912010092

Keywords

Search

Navigation