A scatter search heuristic for the capacitated clustering problem

被引：46

作者：

Scheuerer, S ^{[1
]}

Wendolsky, R ^{[1
]}

机构：

[1] Univ Regensburg, Sch Business, D-93053 Regensburg, Germany

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2006年 / 169卷 / 02期

关键词：

metaheuristics; scatter search; capacitated clustering problems; capacitated p-median problems;

D O I：

10.1016/j.ejor.2004.08.014

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper proposes a scatter search-based heuristic approach to the capacitated clustering problem. In this problem, a given set of customers with known demands must be partitioned into p distinct clusters. Each cluster is specified by a customer acting as a cluster center for this cluster. The objective is to minimize the sum of distances from all cluster centers to all other customers in their cluster, such that a given capacity limit of the cluster is not exceeded and that every customer is assigned to exactly one cluster. Computational results on a set of instances from the literature indicate that the heuristic is among the best heuristics developed for this problem. (c) 2004 Elsevier B.V. All rights reserved.

引用

页码：533 / 547

页数：15

共 50 条

[41] Density based problem space search for the capacitated clustering p-median problem
Ahmadi, S
Osman, IH
ANNALS OF OPERATIONS RESEARCH, 2004, 131 (1-4) : 21 - 43
[42] A swift heuristic algorithm based on capacitated clustering for the Open Periodic Vehicle Routing Problem
Danandeh, Anna
Ghazanfari, Mehdi
Tavakoli-Moghaddam, Reza
Alinaghian, Mehdi
PROCEEDINGS OF THE 9TH WSEAS INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, KNOWLEDGE ENGINEERING AND DATA BASES, 2010, : 208 - +
[43] HEURISTIC APPROACHES TO SOLVE THE, CAPACITATED FACILITY LOCATION PROBLEM IN TERMS OF CLUSTERING INTERNAL EVALUATION
Randi, Gerard S.
Kim, Sunho
Kim, Dohyun
Sutanto, Hadi
2017 6TH IEEE INTERNATIONAL CONFERENCE ON ADVANCED LOGISTICS AND TRANSPORT (ICALT), 2017, : 178 - 183
[44] The capacitated centred clustering problem
Negreiros, M
Palhano, A
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (06) : 1639 - 1663
[45] Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem
Yelmewad, Pramod
Talawar, Basavaraj
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (04): : 3671 - 3692
[46] An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
Tang, L.
Wang, X.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (05) : 590 - 599
[47] Parallel Version of Local Search Heuristic Algorithm to Solve Capacitated Vehicle Routing Problem
Pramod Yelmewad
Basavaraj Talawar
Cluster Computing, 2021, 24 : 3671 - 3692
[48] A Tabu Search Heuristic for Capacitated Network Design
Ben Hamouda, Mohamed Zied
Brun, Olivier
Garcia, Jean-Marie
ISCC: 2009 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, VOLS 1 AND 2, 2009, : 460 - 466
[49] Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem
Mandal, Ashis Kumar
Kahar, M. N. M.
2015 4TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND COMPUTER SYSTEMS (ICSECS), 2015, : 118 - 123
[50] A scatter search approach for the minimum sum-of-squares clustering problem
Pacheco, JA
COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (05) : 1325 - 1335

← 1 2 3 4 5 →