Dynamic Facility Location with Generalized Modular Capacities

Jena, Sanjay Dominik; Cordeau, Jean-François; Gendron, Bernard
August 2015
Transportation Science;Aug2015, Vol. 49 Issue 3, p484
Academic Journal
Location decisions are frequently subject to dynamic aspects such as changes in customer demand. Often, flexibility regarding the geographic location of facilities, as well as their capacities, is the only solution to such issues. Even when demand can be forecast, finding the optimal schedule for the deployment and dynamic adjustment of capacities remains a challenge, especially when the cost structure for these adjustments is complex. In this paper, we introduce a unifying model that generalizes existing formulations for several dynamic facility location problems and provides stronger linear programming relaxations than the specialized formulations. In addition, the model can address facility location problems where the costs for capacity changes are defined for all pairs of capacity levels. To the best of our knowledge, this problem has not been addressed in the literature. We apply our model to special cases of the problem with capacity expansion and reduction or temporary facility closing and reopening. We prove dominance relationships between our formulation and existing models for the special cases. Computational experiments on a large set of randomly generated instances with up to 100 facility locations and 1,000 customers show that our model can obtain optimal solutions in shorter computing times than the existing specialized formulations.


Related Articles

  • Extension of the Firefly Algorithm and Preference Rules for Solving MINLP Problems. Costa, M. Fernanda P.; Francisco, Rogério B.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P. // AIP Conference Proceedings;2017, Vol. 1863 Issue 1, p1 

    An extension of the firefly algorithm (FA) for solving mixed-integer nonlinear programming (MINLP) problems is presented. Although penalty functions are nowadays frequently used to handle integrality conditions and inequality and equality constraints, this paper proposes the implementation...

  • AN APPROACH FOR THE OPTIMAL SOLUTION OF MILP PROBLEMS. Ubale, P. V. // Bulletin of Pure & Applied Sciences-Mathematics;Jul-Dec2012, Vol. 31E Issue 2, p169 

    This paper describes an algorithm for finding solutions to optimization problems in which some of the variables must take integer values. The solution of discrete optimization problem to optimality is often an immense job requiring very efficient algorithm. In this paper we describe a Branch and...

  • Global optimization of general nonconvex problems with intermediate polynomial substructures. Zorn, Keith; Sahinidis, Nikolaos // Journal of Global Optimization;Jul2014, Vol. 59 Issue 2/3, p673 

    This work considers the global optimization of general nonconvex nonlinear and mixed-integer nonlinear programming problems with underlying polynomial substructures. We incorporate linear cutting planes inspired by reformulation-linearization techniques to produce tight subproblem formulations...

  • Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model. Brooks, J. Paul; Lee, Eva K. // INFORMS Journal on Computing;Summer2014, Vol. 26 Issue 3, p567 

    Solution methods are presented for a mixed-integer program (MIP) associated with a method for constrained discrimination. In constrained discrimination, one wishes to maximize the probability of correct classification subject to intergroup misclassification limits. The misclassification limits...

  • A branch and bound method for the solution of multiparametric mixed integer linear programming problems. Oberdieck, Richard; Wittmann-Hohlbein, Martina; Pistikopoulos, Efstratios // Journal of Global Optimization;Jul2014, Vol. 59 Issue 2/3, p527 

    In this paper, we present a novel algorithm for the solution of multiparametric mixed integer linear programming (mp-MILP) problems that exhibit uncertain objective function coefficients and uncertain entries in the right-hand side constraint vector. The algorithmic procedure employs a branch...

  • A MIP-based framework and its application on a lot sizing problem with setup carryover. Caserta, Marco; Voß, Stefan // Journal of Heuristics;Apr2013, Vol. 19 Issue 2, p295 

    In this paper we present a framework to tackle mixed integer programming problems based upon a 'constrained' black box approach. Given a MIP formulation, a black-box solver, and a set of incumbent solutions, we iteratively build corridors around such solutions by adding exogenous constraints to...

  • Optimal Cardinality Constrained Portfolio Selection. Jianjun Gao; Duan Li // Operations Research;May/Jun2013, Vol. 61 Issue 3, p745 

    One long-standing challenge in both the optimization and investment communities is to devise an efficient algorithm to select a small number of assets from an asset pool such that a portfolio objective is optimized. This cardinality constrained investment situation naturally arises due to the...

  • A scenario-based mixed integer linear programming model for composite power system expansion planning with greenhouse gas emission controls. Chang, Mei-Shiang // Clean Technologies & Environmental Policy;Aug2014, Vol. 16 Issue 6, p1001 

    In this paper, the influence of uncertain factors in the power supply system is considered by applying scenario-based programming techniques. A multi-period network design model for composite power system expansion planning is formulated as a mixed integer programming model. This model aims to...

  • On reduction of the multistage problem of stochastic programming with quantile criterion to the problem of mixed integer linear programming. Kibzun, A.; Khromova, O. // Automation & Remote Control;Apr2014, Vol. 75 Issue 4, p688 

    Consideration was given to the a priori formulation of the multistage problem of stochastic programming with a quantile criterion which is reducible to the two-stage problem. Equivalence of the two-stage problems with the quantile criterion in the a priori and a posteriori formulations was...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics