Advanced search
Publication Cover
Journal of the Chinese Institute of Industrial Engineers Volume 18, 2001 - Issue 3
Journal homepage
103
Views
16
CrossRef citations to date
0
Altmetric
Original Articles

SOLVING THE CAPACITATED CLUSTERING PROBLEM WITH GENETIC ALGORITHMS

How-Ming Shieh Department of Information Management and of Civil Engineering, National Central University
&
Ming-Der May Department of Industrial Engineering and Management, LungHwa Institute of Technology, 300, Wan-Shou Road, Section 1, Kueishan Taoyuan, Taiwan, 333, R. O. C.
Pages 1-12 | Received 01 Aug 1998, Accepted 01 Oct 1999, Published online: 17 Feb 2010

Citations (16)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

Jung-Hua Lee & Ping-Teng Chang. (2012) A survey and numerical comparison of factor-free penalty function constraint-handling techniques in genetic algorithms. Journal of the Chinese Institute of Industrial Engineers 29:1, pages 61-86.
Read now
Temel Öncan. (2007) A Survey of the Generalized Assignment Problem and Its Applications. INFOR: Information Systems and Operational Research 45:3, pages 123-141.
Read now

Articles from other publishers (14)

Anubha Rautela, S.K. Sharma & P. Bhardwaj. (2019) Distribution planning using capacitated clustering and vehicle routing problem. Journal of Advances in Management Research 16:5, pages 781-795.
Crossref
Ertan YAKICI & Aybeniz YİĞİT. (2017) Değer Eşitliği Kısıtlı p-Medyan Problemi için Evrimsel Bir Algoritma. Çukurova Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi 32:4, pages 1-10.
Crossref
Ertan YAKICI & Aybeniz YİĞİT. (2017) Değer Eşitliği Kısıtlı p-Medyan Problemi için Evrimsel Bir Algoritma. Çukurova Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi, pages 1-10.
Crossref
Mohsen Moghaddam & Shimon Y. NofMohsen Moghaddam & Shimon Y. Nof. 2017. Best Matching Theory & Applications. Best Matching Theory & Applications 1 17 .
Te-Wei Lin & Chung-Ho Wang. (2010) A hybrid genetic algorithm to minimize the periodic preventive maintenance cost in a series-parallel system. Journal of Intelligent Manufacturing 23:4, pages 1225-1236.
Crossref
Zhen Yang, Haoxun Chen & Feng Chu. (2011) A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem. Computers & Industrial Engineering 61:2, pages 430-435.
Crossref
Chung-Ho Wang & Te-Wei Lin. (2011) Improved particle swarm optimization to minimize periodic preventive maintenance cost for series-parallel systems. Expert Systems with Applications 38:7, pages 8963-8969.
Crossref
Chung-Ho Wang & Jiu-Zhang Lu. (2008) An effective evolutionary algorithm for the practical capacitated vehicle routing problems. Journal of Intelligent Manufacturing 21:4, pages 363-375.
Crossref
Chung-Ho Wang & Te-Wei Lin. (2010) Optimizing minimize periodic preventive maintenance model for series-parallel systems based on particle swarm optimization. Optimizing minimize periodic preventive maintenance model for series-parallel systems based on particle swarm optimization.
Kim Soon Gan, Patricia Anthony, Jason Teo & Kim On Chin. 2010. Agent-Based Evolutionary Search. Agent-Based Evolutionary Search 203 228 .
Chung-Ho Wang & Te-Wei Lin. 2010. Algorithms and Architectures for Parallel Processing. Algorithms and Architectures for Parallel Processing 91 101 .
Chung-Ho Wang & Jiu-Zhang Lu. (2009) A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Expert Systems with Applications 36:2, pages 2921-2936.
Crossref
Gan Kim Soon, Patricia Anthony, Jason Teo & Chin Kim On. (2008) The effect of mutation rate in the evolution of bidding strategies. The effect of mutation rate in the evolution of bidding strategies.
Stephan Scheuerer & Rolf Wendolsky. (2006) A scatter search heuristic for the capacitated clustering problem. European Journal of Operational Research 169:2, pages 533-547.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.