Program trace optimization with constructive heuristics for combinatorial problems

DOI10.1007/978-3-030-16711-0_13MaRDI QIDQ6084521zbMATH OpenOpenAlexFDO

Authors James P. McDermott, Alberto Moraglio

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

constructive heuristicsGRASPsearch operators

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2156299
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• scientific article; zbMATH DE number 5774615
• Model-based search for combinatorial optimization: A critical survey
• A unified modeling and solution framework for combinatorial optimization problems

Cites work

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

Cited in

(1)

• On the graph traversal method for evaluating linear binary-chain programs

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

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