Hybridization of genetic algorithm and fully informed particle swarm for solving the multi-mode resource-constrained project scheduling problem

In this article, the genetic algorithm (GA) and fully informed particle swarm (FIPS) are hybridized for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. In the propos...

Full description

Saved in:
Bibliographic Details
Published in:Engineering optimization Vol. 49; no. 3; pp. 513 - 530
Main Authors: Sebt, M. H., Afshar, M. R., Alipouri, Y.
Format: Journal Article
Language:English
Published: Abingdon Taylor & Francis 04.03.2017
Taylor & Francis Ltd
Subjects:
Algorithms
combinatorial optimization
Decoding
Genetic algorithms
Genetics
hybrid GA-FIPS algorithm
multi-mode project scheduling
Optimization
Production scheduling
Project management
random key representation
resource constraints
Resource scheduling
Scheduling algorithms
Serials
Swarm intelligence
ISSN:0305-215X, 1029-0273
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this article, the genetic algorithm (GA) and fully informed particle swarm (FIPS) are hybridized for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. In the proposed hybrid genetic algorithm-fully informed particle swarm algorithm (HGFA), FIPS is a popular variant of the particle swarm optimization algorithm. A random key and the related mode list representation schemes are used as encoding schemes, and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. Furthermore, the existing mode improvement procedure in the literature is modified. The results show that the proposed mode improvement procedure remarkably improves the project makespan. Comparing the results of the proposed HGFA with other approaches using the well-known PSPLIB benchmark sets validates the effectiveness of the proposed algorithm to solve the MRCPSP.
AbstractList In this article, the genetic algorithm (GA) and fully informed particle swarm (FIPS) are hybridized for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. In the proposed hybrid genetic algorithm-fully informed particle swarm algorithm (HGFA), FIPS is a popular variant of the particle swarm optimization algorithm. A random key and the related mode list representation schemes are used as encoding schemes, and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. Furthermore, the existing mode improvement procedure in the literature is modified. The results show that the proposed mode improvement procedure remarkably improves the project makespan. Comparing the results of the proposed HGFA with other approaches using the well-known PSPLIB benchmark sets validates the effectiveness of the proposed algorithm to solve the MRCPSP.
Author Afshar, M. R.
Alipouri, Y.
Sebt, M. H.
Author_xml – sequence: 1
  givenname: M. H.
  surname: Sebt
  fullname: Sebt, M. H.
  email: sebt@aut.ac.ir
  organization: Department of Civil Engineering, Amirkabir University of Technology
– sequence: 2
  givenname: M. R.
  surname: Afshar
  fullname: Afshar, M. R.
  organization: Department of Civil Engineering, Amirkabir University of Technology
– sequence: 3
  givenname: Y.
  surname: Alipouri
  fullname: Alipouri, Y.
  organization: Department of Civil Engineering, Amirkabir University of Technology
BookMark eNqFkUFrFDEYhoNUcFv9CULAi5fZ5ktmNjt4UUq1QsGLgreQyXzZzZJJapKxrH_Cv2ymWy896Cnw8Tzvl-Q9J2chBiTkNbA1sC27ZIJ1HLrva85gswbo5QbYM7ICxvuGcSnOyGphmgV6Qc5zPjAGgrHtivy-OQ7Jje6XLi4GGi3dYcDiDNV-F5Mr-4nqMFI7e3-kLtiYJhzpnU6V8UjzvU4TrVOao__pwo6WPdJp9sU1UxyRJsxxTgYbE0MuSbuw6Cke0BSazR7H2S9aHQ0ep5fkudU-46vH84J8-3j99eqmuf3y6fPVh9vGtEKWZmsHbMd-ALEBLnorOwO2bYd2kGKUTAjNZWv6dhBdyzUf5Ba5EFZyAGk7QHFB3p5y694fM-aiJpcNeq8Dxjkr6FnLa07XV_TNE_RQXxTq7RRsu471dQdUqjtRJsWcE1p1l9yk01EBU0tN6m9NaqlJPdZUvXdPPOPKQxnLZ_n_2u9P9qkZfR-TH1XRRx-TTToYl5X4d8QfUmWwDg
CitedBy_id crossref_primary_10_1007_s40996_020_00437_2
crossref_primary_10_1109_ACCESS_2020_3014940
crossref_primary_10_1080_15623599_2021_1902731
crossref_primary_10_1016_j_cie_2024_110333
crossref_primary_10_1007_s43452_021_00218_2
crossref_primary_10_1016_j_eswa_2020_114132
crossref_primary_10_1080_0305215X_2019_1610946
crossref_primary_10_1080_15623599_2019_1623992
crossref_primary_10_1016_j_cie_2020_106567
crossref_primary_10_3390_app122412667
crossref_primary_10_3390_math7020146
crossref_primary_10_1007_s10951_021_00696_5
crossref_primary_10_1016_j_cie_2020_106287
crossref_primary_10_1177_0954410019883106
crossref_primary_10_1002_er_7698
crossref_primary_10_1007_s10586_019_03038_5
crossref_primary_10_1016_j_swevo_2025_102141
crossref_primary_10_1016_j_cie_2022_108402
crossref_primary_10_1016_j_cie_2021_107316
crossref_primary_10_1109_TCYB_2021_3097312
crossref_primary_10_1111_exsy_12830
crossref_primary_10_1002_j_2334_5837_2019_00657_x
crossref_primary_10_1111_itor_12644
crossref_primary_10_1016_j_aei_2020_101039
crossref_primary_10_1016_j_asoc_2021_107480
crossref_primary_10_1038_s41598_023_45970_y
crossref_primary_10_1080_0305215X_2017_1378875
crossref_primary_10_1007_s00607_018_00693_1
crossref_primary_10_1080_0305215X_2021_2013479
crossref_primary_10_1155_2022_6324325
crossref_primary_10_1080_0305215X_2018_1431234
Cites_doi 10.1109/CSCWD.2013.6580935
10.1016/j.cor.2008.11.010
10.1109/TSMCB.2003.818557
10.1016/j.ins.2011.06.014
10.1007/978-3-642-38577-3_56
10.1007/978-3-319-19857-6_46
10.1016/j.cor.2007.07.001
10.1007/978-3-642-01009-5_8
10.1016/S0377-2217(96)00180-4
10.1007/s10732-010-9152-0
10.1007/978-94-007-5699-1_24
10.1016/S0377-2217(97)00348-2
10.1007/978-3-319-13563-2_57
10.1080/0305215X.2013.827673
10.1016/j.ejor.2009.11.005
10.1109/IBICA.2012.49
10.3233/IFS-120747
10.1002/9780470225868
10.1016/j.ejor.2007.10.042
10.1109/IEEM.2014.7058760
10.1023/A:1010954031930
10.1016/j.ijpe.2008.11.002
10.1007/s13369-014-1162-z
10.1057/palgrave.jors.2601563
10.1016/j.cor.2010.01.001
10.1016/j.cor.2011.05.008
10.1016/j.compchemeng.2016.01.004
10.3390/e16095032
10.1109/TEVC.2004.826074
10.1145/1389095.1389106
10.1016/j.autcon.2013.05.030
10.1109/5326.740669
10.1023/A:1010902015091
10.1016/j.ejor.2009.12.014
10.1016/j.asoc.2007.07.002
10.1016/j.ejor.2009.03.034
10.14445/22312803/IJCTT-V8P111
10.1007/BF01545587
10.1155/2015/923791
10.1109/TEVC.2008.2011991
ContentType Journal Article
Copyright 2016 Informa UK Limited, trading as Taylor & Francis Group 2016
2016 Informa UK Limited, trading as Taylor & Francis Group
Copyright_xml – notice: 2016 Informa UK Limited, trading as Taylor & Francis Group 2016
– notice: 2016 Informa UK Limited, trading as Taylor & Francis Group
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
DOI 10.1080/0305215X.2016.1197610
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Civil Engineering Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Civil Engineering Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Civil Engineering Abstracts
Civil Engineering Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1029-0273
EndPage 530
ExternalDocumentID 4292601661
10_1080_0305215X_2016_1197610
1197610
Genre Article
Feature
GroupedDBID -~X
.7F
.QJ
0BK
0R~
29G
2DF
30N
4.4
5GY
5VS
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACGOD
ACIWK
ACTIO
ADCVX
ADGTB
ADXPE
AEISY
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EBS
EJD
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
M4Z
NA5
NX~
O9-
P2P
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TN5
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
KR7
L7M
L~C
L~D
ID FETCH-LOGICAL-c437t-8fbe4d9b1361239f75c1f44b4b73d7033a274c94b3542a2b78e233f72117f51e3
IEDL.DBID TFW
ISICitedReferencesCount 38
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000392466100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0305-215X
IngestDate Tue Aug 05 11:28:50 EDT 2025
Wed Aug 13 06:27:01 EDT 2025
Sat Nov 29 07:47:53 EST 2025
Tue Nov 18 20:55:28 EST 2025
Mon Oct 20 23:34:24 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c437t-8fbe4d9b1361239f75c1f44b4b73d7033a274c94b3542a2b78e233f72117f51e3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 1855093541
PQPubID 53195
PageCount 18
ParticipantIDs crossref_citationtrail_10_1080_0305215X_2016_1197610
proquest_miscellaneous_1904203359
proquest_journals_1855093541
informaworld_taylorfrancis_310_1080_0305215X_2016_1197610
crossref_primary_10_1080_0305215X_2016_1197610
PublicationCentury 2000
PublicationDate 2017-03-04
PublicationDateYYYYMMDD 2017-03-04
PublicationDate_xml – month: 03
  year: 2017
  text: 2017-03-04
  day: 04
PublicationDecade 2010
PublicationPlace Abingdon
PublicationPlace_xml – name: Abingdon
PublicationTitle Engineering optimization
PublicationYear 2017
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References Jędrzejowicz P. (CIT0014) 2015; 39
CIT0030
CIT0010
CIT0032
CIT0031
CIT0012
CIT0034
Wauters T. (CIT0043) 2009
Montgomery D. C. (CIT0025) 2005
Vartouni A. M. (CIT0039) 2014; 26
Anderson E. (CIT0002) 1994; 6
CIT0036
CIT0013
CIT0035
CIT0016
CIT0038
CIT0015
CIT0037
CIT0018
CIT0017
CIT0019
CIT0041
CIT0040
CIT0021
CIT0020
CIT0042
CIT0001
CIT0023
CIT0022
CIT0044
Sebt M. H. (CIT0033) 2015; 2
CIT0003
CIT0047
CIT0024
CIT0046
CIT0005
CIT0027
CIT0004
CIT0026
CIT0007
CIT0029
Zhang H (CIT0045) 2012; 28
CIT0006
CIT0028
CIT0009
CIT0008
References_xml – volume: 2
  start-page: 905
  issue: 3
  year: 2015
  ident: CIT0033
  publication-title: International Journal of Supply and Operations Management
– ident: CIT0034
  doi: 10.1109/CSCWD.2013.6580935
– volume-title: Proceedings of the 8th International Conference on Autonomous Agents and Multi agent Systems
  year: 2009
  ident: CIT0043
– ident: CIT0008
  doi: 10.1016/j.cor.2008.11.010
– ident: CIT0016
  doi: 10.1109/TSMCB.2003.818557
– ident: CIT0040
  doi: 10.1016/j.ins.2011.06.014
– volume: 28
  start-page: 150
  year: 2012
  ident: CIT0045
  publication-title: American Society of Civil Engineers
– ident: CIT0005
  doi: 10.1007/978-3-642-38577-3_56
– volume: 39
  start-page: 537
  year: 2015
  ident: CIT0014
  publication-title: Intelligent Decision Technologies
  doi: 10.1007/978-3-319-19857-6_46
– ident: CIT0022
  doi: 10.1016/j.cor.2007.07.001
– ident: CIT0028
  doi: 10.1007/978-3-642-01009-5_8
– ident: CIT0026
  doi: 10.1016/S0377-2217(96)00180-4
– volume: 6
  start-page: 161
  year: 1994
  ident: CIT0002
  publication-title: Operations Research Society of America Journal on Computing
– ident: CIT0030
  doi: 10.1007/s10732-010-9152-0
– ident: CIT0024
  doi: 10.1007/978-94-007-5699-1_24
– ident: CIT0036
  doi: 10.1016/S0377-2217(97)00348-2
– ident: CIT0042
  doi: 10.1007/978-3-319-13563-2_57
– ident: CIT0044
  doi: 10.1080/0305215X.2013.827673
– ident: CIT0013
  doi: 10.1016/j.ejor.2009.11.005
– ident: CIT0006
  doi: 10.1109/IBICA.2012.49
– volume: 26
  start-page: 1103
  issue: 3
  year: 2014
  ident: CIT0039
  publication-title: Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
  doi: 10.3233/IFS-120747
– ident: CIT0018
  doi: 10.1002/9780470225868
– volume-title: Design and Analysis of Experiments
  year: 2005
  ident: CIT0025
– ident: CIT0032
  doi: 10.1016/j.ejor.2007.10.042
– ident: CIT0007
  doi: 10.1109/IEEM.2014.7058760
– ident: CIT0015
  doi: 10.1023/A:1010954031930
– ident: CIT0020
  doi: 10.1016/j.ijpe.2008.11.002
– ident: CIT0031
  doi: 10.1007/s13369-014-1162-z
– ident: CIT0001
  doi: 10.1057/palgrave.jors.2601563
– ident: CIT0009
  doi: 10.1016/j.cor.2010.01.001
– ident: CIT0041
  doi: 10.1016/j.cor.2011.05.008
– ident: CIT0047
– ident: CIT0003
  doi: 10.1016/j.compchemeng.2016.01.004
– ident: CIT0004
  doi: 10.3390/e16095032
– ident: CIT0023
  doi: 10.1109/TEVC.2004.826074
– ident: CIT0021
  doi: 10.1145/1389095.1389106
– ident: CIT0019
  doi: 10.1016/j.autcon.2013.05.030
– ident: CIT0027
  doi: 10.1109/5326.740669
– ident: CIT0012
  doi: 10.1023/A:1010902015091
– ident: CIT0010
  doi: 10.1016/j.ejor.2009.12.014
– ident: CIT0017
  doi: 10.1016/j.asoc.2007.07.002
– ident: CIT0029
  doi: 10.1016/j.ejor.2009.03.034
– ident: CIT0035
  doi: 10.14445/22312803/IJCTT-V8P111
– ident: CIT0037
  doi: 10.1007/BF01545587
– ident: CIT0046
  doi: 10.1155/2015/923791
– ident: CIT0038
  doi: 10.1109/TEVC.2008.2011991
SSID ssj0013008
Score 2.3050745
Snippet In this article, the genetic algorithm (GA) and fully informed particle swarm (FIPS) are hybridized for solving the multi-mode resource-constrained project...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 513
SubjectTerms Algorithms
combinatorial optimization
Decoding
Genetic algorithms
Genetics
hybrid GA-FIPS algorithm
multi-mode project scheduling
Optimization
Production scheduling
Project management
random key representation
resource constraints
Resource scheduling
Scheduling algorithms
Serials
Swarm intelligence
Title Hybridization of genetic algorithm and fully informed particle swarm for solving the multi-mode resource-constrained project scheduling problem
URI https://www.tandfonline.com/doi/abs/10.1080/0305215X.2016.1197610
https://www.proquest.com/docview/1855093541
https://www.proquest.com/docview/1904203359
Volume 49
WOSCitedRecordID wos000392466100010&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: PRVAWR
  databaseName: Taylor & Francis Online Journals
  customDbUrl:
  eissn: 1029-0273
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013008
  issn: 0305-215X
  databaseCode: TFW
  dateStart: 19740101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrR3LTtww0KoQB3qgFIrYslSD1KuXje2s42NVsdoT6gHE3qLYsVsk2EVJlmq_or_MTOLwEEIc6DXOxNZkPO8HY99FGXBBFJzGInFVZoFnzgsu0gLFi7KZt2U7bEKfnWXzufkVswnrmFZJNnToGkW0vJoud2HrPiPuhGgUJdWcErMmI4qDTdoiK9TsKanvfHr5GEcYtzPpCIITSF_D89pXnkmnZ71LX_DqVgBNP_2Ho--w7ah9wo-OXD6zD36xyz4-6Um4x_7N1lTEFcszYRkASYwqHaG4_r2srpo_N4DbA_nt19Cd3ZdwG0kQ6r9FdQP4FJCqyVsBqGJCm7fIaewOVDFgwB2ppjShgsA7hxCgrY2yj0rkIY66-cIupqfnP2c8Tm3gTknd8CxYr0pjE0mdXUzQqUuCUlZZLUvkL7JAQ9gZZWWqRCGszryQMpAlqkOaeLnPNhbLhT9gIIK0Fk1C5ROjJmNtlRkbhwppSIQOTg-Y6v9W7mJLczr3dZ70nU8jvnPCdx7xPWCjB7DbrqfHWwDmKSnkTetMCd3kk1y-ATvs6SaP7KHOE2ojZxAByYAdPyzjxaZoTbHwyxW-Y5CfIrpS8_Ud2x-yLUGKCGXNqSHbaKqVP2Kb7q65qqtv7WW5Bx9JEi4
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELaqUgl6gPISS0sZJK4uG9tZx8eqYrWo7Z4WsTcrdmyo1O5W2bSov4K_zEzitFsh1ANc40xsTcbzsGfmY-yjqCIOiJITLBJXVRF54YPgIi_RvChXBFe1YBN6Oi3mc7NeC0NplRRDx65RRKuraXPTYXSfEveJhBRN1Zwys0YHdBE2oiqrR4RORwHYbPzt7iZh2KLSEQknmr6K52-fuWef7nUv_UNbtyZo_Ox_LH6HPU0OKBx2EvOcbYTFC7a91pbwJfs1uaE6rlShCcsIKGVU7Ajl-fdlfdb8uACcH2jCG-gWHyq4TFIIq59lfQH4FFCw6cAC0MuENnWRE_IO1OnOgHvyTgmkgsi7MyHAcBvNH1XJQ0K7ecW-jj_PjiY8ATdwr6RueBFdUJVxmaTmLibq3GdRKaeclhWqGFliLOyNcjJXohROF0FIGSkY1THPgnzNNhfLRXjDQETpHEaFKmRGjYbaKTM0Hn3SmAkdvR4w1f8u61NXc1r3uc365qeJ35b4bRO_B-zgluyya-vxEIFZlwXbtOcpsQM_sfIB2r1ecGzSECubUSc5gwzIBuzD7TDubbqwKRdheYXvGFSpyK7cvP2H6d-zx5PZ6Yk9-TI93mVPBPkllESn9thmU1-Fd2zLXzdnq3q_3Tm_AVlkFlE
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrR3LTtww0EK0quihT6ouUDqVejXd2M46PqK2KxDVigNV92bFjg1IsLvKhiK-gl9mJnEoqKo4lGucia3JeN4Pxj6LKuKCKDmNReKqKiIvfBBc5CWKF-WK4Kp22ISeTIrp1BymbMJlSqskGzp2jSJaXk2Xe1HFPiPuC9EoSqopJWaNdigONqIiqyeoOudE2EfjX38CCcN2KB2BcILpi3j-9Zl74ule89K_mHUrgcYvH-Hsr9iLpH7Cbkcvr9lKmL1hz-80JXzLrveuqIor1WfCPALSGJU6Qnl2PK9Pm5NzwO2BHPdX0J09VLBINAjLy7I-B3wKSNbkrgDUMaFNXOQ0dwfqFDHgnnRTGlFB4J1HCNDYRuFHNfKQZt2ss5_j70df93ga28C9krrhRXRBVcZlklq7mKhzn0WlnHJaVshgZImWsDfKyVyJUjhdBCFlJFNUxzwL8h1bnc1n4T0DEaVzaBOqkBk1GmqnzNB41EhjJnT0esBU_7esTz3N6dxnNutbnyZ8W8K3TfgesJ1bsEXX1OMhAHOXFGzTelNiN_rEygdgt3q6sYk_LG1GfeQMIiAbsE-3y3izKVxTzsL8At8xyFARXbnZ-I_tP7Jnh9_G9sf-5GCTrQlSSiiDTm2x1aa-CB_YU_-7OV3W2-29uQH-VxUD
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=Hybridization+of+genetic+algorithm+and+fully+informed+particle+swarm+for+solving+the+multi-mode+resource-constrained+project+scheduling+problem&rft.jtitle=Engineering+optimization&rft.au=Sebt%2C+M+H&rft.au=Afshar%2C+M+R&rft.au=Alipouri%2C+Y&rft.date=2017-03-04&rft.issn=0305-215X&rft.eissn=1029-0273&rft.volume=49&rft.issue=3&rft.spage=513&rft.epage=530&rft_id=info:doi/10.1080%2F0305215X.2016.1197610&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-215X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-215X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-215X&client=summon