The Dynamic Uncapacitated Hub Location Problem

Contreras, Ivan; Cordeau, Jean-François; Laporte, Gilbert
February 2011
Transportation Science;Feb2011, Vol. 45 Issue 1, p18
Academic Journal
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangian relaxation to obtain lower and upper bounds at the nodes of the tree. The Lagrangian function exploits the structure of the problem and can be decomposed into smaller subproblems that can be solved efficiently. In addition, some reduction procedures based on the Lagrangian bounds are implemented. These yield a considerable reduction of the size of the problem and thus help reduce the computational burden. Numerical results on a set of instances with up to 100 nodes and 10 time periods are reported.


Related Articles

  • An Overview of Modified Shanks' Conjecture and Comments on its Validity. Gangatharan, N.; Chuah, T. C. // American Journal of Applied Sciences;2007, Vol. 4 Issue 4, p184 

    This study reports the validity of the modified Shanks' conjecture on the planar least squares inverse (PLSI) method of stabilizing two-dimensional (2-D) recursive digital filters. A theoretical procedure proposed based on the Lagrange multiplier method of mathematical optimization. The results...

  • Augmented Lagrangian functions for constrained optimization problems. Zhou, Y.; Yang, X. // Journal of Global Optimization;Jan2012, Vol. 52 Issue 1, p95 

    In this paper, in order to obtain some existence results about solutions of the augmented Lagrangian problem for a constrained problem in which the objective function and constraint functions are noncoercive, we construct a new augmented Lagrangian function by using an auxiliary function. We...

  • Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization. Birgin, Ernesto; Martínez, J. // Computational Optimization & Applications;Apr2012, Vol. 51 Issue 3, p941 

    At each outer iteration of standard Augmented Lagrangian methods one tries to solve a box-constrained optimization problem with some prescribed tolerance. In the continuous world, using exact arithmetic, this subproblem is always solvable. Therefore, the possibility of finishing the subproblem...

  • Duality related to approximate proper solutions of vector optimization problems. Gutiérrez, C.; Huerga, L.; Novo, V.; Tammer, C. // Journal of Global Optimization;Jan2016, Vol. 64 Issue 1, p117 

    In this work we introduce two approximate duality approaches for vector optimization problems. The first one by means of approximate solutions of a scalar Lagrangian, and the second one by considering $$(C,\varepsilon )$$ -proper efficient solutions of a recently introduced set-valued vector...

  • An Exactly Conservative Semi-Lagrangian Scheme (CIP-CSL) in One Dimension. Yabe, T.; Tanaka, R.; Nakamura, T.; Xiao, F. // Monthly Weather Review;Feb2001, Vol. 129 Issue 2, p332 

    Presents a study on a proposed semi-Lagrangian scheme which guarantees mass conservation. Challenges of solving atmosperic problems; Overview of the cubic-interpolated propagation method; Conclusions.

  • A short course in effective Lagrangians. Wudka, Jose´ // AIP Conference Proceedings;2000, Vol. 531 Issue 1, p81 

    These lectures provide an introduction to effective theories concentrating on the basic ideas and providing some simple applications.

  • Some Optimization Problems for p-Laplacian Type Equations. Del Pezzo, L. M.; Fernández Bonder, J. // Applied Mathematics & Optimization;Jun2009, Vol. 59 Issue 3, p365 

    In this paper we study some optimization problems for nonlinear elastic membranes. More precisely, we consider the problem of optimizing the cost functional $\mathcal {J}(u)=\int_{\partial\Omega}f(x)u\,\mathrm {d}\mathcal {H}^{N-1}$ over some admissible class of loads f where u is the (unique)...

  • A New Trajectory Integration Scheme in the Semi-Lagrangian Framework. Suwan Park; Nakhoon Baek // International Journal of Software Engineering & Its Applications;Jan2013, Vol. 7 Issue 1, p179 

    In the typical semi-Lagrangian framework for Navier-Stokes equations, the advection source positions for each grid center points are repeatedly estimated to get interpolated physical quantities. Most research efforts are concentrated on the numerical accuracy, especially for the interpolation of...

  • Multiplier methods for optimization problems with Lipschitzian derivatives. Izmailov, A.; Kurennoy, A. // Computational Mathematics & Mathematical Physics;Dec2012, Vol. 52 Issue 12, p1603 

    Optimization problems for which the objective function and the constraints have locally Lipschitzian derivatives but are not assumed to be twice differentiable are examined. For such problems, analyses of the local convergence and the convergence rate of the multiplier (or the augmented...


Read the Article


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

Try another library?
Sign out of this library

Other Topics