Genetic algorithm optimisation of part placement using a connection-based coding method

DOI10.1007/3-540-48035-8_23MaRDI QIDQ3047739zbMATH OpenFDO

Authors Alan Crispin, Paul Clay, Gaynor Taylor, Robert Hackney, Tom Bayes, David Reedman

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2358/23580232.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• Layout of two dimensional irregular shapes using genetic algorithms
• Resolution of strip-packing problems with genetic algorithms
• A method for optimising the nesting of multiple, highly complex shapes using a modified simulated annealing algorithm
• Genetic Algorithms and Heuristic Rules for Solving the Nesting Problem in the Package Industry

Cited in

(1)

• A new algorithm for minimizing surplus parts in selective assembly by using genetic algorithm

This page was built for publication: Genetic algorithm optimisation of part placement using a connection-based coding method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3047739)