A black-box scatter search for optimization problems with integer variables

DOI10.1007/s10898-013-0061-2zbMath1305.90304OpenAlexW2060532382MaRDI QIDQ742141

Abraham Duarte, Rafael Martí, Manuel Laguna, Micael Gallego, Francisco Gortazar

Publication date: 18 September 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-013-0061-2

zbMATH Keywords

metaheuristicsblack-box optimizationhard optimization problems

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, A heuristic algorithm for a supply chain's production-distribution planning, Scatter search for minimizing weighted tardiness in a single machine scheduling with setups, The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables, A metaheuristic for a numerical approximation to the mass transfer problem, A derivative-free approach for a simulation-based optimization problem in healthcare, Derivative-free methods for mixed-integer constrained optimization problems, Review and comparison of algorithms and software for mixed-integer derivative-free optimization

Uses Software

• Scatter Search
• EPANET
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A distribution-free approach to inducing rank correlation among input variables
• Heuristics for the bandwidth colouring problem
• Hybrid scatter tabu search for unconstrained global optimization
• Hybridizing the cross-entropy method: An application to the max-cut problem
• Black box scatter search for general classes of binary optimization problems
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Experimental testing of advanced scatter search designs for global optimization of multimodal functions
• Context-Independent Scatter and Tabu Search for Permutation Problems
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• A class of bounded approximation algorithms for graph partitioning
• The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A variable neighbourhood search algorithm for the constrained task allocation problem
• A Memetic Algorithm for Water Distribution Network Design
• Adaptive memory programming: a unified view of metaheuristics