An improved origin-based algorithm for solving the combined distribution and assignment problem

Meng Xu, Anthony Chen, Ziyou Gao

Research output: Journal article publicationJournal articleAcademic researchpeer-review

13 Citations (Scopus)

Abstract

This paper is to further study the origin-based (OB) algorithm for solving the combined distribution and assignment (CDA) problem, where the trip distribution follows a gravity model and the traffic assignment is a user-equilibrium model. Recently, the OB algorithm has shown to be superior to the Frank-Wolfe (FW) algorithm for the traffic assignment (TA) problem and better than the Evans' algorithm for the CDA problem in both computational time and solution accuracy. In this paper, a modified origin-destination (OD) flow update strategy proposed by Huang and Lam [Huang, H.J., Lam, W.H.K., 1992. Modified Evans' algorithms for solving the combined trip distribution and assignment problem. Transportation Research B 26 (4), 325-337] for CDA with the Evans' algorithm is adopted to improve the OB algorithm for solving the CDA problem. Convergence proof of the improved OB algorithm is provided along with some preliminary computational results to demonstrate the effect of the modified OD flow update strategy embedded in the OB algorithm.
Original languageEnglish
Pages (from-to)354-369
Number of pages16
JournalEuropean Journal of Operational Research
Volume188
Issue number2
DOIs
Publication statusPublished - 16 Jul 2008
Externally publishedYes

Keywords

  • Combined distribution and assignment problem
  • Evans' algorithm
  • Origin-based algorithm
  • Traffic assignment
  • Trip distribution

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this