Volume 25, Issue 1 (5-2014)                   2014, 25(1): 31-43 | Back to browse issues page

XML Persian Abstract Print

Bu Ali Sina university , ramin_sadeghian@yahoo.com
Abstract:   (7373 Views)
In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is performed on a bi-objective problem. Next the process is performed on a tri-objective problem, and finally it is developed on each general multi objective integer programming (MOIP) problem. In this paper, a numerical example such as tri-objective assignment problem is presented to clear the proposed method.
Full-Text [PDF 4220 kb]   (6142 Downloads)    
Type of Study: Research | Subject: Operations Research
Received: 2011/04/22 | Accepted: 2014/05/26 | Published: 2014/05/26

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.