Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem

被引:64
作者
Chow, Joseph Y. J. [1 ]
Recker, Will W. [1 ]
机构
[1] Univ Calif Irvine, Inst Transportat Studies, Irvine, CA 92697 USA
关键词
Inverse optimization; Activity based; Mixed integer linear programming; Pickup and delivery problem; Goal programming; Common prior; MODEL; ALLOCATION; FORMULATION;
D O I
10.1016/j.trb.2011.11.005
中图分类号
F [经济];
学科分类号
02 ;
摘要
A parameter estimation method is proposed for calibrating the household activity pattern problem so that it can be used as a disaggregate, activity-based analog of the traffic assignment problem for activity-based travel forecasting. Inverse optimization is proposed for estimating parameters of the household activity pattern problem such that the observed behavior is optimal, the patterns can be replicated, and the distribution of the parameters is consistent. In order to fit the model to both the sequencing of activities and the arrival times to those activities, an inverse problem is formulated as a mixed integer linear programming problem such that coefficients of the objectives are jointly estimated along with the goal arrival times to the activities. The formulation is designed to be structurally similar to the equivalent problems defined by Ahuja and Orlin and can be solved exactly with a cutting plane algorithm. The concept of a unique invariant common prior is used to regularize the estimation method, and proven to converge using the Method of Successive Averages. The inverse model is tested on sample households from the 2001 California Household Travel Survey and results indicate a significant improvement over the standard inverse problem in the literature as well as baseline prescriptive models that do not make use of sample data for calibration. Although, not unexpectedly, the estimated optimization model by itself is a relatively poor forecasting model, it may be used in determining responses of a population to spatio-temporal scenarios where revealed preference data is absent. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:463 / 479
页数:17
相关论文
共 39 条
[1]   Inverse optimization [J].
Ahuja, RK ;
Orlin, JB .
OPERATIONS RESEARCH, 2001, 49 (05) :771-783
[2]  
Arentze T.A., 2008, TRANSPORTATION RES B, V43, P251
[3]   Solving a non-convex combined travel forecasting model by the method of successive averages with constant step sizes [J].
Bar-Gera, H ;
Boyce, D .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2006, 40 (05) :351-367
[4]   A THEORY OF THE ALLOCATION OF TIME [J].
BECKER, GS .
ECONOMIC JOURNAL, 1965, 75 (299) :493-517
[5]   The multiple discrete-continuous extreme value (MDCEV) model: Role of utility function parameters, identification considerations, and model extensions [J].
Bhat, Chandra R. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2008, 42 (03) :274-303
[6]   Comprehensive econometric microsimulator for daily activity-travel patterns [J].
Bhat, CR ;
Guo, JY ;
Srinivasan, S ;
Sivakumar, A .
TRAVEL BEHAVIOR AND VALUES 2004, 2004, (1894) :57-66
[7]   A multiple discrete-continuous extreme value model: formulation and application to discretionary time-use decisions [J].
Bhat, CR .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2005, 39 (08) :679-707
[8]   ON AN INSTANCE OF THE INVERSE SHORTEST PATHS PROBLEM [J].
BURTON, D ;
TOINT, PL .
MATHEMATICAL PROGRAMMING, 1992, 53 (01) :45-61
[9]   A goal programming approach to vehicle routing problems with soft time windows [J].
Calvete, Herminia I. ;
Gale, Carmen ;
Oliveros, Maria-Jose ;
Sanchez-Valverde, Belen .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 177 (03) :1720-1733
[10]  
Chow J.Y.J., 2012, P 91 ANN M TRANSP RE