Multi-commodity capacitated multi-facility Weber problem with probabilistic customer locations

Mehdi Amiri-Aref, Omid Keramatlu

Abstract


This paper presents a rectilinear 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. An Alternate location–allocation heuristic method which divides the problem into multi-commodity transportation subproblem and pure allocation subproblem is implemented until no improvement is observed. A typical example is illustrated and results are then reported.


Full Text: PDF

How to Cite this Article:

Mehdi Amiri-Aref, Omid Keramatlu, Multi-commodity capacitated multi-facility Weber problem with probabilistic customer locations, Journal of Mathematical and Computational Science, Vol 2, No 5 (2012), 1498-1511

Copyright © 2012 Mehdi Amiri-Aref, Omid Keramatlu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office: jmcs@scik.org

 

Copyright ©2019 JMCS