Restricted Neighbourhood Search : An Implicit Tabu MethodColin R . ReevesDivision of Statistics and Operational ResearchSchool of Mathematical and Information

@inproceedings{UniversityCoventry1995RestrictedNS,
  title={Restricted Neighbourhood Search : An Implicit Tabu MethodColin R . ReevesDivision of Statistics and Operational ResearchSchool of Mathematical and Information},
  author={SciencesCoventry UniversityCoventry},
  year={1995}
}
  • SciencesCoventry UniversityCoventry
  • Published 1995
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… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Improving the e  ciency of tabu search in machine sequencing problems

  • C. R. Reeves
  • J . Opl . Res . Soc .
  • 1993
Highly Influential
4 Excerpts

Tabu Search

  • C. R. Reeves
  • 1993
Highly Influential
4 Excerpts

Implicit tabu tenure estimates for restricted neighbourhood search

  • T. E. Morton
  • 1995

Genetic algorithms and neighbourhood search

  • T. C. Fogarty
  • 1994

Some e  cient heuristic methods for the ow shop sequencing problem

  • C. N. Potts
  • Euro . J . OR
  • 1990

Simulated annealing for permutation owshopscheduling

  • B. Adenso-Diaz
  • OMEGA
  • 1989

Tabu searchPart I

  • M. Laguna
  • ORSA J . Comput .
  • 1989

Similar Papers

Loading similar papers…