Finding non-dominated solutions for biobjective integer transportation problem
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
A bi-objective programming problem for a transportation model is proposed in this research. The objectives are to minimize the total transportation cost and the other functions. This paper deal with an algorithm for nding all the non-dominated solutions and corresponding ecient solutions for bi-objective integer transportation problems and giving the best ecient solution for problem too.
Abstract
A bi-objective programming problem for a transportation model is proposed in this research. The objectives are to minimize the total transportation cost and the other functions. This paper deal with an algorithm for nding all the non-dominated solutions and corresponding ecient solutions for bi-objective integer transportation problems and giving the best ecient solution for problem too.
참고문헌 (7)
- Augusto Eusebio, "Finding non-dominated solutions in biobjective integer network ow problems", Comuter & Operation Research, 36, pp.2554~2564 (2009)
- Bazaraa MS, "Linear programming and network ows 2th ed" (1975)
- Ehrgott M, "Multicriteria optimization, 2nd ed" (2005), Springer
- Eusebio A, "On computation of all supported ecient solution in multi- objective", European journal of Operational Research (2008)
- Hamdy Taha, "Operation Research, an introduction, 2th ed" (1976), Macmillan publication Co
- Przybylski A, "The biobjective integer minimum cost ow prob- lem", Computer Operation Research, 28, pp.139~156 (2001)
- Steuer RE, "Multiple criteria optimization : theory, computation and application" (1986), Wiley