Origin-based Network Assignment

Hillel Bar-Gera; David Boyce

doi:10.1007/0-306-48220-7_1

Origin-based Network Assignment

Hillel Bar-Gera
, David Boyce

Department of Industrial Engineering and Management

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

Most solution methods for the traffic assignment problem can be categorized as either link-based or route-based. Only a few attempts have followed the intermediate, origin-base dapproach. This paper describes the main concepts of a new, origin-based method for the static user equilibrium traffic assignment problem. Computational efficiency in time and memory makes this method suitable for large-scale networks of practical interest. Experimental results show that the new method is especially efficient in finding highly accurate solutions.

Original language	English
Title of host publication	Transportation Planning
Subtitle of host publication	State of the Art
Editors	Michael Patriksson, Martine Labbé
Publisher	Springer New York
Pages	1-17
Number of pages	17
ISBN (Electronic)	9780306482205
ISBN (Print)	9781402005466
DOIs	https://doi.org/10.1007/0-306-48220-7_1
State	Published - 2002

Access to Document

10.1007/0-306-48220-7_1

Cite this

@inbook{2486f4e6aaf64e6a99b6c1d9ad21b815,

title = "Origin-based Network Assignment",

abstract = "Most solution methods for the traffic assignment problem can be categorized as either link-based or route-based. Only a few attempts have followed the intermediate, origin-base dapproach. This paper describes the main concepts of a new, origin-based method for the static user equilibrium traffic assignment problem. Computational efficiency in time and memory makes this method suitable for large-scale networks of practical interest. Experimental results show that the new method is especially efficient in finding highly accurate solutions.",

author = "Hillel Bar-Gera and David Boyce",

year = "2002",

doi = "10.1007/0-306-48220-7\_1",

language = "English",

isbn = "9781402005466",

pages = "1--17",

editor = "Michael Patriksson and Martine Labb{\'e}",

booktitle = "Transportation Planning",

publisher = "Springer New York",

address = "United States",

}

TY - CHAP

T1 - Origin-based Network Assignment

AU - Bar-Gera, Hillel

AU - Boyce, David

PY - 2002

Y1 - 2002

N2 - Most solution methods for the traffic assignment problem can be categorized as either link-based or route-based. Only a few attempts have followed the intermediate, origin-base dapproach. This paper describes the main concepts of a new, origin-based method for the static user equilibrium traffic assignment problem. Computational efficiency in time and memory makes this method suitable for large-scale networks of practical interest. Experimental results show that the new method is especially efficient in finding highly accurate solutions.

AB - Most solution methods for the traffic assignment problem can be categorized as either link-based or route-based. Only a few attempts have followed the intermediate, origin-base dapproach. This paper describes the main concepts of a new, origin-based method for the static user equilibrium traffic assignment problem. Computational efficiency in time and memory makes this method suitable for large-scale networks of practical interest. Experimental results show that the new method is especially efficient in finding highly accurate solutions.

U2 - 10.1007/0-306-48220-7_1

DO - 10.1007/0-306-48220-7_1

M3 - Chapter

SN - 9781402005466

SP - 1

EP - 17

BT - Transportation Planning

A2 - Patriksson, Michael

A2 - Labbé, Martine

PB - Springer New York

ER -

Origin-based Network Assignment

Abstract

Access to Document

Fingerprint

Cite this