View in EDS HTML Full Text PDF Full Text

A flower pollination algorithm for the double-floor corridor allocation problem.

Saved in:
Bibliographic Details
Title: A flower pollination algorithm for the double-floor corridor allocation problem.
Authors: Guan, Chao1 (AUTHOR), Zhang, Zeqiang1 (AUTHOR) zhangzq@home.swjtu.edu.cn, Li, Yunpeng1 (AUTHOR)
Source: International Journal of Production Research. Oct2019, Vol. 57 Issue 20, p6506-6527. 22p. 6 Diagrams, 6 Charts, 4 Graphs.
Subjects: Pollination, Algorithms, Flowers, Process optimization, Building operation management
Abstract: This research explores the double-floor corridor allocation problem (DFCAP), which deals with the optimal arrangement of departments over two floors and then place them along both sides against a corridor. This problem is a natural extension of the corridor allocation problem (CAP) to additional floors; the layout of each floor can be regarded as an approximately independent CAP. The DFCAP is commonly observed in manufacturing and service buildings. In this study, a mixed-integer programming formulation for the DFCAP is developed, and it is able to reduce to the classical CAP model. Then a novel flower pollination algorithm is provided, which is discretised using swap pair set approach to solve the considered DFCAP. In addition, to ameliorate the algorithm, three constructive heuristic rules are developed to produce a reasonably good initial population; meanwhile, a variable neighbourhood search structure is presented to prevent prematurity in arrival at a poor local solution. Finally, several instances for the DFCAP with a size of 9 ≤ n ≤ 80 are employed in the algorithms, as well as in mixed-integer non-linear programming (MINLP) formulations, which are solved with GUROBI 7.0.1. Moreover, the above-mentioned instances are utilized to show that the proposed algorithm performs better in comparison to the state-of-the-art optimization algorithms. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 138769662
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A flower pollination algorithm for the double-floor corridor allocation problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Guan%2C+Chao%22">Guan, Chao</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Zhang%2C+Zeqiang%22">Zhang, Zeqiang</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> zhangzq@home.swjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Li%2C+Yunpeng%22">Li, Yunpeng</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Production+Research%22">International Journal of Production Research</searchLink>. Oct2019, Vol. 57 Issue 20, p6506-6527. 22p. 6 Diagrams, 6 Charts, 4 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Pollination%22">Pollination</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Flowers%22">Flowers</searchLink><br /><searchLink fieldCode="DE" term="%22Process+optimization%22">Process optimization</searchLink><br /><searchLink fieldCode="DE" term="%22Building+operation+management%22">Building operation management</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This research explores the double-floor corridor allocation problem (DFCAP), which deals with the optimal arrangement of departments over two floors and then place them along both sides against a corridor. This problem is a natural extension of the corridor allocation problem (CAP) to additional floors; the layout of each floor can be regarded as an approximately independent CAP. The DFCAP is commonly observed in manufacturing and service buildings. In this study, a mixed-integer programming formulation for the DFCAP is developed, and it is able to reduce to the classical CAP model. Then a novel flower pollination algorithm is provided, which is discretised using swap pair set approach to solve the considered DFCAP. In addition, to ameliorate the algorithm, three constructive heuristic rules are developed to produce a reasonably good initial population; meanwhile, a variable neighbourhood search structure is presented to prevent prematurity in arrival at a poor local solution. Finally, several instances for the DFCAP with a size of 9 ≤ n ≤ 80 are employed in the algorithms, as well as in mixed-integer non-linear programming (MINLP) formulations, which are solved with GUROBI 7.0.1. Moreover, the above-mentioned instances are utilized to show that the proposed algorithm performs better in comparison to the state-of-the-art optimization algorithms. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Production Research is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=138769662
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/00207543.2019.1566673
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 22
        StartPage: 6506
    Subjects:
      – SubjectFull: Pollination
        Type: general
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Flowers
        Type: general
      – SubjectFull: Process optimization
        Type: general
      – SubjectFull: Building operation management
        Type: general
    Titles:
      – TitleFull: A flower pollination algorithm for the double-floor corridor allocation problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Guan, Chao
      – PersonEntity:
          Name:
            NameFull: Zhang, Zeqiang
      – PersonEntity:
          Name:
            NameFull: Li, Yunpeng
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 15
              M: 10
              Text: Oct2019
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 00207543
          Numbering:
            – Type: volume
              Value: 57
            – Type: issue
              Value: 20
          Titles:
            – TitleFull: International Journal of Production Research
              Type: main
ResultId 1