• Corpus ID: 18269357

Comparing New Heuristics for the Pure Integer Capacitated Plant Location Problem

  title={Comparing New Heuristics for the Pure Integer Capacitated Plant Location Problem},
  author={Elena Alonso Fern and Maruja Ortega},
This paper considers the Pure Integer Capacitated Plant Location Problem (PI-CPLP). It is an NP-hard integer programming problem closely related to the Mixed Integer Capacitated Plant Location Problem (MI-CPLP). The di erence between the two lays in the integrality constraints on the assignment variables. As opposed to MI-CPLP, in PI-CPLP, for a given set of open plants, the assignment subproblem remains NP-hard (speci cally a Generalized Assignment Problem). Several heuristics are proposed… 

Figures from this paper

A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
An exact algorithm in which a column generation procedure for finding upper and lower bounds is incorporated within a Branch-and-Price framework is proposed.
This paper considers the Single Source Capacitated Plant Location Problem (SSCPLP) and proposes three different hybrid approaches that combine elements of the GRASP and the Tabu Search methodologies.
Two Phase Genetic Approach to Single Source Capacitated Facility Location Problem
With rise in urbanization, problem of optimally allocating facilities to satisfy the needs of customers has gained importance. Most of the solutions proposed in literature have modelled the Single
Application : Capacitated Plant Location Problem
This paper explores and defines the classic Capacitated Plant Location Problem (CPLP). The basic problems are defined in details. The main problems of selecting a plant and the assignment of clients
A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
This work offers a unique approach that utilizes a high-quality efficient heuristic within a neighborhood search to address the combined assignment and fixed-charge structure of the underlying optimization problem.
Resource constrained assignment problems with flexible customer demand
of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy RESOURCE CONSTRAINED ASSIGNMENT
Reactive GRASP with path relinking for channel assignment in mobile phone networks
This work proposes to minimize the total interference of the system, using a metaheuristic based on GRASP (Greedy Randomized Adaptive Search Procedure), and uses Path Relinking, which consists of an intensification strategy, which has been applied.
A GRASP-based algorithm for solving DVE partitioning problem
A new solution to this NP-complete task, called partitioning problem, is described, based on GRASP, a multi-start metaheuristic for combinatorial problems, which shows better clustering solutions with less execution times.
Using Decomposition to Solve Facility Location/Fleet Managment Problems
This thesis develops logic-based Benders decomposition models for a facility location/fleet management problem from the literature and for a stochastic extension of the problem and experimentally shows the effectiveness of logic- based Benders in solving such problems.
A Comparison Study of Modern Heuristics for Solving the Partitioning Problem in Distributed Virtual Environment Systems
This paper presents a comparison study of different modern heuristics for solving the partitioning problem in DVE systems, as an alternative to the ad-hoc heuristic proposed in the literature.


A heuristic lagrangean algorithm for the capacitated plant location problem
Abstract Lagrangean techniques have been widely applied to the uncapacitated plant location problem, and in some cases they have proven to be successfull even when capacitated problems with
Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
Abstract Given a mixed-integer programming problem, if one dualizes all linking constraints and the constraints containing only integer variables, the optimum of the Lagrangean dual is equal to the
Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
Abstract In this paper we present an algorithm for the capacitated plant location problem based on a reformulation obtained by the introduction of auxiliary variables. By relaxation of the coupling
A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
A Lagrangian relaxation heuristic algorithm is described for capacitated problems in which each customer is served by a single facility, by relaxing the capacity constraints and solving the uncapacitated facility location problem.
A method for solving to optimality uncapacitated location problems
In this paper we develop a method for solving to optimality a general 0–1 formulation for uncapacitated location problems. This is a 3-stage method that solves large problems in reasonable computing
An algorithm for solving large capacitated warehouse location problems
Abstract In this paper we present a lower bound for the capacitated warehouse location problem based upon lagrangean relaxation of a mixed-integer formulation of the problem. Feasible solution
Heuristics for the capacitated plant location model
The paper generalizes heuristics for the uncapacitated plant location model to the capacitated case using ADD, DROP, SHIFT, ALA, AlA, and VSM based on elementary ADD and DROP operations.
A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
A tabu search heuristic is developed for a version of the stochastic vehicle routing problem where customers are present at locations with some probabilities and have random demands and produces an optimal solution in 89.45% of cases.
Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
SummaryConstraint generation procedures for identifying facet-induced inequalities violated by the optimal solution to the current LP relaxation have been widely used to solve integer programming
The capacitated plant location problem
This paper provides a review of the various solution methods for the capacitated plant location problem. Heuristic and exact procedures, that have appeared in the literature, are covered. The review