메뉴 건너뛰기




Volumn 69, Issue 1-4, 2013, Pages 197-209

A particle swarm optimization algorithm with neighborhood-based mutation for sequence-dependent disassembly line balancing problem

Author keywords

Disassembly; Metaheuristics; Neighborhood based mutation; Particle swarm optimization; Product recovery; Sequence dependent disassembly line balancing

Indexed keywords

ANT COLONY OPTIMIZATION; CONSTRAINED OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS; MANUFACTURE; PARTICLE SWARM OPTIMIZATION (PSO); PRODUCT DESIGN; TABU SEARCH;

EID: 84887821595     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-013-4990-1     Document Type: Article
Times cited : (158)

References (30)
  • 1
    • 0033358107 scopus 로고    scopus 로고
    • Issues in environmentally conscious manufacturing and product recovery: A survey
    • 10.1016/S0360-8352(99)00167-9
    • Gungor A, Gupta SM (1999) Issues in environmentally conscious manufacturing and product recovery: a survey. Comput Ind Eng 36(4):811-853
    • (1999) Comput Ind Eng , vol.36 , Issue.4 , pp. 811-853
    • Gungor, A.1    Gupta, S.M.2
  • 2
    • 72149096791 scopus 로고    scopus 로고
    • Environmentally conscious manufacturing and product recovery (ECMPRO): A review of the state of the art
    • 10.1016/j.jenvman.2009.09.037
    • Ilgin MA, Gupta SM (2010) Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art. J Environ Manag 91(3):563-591
    • (2010) J Environ Manag , vol.91 , Issue.3 , pp. 563-591
    • Ilgin, M.A.1    Gupta, S.M.2
  • 4
    • 0035837942 scopus 로고    scopus 로고
    • A solution approach to the disassembly line balancing problem in the presence of task failures
    • 10.1080/00207540110052157
    • Gungor A, Gupta SM (2001) A solution approach to the disassembly line balancing problem in the presence of task failures. Int J Prod Res 39(7):1427-1467
    • (2001) Int J Prod Res , vol.39 , Issue.7 , pp. 1427-1467
    • Gungor, A.1    Gupta, S.M.2
  • 6
    • 0037143030 scopus 로고    scopus 로고
    • Disassembly line in product recovery
    • 10.1080/00207540210135622
    • Gungor A, Gupta SM (2002) Disassembly line in product recovery. Int J Prod Res 40(11):2569-2589
    • (2002) Int J Prod Res , vol.40 , Issue.11 , pp. 2569-2589
    • Gungor, A.1    Gupta, S.M.2
  • 7
    • 33845939092 scopus 로고    scopus 로고
    • A balancing method and genetic algorithm for disassembly line balancing
    • 10.1016/j.ejor.2005.03.055
    • McGovern SM, Gupta SM (2007) A balancing method and genetic algorithm for disassembly line balancing. Eur J Oper Res 179(3):692-708
    • (2007) Eur J Oper Res , vol.179 , Issue.3 , pp. 692-708
    • McGovern, S.M.1    Gupta, S.M.2
  • 8
    • 84867068820 scopus 로고    scopus 로고
    • Task-failure-driven rebalancing of disassembly lines
    • 10.1080/00207543.2011.616915
    • Altekin FT, Akkan C (2012) Task-failure-driven rebalancing of disassembly lines. Int J Prod Res 50(18):4955-4976
    • (2012) Int J Prod Res , vol.50 , Issue.18 , pp. 4955-4976
    • Altekin, F.T.1    Akkan, C.2
  • 9
    • 34548398404 scopus 로고    scopus 로고
    • Profit-oriented disassembly-line balancing
    • 10.1080/00207540601137207
    • Altekin FT, Kandiller L, Ozdemirel NE (2008) Profit-oriented disassembly-line balancing. Int J Prod Res 46(10):2675-2693
    • (2008) Int J Prod Res , vol.46 , Issue.10 , pp. 2675-2693
    • Altekin, F.T.1    Kandiller, L.2    Ozdemirel, N.E.3
  • 10
    • 70749116514 scopus 로고    scopus 로고
    • Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph
    • 10.1080/07408170802510390
    • Koc A, Sabuncuoglu I, Erel E (2009) Two exact formulations for disassembly line balancing problems with task precedence diagram construction using an AND/OR graph. IIE Trans 41(10):866-881
    • (2009) IIE Trans , vol.41 , Issue.10 , pp. 866-881
    • Koc, A.1    Sabuncuoglu, I.2    Erel, E.3
  • 13
    • 33748559516 scopus 로고    scopus 로고
    • Ant colony optimization for disassembly sequencing with multiple objectives
    • 10.1007/s00170-005-0037-6
    • McGovern SM, Gupta SM (2006) Ant colony optimization for disassembly sequencing with multiple objectives. Int J Adv Manuf Technol 30(5):481-496
    • (2006) Int J Adv Manuf Technol , vol.30 , Issue.5 , pp. 481-496
    • McGovern, S.M.1    Gupta, S.M.2
  • 14
    • 34548449384 scopus 로고    scopus 로고
    • Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem
    • 10.1080/00207540701476281
    • McGovern SM, Gupta SM (2007) Combinatorial optimization analysis of the unary NP-complete disassembly line balancing problem. Int J Prod Res 45(18-19):4485-4511
    • (2007) Int J Prod Res , vol.45 , Issue.18-19 , pp. 4485-4511
    • McGovern, S.M.1    Gupta, S.M.2
  • 15
    • 36448976916 scopus 로고    scopus 로고
    • A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem
    • 10.1080/00207540600943985
    • Agrawal S, Tiwari MK (2008) A collaborative ant colony algorithm to stochastic mixed-model U-shaped disassembly line balancing and sequencing problem. Int J Prod Res 46(6):1405-1429
    • (2008) Int J Prod Res , vol.46 , Issue.6 , pp. 1405-1429
    • Agrawal, S.1    Tiwari, M.K.2
  • 16
    • 61349137696 scopus 로고    scopus 로고
    • Real world disassembly modeling and sequencing problem: Optimization by algorithm of self-guided ants (ASGA)
    • 10.1016/j.rcim.2008.02.004
    • Tripathi M, Agrawal S, Pandey MK, Shankar R, Tiwari MK (2009) Real world disassembly modeling and sequencing problem: optimization by algorithm of self-guided ants (ASGA). Robot Comput Integr Manuf 25(3):483-496
    • (2009) Robot Comput Integr Manuf , vol.25 , Issue.3 , pp. 483-496
    • Tripathi, M.1    Agrawal, S.2    Pandey, M.K.3    Shankar, R.4    Tiwari, M.K.5
  • 17
    • 77953610368 scopus 로고    scopus 로고
    • A new multi-objective ant colony algorithm for solving the disassembly line balancing problem
    • 10.1007/s00170-009-2303-5
    • Ding L-P, Feng Y-X, Tan J-R, Gao Y-C (2010) A new multi-objective ant colony algorithm for solving the disassembly line balancing problem. Int J Adv Manuf Technol 48(5-8):761-771
    • (2010) Int J Adv Manuf Technol , vol.48 , Issue.5-8 , pp. 761-771
    • Ding, L.-P.1    Feng, Y.-X.2    Tan, J.-R.3    Gao, Y.-C.4
  • 21
    • 43449085514 scopus 로고    scopus 로고
    • The sequence-dependent assembly line balancing problem
    • 2399508
    • Scholl A, Boysen N, Fliedner M (2006) The sequence-dependent assembly line balancing problem. OR Spectr 30(3):579-609
    • (2006) OR Spectr , vol.30 , Issue.3 , pp. 579-609
    • Scholl, A.1    Boysen, N.2    Fliedner, M.3
  • 22
    • 84871830217 scopus 로고    scopus 로고
    • Electronic waste and organized crime-assessing the links
    • Anonymous
    • Anonymous (2009) Electronic waste and organized crime-assessing the links. Trends in Organized Crime 12(3-4):352-378
    • (2009) Trends in Organized Crime , vol.12 , Issue.3-4 , pp. 352-378
  • 24
    • 78650310064 scopus 로고    scopus 로고
    • Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization
    • 10.1016/j.ijpe.2010.10.016
    • Nearchou AC (2011) Maximizing production rate and workload smoothing in assembly lines using particle swarm optimization. Int J Prod Econ 129(2):242-250
    • (2011) Int J Prod Econ , vol.129 , Issue.2 , pp. 242-250
    • Nearchou, A.C.1
  • 25
    • 34248654556 scopus 로고    scopus 로고
    • A new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem
    • 10.1007/s00500-007-0149-z
    • Rahimi-Vahed AR, Mirghorbani SM, Rabbani M (2007) A new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem. Soft Comput 11(10):997-1012
    • (2007) Soft Comput , vol.11 , Issue.10 , pp. 997-1012
    • Rahimi-Vahed, A.R.1    Mirghorbani, S.M.2    Rabbani, M.3
  • 26
    • 78649967706 scopus 로고    scopus 로고
    • A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems
    • 10.1016/j.micpro.2010.11.001
    • Kang Q, He H (2011) A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems. Microprocess Microsyst 35(1):10-17
    • (2011) Microprocess Microsyst , vol.35 , Issue.1 , pp. 10-17
    • Kang, Q.1    He, H.2
  • 27
    • 36248986205 scopus 로고    scopus 로고
    • A hybrid multi-objective particle swarm algorithm for a mixed-model assembly line sequencing problem
    • 2367721 10.1080/03052150701512042
    • Rahimi-Vahed AR, Mirghorbani SM, Rabbani M (2007) A hybrid multi-objective particle swarm algorithm for a mixed-model assembly line sequencing problem. Eng Optim 39(8):877-898
    • (2007) Eng Optim , vol.39 , Issue.8 , pp. 877-898
    • Rahimi-Vahed, A.R.1    Mirghorbani, S.M.2    Rabbani, M.3
  • 28
    • 38849205466 scopus 로고    scopus 로고
    • A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
    • 2586401 10.1016/j.cor.2006.12.030
    • Pan Q-K, Fatih Tasgetiren M, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807-2839
    • (2008) Comput Oper Res , vol.35 , Issue.9 , pp. 2807-2839
    • Pan, Q.-K.1    Fatih Tasgetiren, M.2    Liang, Y.-C.3
  • 29
    • 59049093735 scopus 로고    scopus 로고
    • A discrete particle swarm optimization algorithm for scheduling parallel machines
    • 10.1016/j.cie.2008.05.007
    • Kashan AH, Karimi B (2009) A discrete particle swarm optimization algorithm for scheduling parallel machines. Comput Ind Eng 56(1):216-223
    • (2009) Comput Ind Eng , vol.56 , Issue.1 , pp. 216-223
    • Kashan, A.H.1    Karimi, B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.