2-OPT Heuristic for the Disassembly Line Balancing Problem (original) (raw)
Related papers
Greedy algorithm for disassembly line scheduling
SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483)
Remanufacturing, recycling, and disposal recovery operations require the performance of disassembly activities. The disassembly line is the best choice for automated disassembly of returned products, however, finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large. In this paper, a greedy algorithm is presented for obtaining optimal or near-optimal solutions to the disassembly line balancing problem. The greedy algorithm is a first-fit decreasing algorithm further enhanced to preserve precedence relationships. The algorithm seeks to minimize the number of workstations while accounting for hazardous and high demand components. A hill-climbing heuristic is then developed to balance the part removal sequence. Examples are considered to illustrate the methodology. The conclusions drawn from the study include the consistent generation of optimal or near-optimal solutions, the ability to preserve precedence, the speed of the algorithm and its practicality due to the ease of implementation.
A PROMETHEE Method Based Heuristic for Disassembly Line Balancing Problem
Industrial Engineering and Management Systems, 2013
Disassembly of discarded products takes place in the process of remanufacturing, recycling, and disposal. The disassembly lines have been taken as available choice for automated disassembly; therefore, it has become essential that it be designed and balanced to work efficiently. The multi-objective disassembly line balancing problem seeks to find a disassembly sequence which provides a feasible disassembly sequence, minimizes the number of workstations and idle time, and balances the line for the disassembly of post consumed product by considering the environment effects. This paper proposes a multi-criteria decision making technique based heuristic for assigning the disassembly tasks to the workstations. In the proposed heuristic, the PROMETHEE method is used for prioritizing the tasks to be assigned. The tasks are assigned to the disassembly workstations according to their priority rank and precedence relations. The proposed heuristic is illustrated with an example, and the results show that substantial improvement in the performance is achieved compared with other heuristics.
Combinatorial optimization methods for disassembly line balancing
Environmentally Conscious Manufacturing IV, 2004
Disassembly takes place in remanufacturing, recycling, and disposal with a line being the best choice for automation. The disassembly line balancing problem seeks a sequence which: minimizes workstations, ensures similar idle times, and is feasible. Finding the optimal balance is computationally intensive due to factorial growth. Combinatorial optimization methods hold promise for providing solutions to the disassembly line balancing problem, which is proven to belong to the class of NP-complete problems. Ant colony optimization, genetic algorithm, and H-K metaheuristics are presented and compared along with a greedy/hill-climbing heuristic hybrid. A numerical study is performed to illustrate the implementation and compare performance. Conclusions drawn include the consistent generation of optimal or nearoptimal solutions, the ability to preserve precedence, the speed of the techniques, and their practicality due to ease of implementation.
A balancing method and genetic algorithm for disassembly line balancing
European Journal of Operational Research, 2007
Disassembly activities take place in various recovery operations including remanufacturing, recycling and disposal. The disassembly line is the best choice for automated disassembly of returned products. It is therefore important that the disassembly line be designed and balanced so that it works as efficiently as possible. The disassembly line balancing problem seeks a sequence which: is feasible, minimizes workstations, and ensures similar idle times, as well as other endof-life specific concerns. However finding the optimal balance is computationally intensive with exhaustive search quickly becoming prohibitively large even for relatively small products. In this paper the problem is mathematically defined and proven NP-complete. Additionally, a new formula for quantifying the level of balancing is proposed. A first-ever set of a priori instances to be used in the evaluation of any disassembly line balancing solution technique is then developed. Finally, a genetic algorithm is presented for obtaining optimal or near-optimal solutions for disassembly line balancing problems and examples are presented to illustrate implementation of the methodology.
Profit-oriented disassembly-line balancing
International Journal of Production Research, 2008
We study the profit oriented partial disassembly line balancing problem, which simultaneously determines (i) the parts whose demand is to be fulfilled to generate revenue, (ii) the tasks that will release the selected parts under task and station costs, (iii) the number of stations that will be opened, (iv) the cycle time, and (v) the balance of the disassembly line, i.e. the feasible assignment of selected disassembly tasks to stations such that various types of precedence relations among the tasks are satisfied. We characterize the precedence relation types in disassembly and provide a mixed integer programming formulation of the problem. We propose a linear programming based lower and upper bounding scheme.
Multi-Objective Optimization of Lot Size Balancing for Multi-Products Selective Disassembly
Lecture Notes in Economics and Mathematical Systems, 2001
This paper presents a mixed integer goal-programming model that provides a solution for planning component recovery from products with component commonality. The objective of the component recovery model is to determine the aggregate number of a variety of products to disassemble in order to economically fulfill the demand of a multitude of components, and yet have an environmentally benign policy of minimizing waste generation. A numerical example is presented to illustrate the methodology.
Optimal disassembly configurations for single and multiple products
Journal of Manufacturing Systems, 1999
This paper considers the problem of determining optimal disassembly configurations for single and multiple products, that is, which assemblies and subassemblies to disassemble and which to leave intact. The paper first examines the problem of determining revenue-maximizing disassembly configurations for a single product using the hierarchical product tree representation, and develops a linear time algorithm for its solution. This algorithm is then extended to the case where fixed costs may be associated with disassembly o! some nodes in the product tree. Finally, the problem of meeting a specified demand for recovered components and subassemblies from an available inventory of recovered products, where disassembly capacity is limited and products may have common components, is formulated as an opti-. mization problem. A column-generation algorithm for this problem is presented that is capable of solving reasonably sized problems in a few seconds of CPU time on average.
IIE Transactions, 2009
In this paper, the disassembly line balancing problem, which involves determining a line design in which used products are completely disassembled to obtain useable components in a cost-effective manner, is studied. Because of the growing demand for a cleaner environment, this problem has become an important issue in reverse manufacturing. In this study, two exact formulations are developed that utilize an AND/OR Graph (AOG) as the main input to ensure the feasibility of the precedence relations among the tasks. It is also shown that traditional task precedence diagrams can be derived from the AOG of a given product structure. This procedure leads to considerably better solutions of the traditional assembly line balancing problems; it may alter the approach taken by previous researchers in this area.
A method for dealing with multi-objective optimization problem of disassembly processes
Assembly and Task Planning, …, 2003
is highly manual. In this paper the authors consider the line structure and propose an algorithm which will allow to find a disassembly sequence that optimizes a very simplefirnction integrating the income from the parts, the materialproduced by theprocess and the cycle time of the disassembly line. An example is given to illustrate the proposed algorithm.
Generating a complete disassembly-to-order plan
IFAC International Workshop on Intelligent Assembly and Disassembly, 2007, 2007
We introduce techniques used to generate a complete disassembly-to-order (DTO) plan. DTO is a system where a variety of returned products are disassembled to fulfill the demand for specified numbers of components and materials. Complete DTO plan includes the optimal number of take-back products which maximize profit and minimize costs of the DTO system, the number of products to be sent through each disassembly station (non-destructive, destructive and mixed disassembly) including the type of disassembly to be performed (viz., complete or selective) and the optimal disassembly sequence of each product type to help minimize the complexities and the total disassembly time. Techniques implemented to solve the problem are Genetic Algorithm, Linear Physical Programming and refining algorithm. In this paper, we describe how these techniques can be combined to solve for a complete DTO plan. A numerical example is considered to illustrate the methodology.