scientific article
From MaRDI portal
Publication:3064527
zbMath1204.68280MaRDI QIDQ3064527
Prasanna Balaprakash, Zhi Yuan, Thomas Stützle, Mauro Birattari
Publication date: 22 December 2010
Full work available at URL: http://www.springerlink.com/content/n420wl066r2172g8/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Fleet design optimisation from historical data using constraint programming and large neighbourhood search, Balancing bike sharing systems with constraint programming, Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms, ASlib: a benchmark library for algorithm selection, A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem, SATenstein: automatically building local search SAT solvers from components, A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem, A hybrid metaheuristic approach for the capacitated arc routing problem, Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem, Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading, Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem, Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021, Boosting evolutionary algorithm configuration, Feature-based tuning of single-stage simulated annealing for examination timetabling, Ants can orienteer a thief in their robbery, On the impact of the performance metric on efficient algorithm configuration, Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling, A weighted-sum method for solving the bi-objective traveling thief problem, Synergies between operations research and data mining: the emerging use of multi-objective approaches, Task design in complex crowdsourcing experiments: item assignment optimization, MPILS: an automatic tuner for MILP solvers, Modeling and solving the steelmaking and casting scheduling problem, The double traveling salesman problem with partial last‐in‐first‐out loading constraints, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, Hyperparameter autotuning of programs with HybridTuner, Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem, Two phased hybrid local search for the periodic capacitated arc routing problem, Exact and metaheuristic methods for a real-world examination timetabling problem, A hybrid primal heuristic for finding feasible solutions to mixed integer programs, A parallel adaptive memory algorithm for the capacitated modular hub location problem, A demand‐responsive feeder service with a maximum headway at mandatory stops, Region based memetic algorithm for real-parameter optimisation, A matheuristic for the driver scheduling problem with staff cars, Revisiting simulated annealing: a component-based analysis, Hybrid evolutionary search for the traveling repairman problem with profits, Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives, A novel hybrid PSO-based metaheuristic for costly portfolio selection problems, A hybrid evolutionary search for the generalized quadratic multiple knapsack problem, A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints, Automatically improving the anytime behaviour of optimisation algorithms, The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications, Robust university course timetabling problem subject to single and multiple disruptions, A unified ant colony optimization algorithm for continuous optimization, Efficiently solving the traveling thief problem using hill climbing and simulated annealing, Exploring further advantages in an alternative formulation for the set covering problem, Unnamed Item, Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers, OptiLog: a framework for SAT-based systems, PyDGGA: distributed GGA for automatic configuration
Uses Software
