Greedy random adaptive memory programming search for the capacitated clustering problem

@article{Ahmadi2005GreedyRA,
  title={Greedy random adaptive memory programming search for the capacitated clustering problem},
  author={S Farzad Ahmadi and Ibrahim H. Osman},
  journal={European Journal of Operational Research},
  year={2005},
  volume={162},
  pages={30-44}
}
In the capacitated clustering problem (CCP), a given set of n weighted points is to be partitioned into p clusters such that, the total weight of the points in each cluster does not exceed a given cluster capacity. The objective is to find a set of p centers that minimises the total scatter of points allocated to these centers. In this paper, we propose a merger of Greedy Random Adaptive Search Procedure (GRASP) and Adaptive Memory Programming (AMP) into a new GRAMPS framework for the CCP. A… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Metaheuristics for the capacitated clustering

  • S. Ahmadi
  • 1998
Highly Influential
13 Excerpts

Weight constrained minimum sum-of-stars clustering

  • P. Hansen, B. Jaumard, E. Sanlaville
  • Technical report, Gerad Technical Report G-93-38
  • 1993
Highly Influential
5 Excerpts

A bionomic

  • V. Maniezzo, A. Mingozzi, R. Baldacci
  • 1998
Highly Influential
4 Excerpts

Capacitated clustering

  • I. H. Lebanon. Osman, N. Christofides
  • 1994
Highly Influential
4 Excerpts

Constructing optimal index

  • M. P. Beck, J. M. Mulvey
  • 1982
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…