convex combination illustration

Convex combination - Initialization OD pair t2 O1 t1 O2 O1-D O2-D O1-D path 1 path 2 O2-D D t3 Path 3 t4 Demand 10000 10000 Link 1 LinK 2 Link 3

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Initialization OD pair Flow Time O1-D path 1 0 30.0 path 2 10000 48622.5 O2-D Path 3 10000 48622.5 Demand O1-D 10000 CapacityFreeflow tim Flow Time O2-D 10000 Link 1 1800 20 10000 2877.8 LinK 2 1500 30 0 30.0 Link 3 1800 20 20000 45744.7 Link 4 1800 20 10000 2877.8 ALL-OR-NOTHING ASSIGNMENT Current iteration Last iteration OD pair OD pair Flow Time Time O1-D path 1 10000 O1-D path 1 4878.3 path 2 0 path 2 4878.3 O2-D Path 3 10000 O2-D Path 3 7735.0 Capacity Freeflow time Flow Time CapacityFreeflow tim Flow Time Link 1 1800 20 0 20.0 Link 1 1800 20 1406 21.1 LinK 2 1500 30 10000 8918.9 LinK 2 1500 30 8593.808 4878.3 Link 3 1800 20 10000 2877.8 Link 3 1800 20 11406.19 4857.2 Link 4 1800 20 10000 2877.8 Link 4 1800 20 10000 2877.8 Line Search (alpha) Procedure: Alpha 0.000 1. assign AON in the initialization box Objective Fun 25797855.2 2. based on the path times in the initialization box, assign AON in the current iteration box 3. copy the link flows (values only) from the initialization box into the last iteration box
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/24/2011 for the course CIVL 561 taught by Professor Hklo during the Fall '10 term at HKUST.

Ask a homework question - tutors are online