SPOT

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

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

Related Items (87)

A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ Fleet design optimisation from historical data using constraint programming and large neighbourhood search ⋮ Balancing bike sharing systems with constraint programming ⋮ Heuristic search to the capacitated clustering problem ⋮ Capacity consumption analysis using heuristic solution method for under construction railway routes ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A scatter search algorithm for the distributed permutation flowshop scheduling problem ⋮ Emergence, analysis and evolution of structures. Concepts and strategies across disciplines ⋮ A survey of variants and extensions of the location-routing problem ⋮ A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem ⋮ Algorithms for the workflow satisfiability problem engineered for counting constraints ⋮ 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 ⋮ Matheuristics for the single-path design-balanced service network design problem ⋮ An iterated ``hyperplane exploration approach for the quadratic knapsack problem ⋮ Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ An effective iterated tabu search for the maximum bisection problem ⋮ Large-scale vehicle routing problems: quantum annealing, tunings and results ⋮ Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 ⋮ Feature-based tuning of single-stage simulated annealing for examination timetabling ⋮ Ants can orienteer a thief in their robbery ⋮ A new dispatching rule based genetic algorithm for the multi-objective job shop problem ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Exact hypervolume subset selection through incremental computations ⋮ A weighted-sum method for solving the bi-objective traveling thief problem ⋮ Evolutionary self-adaptation: a survey of operators and strategy parameters ⋮ Task design in complex crowdsourcing experiments: item assignment optimization ⋮ Improving the anytime behavior of two-phase local search ⋮ Algorithm portfolio selection as a bandit problem with unbounded losses ⋮ A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization ⋮ Schrödinger wave functional in quantum Yang-Mills theory from precanonical quantization ⋮ Two phased hybrid local search for the periodic capacitated arc routing problem ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs ⋮ Experimental Methods for the Analysis of Optimization Algorithms ⋮ A survey of the standard location-routing problem ⋮ Region based memetic algorithm for real-parameter optimisation ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ A large set of torus obstructions and how they were discovered ⋮ A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem ⋮ A matheuristic for the driver scheduling problem with staff cars ⋮ Generation techniques for linear programming instances with controllable properties ⋮ What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing ⋮ Algorithm runtime prediction: methods \& evaluation ⋮ A novel hybrid PSO-based metaheuristic for costly portfolio selection problems ⋮ On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation ⋮ Multi-Objective Combinatorial Optimization: Problematic and Context ⋮ On the estimation of Pareto fronts from the point of view of copula theory ⋮ Heuristics for periodical batch job scheduling in a MapReduce computing framework ⋮ A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints ⋮ Microforecasting methods for fresh food supply chain management: a computational study ⋮ Time-series event-based prediction: an unsupervised learning framework based on genetic programming ⋮ Automatically improving the anytime behaviour of optimisation algorithms ⋮ Experimental research in evolutionary computation. The new experimentalism ⋮ SPOTMisc ⋮ A model of anytime algorithm performance for bi-objective optimization ⋮ Evolutionary algorithms for single and multicriteria design optimization ⋮ babsim.hospital ⋮ Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis ⋮ The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications ⋮ A bi-objective heuristic approach for green identical parallel machine scheduling ⋮ Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms ⋮ Design and Analysis of Computational Experiments: Overview ⋮ The Sequential Parameter Optimization Toolbox ⋮ Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches ⋮ Automatic algorithm design for hybrid flowshop scheduling problems ⋮ A unified ant colony optimization algorithm for continuous optimization ⋮ Tuning metaheuristics. A machine learning Perspective ⋮ Efficient Multi-Start Strategies for Local Search Algorithms ⋮ FUZZY OPERATOR TREES FOR MODELING RATING FUNCTIONS ⋮ Robust optimization - a comprehensive survey ⋮ ParamILS: An Automatic Algorithm Configuration Framework ⋮ Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach ⋮ Efficiently solving the traveling thief problem using hill climbing and simulated annealing ⋮ 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 ⋮ Generating Applicable Synthetic Instances for Branch Problems ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ Rollout-based routing strategies with embedded prediction: a fish trawling application

This page was built for software: SPOT