SOLVING THE CAPACITATED CLUSTERING PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHMS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

YAGHINI M.; LESAN J.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2010 | Volume:21 | Issue:3 Page(s): 44-54

Download Full-Text

Persian Verion

View:

930

Download:

Cites:

Information Journal Paper

Title

SOLVING THE CAPACITATED CLUSTERING PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHMS

Author(s)

YAGHINI M. | LESAN J. | Issue Writer Certificate

Keywords

CAPACITATED CLUSTERING PROBLEMQ2

SET PARTITIONINGQ2

CAPACITATED P-MEDIAN PROBLEMQ2

METAHEURISTICSQ2

GENETIC ALGORITHMQ2

SIMULATED ANNEALINGQ2

Abstract

The CAPACITATED CLUSTERING PROBLEM (CCP) is a classical location problem with various applications in data mining. In the CAPACITATED CLUSTERING PROBLEM, a set of n entities is to be partitioned into p disjoint clusters, such that the total dissimilarity within each cluster is minimized subject to constraints on maximum cluster capacity. Dissimilarity of a cluster is the sum of the dissimilarities between each entity that belongs to the cluster and the median associated with the cluster. In this paper two solution methods proposed for the problem. First method is a simulation annealing algorithm which uses different neighborhood structures randomly. The second method is a GENETIC ALGORITHM approach which strengthened by a heuristic local search method. Computational results of test samples from literature demonstrate the robustness and efficiency of the proposed solution methods. This confirms that the proposed algorithm provides high quality solutions in reasonable time.

Cites

No record.

References

No record.

Cite

APA: Copy

YAGHINI, M., & LESAN, J.. (2010). SOLVING THE CAPACITATED CLUSTERING PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHMS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 21(3), 44-54. SID. https://sid.ir/paper/65528/en

Vancouver: Copy

YAGHINI M., LESAN J.. SOLVING THE CAPACITATED CLUSTERING PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHMS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2010;21(3):44-54. Available from: https://sid.ir/paper/65528/en

IEEE: Copy

M. YAGHINI, and J. LESAN, “SOLVING THE CAPACITATED CLUSTERING PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHMS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 21, no. 3, pp. 44–54, 2010, [Online]. Available: https://sid.ir/paper/65528/en

Related Journal Papers