Parametric uncapacitated facility location

Article Abstract:

The uncapacitated facility location problem (UFLP) concerning the location of uncapacitated plants with an objective function to minimize the cost of fulfilling customer demands is examined. Specifically, it is shown that the 'special structure of the UFLP' enables its expression as a special case of the parametric cost problem to facilitate its parametric analysis via a branch and bound algorithm. The latter overcomes the computational difficulties associated with parametric, mixed-integer programming problems.

Industrial sites, Optimization theory, Mathematical programming

---

An efficient tabu search procedure for the p-Median Problem

Article Abstract:

A new solution heuristic for the p-Median Problem, which seeks to identify the locations of a predetermined number of facilities in such a way as to minimize the total distance that demand must travel to reach its nearest facility, is proposed. The procedure is based on tabu search theories and uses short- and long-term memory. A comparison with two other move heuristics showed that the new one is superior in terms of the quality of the solutions generated.

Analysis, Factories, Location, Heuristic programming

---

Similar abstracts:

• Abstracts: Value efficiency analysis of academic research. Approximate solutions to the turbine balancing problem
• Abstracts: A Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem. A reduction result for location problems with polyhedral barriers

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.