Tuning metaheuristics. A machine learning Perspective

DOI10.1007/978-3-642-00483-4zbMath1183.68464OpenAlexW4251464645WikidataQ62672038 ScholiaQ62672038MaRDI QIDQ1012715

Publication date: 22 April 2009

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00483-4

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items

Comparison of metaheuristics for the k‐labeled spanning forest problem, Effective learning hyper-heuristics for the course timetabling problem, Best practices for comparing optimization algorithms, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration, OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms, An efficient algorithm for unconstrained optimization, Runtime analysis for self-adaptive mutation rates, Capping methods for the automatic configuration of optimization algorithms, Synergies between operations research and data mining: the emerging use of multi-objective approaches, An optimization algorithm inspired by social creativity systems, MPILS: an automatic tuner for MILP solvers, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem, Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, A multilevel evaluation method for heuristics with an application to the VRPTW, Automatic performance tuning for Albany Land Ice, Algorithms for the minmax regret path problem with interval data, Region based memetic algorithm for real-parameter optimisation, A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem, An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems, Review on nature-inspired algorithms, Methods for improving the efficiency of swarm optimization algorithms. A survey, A joint problem of strategic workforce planning and fleet renewal: with an application in defense, New genetic algorithm approach for the MIN-degree constrained minimum spanning tree, A methodology for determining an effective subset of heuristics in selection hyper-heuristics, Collaborative vehicle routing: a survey, Automatically improving the anytime behaviour of optimisation algorithms, Large neighbourhood search algorithms for the founder sequence reconstruction problem, Estimation-based metaheuristics for the probabilistic traveling salesman problem, Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms, Adaptation of the method of musical composition for solving the multiple sequence alignment problem, A heuristic and an exact method for the gate matrix connection cost minimization problem, Memory and Learning in Metaheuristics, Rollout-based routing strategies with embedded prediction: a fish trawling application

Uses Software