A biased random-key genetic algorithm for the minimization of open stacks problem

DOI10.1111/itor.12109zbMath1338.90338OpenAlexW2103937264MaRDI QIDQ2803254

Miguel Dias Costa, José Fernando Gonçalves, Mauricio G. C. Resende

Publication date: 4 May 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/5384

zbMATH Keywords

biased random-key genetic algorithmrandom keyscutting patternminimization of open stacks problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Solving the set packing problem via a maximum weighted independent set heuristic, Efficient approaches for the flooding problem on graphs, An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls, A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains, A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation, Mathematical models for the minimization of open stacks problem, The capacitated family traveling salesperson problem, A biased random-key genetic algorithm for single-round divisible load scheduling, A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure

Cites Work

• Unnamed Item
• Heuristics for sequencing cutting patterns
• The minimization of open stacks problem: a review of some properties and their use in pre-processing operations
• Establishing the optimality of sequencing heuristics for cutting stock problems
• On a pattern sequencing problem to minimize the maximum number of open stacks
• Applications of modern heuristic search methods to pattern sequencing problems
• Heuristic and exact methods for the cutting sequencing problem
• Improved heuristics for sequencing cutting patterns
• A parallel multi-population biased random-key genetic algorithm for a container loading 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
• A genetic algorithm for the resource constrained multi-project scheduling problem
• A hybrid genetic algorithm for the job shop scheduling problem
• Dynamic Programming to Minimize the Maximum Number of Open Stacks
• Refinements on an enumeration scheme for solving a pattern sequencing problem
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A multiple-population evolutionary approach to gate matrix layout
• Randomized heuristics for the family traveling salesperson problem
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling