SOLVING THE CAPACITATED CLUSTERING PROBLEM BY A COMBINED META-HEURISTIC ALGORITHM

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.

MAHMOODI DARANI NARGES; AHMADI VAHID; SAADATI ESKANDARI ZAHRA; YOUSEFIKHOSHBAKHT MAJID

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

Journal Paper

Paper Information

Journal: JOURNAL OF ADVANCES IN COMPUTER RESEARCH Year:2013 | Volume:4 | Issue:1 (11) Page(s): 89-100

Download Full-Text

View:

551

Download:

212

Cites:

Information Journal Paper

Title

SOLVING THE CAPACITATED CLUSTERING PROBLEM BY A COMBINED META-HEURISTIC ALGORITHM

Author(s)

MAHMOODI DARANI NARGES | AHMADI VAHID | SAADATI ESKANDARI ZAHRA | YOUSEFIKHOSHBAKHT MAJID | Issue Writer Certificate

Keywords

CAPACITATED CLUSTERING PROBLEM

NP-HARD PROBLEMS

ANT COLONY OPTIMIZATION

SWEEP ALGORITHM

LOCAL SEARCH

Abstract

The CAPACITATED CLUSTERING PROBLEM (CCP) is one of the most important combinational optimization problems that nowadays has many real applications in industrial and service problems. In the CCP, a given n nodes with known demands must be partitioned into k distinct clusters in which each cluster is detailed by a node acting as a cluster center of this cluster. The objective is to minimize the sum of distances from all cluster centers to all other nodes in their cluster, such that the sum of the corresponding node weights does not exceed a fixed capacity and every node is allocated to exactly one cluster. This paper presents a hybrid three-phase meta-heuristic algorithm (HTMA) including SWEEP ALGORITHM (SA), ANT COLONY OPTIMIZATION (ACO) and two LOCAL SEARCHes for the CCP. At the first step, a feasible solution of CCP is produced by the SA, and at the second step, the ACO, insert and swap moves are used to improve solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach compared to other meta-heuristic algorithms.

Cites

FINITE TIME ADAPTIVE OPTIMAL INTEGRAL SLIDING MODE CONTROL FOR A CLASS OF UNCERTAIN SECOND ORDER NONLINEAR SYSTEMS WITH INPUT NONLINEARITY

References

Cite

APA: Copy

MAHMOODI DARANI, NARGES, AHMADI, VAHID, SAADATI ESKANDARI, ZAHRA, & YOUSEFIKHOSHBAKHT, MAJID. (2013). SOLVING THE CAPACITATED CLUSTERING PROBLEM BY A COMBINED META-HEURISTIC ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH, 4(1 (11)), 89-100. SID. https://sid.ir/paper/328726/en

Vancouver: Copy

MAHMOODI DARANI NARGES, AHMADI VAHID, SAADATI ESKANDARI ZAHRA, YOUSEFIKHOSHBAKHT MAJID. SOLVING THE CAPACITATED CLUSTERING PROBLEM BY A COMBINED META-HEURISTIC ALGORITHM. JOURNAL OF ADVANCES IN COMPUTER RESEARCH[Internet]. 2013;4(1 (11)):89-100. Available from: https://sid.ir/paper/328726/en

IEEE: Copy

NARGES MAHMOODI DARANI, VAHID AHMADI, ZAHRA SAADATI ESKANDARI, and MAJID YOUSEFIKHOSHBAKHT, “SOLVING THE CAPACITATED CLUSTERING PROBLEM BY A COMBINED META-HEURISTIC ALGORITHM,” JOURNAL OF ADVANCES IN COMPUTER RESEARCH, vol. 4, no. 1 (11), pp. 89–100, 2013, [Online]. Available: https://sid.ir/paper/328726/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops