Complementarity Formulation and Solution Algorithm for Auto-Transit Assignment Problem. Issue 4 (April 2019)

• Record Type: Journal Article
• Authors: Zarrinmehr, Amirali; Aashtiani, Hedayat Z.; Nie, Yu (Marco); Azizian, Hossein
• Is Part Of: Transportation research record. Volume 2673:Issue 4(2019)
• Page Start: 384
• Page End: 397
• Publication Date: 2019-04
• Subjects: Transportation -- Periodicals; Roads; Transport -- Périodiques; Routes -- Périodiques; Routes -- Conception et construction -- Périodiques; Roads; Transportation; 388.05
• DOI: 10.1177/0361198119837956
• Languages: English
• ISSNs: 0361-1981

Abstract

In this paper, a combined model of auto-transit assignment is introduced based on two complementarity formulations in the literature. The model accounts for interactions between the auto and transit modes through non-separable asymmetric demand and cost functions. A path-based solution algorithm is presented based on the three ideas of decomposition, column generation, and linearization, which have proved to be effective in tackling large-size networks. Numerical results over the Chicago sketch network suggest that the algorithm converges quickly within the first iterations, but is less effective as the solution gets closer to the neighborhood of the equilibrium solution. The sluggish convergence behavior is attributed to the difficulty of searching the space of strategy-based transit assignment model.