Simultaneous estimation of the origin-destination matrices and the parameters of a nested logit model in a combined network equilibrium model
This paper deals with the inverse problem of a type of traffic equilibrium models with combined modes. This problem consists of obtaining a parametrization of the equilibrium model from a set of observations of the outputs for the model. The inputs for the model are an origin-destination (O-D) trip matrix for the various alternatives that have been considered, and a set of parameters for a nested logit model used as a demand model. This model has been formulated by using a new approach called the calibration and demand adjustment model (CDAM) based on bilevel programming which simultaneously estimates an O-D matrix and the parameters for the nested logit model. In this paper, the CDAM properties are studied and it is proved the CDAM solution exists. This paper develops a heuristic column (paths/hyperpaths) generation algorithm for the CDAM. This algorithm iterates between the network equilibrium problem and that which is used to obtain a set of paths when equilibrium is attained, and the CDAM is restricted to the set of previously generated columns (the so-called restricted CDAM). The restricted CDAM is formulated as a single level model under certain hypotheses and it furnishes a solution upon which to base a new estimation of the O-D matrix and the vector of parameters. The computational tests on the algorithm have been carried out using data from a multi-modal network in Madrid.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Codina, Esteve & Garcia, Ricardo & Marin, Angel, 2006. "New algorithmic alternatives for the O-D matrix adjustment problem on traffic networks," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1484-1500, December.
- D E Boyce, 1986. "Integration of Supply and Demand Models in Transportation and Location: Problem Formulations and Research Questions," Environment and Planning A, , vol. 18(4), pages 485-489, April.
- Cascetta, Ennio & Nguyen, Sang, 1988. "A unified framework for estimating or updating origin/destination matrices from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 22(6), pages 437-455, December.
- Yang, Hai, 1995. "Heuristic algorithms for the bilevel origin-destination matrix estimation problem," Transportation Research Part B: Methodological, Elsevier, vol. 29(4), pages 231-242, August.
- D E Boyce, 1986. "Integration of supply and demand models in transportation and location: problem formulations and research questions," Environment and Planning A, Pion Ltd, London, vol. 18(4), pages 485-489, April.
- Shihsien, Liu & Fricker, Jon D., 1996. "Estimation of a trip table and the [Theta] parameter in a stochastic network," Transportation Research Part A: Policy and Practice, Elsevier, vol. 30(4), pages 287-305, July.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:197:y:2009:i:1:p:320-331. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.