Application of modified multi-objective particle swarm optimisation algorithm for flexible process planning problem

Process planning belongs to one of the most essential functions of the modern manufacturing system. Moreover, flexible process planning implies the ability of a system to adapt to changing requirements and thereby provide alternative ways of performing manufacturing operations on a part. Variety of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of computer integrated manufacturing Jg. 30; H. 2-3; S. 271 - 291
Hauptverfasser: Miljković, Zoran, Petrović, Milica
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis 04.03.2017
Schlagworte:
AND/OR network
flexible process planning
genetic algorithms
particle swarm optimisation
simulated annealing
ISSN:0951-192X, 1362-3052
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Process planning belongs to one of the most essential functions of the modern manufacturing system. Moreover, flexible process planning implies the ability of a system to adapt to changing requirements and thereby provide alternative ways of performing manufacturing operations on a part. Variety of manufacturing resources including variety of alternative machines, alternative tools, as well as tool access direction (TAD) leads to the fact that most of the parts in modern manufacturing systems have various flexible process plans. Therefore, obtaining optimal process plan from all available alternatives has become a very important task in the domain of flexible process planning research. In this article, a method based on modified particle swarm optimisation (mPSO) has been developed to solve this nondeterministic polynomial-hard combinatorial optimisation problem, and the following issues have been addressed: (i) the AND/OR network representation has been adopted to describe various types of flexibility, i.e. machine flexibility, tool flexibility, TAD flexibility, process flexibility and sequence flexibility; (ii) the particle encoding/decoding scheme has been proposed and traditional PSO algorithm has been modified with crossover, mutation and shift operator and (iii) optimal operation sequence has been found by performing multi-objective optimisation procedure concerning minimisation of the production time and production cost. In order to verify the performance of the proposed mPSO algorithm, five independent experiments have been carried out and comparisons with other meta-heuristic algorithms have been made. The experimental results show that the proposed algorithm has achieved satisfactory improvement in terms of efficiency and effectiveness.
AbstractList Process planning belongs to one of the most essential functions of the modern manufacturing system. Moreover, flexible process planning implies the ability of a system to adapt to changing requirements and thereby provide alternative ways of performing manufacturing operations on a part. Variety of manufacturing resources including variety of alternative machines, alternative tools, as well as tool access direction (TAD) leads to the fact that most of the parts in modern manufacturing systems have various flexible process plans. Therefore, obtaining optimal process plan from all available alternatives has become a very important task in the domain of flexible process planning research. In this article, a method based on modified particle swarm optimisation (mPSO) has been developed to solve this nondeterministic polynomial-hard combinatorial optimisation problem, and the following issues have been addressed: (i) the AND/OR network representation has been adopted to describe various types of flexibility, i.e. machine flexibility, tool flexibility, TAD flexibility, process flexibility and sequence flexibility; (ii) the particle encoding/decoding scheme has been proposed and traditional PSO algorithm has been modified with crossover, mutation and shift operator and (iii) optimal operation sequence has been found by performing multi-objective optimisation procedure concerning minimisation of the production time and production cost. In order to verify the performance of the proposed mPSO algorithm, five independent experiments have been carried out and comparisons with other meta-heuristic algorithms have been made. The experimental results show that the proposed algorithm has achieved satisfactory improvement in terms of efficiency and effectiveness.
Author Miljković, Zoran
Petrović, Milica
Author_xml – sequence: 1
  givenname: Zoran
  orcidid: 0000-0001-9706-6134
  surname: Miljković
  fullname: Miljković, Zoran
  email: zmiljkovic@mas.bg.ac.rs
  organization: Faculty of Mechanical Engineering, Production Engineering Department, University of Belgrade
– sequence: 2
  givenname: Milica
  orcidid: 0000-0002-4950-6518
  surname: Petrović
  fullname: Petrović, Milica
  organization: Faculty of Mechanical Engineering, Production Engineering Department, University of Belgrade
BookMark eNqFkM1KAzEUhYNUsK0-gpAXmJqfZqaDG0vxDwpuFNwNmUxSb0kmQxKtfXtnbN240NWFw_kOl2-CRq1vNUKXlMwoWZArUgpKS_Y6Y4TmM0rnYkHmJ2hMec4yTgQbofHQyYbSGZrEuCWE8r41RnHZdRaUTOBb7A12vgEDusHu3SbIfL3VKsGHxp0MCZTVOO5kcNh3CRzEAyftxgdIbw4bH7Cx-hPqvtkFr3SMuLOybaHdDEGfu3N0aqSN-uJ4p-jl7vZ59ZCtn-4fV8t1pnjOU1aXXNG6bkRplG5UXTCljGR50wipmRSCsKJQYq5rU0i-KBtZLijnTJd5UeienqLrw64KPsagTaUgfX-cggRbUVIN_qoff9Xgrzr662nxi-4COBn2_3I3Bw7a3oaTOx9sUyW5tz6YIFsFseJ_T3wBcR-OOg
CitedBy_id crossref_primary_10_3390_su11020502
crossref_primary_10_1080_00207543_2021_1912432
crossref_primary_10_1007_s00170_018_1646_1
crossref_primary_10_1007_s00170_018_3151_y
crossref_primary_10_1051_matecconf_201712602005
crossref_primary_10_1109_TSMC_2018_2881686
crossref_primary_10_1007_s00170_023_12027_3
crossref_primary_10_1080_00207543_2020_1736357
crossref_primary_10_1016_j_rcim_2021_102200
crossref_primary_10_1177_0954405419896118
crossref_primary_10_1007_s13369_022_07209_2
crossref_primary_10_1080_00207543_2019_1650975
crossref_primary_10_1017_S0890060422000105
crossref_primary_10_1080_0951192X_2020_1780318
crossref_primary_10_3390_pr7020111
crossref_primary_10_1080_21681015_2025_2471897
crossref_primary_10_3390_ma14237360
crossref_primary_10_1080_00207543_2025_2490214
crossref_primary_10_1016_j_aej_2017_06_017
crossref_primary_10_1016_j_asoc_2019_105520
crossref_primary_10_1007_s00170_018_2370_6
crossref_primary_10_1007_s10696_019_09360_9
crossref_primary_10_1016_j_jii_2022_100364
crossref_primary_10_1080_00207543_2018_1425015
crossref_primary_10_1016_j_asoc_2022_109784
Cites_doi 10.1080/00207549408957006
10.1016/j.engappai.2009.04.005
10.1007/s00170-004-2491-y
10.1080/09511920701607741
10.1080/0951192021000025742
10.1016/0360-8352(94)90345-X
10.1080/00207540110119991
10.1016/j.cor.2008.07.006
10.1007/s00170-011-3870-9
10.1080/002075499191409
10.1016/S0305-0548(02)00063-1
10.1080/0951192X.2011.627949
10.1080/0951192X.2010.518632
10.1007/s00170-012-4572-7
10.1007/BF00170206
10.1080/09511920600667366
10.1243/09544054JEM647
10.1016/S0952-1976(97)00006-7
10.1023/A:1027302604072
10.1007/s00170-013-4815-2
10.1080/09511920601079355
10.1007/s00170-011-3527-8
10.1080/00207540310001652897
10.1080/002075400411420
10.1080/0951192X.2014.961548
10.1007/s00170-007-1069-x
10.1007/s10845-010-0382-7
10.1007/s10845-010-0407-2
10.1007/s00170-010-2977-8
ContentType Journal Article
Copyright 2016 Taylor & Francis 2016
Copyright_xml – notice: 2016 Taylor & Francis 2016
DBID AAYXX
CITATION
DOI 10.1080/0951192X.2016.1145804
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1362-3052
EndPage 291
ExternalDocumentID 10_1080_0951192X_2016_1145804
1145804
Genre Article
GrantInformation_xml – fundername: The Ministry of Education, Science and Technological Development of the Serbian Government
  grantid: Grant TR-35004
GroupedDBID .4S
.7F
.DC
.QJ
0BK
0R~
29J
30N
4.4
5GY
5VS
8VB
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABJNI
ABLIJ
ABPAQ
ABPEM
ABPPZ
ABTAI
ABXUL
ABXYU
ACGEJ
ACGFS
ACTIO
ADCVX
ADGTB
ADMLS
ADXPE
AEISY
AEMOZ
AENEX
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHDZW
AHQJS
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
ARCSS
AVBZW
AWYRJ
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
EBO
EBR
EBS
EBU
ECS
EDO
EJD
EMK
EPL
E~A
E~B
GTTXZ
H13
HF~
HZ~
H~P
I-F
IPNFZ
J.P
K1G
KYCEM
M4Z
MK~
ML~
NA5
NX~
O9-
P2P
QWB
RIG
RNANH
RNS
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TH9
TNC
TTHFI
TUROJ
TUS
TWF
UPT
UT5
UU3
ZGOLN
ZL0
~S~
AAYXX
CITATION
ID FETCH-LOGICAL-c363t-b93c1bbd59fcedcb72ccfa26dd5ae2a550277c54ebf7a389da981332e9677eb93
IEDL.DBID TFW
ISICitedReferencesCount 31
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000390883300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0951-192X
IngestDate Sat Nov 29 06:18:25 EST 2025
Tue Nov 18 19:49:05 EST 2025
Mon Oct 20 23:43:02 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2-3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c363t-b93c1bbd59fcedcb72ccfa26dd5ae2a550277c54ebf7a389da981332e9677eb93
ORCID 0000-0002-4950-6518
0000-0001-9706-6134
PageCount 21
ParticipantIDs informaworld_taylorfrancis_310_1080_0951192X_2016_1145804
crossref_citationtrail_10_1080_0951192X_2016_1145804
crossref_primary_10_1080_0951192X_2016_1145804
PublicationCentury 2000
PublicationDate 2017-03-04
PublicationDateYYYYMMDD 2017-03-04
PublicationDate_xml – month: 03
  year: 2017
  text: 2017-03-04
  day: 04
PublicationDecade 2010
PublicationTitle International journal of computer integrated manufacturing
PublicationYear 2017
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References CIT0032
CIT0031
CIT0012
CIT0034
CIT0033
Browne J. (CIT0004) 1984; 2
CIT0014
CIT0036
CIT0013
CIT0035
CIT0016
CIT0038
CIT0015
Ahuja R. K. (CIT0001) 1993
CIT0018
CIT0017
CIT0019
Kalajdžić M. (CIT0008) 2006
CIT0040
CIT0021
Petrović M. (CIT0030) 2012; 54
CIT0020
CIT0022
Luger G. F. (CIT0023) 1989
CIT0003
CIT0025
CIT0002
CIT0024
CIT0005
CIT0027
CIT0026
CIT0007
CIT0006
CIT0028
References_xml – ident: CIT0003
  doi: 10.1080/00207549408957006
– ident: CIT0034
  doi: 10.1016/j.engappai.2009.04.005
– volume-title: Artificial Intelligence and the Design of Expert Systems
  year: 1989
  ident: CIT0023
– ident: CIT0013
  doi: 10.1007/s00170-004-2491-y
– ident: CIT0035
  doi: 10.1080/09511920701607741
– ident: CIT0002
  doi: 10.1080/0951192021000025742
– ident: CIT0014
  doi: 10.1016/0360-8352(94)90345-X
– ident: CIT0016
  doi: 10.1080/00207540110119991
– ident: CIT0036
  doi: 10.1016/j.cor.2008.07.006
– ident: CIT0007
  doi: 10.1007/s00170-011-3870-9
– ident: CIT0031
  doi: 10.1080/002075499191409
– volume-title: Network Flows, Theory, Algorithms, and Applications
  year: 1993
  ident: CIT0001
– ident: CIT0012
  doi: 10.1016/S0305-0548(02)00063-1
– ident: CIT0026
  doi: 10.1080/0951192X.2011.627949
– ident: CIT0040
  doi: 10.1080/0951192X.2010.518632
– ident: CIT0018
  doi: 10.1007/s00170-012-4572-7
– ident: CIT0021
  doi: 10.1007/BF00170206
– ident: CIT0015
  doi: 10.1080/09511920600667366
– ident: CIT0006
  doi: 10.1243/09544054JEM647
– volume-title: Manufacturing Technology
  year: 2006
  ident: CIT0008
– ident: CIT0032
  doi: 10.1016/S0952-1976(97)00006-7
– ident: CIT0038
  doi: 10.1023/A:1027302604072
– ident: CIT0024
  doi: 10.1007/s00170-013-4815-2
– ident: CIT0005
  doi: 10.1080/09511920601079355
– ident: CIT0020
  doi: 10.1007/s00170-011-3527-8
– ident: CIT0017
  doi: 10.1080/00207540310001652897
– ident: CIT0025
  doi: 10.1080/002075400411420
– volume: 54
  start-page: 205
  issue: 3
  year: 2012
  ident: CIT0030
  publication-title: Strojarstvo
– volume: 2
  start-page: 114
  issue: 2
  year: 1984
  ident: CIT0004
  publication-title: The FMS Magazine
– ident: CIT0027
  doi: 10.1080/0951192X.2014.961548
– ident: CIT0019
  doi: 10.1007/s00170-007-1069-x
– ident: CIT0033
  doi: 10.1007/s10845-010-0382-7
– ident: CIT0022
  doi: 10.1007/s10845-010-0407-2
– ident: CIT0028
  doi: 10.1007/s00170-010-2977-8
SSID ssj0013580
Score 2.2587485
Snippet Process planning belongs to one of the most essential functions of the modern manufacturing system. Moreover, flexible process planning implies the ability of...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 271
SubjectTerms AND/OR network
flexible process planning
genetic algorithms
particle swarm optimisation
simulated annealing
Title Application of modified multi-objective particle swarm optimisation algorithm for flexible process planning problem
URI https://www.tandfonline.com/doi/abs/10.1080/0951192X.2016.1145804
Volume 30
WOSCitedRecordID wos000390883300004&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: 1362-3052
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0013580
  issn: 0951-192X
  databaseCode: TFW
  dateStart: 19880101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV27TsMwFLVQxQADb0R5yQNroE3sOB4rRMVUMRSRLfITipomSgL8Prbj0HYABthzo8Sve659fA4AV9bP1uBkGvAYkwAxhAOG7B48T4aIcGmyjnZmE2QySdKUPng2Ye1plbaG1q1QhFur7eRmvO4YcTcWFRhgklpiVmzFbnHiFEFN6rdTczp-Wp4jYOed5szkbUh3h-e7t6xlpzXt0pWsM979h-_dAzsecsJRO0b2wYZaHIDtFSHCQ1CPlufYsNAwL-RMG3AKHd8wKPhruy7C0o80WH-wKoeFWXByTwiCbP5cVLPmJYfmf6C2SpvcPFm2VxFg6e2RoPewOQKP47vp7X3g7RgCEcVRE3AaiSHnElMtlBSchEJoFsZSYqZCZkqdkBCBkeKaMIODJKOJqYBDRWNClIk-Br1FsVAnAErGqY6RGigRIaS1KVMHLEREYh0zTUkfoK4bMuG1yq1lxjwbdpKmvk0z26aZb9M-uP4KK1uxjt8C6GofZ43bJdGtpUkW_Rh7-ofYM7AVWnhguWzoHPSa6k1dgE3x3szq6tIN4U_hfO_S
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT8JAEN4YNFEPvo343IPXKrS7XfZIjAQjcsLIrdmnYoA2UPXvu9MuAgf1oPdO084-5pvZ2e9D6BL0bB1O5oGMKQuIIDQQBGrwslEnTGoXdWwhNsG63Ua_zxfvwkBbJeTQtiSKKPZqWNxQjJ61xF0DLHDIpA-dWTGw3dIGUIKuUhdrgT-_13qanyTQQj2tkJMHm9ktnu9esxSflthLF-JOa_s_vngHbXnUiZvlNNlFK2a8hzYXuAj30bQ5P8rGqcWjVA-sw6e4aDkMUvlabo0485MNTz_EZIRTt-eMfE8QFsPndDLIX0bY_RC2QLYp3ZNZeRsBZ14hCXsZmwP02Lrt3bQDr8gQqCiO8kDySNWl1JRbZbSSLFTKijDWmgoTCpfthIwpSoy0TDgopAVvuCQ4NDxmzDjrQ1QZp2NzhLAWktuYmJpRESHWuky1JkLCNLWxsJxVEZmNQ6I8XTmoZgyT-ozV1Ps0AZ8m3qdVdPVllpV8Hb8Z8MVBTvKiUGJLVZMk-tH2-A-2F2i93XvoJJ277v0J2ggBLUBrGzlFlXzyZs7QmnrPB9PJeTGfPwEPzfP8
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1NT4MwGG7MNEYPfhvnZw9e0Q0KpcdFJRrNssOMu5F-6swYBFD_vi0Utx3Ug955CbRv2-dtnz4PAOfGz1bjZOKwwMcOosh3KDJ78CzsIsyEXnVUZTaB-_1wNCIDyyYsLK3S1NCqFoqo5mozuDOhGkbcpUEFGpiMDDErMGK3fmgUQZc1dA5Mkg-jp9lBgl-Zp1Vu8iamucTz3WsWlqcF8dK5ZSfa_IcP3gIbFnPCXp0k22BJTnfA-pwS4S4oerODbJgqmKRirDQ6hRXh0EnZaz0xwsymGiw-aJ7AVM84iWUEQTp5TvNx-ZJA_T9QGalNpp_M6rsIMLP-SNCa2OyBx-hmeHXrWD8Gh3uBVzqMeLzLmPCJ4lJwhl3OFXUDIXwqXaprHRdj7iPJFKYaCAlKQl0Cu5IEGEsdvQ9a03QqDwAUlBEVINmR3ENIKV2ndqiLsPBVQBXBbYCaboi5FSs3nhmTuNtomto2jU2bxrZN2-DiKyyr1Tp-CyDzfRyX1TaJqj1NYu_H2MM_xJ6B1cF1FD_c9e-PwJproILhtaFj0CrzN3kCVvh7OS7y0yqbPwE8bfKu
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=Application+of+modified+multi-objective+particle+swarm+optimisation+algorithm+for+flexible+process+planning+problem&rft.jtitle=International+journal+of+computer+integrated+manufacturing&rft.au=Miljkovi%C4%87%2C+Zoran&rft.au=Petrovi%C4%87%2C+Milica&rft.date=2017-03-04&rft.issn=0951-192X&rft.eissn=1362-3052&rft.volume=30&rft.issue=2-3&rft.spage=271&rft.epage=291&rft_id=info:doi/10.1080%2F0951192X.2016.1145804&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_0951192X_2016_1145804
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0951-192X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0951-192X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0951-192X&client=summon