Article1998

Lagrangean heuristics applied to a variety of large capacitated plant location problems

50 citations0/0 files storedJournal of the Operational Research Society

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Facility Location and Emergency Management Vehicle Routing Optimization Methods Optimization and Mathematical Programming

Abstract

A series of performance improving heuristics are developed and embedded into the procedure of Lagrangean heuristics. The principles and ideas of these heuristics are used to build a general framework with which a variety of large Capacitated Plant Location Problems (CPLP) are solved, including the multi-capacitated case. A significant improvement over the results discussed in the literature is recorded. The single-source multi-Capacitated Plant Location Problem, which has not been addressed in the literature, is also tackled with encouraging results.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 50 citations exist upstream.

References

1980Operations Research -- An Introduction 1991Discrete location theory 1997Network and Discrete Location: Models, Algorithms and Applications.1996Facility Location: A Survey of Applications and Methods.1993Lagrangean heuristics for location problems 1978Lagrangean Relaxation Applied to Capacitated Facility Location Problems 1984A heuristic lagrangean algorithm for the capacitated plant location problem 1993A Lagrangian heuristic for the capacitated plant location problem with single source constraints

Cited by

2017Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities 2013Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem 2008Region-rejection based heuristics for the capacitated multi-source Weber problem 2006A perturbation-based heuristic for the capacitated multisource Weber problem 2003Genetic Algorithms for the Single Source Capacitated Location Problem

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.