The Quadratic Assignment Problem
The Quadratic Assignment Problem

Author: E. Cela

Publisher: Springer Science & Business Media

Published: 2013-03-14

Total Pages: 296

ISBN-13: 1475727879

DOWNLOAD EBOOK

The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.

Quadratic Assignment and Related Problems
Quadratic Assignment and Related Problems

Author: Panos M. Pardalos

Publisher: American Mathematical Soc.

Published: 1994-01-01

Total Pages: 380

ISBN-13: 9780821870624

DOWNLOAD EBOOK

The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms.

Advanced Research in Applied Artificial Intelligence
Advanced Research in Applied Artificial Intelligence

Author: He Jiang

Publisher: Springer

Published: 2012-06-30

Total Pages: 846

ISBN-13: 3642310877

DOWNLOAD EBOOK

This volume constitutes the thoroughly refereed conference proceedings of the 25th International Conference on Industrial Engineering and Other Applications of Applied Intelligend Systems, IEA/AIE 2012, held in Dalian, China, in June 2012. The total of 82 papers selected for the proceedings were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on machine learning methods; cyber-physical system for intelligent transportation applications; AI applications; evolutionary algorithms, combinatorial optimization; modeling and support of cognitive and affective human processes; natural language processing and its applications; social network and its applications; mission-critical applications and case studies of intelligent systems; AI methods; sentiment analysis for asian languages; aspects on cognitive computing and intelligent interaction; spatio-temporal datamining, structured learning and their applications; decision making and knowledge based systems; pattern recognition; agent based systems; decision making techniques and innovative knowledge management; machine learning applications.

Parallel Problem Solving from Nature -- PPSN XIII
Parallel Problem Solving from Nature -- PPSN XIII

Author: Thomas Bartz-Beielstein

Publisher: Springer

Published: 2014-09-11

Total Pages: 977

ISBN-13: 3319107623

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 13th International Conference on Parallel Problem Solving from Nature, PPSN 2013, held in Ljubljana, Slovenia, in September 2014. The total of 90 revised full papers were carefully reviewed and selected from 217 submissions. The meeting began with 7 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN XIII also included 9 tutorials. The papers are organized in topical sections on adaption, self-adaption and parameter tuning; classifier system, differential evolution and swarm intelligence; coevolution and artificial immune systems; constraint handling; dynamic and uncertain environments; estimation of distribution algorithms and metamodelling; genetic programming; multi-objective optimisation; parallel algorithms and hardware implementations; real world applications; and theory.

Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)
Tree-Search Algorithms for Quadratic Assignment Problems (Classic Reprint)

Author: John F. Pierce

Publisher: Forgotten Books

Published: 2018-02-21

Total Pages: 82

ISBN-13: 9780666104328

DOWNLOAD EBOOK

Excerpt from Tree-Search Algorithms for Quadratic Assignment Problems In some contexts there may be constraints applicable to the problem which are not represented in the statement as embodied in (i) For example, there may be a restriction that plant i Ot be 10c3t9d at 3. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Essays and Surveys in Metaheuristics
Essays and Surveys in Metaheuristics

Author: Celso C. Ribeiro

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 647

ISBN-13: 1461515076

DOWNLOAD EBOOK

Finding exact solutions to many combinatorial optimization problems in busi ness, engineering, and science still poses a real challenge, despite the impact of recent advances in mathematical programming and computer technology. New fields of applications, such as computational biology, electronic commerce, and supply chain management, bring new challenges and needs for algorithms and optimization techniques. Metaheuristics are master procedures that guide and modify the operations of subordinate heuristics, to produce improved approx imate solutions to hard optimization problems with respect to more simple algorithms. They also provide fast and robust tools, producing high-quality solutions in reasonable computation times. The field of metaheuristics has been fast evolving in recent years. Tech niques such as simulated annealing, tabu search, genetic algorithms, scatter search, greedy randomized adaptive search, variable neighborhood search, ant systems, and their hybrids are currently among the most efficient and robust optimization strategies to find high-quality solutions to many real-life optimiza tion problems. A very large nmnber of successful applications of metaheuristics are reported in the literature and spread throughout many books, journals, and conference proceedings. A series of international conferences entirely devoted to the theory, applications, and computational developments in metaheuristics has been attracting an increasing number of participants, from universities and the industry.