This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective local search technique for the CPMP. Computational results show the effectiveness of the proposed approach, when compared to the best performing heuristics so far presented in the literature
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatoria...
The capacitated p-median problem is the variation of the well-known p-median problem in which a dema...
The Capacitated p-median Problem (CPMP) is a facility location problem and as such, it can be used f...
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considerin...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
The p-median problem has been widely studied in combinatorial optimisation, but its generalisation ...
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitate...
Facility-location problems have several applications, such as telecommunications, industrial transpo...
Facility-location problems have several applications, such as telecommunications, industrial transpo...
Facility-location problems have several applications, such as telecommunications, industrial transpo...
This work introduces a modified MAX MIN Ant System (MMAS) designed to solve the Capacitated p-Median...
Facility-location problems have several applications in telecommunications, industrial transportatio...
Abstract. In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). Th...
This paper builds upon the success of our invented density constructive method for Capacitated Clust...
Median problems are combinatorial problems of searching for p facility locations (medians) that will...
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatoria...
The capacitated p-median problem is the variation of the well-known p-median problem in which a dema...
The Capacitated p-median Problem (CPMP) is a facility location problem and as such, it can be used f...
The capacitated p-median problem (CPMP) seeks to obtain the optimal location of p medians considerin...
Abstract. Capacitated p-median problem (CPMP) is an important variation of facility location problem...
The p-median problem has been widely studied in combinatorial optimisation, but its generalisation ...
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitate...
Facility-location problems have several applications, such as telecommunications, industrial transpo...
Facility-location problems have several applications, such as telecommunications, industrial transpo...
Facility-location problems have several applications, such as telecommunications, industrial transpo...
This work introduces a modified MAX MIN Ant System (MMAS) designed to solve the Capacitated p-Median...
Facility-location problems have several applications in telecommunications, industrial transportatio...
Abstract. In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). Th...
This paper builds upon the success of our invented density constructive method for Capacitated Clust...
Median problems are combinatorial problems of searching for p facility locations (medians) that will...
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatoria...
The capacitated p-median problem is the variation of the well-known p-median problem in which a dema...
The Capacitated p-median Problem (CPMP) is a facility location problem and as such, it can be used f...