Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Genetic Programming and Evolvable Machines
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems
Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Design of Iterated Local Search Algorithms
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Four point conditions and exponential neighborhoods for symmetric TSP
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics
MA|PM: memetic algorithms with population management
Computers and Operations Research
Approximation algorithms for minimizing the total weighted tardiness on a single machine
Theoretical Computer Science
Block approach: tabu search algorithm for single machine total weighted tardiness problem
Computers and Industrial Engineering
Exponential neighborhood search for a parallel machine scheduling problem
Computers and Operations Research
Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems
International Journal of Intelligent Systems Technologies and Applications
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Expert Systems with Applications: An International Journal
Computers and Operations Research
Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
Computers and Operations Research
The max K-armed bandit: a new model of exploration applied to search heuristic selection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
An exact algorithm for single-machine scheduling without machine idle time
Journal of Scheduling
Block approach-tabu search algorithm for single machine total weighted tardiness problem
Computers and Industrial Engineering
MA|PM: memetic algorithms with population management
Computers and Operations Research
Matheuristics: Optimization, Simulation and Control
HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics
Fast neighborhood search for the single machine earliness-tardiness scheduling problem
Computers and Operations Research
Stochastic local search for multiprocessor scheduling for minimum total tardiness
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Combinations of local search and exact algorithms
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Bandit-based Monte-Carlo planning for the single-machine total weighted tardiness scheduling problem
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Threshold accepting framework for discrete and continuous search spaces
International Journal of Innovative Computing and Applications
Computers and Industrial Engineering
Hybrid metaheuristics in combinatorial optimization: A survey
Applied Soft Computing
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
Computers and Operations Research
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Unsupervised bilingual POS tagging with Markov random fields
EMNLP '11 Proceedings of the First Workshop on Unsupervised Learning in NLP
On the theoretical properties of swap multimoves
Operations Research Letters
Dynasearch for the earliness-tardiness scheduling problem with release dates and setup constraints
Operations Research Letters
Fast neighborhood search for the single machine total weighted tardiness problem
Operations Research Letters
Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
Operations Research Letters
Operations Research Letters
Computers and Operations Research
Computers and Operations Research
Some heuristics for no-wait flowshops with total tardiness criterion
Computers and Operations Research
Refining scheduling policies with genetic algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Minimizing conditional-value-at-risk for stochastic scheduling problems
Journal of Scheduling
An iterated-tabu-search heuristic for a variant of the partial set covering problem
Journal of Heuristics
Hi-index | 0.00 |
This paper introduces a new neighborhood search technique, called dynasearch, that uses dynamic programming to search an exponential size neighborhood in polynomial time. While traditional local search algorithms make a single move at each iteration, dynasearch allows a series of moves to be performed. The aim is for the lookahead capabilities of dynasearch to prevent the search from being attracted to poor local optima. We evaluate dynasearch by applying it to the problem of scheduling jobs on a single machine to minimize the total weighted tardiness of the jobs. Dynasearch is more effective than traditional first-improve or best-improve descent in our computational tests. Furthermore, this superiority is much greater for starting solutions close to previous local minima. Computational results also show that an iterated dynasearch algorithm in which descents are performed a few random moves away from previous local minima is superior to other known local search procedures for the total weighted tardiness scheduling problem.