Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)

Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while simi...

Full description

Saved in:
Bibliographic Details
Published in:Iranian journal of management studies Vol. 10; no. 2; p. 467
Main Authors: Maadi, Mansoureh, Javidnia, Mohammad, Jamshidi, Rasoul
Format: Journal Article
Language:English
Published: University of Tehran, Farabi College 22.03.2017
Subjects:
Algorithms
Annealing
Genetic algorithms
Novels
Plant layout
Production management
Technology application
ISSN:2008-7055
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row and dissimilar facilities should be arranged in a parallel row. As PROP is a new introduced NP-hard problem, only a mixed integer programming model is developed to formulate this problem. So to solve large scale instances of this problem, heuristic and metaheuristic algorithms can be useful. In this paper, two strategies based on genetic algorithm (GA) and a novel population based simulated annealing algorithm (PSA) to solve medium and large instances of PROP are proposed. Also several test problems of PROP in two groups with different sizes that have been extracted from the literature are solved to evaluate the proposed algorithms in terms of objective function value and computational time. According to the results, in the first group of instances, both algorithms almost have equal performances, and in the second group PSA shows better performance by increasing the size of test problems.
AbstractList Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row and dissimilar facilities should be arranged in a parallel row. As PROP is a new introduced NP-hard problem, only a mixed integer programming model is developed to formulate this problem. So to solve large scale instances of this problem, heuristic and metaheuristic algorithms can be useful. In this paper, two strategies based on genetic algorithm (GA) and a novel population based simulated annealing algorithm (PSA) to solve medium and large instances of PROP are proposed. Also several test problems of PROP in two groups with different sizes that have been extracted from the literature are solved to evaluate the proposed algorithms in terms of objective function value and computational time. According to the results, in the first group of instances, both algorithms almost have equal performances, and in the second group PSA shows better performance by increasing the size of test problems.
Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row and dissimilar facilities should be arranged in a parallel row. As PROP is a new introduced NP-hard problem, only a mixed integer programming model is developed to formulate this problem. So to solve large scale instances of this problem, heuristic and metaheuristic algorithms can be useful. In this paper, two strategies based on genetic algorithm (GA) and a novel population based simulated annealing algorithm (PSA) to solve medium and large instances of PROP are proposed. Also several test problems of PROP in two groups with different sizes that have been extracted from the literature are solved to evaluate the proposed algorithms in terms of objective function value and computational time. According to the results, in the first group of instances, both algorithms almost have equal performances, and in the second group PSA shows better performance by increasing the size of test problems. Keywords Facility layout problem, Parallel row ordering problem, Genetic algorithm, Population based simulated annealing algorithm.
Audience Academic
Author Maadi, Mansoureh
Jamshidi, Rasoul
Javidnia, Mohammad
Author_xml – sequence: 1
  fullname: Maadi, Mansoureh
– sequence: 2
  fullname: Javidnia, Mohammad
– sequence: 3
  fullname: Jamshidi, Rasoul
BookMark eNptkNFLwzAQxvMwwan7HwK-KNiaJk3SPs6hTpiszPniy0iba5fRNpBk7N83oA8TvIM7OH7fB_ddocloR0AIZySllPDy0RwGn1KSyZRmQgiWCklpwSdoSgkpEkk4v0Qz7w8klsxyIsQUfW1PFn8EpwJ0Bjx-Uh40tiN-h6CSJRyd8cE0eN531pmwHzxurcOVcqrvoccbe8Jrp8GZscOVs3UPA76rNuvq_gZdtKr3MPvd1-jz5Xm7WCar9evbYr5KuqwoQ9KwUheS1Vwx0pAih5LXJZXAdK0g14rKWhClW1BMF4rxNpOtAMZJ3hBdSsqu0e2Pb6d62JmxtfGdZjC-2c15EZMpKc0ilf5DxdYwmCZG2Zp4_yN4OBPUR29G8HF40-2D79TR-3P8G1bAddc
ContentType Journal Article
Copyright COPYRIGHT 2017 University of Tehran, Farabi College
Copyright_xml – notice: COPYRIGHT 2017 University of Tehran, Farabi College
DBID N95
DOI 10.22059/ijms.2017.216663.672285
DatabaseName Gale Business: Insights
DatabaseTitleList


DeliveryMethod fulltext_linktorsrc
Discipline Business
ExternalDocumentID A580599221
GroupedDBID 5VS
77T
7WY
8FL
ABUWG
ACIHN
ADBBV
AEAQA
AFFHD
AFKRA
AFMMW
AHQJS
AKVCP
ALMA_UNASSIGNED_HOLDINGS
BAAKF
BAIFH
BBTPI
BCNDV
BENPR
BEZIV
BPHCQ
CCPQU
CWDGH
DWQXO
EBU
EOJEC
FRNLG
GROUPED_DOAJ
IAO
IEA
ISM
ITC
K1G
K60
K6~
KQ8
M0C
N95
OBODZ
OK1
PHGZM
PHGZT
PIMPY
PQBIZ
PQBZA
PQQKQ
PROAC
PV9
RNS
RZL
TH9
ID FETCH-LOGICAL-g189t-c39d873b5a30c084e95b927e3dbae4da27b60adfea3d8a35f17f6e3504c0d9723
ISICitedReferencesCount 16
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000406013200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2008-7055
IngestDate Sat Nov 29 13:35:40 EST 2025
Sat Nov 29 10:08:46 EST 2025
Sat Nov 29 08:21:13 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-g189t-c39d873b5a30c084e95b927e3dbae4da27b60adfea3d8a35f17f6e3504c0d9723
ParticipantIDs gale_infotracmisc_A580599221
gale_infotracacademiconefile_A580599221
gale_businessinsightsgauss_A580599221
PublicationCentury 2000
PublicationDate 20170322
PublicationDateYYYYMMDD 2017-03-22
PublicationDate_xml – month: 03
  year: 2017
  text: 20170322
  day: 22
PublicationDecade 2010
PublicationTitle Iranian journal of management studies
PublicationYear 2017
Publisher University of Tehran, Farabi College
Publisher_xml – name: University of Tehran, Farabi College
SSID ssj0000714066
Score 2.0903993
Snippet Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row...
SourceID gale
SourceType Aggregation Database
StartPage 467
SubjectTerms Algorithms
Annealing
Genetic algorithms
Novels
Plant layout
Production management
Technology application
Title Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)
Volume 10
WOSCitedRecordID wos000406013200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  issn: 2008-7055
  databaseCode: 7WY
  dateStart: 20110301
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.proquest.com/abicomplete
  omitProxy: false
  ssIdentifier: ssj0000714066
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  issn: 2008-7055
  databaseCode: M0C
  dateStart: 20110301
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://search.proquest.com/abiglobal
  omitProxy: false
  ssIdentifier: ssj0000714066
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Middle East & Africa Database (ProQuest)
  issn: 2008-7055
  databaseCode: CWDGH
  dateStart: 20110301
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://search.proquest.com/middleeastafrica
  omitProxy: false
  ssIdentifier: ssj0000714066
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  issn: 2008-7055
  databaseCode: BENPR
  dateStart: 20110301
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://www.proquest.com/central
  omitProxy: false
  ssIdentifier: ssj0000714066
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  issn: 2008-7055
  databaseCode: PIMPY
  dateStart: 20110301
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: http://search.proquest.com/publiccontent
  omitProxy: false
  ssIdentifier: ssj0000714066
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db5RAEN9cqjG-GD9jtZp90PhAqMAe7PJ4NjbV5GpTz6RvzcIud5gDDHBt_wL_bmdYPpuY1AdfNgQWFpgfO8PszG8IeRe4ymHKj-zYTZg9j-Gbi0KX2SIG5ex6GknUmmIT_PRUXFyEZ7PZ7y4X5mrL81zc3IS__quoYR8IG1Nn_0Hc_UVhB2yD0KEFsUN7N8FfF1bHOasr6xOoKYVLAktdS_tE7ww1s7XYrosyrTeGkAEsyRKrqmyt8-La-oZ8nOhDODPlZsYW7BdQbmnrvW8t2awPoWnYakdhiUspVWpSgnJcJtC98_krxtLnJlJ3WWxklkk1HMuqTWpOPJdw3nbsmwB95zDbG_5kp7ElK70pjVP3GB4pSjvXyDDjNbEYSO8zmZ6dEQy90Vw7N3U8busAzBxGDtX0Z4Z07C4_9HBplB0G3PNMeaBbDNsLXyBLjYd8BPc87ocYGrh0jnpfHSZ5Oc2yd3-HJiisGevjX0ZqlfzIXFk9Jo_a_wy6MPh4QmY6f0oedGkOz8h3gAkdYEIbmNAip1OY0AEmFGBCO5hQgAntYEJbmDwnP44_r45O7LbAhr12RVjbMQuV4CzyJXNiR8x16EehxzVTkdRzJT0eBY5UiZZMCcn8xOVJoJnvwDetsFzdC7KXF7l-SagI2JzzhDlKIGkel2CWJzxRfpgIP4jcffIeX8ZlW1oVmgqdT9Va7qrqcpDAPvnQ9EOJwjuIZZslAqMgUdmk58GkJ0yL8ejwqztf6DV5OGD3gOzV5U6_IffjqzqtyrcNEv4AolSCkw
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Two+Strategies+Based+on+Meta-Heuristic+Algorithms+for+Parallel+Row+Ordering+Problem&rft.jtitle=Iranian+journal+of+management+studies&rft.au=Maadi%2C+Mansoureh&rft.au=Javidnia%2C+Mohammad&rft.au=Jamshidi%2C+Rasoul&rft.date=2017-03-22&rft.pub=University+of+Tehran%2C+Farabi+College&rft.issn=2008-7055&rft.volume=10&rft.issue=2&rft.spage=467&rft_id=info:doi/10.22059%2Fijms.2017.216663.672285&rft.externalDocID=A580599221
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2008-7055&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2008-7055&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2008-7055&client=summon