This paper builds upon the success of our invented density constructive method for Capacitated Clustering Problems and employs it in a multi-start search procedure. This provides a good model for using appropriate search algorithms based on strengths of the constructive approach and/or strengths of the neighbourhood structures. It provides a good overview of all the improvements made to the capacitated clustering problem made by us including a new neighbourhood structure, a systematic comparison of different search algorithms for the problem and a new set of large benchmark problems. This paper is published in one of the leading OR journals
Given a weighted graph, the capacitated clustering problem (CCP) is to partition a set of nodes into...
This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunc...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, consid...
This paper proposes a clever and efficient constructive algorithm for the Capacitated Clustering Pro...
Abstract. In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). Th...
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considerin...
Abstract. In the Capacitated Clustering Problem (CCP), a given set of n weighted points is to be par...
International audienceGiven a weighted graph, the capacitated clustering problem (CCP) is to partiti...
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRA...
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRA...
International audience<p>Given a weighted graph, the capacitated clustering problem (CCP) is to part...
In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRAS...
In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRAS...
The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minim...
This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique,...
Given a weighted graph, the capacitated clustering problem (CCP) is to partition a set of nodes into...
This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunc...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, consid...
This paper proposes a clever and efficient constructive algorithm for the Capacitated Clustering Pro...
Abstract. In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). Th...
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considerin...
Abstract. In the Capacitated Clustering Problem (CCP), a given set of n weighted points is to be par...
International audienceGiven a weighted graph, the capacitated clustering problem (CCP) is to partiti...
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRA...
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRA...
International audience<p>Given a weighted graph, the capacitated clustering problem (CCP) is to part...
In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRAS...
In this work, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRAS...
The Capacitated Centered Clustering Problem (CCCP) consists of defining a set of p groups with minim...
This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique,...
Given a weighted graph, the capacitated clustering problem (CCP) is to partition a set of nodes into...
This paper presents the Clustering Search (CS) as a new hybrid metaheuristic, which works in conjunc...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, consid...