Skip to main content

Advertisement

Springer Nature Link
Log in

An efficient GRASP algorithm for disassembly sequence planning

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

One of the steps in a reverse supply chain is to disassemble the recovered products. The design of such disassembly operations is more complex than that of classical assembly lines. A new GRASP algorithm is presented in this paper for solving Disassembly Sequence Planning, i.e. the determination of the sequence for disassembling component parts. The problem has a combinatorial structure and a large number of constraints. Moreover, checking the feasibility of each solution element is time consuming. The proposed approach is successfully tested against previous best known solutions for a set of public benchmark problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Abe S, Murayama T, Oba F, Narutaki N (1999) Stability check and reorientation of subassemblies in assembly planning. Proceedings of the IEEE International Conference on Systems, Manufacturing and Cybernetics 2:486–491

    Google Scholar 

  • Adenso-Díaz B, Moure F, Rendueles M (2002) Automatic disassembly plans: applications to the continuous process industries case. J Manuf Syst 21(4):276–286

    Article  Google Scholar 

  • Adenso-Díaz B, González B, García S, Barba, Y (2005) A multi-start greedy heuristic for the disassembly sequence problem. In: Gupta SM (ed) Proceedings of SPIE, Environmentally Conscious Manufacturing Conference—2005 (in press)

  • Baldwin DF, Abell TE, Lui MM, De Fazio T L, Whitney DE (1991) An integrated computer aid for generating an evaluating assembly sequences for mechanical products. IEEE Trans Robot Autom 7:78–94

    Article  Google Scholar 

  • Bourjault A (1984) Contribution a une approche méthodologue de l’assemblage automatisé: elaboration automatique des séquences opératoires. Ph D dissertation, Université de Franche-Comte

  • Caccia C, Pozzetti A (1999) A genetic algorithm for disassembly strategy definition. Proceedings of 1999 SPIE Conference on Environmentally Conscious Manufacturing, pp 68–77

  • De Lit P, Latine P, Rekiek B, Delchambre A (2001) Assembly planning with an ordering genetic algorithm. Int J Prod Res 39(16):3623–3640

    Article  Google Scholar 

  • Dini G, Failli F, Lazzerini B, Marcelloni F (1999) Generation of optimized assembly sequences using genetic algorithms. CIRP Ann 44(1):11–14

    Google Scholar 

  • Erdos G, Kis T (2001) Modelling and evaluating product end-of-life options. Int J Prod Res 39(6):1203–1220

    Google Scholar 

  • Failli F, Dini G (2001) Optimization of disassembly sequences for recycling of end-of-life products by using a colony of ant-like agents. Proceedings of the 14th International Conference of Industrial and Engineering Applications of Artificial Intelligence and Expert Systems IEA/AIE, Budapest, pp 632–639

  • Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109–133

    Article  Google Scholar 

  • Festa P, Resende MGC (2002) GRASP: an annotated bibliography. In: Ribeiro CC, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 325–367 (online up-to-date version at http://www.graspheuristic.org)

  • González B, Adenso-Díaz B (2006) A scatter search approach to the optimum disassembly sequence problem. Comput Oper Res 33(6):1776–1793

    Article  Google Scholar 

  • Guide VDR, van Wassenhove LN (2002) The reverse supply chain. Harvard Bus Rev 80(2):25–26

    Google Scholar 

  • Güngör A, Gupta SM (1997) An evaluation methodology for disassembly processes. Comput Ind Eng 33(1):329–332

    Article  Google Scholar 

  • Homem de Mello LS, Sanderson AC (1991) A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans Robot Autom 7(2):228–240

    Article  Google Scholar 

  • Hoshino T, Yura K, Hitomi K (1995) Optimization analysis for recycle-oriented manufacturing systems. Int J Prod Res 33(8):2069–2078

    Google Scholar 

  • http://coruxa.epsig.uniovi.es/~adenso/file_d.html

  • Huang YM, Huang CT (2002) Disassembly matrix for disassembly processes of products. Int J Prod Res 40(2):255–273

    Article  Google Scholar 

  • Huang HH, Wang MH, Johnson MR (2000) Disassembly sequence generation using a neural network approach. J Manuf Syst 19(2):73–82

    Google Scholar 

  • Kanehara T, Suzuki T, Inaba A, Okuma S (1993) On algebraic and graph structural properties of assembly Petri net. Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp 2286–2293

  • Kang JG, Lee DH, Xirouchakis P, Personn GP (2001) Parallel disassembly sequencing with sequence-dependent operation times. CIRP Ann 50(1):343–346

    Article  Google Scholar 

  • Kuo T, Zhang HC, Huang SH (2000) Disassembly analysis for electromechanical products: a graph-based heuristic approach. Int J Prod Res 38(5):993–1007

    Article  Google Scholar 

  • Lambert AJD (1999a) Linear programming in disassembly/clustering generation. Comput Ind Eng 36:723–738

    Article  Google Scholar 

  • Lambert AJD (1999b) Optimal disassembly sequence generation for combined material recycling and part reuse. Proceedings of 1999 IEEE International Symposium on Assembly and Task Planning, Oporto (Portugal), pp 115–146

  • Lambert AJD (2003) Disassembly sequencing: a survey. Int J Prod Res 41(16):3721–3759

    Article  Google Scholar 

  • Martínez M, Pham VH, Favrel J (1997) Dynamic generation of disassembly sequences. Proceedings of the 6th IEEE International Symposium on Emerging Technologies and Factory Automation, pp 177–182

  • Murayama T, Oba F, Abe S (1994) Assembly partitioning by genetic algorithm for generating assembly sequences efficiently. Adv Intell Prod 695–700

  • O’Shea B, Kaebernick H, Grewal S, Perlewitz H, Müller K, Seliger G (1999) Method for automatic tool selection for disassembly planning process. Assem Autom 19(1):47–54

    Article  Google Scholar 

  • Park JH, Chung MJ (1993) Automatic generation of assembly sequences for multi-robot workcell. Robot Comput-Integr Manuf 10:355–363

    Article  Google Scholar 

  • Penev K, De Ron AJ (1996) Determination of a disassembly strategy. Int J Prod Res 34(2):495–506

    Google Scholar 

  • Pitsoulis LS, Resende MGC (2002). Greedy randomized adaptive search procedures. In: Pardalos PM, Resende MGC (eds) Handbook of applied optimization. Oxford University Press, Oxford, pp 168–183

  • Pu P (1992) An assembly sequence generation algorithm using case-based search techniques. Proceedings of 1992 IEEE International Conference on Robotics and Automation, pp 2425–2430

  • Resende MGC (2001) Greedy randomized adaptive search procedures (GRASP), In: Floudas C, Pardalos PM (eds) Encyclopedia of optimization, vol 2. Kluwer, Dordrecht, pp 373–382

  • Scholz-Reiter B, Scharke H, Hucht A (1999) Flexible robot-based disassembly cell for obsolete TV-sets and monitors. Robot, Comput Integr Manuf 15:247–255

    Article  Google Scholar 

  • Seo KK, Park HJ, Jang DS (2001) Optimal disassembly sequence using genetic algorithms considering economic and environmental aspects. Int J Adv Manuf Technol 18:371–380

    Article  Google Scholar 

  • Spengler TH, Püchert H, Penkuhn T, Rentz O (1997) Environmental integrated production and recycling management. Eur J Oper Res 97:308–356

    Article  Google Scholar 

  • Swaminathan A, Barber KS (1996) An experience-based assembly sequence planner for mechanical assemblies. IEEE Trans Robot Autom 12(2):252–267

    Article  Google Scholar 

  • Veerakamolmal P, Gupta SM (2002) A case-based reasoning approach for automating disassembly process planning. J Intell Manuf 13(1):47–60

    Article  Google Scholar 

Download references

Acknowledgements

This research was carried out under the support of the Spanish Ministry of Science, contract number MEC-04-SEJ2004-07877-C02-01. The authors are thankful to the referees for their constructive criticism and helpful suggestions.

Author information

Authors and Affiliations

  1. Escuela Politécnica Superior de Ingeniería, Universidad de Oviedo, Campus de Gijón, 33204, Gijón, Spain

    Belarmino Adenso-Díaz & Santiago García-Carbajal

  2. Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, Avda. Reina Mercedes, s/n, 41012, Sevilla, Spain

    Sebastián Lozano

Authors
  1. Belarmino Adenso-Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Santiago García-Carbajal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sebastián Lozano
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Belarmino Adenso-Díaz.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adenso-Díaz, B., García-Carbajal, S. & Lozano, S. An efficient GRASP algorithm for disassembly sequence planning. OR Spectrum 29, 535–549 (2007). https://doi.org/10.1007/s00291-005-0028-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-005-0028-x

Keywords