A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem.

Abstract

This paper compare approaches proposed in the literature for the Capacitated Plant Location Problem. The comparison is based on new theoretical and computational results. The main emphasis of the paper is on relaxations. In particular we identify dominance relations among the various relaxations found in the literature. We also perform a probabilistic study of these relaxations using a Euclidean model. In the computational study, we compare the relaxations as a function of various characteristics of the test problems. Several of these relaxations can be used to generate heuristic feasible solutions that are better than the classical greedy or interchange-type heuristics, both in computing time and in the quality of the solutions found. Keywords: Plants; Warehouses; Mixed integer linear program.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1988
Accession Number
ADA192979

Entities

People

  • G. Cornujols
  • J. M. Thizy
  • R. Sridharan

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computational Complexity
  • Computer Programming
  • Errors
  • Inequalities
  • Linear Programming
  • Mathematical Models
  • Models
  • Notation
  • Optimization
  • Polynomials
  • Probabilistic Models
  • Production
  • Random Variables
  • Splitting
  • Transportation
  • Vans

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)