TITLE

Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution

AUTHOR(S)
Alenezy, Eiman Jadaan; Khalaf, Rehab F.
PUB. DATE
August 2013
SOURCE
Applied Mathematics;Aug2013, Vol. 4 Issue 8, p1168
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this work, the Lagrangean Relaxation method has been discussed to solve different sizes of capacitated facility location problem (CFLP). A good lower bound has been achieved on the solution of the CFLP considered in this paper. This lower bound has been improved by using the Volume algorithm. The methods of setting two important parameters in heuristic have been given. The approaches used to gain the lower bound have been explained. The results of this work have been compared with the known results given by Beasley.
ACCESSION #
91671580

 

Related Articles

  • USING COLUMN GENERATION TO COMPUTE LOWER BOUND SETS FOR BI-OBJECTIVE COMBINATORIAL OPTIMIZATION PROBLEMS. SARPONG, BOADU MENSAH; ARTIGUES, CHRISTIAN; JOZEFOWIEZ, NICOLAS // RAIRO -- Operations Research;Jul2015, Vol. 49 Issue 3, p527 

    We discuss the use of column generation in a bi-objective setting. Just as in single objective combinatorial optimization, the role of column generation in the bi-objective setting is to compute dual bounds (i.e. lower bounds for minimization problems and upper bounds for maximization problems)...

  • On Second-order Approximations to the Risk in Estimating the Exponential Mean by a Two-stage Procedure. Isogai, Eiichi; Uno, Chikara // International Journal of Statistics & Probability;Nov2012, Vol. 1 Issue 2, p47 

    We consider the problem of minimum risk point estimation of the mean of an exponential distribution under the assumption that the mean exceeds some positive known number. For this problem Mukhopadhyay and Duggan (2001) proposed a two-stage procedure and provided second-order approximations to...

  • Multi-objective Optimization Problem with Bounded Parameters. Bhurjee, Ajay Kumar; Panda, Geetanjali // RAIRO -- Operations Research;Oct2014, Vol. 48 Issue 4, p545 

    In this paper, we propose a nonlinear multi-objective optimization problem whose parameters in the objective functions and constraints vary in between some lower and upper bounds. Existence of the efficient solution of this model is studied and gradient based as well as gradient free optimality...

  • On approximation of the fully fuzzy fixed charge transportation problem. Mahmoodirad, A.; Hassasi, H.; Tohidi, G.; Sanei, M. // International Journal of Industrial Mathematics;2014, Vol. 6 Issue 4, p307 

    In the literature hardly any attention is paid to solving a fuzzy fixed charge transportation problem. In this paper, we consider the fully fixed-charge transportation problem and try to find both the lower and upper bounds on the fuzzy optimal value of such a problem in which all of the...

  • Periodic BVPs for fractional order impulsive evolution equations. Xiulan Yu; JinRong Wang // Boundary Value Problems;Feb2014, Vol. 2014, p1 

    In this paper, we study periodic BVPs for fractional order impulsive evolution equations. The existence and boundedness of piecewise continuous mild solutions and design parameter drift for periodic motion of linear problems are presented. Furthermore, existence results of piecewise continuous...

  • Domain Decomposition Schemes Based on the Penalty Method for the Problems of Perfect Contact of Elastic Bodies. Prokopyshyn, І. // Journal of Mathematical Sciences;Jan2016, Vol. 212 Issue 1, p46 

    On the basis of the penalty method, we propose a number of continuous parallel domain decomposition schemes for the solution of the problems of perfect mechanical contact of elastic bodies. For some of these schemes, we prove the theorems on convergence. We study the problem of optimal choice of...

  • BOOSTING THE PERFORMANCE OF METAHEURISTICS FOR THE MINLA PROBLEM USING A MORE DISCRIMINATING EVALUATION FUNCTION. Rodriguez-Tello, Eduardo; Jin-Kao Hao; Romero-Monsivais, Hillel // Tehnicki vjesnik / Technical Gazette;Jan/Feb2015, Vol. 22 Issue 1, p11 

    This paper investigates the role of evaluation function used by metaheuristics for solving combinatorial optimization problems. Evaluation function (EF) is a key component of any metaheuristic algorithm and its design directly influences the performance of such an algorithm. However, the design...

  • A Greedy Heuristic Algorithm for Solving the Capacitated Planar Multi-facility Location-Allocation Problem. Luis, Martino; Ramli, Mohammad Fadzli; Lin, Abdullah // AIP Conference Proceedings;2016, Vol. 1782 Issue 1, p1 

    This study investigates the capacitated planar multi-facility location-allocation problem by considering various capacity constraints. The problem is also known as the capacitated multi-source Weber problem, where the number of facilities to be located is specified and each of which has a...

  • A posterior error analysis for the nonconforming discretization of Stokes eigenvalue problem. Jia, Shang; Luo, Fu; Xie, He // Acta Mathematica Sinica;Jun2014, Vol. 30 Issue 6, p949 

    In this paper, we present a posteriori error estimator for the nonconforming finite element approximation, including using Crouzeix-Raviart element and extended Crouzeix-Raviart element, of the Stokes eigenvalue problem. With the technique of Helmholtz decomposition, we first give out a...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics