Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

Models and algorithms for the capacitated facility location problem

 

Marketed By :  LAP LAMBERT Academic Publishing   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 2,675

Availability: In stock

 
  • Product Description
 

We investigate solution approaches for large instances of the capacitated facility location problem (CFLP). we present details of a Lagrangean Decomposition algorithm for solving such problems. We introduce a new tightening constraint and dual estimates that lead to improved lower bounds. In our computer environment, we describe a number of Greedy heuristics that provide good upper bound solutions. We describe how these results can be exploited by warm starting our upper bound procedure in the Lagrangean Decomposition approach. We present our results that indicate the benefits of being able to incorporate these warm starts. We show for small instances of the CFLP, it is effective to have tight linking constraints. We report results that illustrate the trade off between these constraints, solution time, and solution quality. We describe an effective routine, whereby at each pass in the algorithm, these constraints can be sequentially added. We present a new heuristic called the “unit cost technique”, to improve the upper bound. Also we show through solving very large instances of the CFLP that our algorithm scales up well in terms of computational time and solution quality.

Product Specifications
SKU :COC76234
AuthorEiman J. Alenezy
LanguageEnglish
BindingPaperback
Number of Pages84
Publishing Year2014-08-06T00:00:00.000
ISBN9783659577413
Edition1 st
Book TypeMathematics
Country of ManufactureIndia
Product BrandLAP LAMBERT Academic Publishing
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-10-08 00:00:00
0 Review(s)