Combining cost-based and rule-based knowledge in complex resource allocation problems

被引:13
作者
Marar, A [1 ]
Powell, WB
Kulkarni, S
机构
[1] Princeton Univ, Dept Operat Res & Financial Engn, Princeton, NJ 08544 USA
[2] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
D O I
10.1080/07408170500333384
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
A major challenge in the formulation of optimization models for large-scale, complex operational problems is that some data are impossible or uneconomical to collect, producing a cost model that suffers from incomplete information. As a result, even an optimal solution may be "wrong" in the sense that it is solving the wrong problem. In many operational settings, knowledgeable experts will already know. at least approximately, how a model should behave, and can express this knowledge in the form of low dimensional patterns: "high powered locomotives should pull intermodal trains" (because they need to move quickly) or "loaded C-141s should not be flown into Saudi Arabia" (for maintenance reasons). Unlike the literature on inverse optimization which uses observed actions to train the parameters of a cost model, we used exogenous patterns to guide the behavior of a model using a proximal point term that penalizes deviations from these patterns. Under the assumption that the patterns are derived from rational behaviors, we establish the conditions under which incorporating patterns will reduce actual costs rather than just the engineered costs. The effectiveness of the approach is demonstrated in a controlled, laboratory setting using data from a major railroad.
引用
收藏
页码:159 / 172
页数:14
相关论文
共 11 条
[1]   Inverse optimization [J].
Ahuja, RK ;
Orlin, JB .
OPERATIONS RESEARCH, 2001, 49 (05) :771-783
[2]  
BERTSEKAS DP, 1995, NONLINEAR PROGRAMMIN
[3]  
Burton D, 1997, LECT NOTES ECON MATH, V450, P156
[4]  
Fourer R, 1993, AMPL MODELING LANGUA
[5]   An information model based on classification theory [J].
Parsons, J .
MANAGEMENT SCIENCE, 1996, 42 (10) :1437-1453
[6]   MONOTONE OPERATORS AND PROXIMAL POINT ALGORITHM [J].
ROCKAFELLAR, RT .
SIAM JOURNAL ON CONTROL, 1976, 14 (05) :877-898
[7]  
Rudin W., PRINCIPLES MATH ANAL
[8]   A LINEARIZATION METHOD FOR NONSMOOTH STOCHASTIC-PROGRAMMING PROBLEMS [J].
RUSZCZYNSKI, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (01) :32-49
[9]   Solving inverse spanning tree problems through network flow techniques [J].
Sokkalingam, PT ;
Ahuja, RK ;
Orlin, JB .
OPERATIONS RESEARCH, 1999, 47 (02) :291-298
[10]   LOQO: An interior point code for quadratic programming [J].
Vanderbei, RJ .
OPTIMIZATION METHODS & SOFTWARE, 1999, 11-2 (1-4) :451-484