An efficient method to compute traffic assignment problems with elastic demands

Author	dc.contributor.author	Babonneau, F.
Author	dc.contributor.author	Vial, J.-P.	es_CL
Admission date	dc.date.accessioned	2010-01-07T13:23:52Z
Available date	dc.date.available	2010-01-07T13:23:52Z
Publication date	dc.date.issued	2008-05
Cita de ítem	dc.identifier.citation	TRANSPORTATION SCIENCE Volume: 42 Issue: 2 Pages: 249-260 Published: MAY 2008	en_US
Identifier	dc.identifier.issn	0041-1655
Identifier	dc.identifier.other	10.1287/trsc.1070.0208
Identifier	dc.identifier.uri	https://repositorio.uchile.cl/handle/2250/125053
Abstract	dc.description.abstract	The traffic assignment problem (TAP) with elastic demands can be formulated as an optimization problem, the objective of which is the sum of a congestion function and a disutility function. We propose to use a variant of the analytic center cutting plane method to solve this problem. We test the method on TAP instances with the Bureau of Public Roads congestion function and different demand functions (constant elasticity and linear). The results of the numerical experiments show that it is possible to solve large instances with high accuracy.	en_US
Lenguage	dc.language.iso	en	en_US
Publisher	dc.publisher	INFORMS	en_US
Keywords	dc.subject	MULTICOMMODITY FLOW PROBLEMS	en_US
Título	dc.title	An efficient method to compute traffic assignment problems with elastic demands	en_US
Document type	dc.type	Artículo de revista