A manufacturing problem solving environment combining evaluation, search, and generalisation methods

被引:9
作者
Caskey, KR [1 ]
机构
[1] Tech Univ Eindhoven, Fac Technol Management, NL-5600 MB Eindhoven, Netherlands
关键词
simulation; genetic algorithms; neural networks; scheduling; manufacturing; search; generalisation;
D O I
10.1016/S0166-3615(00)00072-5
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper develops a general environment for suggesting good operating strategies for specific factory conditions at the time the strategies are needed. The characteristics of the problems addressed do not allow analysis of the alternatives at the time the suggestions are needed. This requires the analysis to be done beforehand. However, by performing the analysis before the suggestions are needed, the future factory condition is unknown. With a large number of possible factory conditions, it is not possible to analyse all the possible states beforehand. We develop an environment that characterises this problem in terms of search, evaluation, and generalisation. This environment is characterised by several components working together. To aid understanding of the tasks of each component, we characterise their actions in terms of vectors and spaces. To demonstrate the operation of this environment we choose specific search and generalisation techniques and apply the environment to a specific factory problem. We will discuss the choice of these methods and how they work together, the results of a specific application, and a discussion of further extensions. The methods used in the test problem are: discrete event simulation, genetic algorithm (GA) search, and neural network generalisation. We will also point out where recent work by others has addressed segments of the problem presented and where these efforts fit in the proposed structure, and how current methods of knowledge extraction and data mining relate to this model. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:175 / 187
页数:13
相关论文
共 22 条
[1]  
[Anonymous], 1989, GENETIC ALGORITHM SE
[2]   Simulation optimization with qualitative variables and structural model changes: A genetic algorithm approach [J].
Azadivar, F ;
Tompkins, G .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 113 (01) :169-182
[3]   Mining business databases [J].
Brachman, RJ ;
Khabaza, T ;
Kloesgen, W ;
PiatetskyShapiro, G ;
Simoudis, E .
COMMUNICATIONS OF THE ACM, 1996, 39 (11) :42-48
[4]   Heterogeneous dispatching rules in job and flow shops [J].
Caskey, K ;
Storch, RL .
PRODUCTION PLANNING & CONTROL, 1996, 7 (04) :351-361
[5]  
CASKEY KR, 1993, THESIS U WASHINGTON
[6]  
CHAPMAN BL, 1986, HTESIS U TEXAS AUSTI
[7]  
Davis L., 1987, GENETIC ALGORITHMS S
[8]   NEW APPROACHES FOR HEURISTIC-SEARCH - A BILATERAL LINKAGE WITH ARTIFICIAL-INTELLIGENCE [J].
GLOVER, F ;
GREENBERG, HJ .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 39 (02) :119-130
[9]   TABU SEARCH - A TUTORIAL [J].
GLOVER, F .
INTERFACES, 1990, 20 (04) :74-94
[10]   A BRANCH-BOUND SOLUTION TO GENERAL SCHEDULING PROBLEM [J].
GREENBERG, HH .
OPERATIONS RESEARCH, 1968, 16 (02) :353-+