An Efficient Hybrid CS and K-Means Algorithm for the Capacitated PMedian Problem
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Using Recursive KMeans and Dijkstra Algorithm to Solve CVRP
Capacitated vehicle routing problem (CVRP) is being one of the most common optimization problems in our days
Some Experiences with Hybrid Genetic Algorithms in Solving the Uncapacitated Examination Timetabling Problem
This paper provides experimental experiences on two local search hybridized genetic algorithms in solving the uncapacitated examination timetabling problem. The proposed two hybrid algorithms use partition and priority b…
SchedulingHybrid Metaheuristics for the Clustered Vehicle Routing Problem
The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster c…
Hybridising Reinforcement Learning and Heuristics for Hierarchical Directed Arc Routing Problems
The Hierarchical Directed Capacitated Arc Routing Problem (HDCARP) is an extension of the Capacitated Arc Routing Problem (CARP), where the arcs of a graph are divided into classes based on their priority. The traversal …
ARCreinforcement-learningReinforcement LearningReinforcement Learning (RL)Hybrid Node-Destroyer Model with Large Neighborhood Search for Solving the Capacitated Vehicle Routing Problem
In this research, we propose an iterative learning hybrid optimization solver developed to strengthen the performance of metaheuristic algorithms in solving the Capacitated Vehicle Routing Problem (CVRP). The iterative h…