A Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem

Article Abstract:

The application of Lagrangean techniques to capacitated plant location problems having extra constraints is considered where the model is of a pure integer type. Various Lagrangean decompositions are assessed, and certain heuristic algorithms are designed to address resulting subproblems. This becomes a two-phase heuristic procedure; the location phase defines the group of multipliers, and the second phase can be treated with decomposition, or knapsack type subproblems. Extensive computations are featured. A flowchart is included which summarizes the algorithm. Twenty problems are given for various plant location chances in light of costs and capacities. Other cases illustrated heuristic behavior in the number of iterations in an interchange heuristic.

Author: Barcelo, J., Casanovas, J.

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A reduction result for location problems with polyhedral barriers

Article Abstract:

Research is presented describing the study of location dynamics and the decision processes involved in determining new facility locations where barriers exist.

Author: Klamroth, K
Restraint of trade

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


On the collection depots location problem

Article Abstract:

Research is presented describing the study of location management using computational analysis to determine the best location when service is demanded.

Author: Drezner, Z, Wesolowsky, G
Observations, Location, Commercial buildings, Euclidean geometry

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Industrial locations, Industrial location
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.