Solving the Capacitated Clustering Problem by a Combined Meta-Heuristic Algorithm

سال انتشار: 1391
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 593

فایل این مقاله در 12 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_JACR-4-1_008

تاریخ نمایه سازی: 16 شهریور 1395

چکیده مقاله:

The capacitated clustering problem (CCP) is one of the most importantcombinational optimization problems that nowadays has many real applications inindustrial and service problems. In the CCP, a given n nodes with known demandsmust be partitioned into k distinct clusters in which each cluster is detailed by anode acting as a cluster center of this cluster. The objective is to minimize the sumof distances from all cluster centers to all other nodes in their cluster, such that thesum of the corresponding node weights does not exceed a fixed capacity and everynode is allocated to exactly one cluster. This paper presents a hybrid three-phasemeta-heuristic algorithm (HTMA) including sweep algorithm (SA), ant colonyoptimization (ACO) and two local searches for the CCP. At the first step, a feasiblesolution of CCP is produced by the SA, and at the second step, the ACO, insert andswap moves are used to improve solutions. Extensive computational tests onstandard instances from the literature confirm the effectiveness of the presentedapproach compared to other meta-heuristic algorithms.

نویسندگان

Narges Mahmoodi Darani

Department of Mathematic, Malayer Branch, Islamic Azad University, Malayer, Iran

Vahid Ahmadi

Department of Mathematic, Ahvaz Branch, Islamic Azad University, Ahvaz, Iran

Zahra Saadati Eskandari

Young Researchers & Elite Club, Fereydan Branch, Islamic Azad University, Fereydan, Iran

Majid Yousefikhoshbakht

Young Researchers & Elite Club, Hamedan Branch, Islamic Azad University, Hamedan, Iran