genetic algorithm for Multi commodity Capacited multi –facility Euclidean distance problem with probabilistic customer location
genetic algorithm for Multi commodity Capacited multi –facility Euclidean distance problem with probabilistic customer location
omid keramatlou1 saeid jamshidi2 razieh gohardoust monfared3
1) Master of Industrial Engineering
2) Master of Industrial Management
3) Master of MBA Email: razieh gohardoust monfared
IOI Code
:
XYDC-AFHCB
Publication :
International Conference on Researches in Science & Engineering(icrsie.com)
Abstract :
This paper presents a Euclidean distance multi-commodity multi-facility Weber problem with capacity constraints and finds the location of facilities and assigns the amount of each commodity to each customer at minimum cost. Although this problem is NP-hard and has neither convex nor concave objective function, considering probabilistic customer points make the problem more difficult. An exact and an approximated expected distance function is applied in order to solve the problem Finally, this issue has been solved with genetic algorithm. A typical example is illustrated and results are then reported.
Keywords : locate allocation probabilistic customer genetic algorithm euclidean distance