An exact method for the two-echelon, single-source, capacitated facility location problem

Article Abstract:

A Lagrangian relaxation-based branch and bound algorithm solution is provided for the facility location problem.

Operations research, Management science, Usage, Lagrange equations

---

Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem

Article Abstract:

A mathematical model was presented to resolve two-echelon, single-source, capacitated facility location problem. The model was formulated after taking into account six Lagrangian relaxation-based heuristics. First (LR1) and second (LR2) Lagrangian relaxations were found to produce the most encouraging results after considering the lower bound, upper bound and the gap of relaxations.

Research and Development in the Physical, Engineering, and Life Sciences, Mathematics, Research, Analysis, Heuristic, Facility management, Lagrangian functions, Facilities management, Heuristics (Psychology)

---

A repeated matching heuristic for the single-source capacitated facility location problem

Article Abstract:

A new optimization-based heuristic method is used to solve the Single-Source Capacitated Facility Location problem. The method is based on a repeated matching algorithm which solves a group of matching problems until the required convergence criteria are obtained. In contrast to Lagrangean heuristics, the new method produces solutions in each iteration. The results indicate that the method gives solutions which are usually better than those produced by the best Lagrangean heuristics.

Plant Siting Analysis, Industrial locations, Industrial location, Heuristic programming, Investment management

Similar abstracts:

• Abstracts: A memetic algorithm for the total tardiness single machine scheduling problem. Algorithmic approach to the satisfactory graph partitioning problem
• Abstracts: Wary Montenegro watches for signs of instability after Yugoslavian election. Milosevic's opponent puts election celebration on hold
• Abstracts: Solving the shortest route cut and fill problem using simulated annealing. Computational analysis of a flexible assembly system design problem

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