Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
A tabu search heuristic for the vehicle routing problem
Management Science
American Journal of Mathematical and Management Sciences - Modern digital simulation methodology, III
A systematic procedure for setting parameters in simulated annealing algorithms
Computers and Operations Research
Design and Analysis of Experiments
Design and Analysis of Experiments
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
Computers and Industrial Engineering
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Operations Research
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A Rigorous Evaluation of Crossover and Mutation in Genetic Programming
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
An experimental investigation of model-based parameter optimisation: SPO and beyond
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Automatic algorithm configuration based on local search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
Tuning the performance of the MMAS heuristic
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
A gender-based genetic algorithm for the automatic configuration of algorithms
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
ISAC --Instance-Specific Algorithm Configuration
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Off-line vs. on-line tuning: a study on MAX–MIN ant system for the TSP
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
A math-heuristic algorithm for the DNA sequencing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Time-bounded sequential parameter optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Tuning metaheuristics: A data mining based approach for particle swarm optimization
Expert Systems with Applications: An International Journal
Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Applications of racing algorithms: an industrial perspective
EA'05 Proceedings of the 7th international conference on Artificial Evolution
On MAX - MIN ant system's parameters
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Instance-Based parameter tuning via search trajectory similarity clustering
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Computers and Industrial Engineering
DOE-based parameter tuning for local branching algorithm
International Journal of Metaheuristics
Calibrating continuous multi-objective heuristics using mixture experiments
Journal of Heuristics
International Journal of Applied Metaheuristic Computing
Automatic (offline) configuration of algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A path relinking algorithm for a multi-depot periodic vehicle routing problem
Journal of Heuristics
A hybrid metaheuristic approach for the capacitated p-median problem
Applied Soft Computing
Hi-index | 0.00 |
In this paper, we propose a procedure, based on statistical design of experiments and gradient descent, that finds effective settings for parameters found in heuristics. We develop our procedure using four experiments. We use our procedure and a small subset of problems to find parameter settings for two new vehicle routing heuristics. We then set the parameters of each heuristic and solve 19 capacity-constrained and 15 capacity-constrained and route-length-constrained vehicle routing problems ranging in size from 50 to 483 customers. We conclude that our procedure is an effective method that deserves serious consideration by both researchers and operations research practitioners.