A fixed-length subset genetic algorithm for the p-median problem

DOI10.1007/3-540-45110-2_42MaRDI QIDQ4449755zbMATH OpenFDO

Authors Zhou Xu, Andrew Lim

Publication date 11 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2724/27241596.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99) Combinatorial optimization (90C27)

Recommendations

• An efficient genetic algorithm for the \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• A genetic algorithm for solving a capacitated \(p\)-median problem
• A genetic algorithm for the p-median problem with pos/neg weights
• scientific article; zbMATH DE number 1138446
• New genetic algorithms based approaches to continuous \(p\)-median problem
• Modified genetic algorithm with greedy heuristic for continuous and discrete p-median problems
• Genetic algorithms for solving the discrete ordered median problem
• Tuned genetic algorithms for finding p-medians of a weighted graph
• An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem

Cited in

(5)

• A Lagrangian search method for the \(P\)-median problem
• Hybrid genetic algorithms with selective crossover for the capacitated p-Median problem
• An efficient genetic algorithm for the \(p\)-median problem
• scientific article; zbMATH DE number 1138446 (Why is no real title available?)
• A scatter search-based heuristic to locate capacitated transshipment points

This page was built for publication: A fixed-length subset genetic algorithm for the p-median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449755)