Program trace optimization with constructive heuristics for combinatorial problems

DOI10.1007/978-3-030-16711-0_13zbMath1525.90369OpenAlexW2938433958MaRDI QIDQ6084521

Alberto Moraglio, James P. McDermott

Publication date: 1 December 2023

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10871/36291

zbMATH Keywords

GRASPconstructive heuristicssearch operators

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A greedy genetic algorithm for the quadratic assignment problem
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
• Greedy randomized adaptive search procedures
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Genetic Algorithms and Random Keys for Sequencing and Optimization

This page was built for publication: Program trace optimization with constructive heuristics for combinatorial problems