nach oben

OR Spectrum

Erschienen in:

01.07.2007 | Regular Article

An efficient GRASP algorithm for disassembly sequence planning

verfasst von: Belarmino Adenso-Díaz, Santiago García-Carbajal, Sebastián Lozano

Erschienen in: OR Spectrum | Ausgabe 3/2007

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel Two very large-scale neighborhoods for single machine scheduling

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

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

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–286CrossRef

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–94CrossRef

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–3640CrossRef

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

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

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–133CrossRef

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–1793CrossRef

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

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

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–240CrossRef

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

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–273CrossRef

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

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–346CrossRef

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

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

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–3759CrossRef

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–54CrossRef

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

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

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–255CrossRef

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–380CrossRef

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

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

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

Titel: An efficient GRASP algorithm for disassembly sequence planning
verfasst von: Belarmino Adenso-Díaz
Santiago García-Carbajal
Sebastián Lozano
Publikationsdatum: 01.07.2007
Verlag: Springer-Verlag
Erschienen in: OR Spectrum / Ausgabe 3/2007
Print ISSN: 0171-6468
Elektronische ISSN: 1436-6304
DOI: https://doi.org/10.1007/s00291-005-0028-x

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Springer Professional "Wirtschaft+Technik"

Weitere Artikel der Ausgabe 3/2007

Two very large-scale neighborhoods for single machine scheduling

Performance evaluation of photolithography cluster tools

Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems

Cyclic hoist scheduling in large real-life electroplating lines

A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups

Heavy traffic analysis of a single vehicle loop in an automated storage and retrieval system