Tuned genetic algorithms for finding p-medians of a weighted graph

MaRDI QIDQ554210zbMATH OpenFDO

Authors Y. Naserifar, A. Kaveh, Mohammad Shahrouzi

Publication date 29 July 2011

Published in Scientia Iranica. Transaction A: Civil Engineering (Search for Journal in Brave)

zbMATH Keywords

\(p\)-median problemdirect index codinggenetic algorithmparameter tuningsimulated annealing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An efficient genetic algorithm for the \(p\)-median problem
• A genetic algorithm for the p-median problem with pos/neg weights
• scientific article; zbMATH DE number 1803759
• Genetic algorithms for solving the discrete ordered median problem
• A genetic algorithm for solving a capacitated \(p\)-median problem

Cited in

(3)

• scientific article; zbMATH DE number 1803759 (Why is no real title available?)
• scientific article; zbMATH DE number 1138446 (Why is no real title available?)
• scientific article; zbMATH DE number 2040689 (Why is no real title available?)

Describes a project that uses

Uses Software

• BEAMR

This page was built for publication: Tuned genetic algorithms for finding \(p\)-medians of a weighted graph

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