Multiobjective Heuristic Search (Paperback)

Pallab Dasgupta

ISBN 10: 3528057084 / ISBN 13: 9783528057084

Edité par Elsevier Science & Technology, San Francisco, 1999

A propos de cet article

Paperback. Solutions to most real-world optimization problems involve a trade-off between multiple conflicting and non-commensurate objectives. Some of the most challenging ones are area-delay trade-off in VLSI synthesis and design space exploration, time-space trade-off in computation, and multi-strategy games. Conventional search techniques are not equipped to handle the partial order state spaces of multiobjective problems since they inherently assume a single scalar objective function. Multiobjective heuristic search techniques have been developed to specifically address multicriteria combinatorial optimization problems. This text describes the multiobjective search model and develops the theoretical foundations of the subject, including complexity results . The fundamental algorithms for three major problem formulation schemes, namely state-space formulations, problem-reduction formulations, and game-tree formulations are developed with the support of illustrative examples. Applications of multiobjective search techniques to synthesis problems in VLSI, and operations research are considered. This text provides a complete picture on contemporary research on multiobjective search, most of which is the contribution of the authors. Solutions to most real-world optimization problems involve a trade-offbetween multiple conflicting and non-commensurate objectives. Some ofthe most challenging ones are area-delay trade-off in VLSI synthesisand design space exploration, time-space trade-off in computation, andmulti-strategy games. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

N° de réf. du vendeur 9783528057084

Détails bibliographiques

• Titre: Multiobjective Heuristic Search (Paperback)
• Éditeur: Elsevier Science & Technology, San Francisco
• Date de parution: 1999
• Langue: anglais
• ISBN à 10 chiffres: 3528057084
• ISBN à 13 chiffres: 9783528057084
• Reliure: Paperback
• Édition: Edition originale
• État de l'article: new

A propos de ce titre

Synopsis

A large number of problems require the optimization of multiple criteria. These crite- ria are often non-commensurate and sometimes conflicting in nature making the task of optimization more difficult. In such problems, the task of creating a combined opti- mization function is often not easy. Moreover, the decision procedure can be affected by the sensitivity of the solution space, and the trade-off is often non-linear. In real life we traditionally handle such problems by suggesting not one, but several non-dominated solutions. Finding a set of non-dominated solutions is also useful in multistaged opti- mization problems, where the solution of one stage of optimization is passed on to the next stage. One classic example is that of circuit design, where high-level synthesis, logic synthesis and layout synthesis comprise important stages of optimization of the circuit. Passing a set of non-dominated partial solutions from one stage to the next typically ensures better global optimization. This book presents a new approach to multi-criteria optimization based on heuristic search techniques. Classical multicriteria optimization techniques rely on single criteria optimization algorithms, and hence we are either required to optimize one criterion at a time (under constraints on the others), or we are asked for a single scalar combined optimization function. On the other hand, the multiobjective search approach maps each optimization criterion onto a distinct dimension of a vector valued cost structure.

À propos de l?auteur

Assistant Professor Dr. Pallab Dasgupta, Associate Professor Dr. P.P. Chakrabarti and Professor Dr. S. C. DeSarkar are at the Department of Computer Science & Engineering at the Indian Institute of Technology Kharagpur, INDIA 721302