Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Proceedings of the 5th International Conference on Genetic Algorithms
Genetic Local Search Algorithms for the Travelling Salesman Problem
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Efficient and Effective Clustering Methods for Spatial Data Mining
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Discovering Associations in Spatial Data - An Efficient Medoid Based Approach
PAKDD '98 Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining
A new representation and operators for genetic algorithms applied to grouping problems
Evolutionary Computation
Computers and Industrial Engineering
| Hi-index | 0.00 |
The p-median problem is an NP-complete combinatorial optimisation problem well investigated in the fields of facility location and more recently, clustering and knowledge discovery. We show that hybrid optimisation algorithms provide reasonable speed and high quality of solutions, allowing effective trade-off of quality of the solution with computational effort. Our approach to hybridisation is a tightly coupled approach rather than a serialisation of hill-climbers with genetic algorithms. Our hybrid algorithms use genetic operators that have some memory about how they operated in their last invocation.