Single row facility layout problem using a permutation-based genetic algorithm
Identifieur interne : 002845 ( Main/Merge ); précédent : 002844; suivant : 002846Single row facility layout problem using a permutation-based genetic algorithm
Auteurs : Dilip Datta [Inde, Portugal] ; Andre R. S. Amaral [Portugal] ; Jose Rui Figueira [France]Source :
- European journal of operational research [ 0377-2217 ] ; 2011.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000147
- to stream PascalFrancis, to step Curation: 000866
- to stream PascalFrancis, to step Checkpoint: 000121
Links to Exploration step
Pascal:11-0302803Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Single row facility layout problem using a permutation-based genetic algorithm</title><author><name sortKey="Datta, Dilip" sort="Datta, Dilip" uniqKey="Datta D" first="Dilip" last="Datta">Dilip Datta</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Mechanical Engineering, National Institute of Technology-Silchar</s1><s2>Silchar 788 010</s2><s3>IND</s3><sZ>1 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Silchar 788 010</wicri:noRegion></affiliation><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>CEG-IST, Center for Management Studies, Instituto Superior Técnico, Technical University of Lisbon, Tagus Park, Av. Cavaco Silva</s1><s2>2744-016 Porto Salvo</s2><s3>PRT</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Portugal</country><wicri:noRegion>2744-016 Porto Salvo</wicri:noRegion></affiliation></author><author><name sortKey="Amaral, Andre R S" sort="Amaral, Andre R S" uniqKey="Amaral A" first="Andre R. S." last="Amaral">Andre R. S. Amaral</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>CEG-IST, Center for Management Studies, Instituto Superior Técnico, Technical University of Lisbon, Tagus Park, Av. Cavaco Silva</s1><s2>2744-016 Porto Salvo</s2><s3>PRT</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Portugal</country><wicri:noRegion>2744-016 Porto Salvo</wicri:noRegion></affiliation></author><author><name sortKey="Rui Figueira, Jose" sort="Rui Figueira, Jose" uniqKey="Rui Figueira J" first="Jose" last="Rui Figueira">Jose Rui Figueira</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>INPL, Ecole des Mines de Nancy, Laboratoire LORIA, Parc de Saurupt CS 14 234</s1><s2>54 042 Nancy</s2><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>54 042 Nancy</wicri:noRegion><wicri:noRegion>Parc de Saurupt CS 14 234</wicri:noRegion><wicri:noRegion>54 042 Nancy</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">11-0302803</idno><date when="2011">2011</date><idno type="stanalyst">PASCAL 11-0302803 INIST</idno><idno type="RBID">Pascal:11-0302803</idno><idno type="wicri:Area/PascalFrancis/Corpus">000147</idno><idno type="wicri:Area/PascalFrancis/Curation">000866</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000121</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000121</idno><idno type="wicri:doubleKey">0377-2217:2011:Datta D:single:row:facility</idno><idno type="wicri:Area/Main/Merge">002845</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Single row facility layout problem using a permutation-based genetic algorithm</title><author><name sortKey="Datta, Dilip" sort="Datta, Dilip" uniqKey="Datta D" first="Dilip" last="Datta">Dilip Datta</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Mechanical Engineering, National Institute of Technology-Silchar</s1><s2>Silchar 788 010</s2><s3>IND</s3><sZ>1 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Silchar 788 010</wicri:noRegion></affiliation><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>CEG-IST, Center for Management Studies, Instituto Superior Técnico, Technical University of Lisbon, Tagus Park, Av. Cavaco Silva</s1><s2>2744-016 Porto Salvo</s2><s3>PRT</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Portugal</country><wicri:noRegion>2744-016 Porto Salvo</wicri:noRegion></affiliation></author><author><name sortKey="Amaral, Andre R S" sort="Amaral, Andre R S" uniqKey="Amaral A" first="Andre R. S." last="Amaral">Andre R. S. Amaral</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>CEG-IST, Center for Management Studies, Instituto Superior Técnico, Technical University of Lisbon, Tagus Park, Av. Cavaco Silva</s1><s2>2744-016 Porto Salvo</s2><s3>PRT</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Portugal</country><wicri:noRegion>2744-016 Porto Salvo</wicri:noRegion></affiliation></author><author><name sortKey="Rui Figueira, Jose" sort="Rui Figueira, Jose" uniqKey="Rui Figueira J" first="Jose" last="Rui Figueira">Jose Rui Figueira</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>INPL, Ecole des Mines de Nancy, Laboratoire LORIA, Parc de Saurupt CS 14 234</s1><s2>54 042 Nancy</s2><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>54 042 Nancy</wicri:noRegion><wicri:noRegion>Parc de Saurupt CS 14 234</wicri:noRegion><wicri:noRegion>54 042 Nancy</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">European journal of operational research</title><title level="j" type="abbreviated">Eur. j. oper. res.</title><idno type="ISSN">0377-2217</idno><imprint><date when="2011">2011</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">European journal of operational research</title><title level="j" type="abbreviated">Eur. j. oper. res.</title><idno type="ISSN">0377-2217</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Combinatorial optimization</term><term>Costs</term><term>Expert system</term><term>Genetic algorithm</term><term>Layout problem</term><term>NP hard problem</term><term>On line</term><term>Permutation</term><term>Plant layout</term><term>Unconstrained optimization</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Planning installation</term><term>Problème agencement</term><term>Permutation</term><term>Algorithme génétique</term><term>Problème NP difficile</term><term>En ligne</term><term>Coût</term><term>Système expert</term><term>Optimisation sans contrainte</term><term>Optimisation combinatoire</term><term>.</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions.</div></front></TEI><affiliations><list><country><li>France</li><li>Inde</li><li>Portugal</li></country></list><tree><country name="Inde"><noRegion><name sortKey="Datta, Dilip" sort="Datta, Dilip" uniqKey="Datta D" first="Dilip" last="Datta">Dilip Datta</name></noRegion></country><country name="Portugal"><noRegion><name sortKey="Datta, Dilip" sort="Datta, Dilip" uniqKey="Datta D" first="Dilip" last="Datta">Dilip Datta</name></noRegion><name sortKey="Amaral, Andre R S" sort="Amaral, Andre R S" uniqKey="Amaral A" first="Andre R. S." last="Amaral">Andre R. S. Amaral</name></country><country name="France"><noRegion><name sortKey="Rui Figueira, Jose" sort="Rui Figueira, Jose" uniqKey="Rui Figueira J" first="Jose" last="Rui Figueira">Jose Rui Figueira</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002845 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002845 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= Pascal:11-0302803
|texte= Single row facility layout problem using a permutation-based genetic algorithm
}}
| This area was generated with Dilib version V0.6.33. |  |