Scientific Research An Academic Publisher
OPEN ACCESS
Add your e-mail address to receive free newsletters from SCIRP.
Select Journal AA AAD AAR AASoci AAST ABB ABC ABCR ACES ACS ACT AD ADR AE AER AHS AID AiM AIT AJAC AJC AJCC AJCM AJIBM AJMB AJOR AJPS ALAMT ALC ALS AM AMI AMPC ANP APD APE APM ARS ARSci AS ASM BLR CC CE CellBio ChnStd CM CMB CN CRCM CS CSTA CUS CWEEE Detection EMAE ENG EPE ETSN FMAR FNS GEP GIS GM Graphene GSC Health IB ICA IIM IJAA IJAMSC IJCCE IJCM IJCNS IJG IJIDS IJIS IJMNTA IJMPCERO IJNM IJOC IJOHNS InfraMatics JACEN JAMP JASMI JBBS JBCPR JBiSE JBM JBNB JBPC JCC JCDSA JCPT JCT JDAIP JDM JEAS JECTC JEMAA JEP JFCMV JFRM JGIS JHEPGC JHRSS JIBTVA JILSA JIS JMF JMGBND JMMCE JMP JPEE JQIS JSBS JSEA JSEMAT JSIP JSS JSSM JST JTR JTST JTTs JWARP LCE MC ME MI MME MNSMS MPS MR MRC MRI MSA MSCE NJGC NM NR NS OALib OALibJ ODEM OJA OJAB OJAcct OJAnes OJAP OJApo OJAppS OJAPr OJAS OJBD OJBIPHY OJBM OJC OJCB OJCD OJCE OJCM OJD OJDer OJDM OJE OJEE OJEM OJEMD OJEpi OJER OJF OJFD OJG OJGas OJGen OJI OJIC OJIM OJINM OJL OJM OJMC OJMetal OJMH OJMI OJMIP OJML OJMM OJMN OJMP OJMS OJMSi OJN OJNeph OJO OJOG OJOGas OJOp OJOph OJOPM OJOTS OJPathology OJPC OJPChem OJPed OJPM OJPP OJPS OJPsych OJRA OJRad OJRD OJRM OJS OJSS OJSST OJST OJSTA OJTR OJTS OJU OJVM OPJ POS PP PST PSYCH SAR SCD SGRE SM SN SNL Soft SS TEL TI UOAJ VP WET WJA WJCD WJCMP WJCS WJET WJM WJNS WJNSE WJNST WJV WSN YM
More>>
M. J. Cortinhal and M. E. Captivo, “Genetic Algorithms for the Single Source Capacitated Location Problem,” Metaheuristics: Computer Decision-Making, Vol. 86, 2004, pp. 187-216.
has been cited by the following article:
TITLE: Implementing Lagrangean Decomposition Technique to Acquire an Adequate Lower Boundon the Facility Location Problem Solution
AUTHORS: Eiman Jadaan Alenezy, Rehab F. Khalaf
KEYWORDS: Capacitated Facility Location Problem; Lagrangean Relaxation Technique; Volume Algorithm;Randomised Rounding Technique; Unit Cost Technique
JOURNAL NAME: Applied Mathematics, Vol.4 No.8, July 30, 2013
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.
Related Articles:
Formation of X-120 M Line Pipe through J-C-O-E Technique
Jai Dev Chandel, Nand Lal Singh
DOI: 10.4236/eng.2011.34046 10,452 Downloads 18,183 Views Citations
Pub. Date: April 8, 2011
A Cross Entropy-Genetic Algorithm for m-Machines No-Wait Job-ShopScheduling Problem
Budi Santosa, Muhammad Arif Budiman, Stefanus Eko Wiratno
DOI: 10.4236/jilsa.2011.33018 4,977 Downloads 9,736 Views Citations
Pub. Date: August 5, 2011
On the Metaheuristics Approach to the Problem of Genetic Sequence Comparison and Its Parallel Implementation
Sergey Makarkin, Boris Melnikov, Alexander Panin
DOI: 10.4236/am.2013.410A1006 2,685 Downloads 4,382 Views Citations
Pub. Date: September 30, 2013
The Capacitated Location-Allocation Problem in the Presence of k Connections
Saber Shiripour, Mehdi Amiri-Aref, Iraj Mahdavi
DOI: 10.4236/am.2011.28130 5,453 Downloads 10,003 Views Citations
Pub. Date: August 24, 2011
Decision Making Styles and Adaptive Algorithms for Human Action
Mauro Maldonato, Silvia Dell’ Orco
DOI: 10.4236/psych.2011.28124 5,964 Downloads 9,553 Views Citations
Pub. Date: November 7, 2011
