2-Opt population training for minimization of open stack problem

DOI10.1007/3-540-36127-8_30MaRDI QIDQ4438009zbMATH OpenFDO

Authors Alexandre de Oliveira, Luiz Antonio Nogueira Lorena

Publication date 8 December 2003

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/2507/25070313.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A biased random-key genetic algorithm for the minimization of open stacks problem
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines
• Analysis of distributed genetic algorithms for solving cutting problems
• On a pattern sequencing problem to minimize the maximum number of open stacks

Cited in

(2)

• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• A biased random-key genetic algorithm for the minimization of open stacks problem

This page was built for publication: 2-Opt population training for minimization of open stack problem

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