An Algorithm for Solving Bi-criteria Large Scale Transshipment Problems
Keywords:
large scale transportation problem, transshipment problem, multi-objective, decision making, decomposition technique of linear programming
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2014-10-15
Issue
Section
License
Copyright (c) 2014 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.