SPOT

swMATH6347CRANSPOTMaRDI QIDQ18474FDOQ18474

Sequential Parameter Optimization Toolbox

Martin Zaefferer, Frederik Rehbach, Thomas Bartz-Beielstein

Last update: 25 June 2022

Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0

Software version identifier: 2.11.14

Official website: http://cran.r-project.org/web/packages/SPOT/index.html

Source code repository: https://github.com/cran/SPOT

Cited In (only showing first 100 items - show all)

• Efficient multi-start strategies for local search algorithms
• A unified ant colony optimization algorithm for continuous optimization
• Fleet design optimisation from historical data using constraint programming and large neighbourhood search
• Balancing bike sharing systems with constraint programming
• Algorithm portfolio selection as a bandit problem with unbounded losses
• Generating applicable synthetic instances for branch problems
• The Sequential Parameter Optimization Toolbox
• Algorithm runtime prediction: methods \& evaluation
• Evolutionary algorithms for single and multicriteria design optimization
• Experimental research in evolutionary computation. The new experimentalism
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• Exact hypervolume subset selection through incremental computations
• Capacity consumption analysis using heuristic solution method for under construction railway routes
• Experimental Methods for the Analysis of Optimization Algorithms
• A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
• Robust optimization - a comprehensive survey
• Heuristic search to the capacitated clustering problem
• Improving the anytime behavior of two-phase local search
• Tuning metaheuristics. A machine learning Perspective
• Evolutionary self-adaptation: a survey of operators and strategy parameters
• Algorithms for the workflow satisfiability problem engineered for counting constraints
• Hybrid evolutionary search for the traveling repairman problem with profits
• GLOB
• Hyperheuristics
• EVE-OPT
• EasyLocal++
• Gstat
• BoneRoute
• Knapsack
• LKH
• CMA-ES
• Spacemap
• libagf
• METSlib
• DISCRETA
• ROptEst
• GVF
• SSPMO
• dunn.test
• irace
• ifs
• PDEtools
• MIRPLib
• SMS-EMOA
• CANONIK
• SATenstein
• json2run
• PySCIPOpt
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
• A decision support tool for generating shipping data for the Hunter Valley coal chain
• GRADIENT
• CBMix
• FES
• CEC 05
• FEMOEA
• SMAC
• flacco
• WorkflowSim
• MLaut
• COBAYN
• PARPAP
• RobinX
• weightedHypervolume
• CAMOS
• Performance Assessment
• MATILDA
• A new dispatching rule based genetic algorithm for the multi-objective job shop problem
• Design and Analysis of Computational Experiments: Overview
• SPOTMisc
• Multi-objective combinatorial optimization: problematic and context
• babsim.hospital
• Two phased hybrid local search for the periodic capacitated arc routing problem
• On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
• Automatically improving the anytime behaviour of optimisation algorithms
• Paramils: an automatic algorithm configuration framework
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• A survey of variants and extensions of the location-routing problem
• A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
• Time-series event-based prediction: an unsupervised learning framework based on genetic programming
• MPILS
• Automatic algorithm design for hybrid flowshop scheduling problems
• Rollout-based routing strategies with embedded prediction: a fish trawling application
• Emergence, analysis and evolution of structures. Concepts and strategies across disciplines
• Microforecasting methods for fresh food supply chain management: a computational study
• HUBBI
• An effective iterated tabu search for the maximum bisection problem
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• Revisiting simulated annealing: a component-based analysis
• Task design in complex crowdsourcing experiments: item assignment optimization
• EpiSIX
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
• On the estimation of Pareto fronts from the point of view of copula theory
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
• Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• A model of anytime algorithm performance for bi-objective optimization

This page was built for software: SPOT