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

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

Cited In (87)

• Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches
• Rollout-based routing strategies with embedded prediction: a fish trawling application
• Microforecasting methods for fresh food supply chain management: a computational study
• Task design in complex crowdsourcing experiments: item assignment optimization
• 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
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• A model of anytime algorithm performance for bi-objective optimization
• 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
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
• On the impact of the performance metric on efficient algorithm configuration
• A weighted-sum method for solving the bi-objective traveling thief problem
• Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
• Generation techniques for linear programming instances with controllable properties
• The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
• FUZZY OPERATOR TREES FOR MODELING RATING FUNCTIONS
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• 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
• Schrödinger wave functional in quantum Yang-Mills theory from precanonical quantization
• Ants can orienteer a thief in their robbery
• 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
• Automatic algorithm design for hybrid flowshop scheduling problems
• Algorithm portfolio selection as a bandit problem with unbounded losses
• Emergence, analysis and evolution of structures. Concepts and strategies across disciplines
• Multi-Objective Combinatorial Optimization: Problematic and Context
• Generating applicable synthetic instances for branch problems
• An effective iterated tabu search for the maximum bisection problem
• 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
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• Revisiting simulated annealing: a component-based analysis
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• ParamILS: An Automatic Algorithm Configuration Framework
• 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
• Efficient Multi-Start Strategies for Local Search Algorithms
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure
• 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
• Matheuristics for the single-path design-balanced service network design problem
• Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
• Large-scale vehicle routing problems: quantum annealing, tunings and results
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• Improving the anytime behavior of two-phase local search
• A survey of the standard location-routing problem
• Tuning metaheuristics. A machine learning Perspective
• A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
• 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
• 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
• Region based memetic algorithm for real-parameter optimisation
• A new dispatching rule based genetic algorithm for the multi-objective job shop problem
• Design and Analysis of Computational Experiments: Overview
• A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
• SPOTMisc
• Efficiently solving the traveling thief problem using hill climbing and simulated annealing
• Exploring further advantages in an alternative formulation for the set covering problem
• babsim.hospital
• A hybrid primal heuristic for finding feasible solutions to mixed integer programs
• Heuristics for periodical batch job scheduling in a MapReduce computing framework
• Two phased hybrid local search for the periodic capacitated arc routing problem
• How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
• 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
• Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
• 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

This page was built for software: SPOT