Multilevel approaches applied to the capacitated clustering problem

  • Rodney D
  • Soper A
  • Walshaw C
  • 10

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.

Abstract

This paper presents two multilevel refinement algorithms for the capacitated clustering problem. Multilevel refinement is a collaborative technique capable of significantly aiding the solution process for optimisation problems. The central methodologies of the technique are filtering solutions from the search space and reducing the level of problem detail to be considered at each level of the solution process. The first multilevel algorithm uses a simple tabu search while the other executes a standard local search procedure. Both algorithms demonstrate that the multilevel technique is capable of aiding the solution process for this combinatorial optimisation problem.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • SGR: 62649140941
  • PUI: 354338474
  • SCOPUS: 2-s2.0-62649140941
  • ISBN: 1601320590

Authors

  • D Rodney

  • A Soper

  • C Walshaw

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free