불확실성 하에서 최대후회 최소화 분해 계획
Minmax Regret Approach to Disassembly Sequence Planningwith Interval Data
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde’s heuristic algorithm.
Abstract
Disassembly of products at their end-of-life (EOL) is a prerequisite for recycling or remanufacturing, since most products should be disassembled before being recycled or remanufactured as secondary parts or materials. In disassembly sequence planning of EOL products, considered are the uncertainty issues, i.e., defective parts or joints in an incoming product, disassembly damage, and imprecise net profits and costs. The paper deals with the problem of determining the disassembly level and corresponding sequence, with the objective of maximizing the overall profit under uncertainties in disassembly cost and/or revenue. The solution is represented as the longest path on a directed acyclic graph where parameter (arc length) uncertainties are modeled in the form of intervals. And, a heuristic algorithm is developed to find a path with the minimum worst case regret, since the problem is NP-hard. Computational experiments are carried out to show the performance of the proposed algorithm compared with the mixed integer programming model and Conde’s heuristic algorithm.
참고문헌 (34)
- 유호현, "일본 사례를 통해 본 도시광산의 미래", LG Business Insight, 통권 : 1038, pp.48~54 (2009), LG경제연구원
- Aissi, H., "Min-max and min-max regret versions of combinatorial optimization problems：A survey", European Journal of Operational Research, 197(2), pp.427~438 (2009)
- Assavapokee, T., "Min-Max Regret Robust Optimization Approach on Interval Data Uncertainty", Journal of Optimization Theory and Applications, 137(2), pp.297~316 (2008)
- Averbakh, I., "Interval data minmax regret network optimization problems", Discrete Applied Mathematics, 138, pp.289~301 (2004)
- Averbakh, I., "On the complexity of minmax regret linear programming", European Journal of Operational Research, 160(1), pp.227~231 (2005)
- Bourjault, A., "Contribution à une approche méthodologique de l'assemblage automatisé：elaboration automatique des séquences opératoires", 박사, pp.1984
- Chanas, S., "The computational complexity of the criticality problems in a network with interval activity times", European Journal Of Operational Research, 136(3), pp.541~550 (2002)
- Chanas, s., "On the hardness of evaluating criticality of activities in a planar network with duration intervals", Operations Research Letters, 31(1), pp.53~59 (2003)
- Chevron, D., "Disassembling Process Modelling and Operations Planning under Imprecise Operation Time", 13th IFAC World Congress, pp.367~372 (1996)
- Conde, E., "A minmax regret approach to the critical path method with task interval times", European Journal of Operational Research, 197(1), pp.235~242 (2009)
- Eppstein, D., "Finding the k shortest paths", SIAM Journal on Computing, 28(2), pp.652~673 (1998)
- Erdös, G., "Disassembly sequence planning for products with defective parts in product recovery", International Journal of Production Research, 39, pp.1203~1220 (2001)
- Homem De Mello, L. S., "A Correct and Compete Algorithm for the generation of Mechanical Assembly sequences", IEEE Transactions on Robotics and Automation, 7, pp.228~240 (1991)
- Inuiguchi, M., "Minimax Regret Solution To Linear-Programming Problems with An Interval Objective Function", European Journal Of Operational Research, 86(3), pp.526~536 (1995)
- Johnson, M. R., "Economical evaluation of disassembly operations for recycling, remanufacturing and reuse", International Journal of Production Research, 36(12), pp.3227~3252 (1998)
- 강준규, "작업시간이 순서 의존적인 경우 조립상태를 나타내는 유방향그래프를 이용한 최적 제품 분해순서 결정", 대한산업공학회지, 28(3), pp.264~273 (2002), 대한산업공학회
- Kang, J.-G., "Disassembly Sequencing with Imprecise Data：a Case Study", International Journal of Industrial Engineering-Theory, Applications and Practice, 10(4), pp.407~412 (2003)
- Kang, J.-G., "Robust Disassembly Sequencing with Interval Data", Proceedings of 6th Global Conference on Sustainable Product Development and Life Cycle Engineering, pp.109~113 (2008)
- 강준규, "불확실성 하의 최장경로문제에서 최대후회 최소화 경로 탐색 알고리듬", 한국경영공학회지, 14(3), pp.169~182 (2009), 한국경영공학회
- Kang, J.-G., "Disassembly sequencing for maintenance：a survey", Proceedings of the Institution of Mechanical Engineers, Part B：Journal of Engineering Manufacture, 통권 : 220, pp.1697~1716 (2006)
- "The Robust shortest Path Problem with Interval Data"[URL]
- 김현수, "국내 폐가전제품의 회수 및 재활용을 위한 RFID 기반 통합관리시스템 설계", 산업경영시스템학회지, 32(2), pp.120~131 (2009), 한국산업경영시스템학회
- Lambert, A. J. D., "Optimal disassembly Sequence generation for combined material recycling and part reuse", Proceedings of IEEE International Symposium on Assembly and Task Planning, pp.146~151 (1999)
- 임성묵, "퍼지 선형계획법 해법 및 퍼지 DEA에의 적용에 관한 연구", 산업경영시스템학회지, 31(2), pp.51~60 (2008), 한국산업경영시스템학회
- Montemanni, R., "An Exact Algorithm for the Robust Shortest Path Problem with Interval Data", Computers and Operations Research, 31(10), pp.1667~1680 (2004)
- Montemanni, R., "A branch and bound algorithm for the robust Shortest path problem with interval data", Operations Research Letters, 32(3), pp.225~232 (2004)
- Montemanni, R., "The robust Shortest path problem with interval data via Benders decomposition", 4OR, 3(4), pp.315~328 (2005)
- 박홍석, "폐자동차 부품의 최적 분리순서 생성을 위한 방법론", 한국정밀공학회지, 20(9), pp.188~196 (2003), 한국정밀공학회
- Seo, K. K., "Optimal disassembly Sequence using genetic algorithms considering economic and environmental aspects", International Journal of Advanced Manufacturing Technology, 18(5), pp.371~380 (2001)
- Tang, O., "Economic evaluation of disassembly processes in remanufacturing Systems", International Journal of Production Research, 42(17), pp.3603~3617 (2004)
- Tripathi, M., "Real world disassembly modeling and Sequencing problem：Optimization by Algorithm of Self-Guided Ants (AsGA)", Robotics and Computer-Integrated Manufacturing, 25(3), pp.483~496 (2009)
- Zieliński, P., "The computational complexity of the relative robust Shortest path problem with interval data", European Journal of Operational Research, 158(3), pp.570~576 (2004)