Restricted Neighbourhood Search: An Implicit Tabu Method

نویسنده

  • Colin R. Reeves
چکیده

Recent work 1] has highlighted the value of using a restricted candidate list in the implementation of the Tabu Search (TS) method. The original motivation for this approach was to reduce the amount of computation involved in applying TS to the solution of owshop sequencing problems. However, it is becoming evident that this concept of restricted neighbourhood search (RNS) can itself act as a diversiication method, without the need for explicit tabu data structures. This paper reports some computational experiments which compare the original ndings of 1] with an approach which uses the restricted neighbourhood alone. These results suggest that RNS imposes an implicit tabu condition on certain elements of the solution, and that the size of the restriction may interact with the tabu tenure in interesting ways.

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An incremental tabu search heuristic for the generalized vehicle routing problem with time windows

This paper describes an incremental neighbourhood tabu search heuristic for the generalized vehicle routing problem with time windows. The purpose of this work is to offer a general tool that can successfully be applied to a large variety of specific problems. The algorithm builds upon a previously developed tabu search heuristic by replacing its neighbourhood structure. The new neighbourhood i...

متن کامل

Restricted Evaluation Genetic Algorithms with Tabu Search for Optimising Boolean Functions as Multi-Level AND-EXOR Networks

In GAs applied to engineering problems (in our case, the optimisation of logic circuits) the fitness function is usually complex and the fitness evaluation is time consuming. The run time is therefore a major consideration when designing a GA for optimisation, thus a look-up table for fitness evaluation is desirable. As a consequence, it is appropriate to limit the number of different chromosom...

متن کامل

Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search

In this paper a new metaheuristic method is proposed to solve the classical permutation flowshop scheduling problem with the objective of minimizing sum of completion times. The representative neighbourhood combines the stochastic sampling method mainly used in Simulated Annealing and the best descent method elaborated in Tabu Search and integrates them naturally into a single method. The metho...

متن کامل

Tabu Search Heuristics for the Vehicle Routing Problem

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.

متن کامل

Genetic tabu search for the fuzzy flexible job shop problem

This paper tackles the flexible job-shop scheduling problem with uncertain processing times. The uncertainty in processing times is represented by means of fuzzy numbers, hence the name fuzzy flexible job-shop scheduling. We propose an effective genetic algorithm hybridised with tabu search and heuristic seeding to minimise the total time needed to complete all jobs, known as makespan. To build...

متن کامل

افزودن به منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی راحت تر خواهید کرد

برای دسترسی به متن کامل این مقاله و 10 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995