Tabu search when noise is present: An illustration in the context of cause and effect analysis

被引:11
作者
Costa, D [1 ]
Silver, EA
机构
[1] Univ Neuchatel, Grp Stat, CH-2002 Neuchatel, Switzerland
[2] Univ Calgary, Fac Management, Calgary, AB T2N 1N4, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
cause and effect analysis; sampling; statistical tests; stochastic combinatorial optimization; tabu search;
D O I
10.1023/A:1009636520440
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the field of combinatorial optimization, it may be possible to more accurately represent reality through stochastic models rather than deterministic ones. When randomness is present in a problem, algorithm designers face new difficulties which complicate their task significantly. Finding a proper mathematical formulation and a fast evaluation of the objective function are two major issues. In this paper we propose a new tabu search algorithm based on sampling and statistical tests. The algorithm is shown to perform well in a stochastic environment where the quality of feasible solutions cannot be computed easily. This new search principle is illustrated in the field of cause and effect analysis where the true cause of an undesirable effect needs to be eliminated. A set of n potential causes is identified and each of them is assumed to be the true cause with a given probability. The time to investigate a cause is a random variable with a known probability distribution. Associated with each cause is the reward obtained if the cause is really the true cause. The decision problem is to sequence the n potential causes so as to maximize the expected reward realized before a specified time horizon.
引用
收藏
页码:5 / 23
页数:19
相关论文
共 29 条
[1]   A method for discrete stochastic optimization [J].
Andradottir, S .
MANAGEMENT SCIENCE, 1995, 41 (12) :1946-1961
[2]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[3]   Nelder-Mead simplex modifications for simulation optimization [J].
Barton, RR ;
Ivey, JS .
MANAGEMENT SCIENCE, 1996, 42 (07) :954-973
[4]   Probabilistic combinatorial optimization problems on graphs: A new domain ia operational research [J].
Bellalouna, M ;
Murat, C ;
Paschos, VT .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 87 (03) :693-706
[5]   THE VEHICLE SCHEDULING PROBLEM WITH INTERMITTENT CUSTOMER DEMANDS [J].
BENTON, WC ;
ROSSETTI, MD .
COMPUTERS & OPERATIONS RESEARCH, 1992, 19 (06) :521-531
[6]   A new generation of vehicle routing research: Robust algorithms, addressing uncertainty [J].
Bertsimas, DJ ;
SimchiLevi, D .
OPERATIONS RESEARCH, 1996, 44 (02) :286-304
[7]  
CHUN YH, 1995, J OPER RES SOC, V46, P1133
[8]   A tabu search heuristic for the vehicle routing problem with stochastic demands and customers [J].
Gendreau, M ;
Laporte, G ;
Seguin, R .
OPERATIONS RESEARCH, 1996, 44 (03) :469-477
[9]   AN EXACT ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH STOCHASTIC DEMANDS AND CUSTOMERS [J].
GENDREAU, M ;
LAPORTE, G ;
SEGUIN, R .
TRANSPORTATION SCIENCE, 1995, 29 (02) :143-155
[10]  
GIBBONS JD, 1985, STAT TXB MONOGRAPHS, V85