Cookies

We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

School of Engineering and Computing Sciences (ECS)

Profile

Publication details for Dr Graham Coates

Image: Efficient process optimization.Whitfield, R. I., Duffy, A. H. B., Coates, G. & Hills, W. (2003). Efficient process optimization. Concurrent engineering research and applications 11(2): 83-92.

Author(s) from Durham

Abstract

A computer-based system for modelling and optimizing processes is presented. The Design Structure Matrix (DSM) process representation was used to model the processes due to its compact, generic and easily quantifiable nature. The system is capable of calculating a number of process performance metrics that are focussed towards determining the degree of iteration and concurrency within the process, however, the system is easily extendible to include other process performance measurements. The paper describes the use of a Genetic Algorithm (GA) to optimise the sequence of activities with the focus of reducing the amount of iteration by reducing the number of feedback loops and hence reducing the number of initial guesses that are needed in order to undertake highly dependent tasks. Previous investigations have attempted to define a generic structure for combinatorial optimisation using GAs [Todd, D. (1997). Multiple Criteria Genetic Algorithms in Engineering Design and Operation, Ph.D. Thesis, Engineering Design Centre, University of Newcastle upon Tyne, UK.],however this paper demonstrates that the structure of the GA is intrinsically tied to the domain. The focus of this paper was an investigation to determine the most efficient and timely structure for the GA with respect to process optimisation. Additional criteria are included within the system and it is has been demonstrated that the structure is applicable for these criteria. It is therefore assumed that if the criteria are dependent upon the matrix representation, in particular, the sequence of the activities and dependencies, then the GA structure will remain applicable. This assumption was demonstrated to be correct when the DSM and GA were used with the same GA structure to optimise component modularity using different optimisation criteria [Whitfield R.I., Smith J.S. and Duffy A.H.B. (2002). Identifying Component Modules, Seventh International Conference on Artificial Intelligence in Design AID'02, Cambridge, UK,15-17 July 2002.]. The results indicated that the independent position based crossover and shift mutation operators with 60 and 20% probabilities respectively was the most successful structure for the GA. A relationship between the number of activities and the number of evaluations was determined and may be used to eliminate unnecessary computation in future investigations.

References

1. Austin, S.A., Baldwin, A.N., Hassan, T. and Newton, A.J. (1989). Techniques for the Management of Information Flow in Building Design, Information Technology in Civil and Structural Engineering Design ITCSED96, pp. 119-124, Glasgow, UK .
3. Coates, G., Duffy, A.H.B., Hills, W. and Whitfield, R.I. (2000). A Generic Coordination Approach Applied to a Manufacturing Environment , Journal of Materials Processing Technology, 107: 404-411 .[CrossRef][ISI]
4. Davis, L. (1985). Job Shop Scheduling and Genetic Algorithms , In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 136-140 , Lawrence Erlbaum Associates, Hillsdale, NJ, USA.
5. Eppinger, S.D., Whitney, D.E., Smith, R.P. and Gebala, D.A. (1994). A Model-Based Method for Organizing Tasks in Product Development , Research in Engineering Design, 6: 1-13 .[ISI]
6. Glover, F. and Laguna, M. (1993). Tabu Search, In: Reeves, C.R. (ed.), Modern Heuristic Techniques for Combinatorial Problems, pp. 70-150, Blackwell Scientific Publications, Oxford, UK .
7. Gebala, D.A. and Eppinger, S.D. (1991). Methods for Analysing Design Procedures, ASME Transactions , Design Theory and Methodology, 31: 227-233 .
8. Goldberg, D.E. and Lingle, R. (1985). Alleles, Loci and the Travelling Salesman Problem , In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154-159 , Lawrence Erlbaum Associates, Hillsdale, NJ, USA.
9. Goldberg, D.E. (1989). Sizing Populations for Serial and Parallel Genetic Algorithms , In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 70-79 , Morgan Kaufmann Publishers, CA, USA.
10. Goldberg, D.E. (1989). Genetic Algorithms in Search, Optimisation and Machine Learning, Addison-Wesley, Massachusetts, USA .
11. Greffenstette, J.J., Gopal, R., Rosmaita, B. and VanGucht, D. (1985). Genetic Algorithms for the Travelling Salesman Problem , In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 160-168 , Lawrence Erlbaum Associates, Hillsdale, NJ, USA.
12. Haffey, M.K.D. and Duffy, A.H.B. (2001). Process Performance Measurement Support: A Critical Analysis , International Conference on Engineering Design, ICED01 Glasgow, UK.
13. Holland, J.H. (1962). Outline for a Logical Theory of Adaptive Systems , Joint Association of Computing Machinery, 9: 297-314 .
14. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983). Optimisation by Simulated Annealing , Science, 220(4598): 671-680 .[ISI]
15. Kusiak, A. and Park, K. (1990). Concurrent Engineering: Decomposition and Scheduling of Design Activities , International Journal of Production Research, 28(10): 1883-1900 .[ISI]
16. Kusiak, A. and Wang, J. (1991). Concurrent Engineering: Simplification of the Design Process, In: Doumeingts, G., Browne, J. and Tomljanovich, M. M. (eds.), Computer Applications in Production and Engineering: Integration Aspects, Elsevier Science Publishers, Netherlands .
17. Malmström, J., Pikosz, P. and Malmqvist, J. (1998). The Complementary Roles of IDEF0 and DSM for the Modelling on Information Management Processes , In: Proceedings of the Fifth ISPE International Conference on Concurrent Engineering: Research and Applications, pp. 261-270 , Tokyo, Japan.
18. Murata, T. and Ishibuchi, H. (1994). Performance Evaluation of Genetic Algorithms for Flow Shop Scheduling Problems , In: Proceedings of the First IEEE Conference on Evolutionary Computation, 2: 812-817 .
19. Oliver, I.M., Smith, C.J. and Holland, J.R.C. (1987). A Study of Permutation Crossovers on the Travelling Salesman Problem , In: Proceedings of the Second International Conference on Genetic Algorithms and their Applications, pp. 225-230 .
21. Park, H. and Cutkosky, M.R. (1999). Framework for Modelling Dependencies in Collaborative Engineering Processes , Research in Engineering Design, 11: 84-102 .[ISI]
22. Pongcharoen, P., Hicks, C. and Braiden, P.M. (1999). The Development of Bi-Criteria Genetic Algorithms for the Finite Capacity Scheduling of Complex Products, with Multiple Levels of Product Structure , European Journal of Operational Research.
23. Prasad, B. (1996). Concurrent Engineering Fundamentals, Integrated Product and Process Organization, Vol. 1, Prentice Hall, USA .
24. Ross, D.T. (1977). Structured Analysis (SA): A Language for Communicating Ideas , IEEE Trans. Software Engineering, 3(1): 16-34 .[ISI]
25. Scott, J.A. (1998). A Strategy for Modelling the Design-Development Phase of a Product, Ph.D. Thesis, Department of Marine Technology, University of Newcastle upon Tyne, UK.
26. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D. and Whitley, C. (1991). A Comparison of Genetic Sequencing Operators , In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 69-76 , San Mateo, CA, USA.
27. Steward, D.V. (1981). The Design Structure System: A Method for Managing the Design of Complex Systems , IEEE Trans. Engineering Management, 28: 71-74 .[ISI]
28. Steward, D.V. (1981). Systems Analysis and Management - Structure Strategy and Design, Petrocelli Books Inc., USA .
29. Steward, D.V. (1991). Planning and Managing the Design of Systems , In: Proceedings of Portland International Conference on Management of Engineering and Technology, pp. 189-193 , Portland, Oregon, USA.
30. Stewardson, D.J., Whitfield, R.I., Hicks, C., Pongcharoen, P. and Braiden, P.M. (2001). Sparse Experimental Design: An Effective and Efficient Way of Discovering Better Genetic Algorithm Structures , 2nd European Conference on Intelligent Management Systems in Operations, Salford, UK.
31. Syswerda, G.(1991). Scheduling Optimisation Using Genetic Algorithms, In: Davis, L. (ed.), Handbook of Genetic Algorithms, pp. 332-349, Van Nostrand Reinhold .
32. Todd, D. (1997). Multiple Criteria Genetic Algorithms in Engineering Design and Operation, Ph.D. Thesis, Engineering Design Centre, University of Newcastle upon Tyne, UK.
34. Weist, J.D. and Levy, F.K. (1977). A Management Guide to PERT/CPM, Prentice-Hall, Englewood Cliffs, NJ, USA .
35. Whitfield, R.I. (2001). Effective Combinatorial Optimisation, CAD Centre Internal Report, CADC/01-06/R/03, DMEM, University of Strathclyde, Glasgow, UK .
36. Whitfield R.I., Smith J.S. and Duffy A.H.B. (2002). Identifying Component Modules , Seventh International Conference on Artificial Intelligence in Design AID'02, Cambridge, UK, 15-17 July 2002.
37. Whitley, D., Starkweather, T. and Fuquay, D. (1989). Scheduling Problems and the Travelling Salesman: The Genetic Edge Recombination Operator , In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 133-140 . Morgan Kaufmann Publishers, CA, USA.

Notes

Copyright © 2000-2006 SAGE Publications.