Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13562
Title: Heuristic algorithms for solving a class of multiobjective zero-one programming problems
Authors: ZHANG CAIWEN
Keywords: Multiobjective integer programming, LP-based heuristic, Epsilon-Nondominated solution, Knapsack problem, Generalized assignment problem
Issue Date: 5-Nov-2003
Source: ZHANG CAIWEN (2003-11-05). Heuristic algorithms for solving a class of multiobjective zero-one programming problems. ScholarBank@NUS Repository.
Abstract: This thesis is devoted to the design and development of heuristics for solving multiobjective zero-one integer linear programming problems. We present some useful concepts and propose some heuristic methods for finding the epsilon-nondominated solutions. The proposed method decomposes a multiobjective zero-one programming problem into a series of single objective problems. Efficient LP-based heuristics, which capitalize on the similarity between the optimal solution of a zero-one programming problem and that of its corresponding LP problem, are employed to solve these single objective problems. In particular, the proposed methods are applied to two classes of problems, i.e. the multiobjective zero-one knapsack problem and the multiobjective generalized assignment problem. Extensive computational experiments have demonstrated that the methods we proposed are very effective and efficient for solving these classes of problems. These methods can also be extended to other multiobjective zero-one programming problems, especially the other members from the family of the knapsack problems.
URI: http://scholarbank.nus.edu.sg/handle/10635/13562
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ZhangCW.pdf1.72 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

245
checked on Dec 11, 2017

Download(s)

167
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.