EPrints@IIT Delhi >
Faculty Research Publicatons  >
Computer Science and Engineering >

Please use this identifier to cite or link to this item: http://eprint.iitd.ac.in/handle/2074/198

Title: Iterative deepening multiobjective
Authors: Harikumar, S
Kumar, Shashi
Keywords: Algorithms
Combinatorial problems
Multiobjective search
Analysis of algorithms
Issue Date: 1996
Publisher: Elsevier Science
Citation: Information Processing Letters 58 , 11 - 15
Abstract: Many real-world optimization problems involve multiple objectives which are often conflicting. When conventional heuristic search algorithms such as A* and IDA* are used for solving such problems, then these problems have to be modeled as simple cost minimization or maximization problems. The task of modeling such problems using a single valued crite- rion has often proved difficult [6]. The problems involved in accurately and confidently determining a scalar valued criterion on which to base the selection of a most preferred alternative have led to the devel- opment of the multiobjective approach to alternative selection [7]. In [7], Stewart and White have pre- sented a multiobjective generalization of the popular A* algorithm, the MOA* , which uses heuristic based best first search techniques to generate all non- dominated solutions. Like A*, MOA* also has expo- nential space complexity. Depth first search tech- niques use linear space, but take too much time and do not lead to an admissible algorithm.
URI: http://eprint.iitd.ac.in/dspace/handle/2074/198
Appears in Collections:Computer Science and Engineering

Files in This Item:

File Description SizeFormat
harikumarite96.pdf418.44 kBAdobe PDFView/Open
View Statistics

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


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback