An opportunity cost-based genetic algorithm for a modified capacitated p-median problem

An opportunity cost-based genetic algorithm for a modified capacitated p-median problem

Show all versions (2)

Median problems are combinatorial problems of searching for p facility locations (medians) that will serve a network of n demand nodes at a minimum cost. A Capacitated p-Median Problem (CPMP) allocates the demand of all nodes to the p facilities subject to the service capacity of each facility. In v...

תיאור מלא

מידע ביבליוגרפי
הוצא לאור ב:Philippine Engineering Journal 27, 2(2 copies) (2006(D)).
מחבר ראשי: Resurreccion, Joanna Z.
פורמט: Article
שפה:English
נושאים:
Genetic algorithm.
Capacitated p-median problems.
Opportunity cost.
גישה מקוונת:Also available online for University of the Philippines Diliman. Click here