DeepAI AI Chat
Log In Sign Up

An Efficient Hybrid CS and K-Means Algorithm for the Capacitated PMedian Problem

06/29/2014
by   Hassan Gholami Mazinan, et al.
0

Capacitated p-median problem (CPMP) is an important variation of facility location problem in which p capacitated medians are economically selected to serve a set of demand vertices so that the total assigned demand to each of the candidate medians must not exceed its capacity. This paper surveys and analyses the combination of Cuckoo Search and K-Means algorithms to solve the CPMP. In order to check for quality and validity of the suggestive method, we compared the final solution produced over the two test problems of Osman and Christofides, each of which including 10 sample tests. According to the results, the suggested meta-heuristic algorithm shows superiority over the rest known algorithms in this field as all the best known solutions in the first problem set, and several sample sets in the second problem set have been improved within reasonable periods of time.

READ FULL TEXT

page 9

page 10

page 11

page 12

08/18/2021

Combining K-means type algorithms with Hill Climbing for Joint Stratification and Sample Allocation Designs

In this paper we combine the k-means and/or k-means type algorithms with...
03/13/2018

Mathematical models and search algorithms for the capacitated p-center problem

The capacitated p-center problem requires to select p facilities from a ...
11/04/2020

Maximizing Store Revenues using Tabu Search for Floor Space Optimization

Floor space optimization is a critical revenue management problem common...
04/06/2020

The Importance of Good Starting Solutions in the Minimum Sum of Squares Clustering Problem

The clustering problem has many applications in Machine Learning, Operat...
06/28/2022

Hybrid cuckoo search algorithm for the minimum dominating set problem

The notions of dominating sets of graphs began almost 400 years ago with...
08/17/2013

Graph Colouring Problem Based on Discrete Imperialist Competitive Algorithm

In graph theory, Graph Colouring Problem (GCP) is an assignment of colou...
02/11/2023

A practically efficient fixed-pivot selection algorithm and its extensible MATLAB suite

Many statistical problems and applications require repeated computation ...