Constraint programming and genetic algorithms to solve layout design problem

Authors:
José Tavares
Affiliations:
Knowledge Engineering and Decision Support Group, Institute of Engineering, Polytechnic of Porto, Porto, Portugal
Venue:
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Year:
2005

Citing 3
Cited 0

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algorithms for constraint-satisfaction problems: a survey

AI Magazine
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Real world optimization problems are typically complex and difficult to solve. In this work it is intended to address these problems through a combination of two techniques: Constraint Logic Programming (CLP) and Genetic Algorithms (GA). This approach aims to benefit, on the one hand, from the easiness and naturalness of the CLP to express problems whose formulation is based on constraints, and on the other hand, from the ability that GA have in attaining good solutions to a particular problem, manly when specific and efficient methods to solve the problem suitable way do not exist. As a case study these ideas were tested to solve the Facility Layout Problem which is one of the most difficult problems that face researchers experimenting with complex systems to real world applications. It relies with the design and location of production lines, machinery and equipment, inventory storage and shipping facilities.