23
Universität Stuttgart Institut für Straßen- und Verkehrswesen Lehrstuhl für Verkehrsplanung und Verkehrsleittech M.Sc Yaohua Xiong IDS 2012 2012.12.13 Pfaffenwaldring 7 70569 Stuttgart Tel. +49 (0)711 685-82480 www.isv.uni-stuttg A Branch-and-Bound Based Framework for Route Set Generation

A Branch-and-Bound Based Framework for Route Set Generation

  • Upload
    glenda

  • View
    34

  • Download
    0

Embed Size (px)

DESCRIPTION

A Branch-and-Bound Based Framework for Route Set Generation. Outline. Motivation and Objective Background Generate Realistic Route Set Summary Open Questions. Outline. Motivation and Objective Background Generate Realistic Route Set Summary Open Questions. Motivation and Objective. - PowerPoint PPT Presentation

Citation preview

Page 1: A Branch-and-Bound Based Framework for Route Set Generation

Universität StuttgartInstitut für Straßen- und VerkehrswesenLehrstuhl für Verkehrsplanung und Verkehrsleittechnik

M.Sc Yaohua XiongIDS 2012

2012.12.13

Pfaffenwaldring 7 70569 Stuttgart Tel. +49 (0)711 685-82480 www.isv.uni-stuttgart.de/vuv/

A Branch-and-Bound Based Framework for Route Set Generation

Page 2: A Branch-and-Bound Based Framework for Route Set Generation

Outline

Motivation and Objective

Background

Generate Realistic Route Set

Summary

Open Questions

Page 3: A Branch-and-Bound Based Framework for Route Set Generation

Outline

Motivation and Objective

Background

Generate Realistic Route Set

Summary

Open Questions

Page 4: A Branch-and-Bound Based Framework for Route Set Generation

Motivation and Objective

Path Based Assignment Path Flows instead of Link Flows Detailed Result Stable Result

New Question: are the paths “realistic”? What is “realistic”? How to make paths “realistic”?

Terminology Route: Consecutive Links Path: Path + Departure Time

Page 5: A Branch-and-Bound Based Framework for Route Set Generation

Outline

Motivation and Objective

Background

Generate Realistic Route Set

Summary

Open Questions

Page 6: A Branch-and-Bound Based Framework for Route Set Generation

Conventional Assignment Process

A

B

Done!

Find Free Flow Shortest

Path

Network Loading

Converge?Find CongestedShortest Path

Path Flow Set

End

Start

Page 7: A Branch-and-Bound Based Framework for Route Set Generation

Existing Approaches for Route Generation

Approach Procedure Result Ref

K-shortest Path Exact Deterministic Van der zijpp

Link Elimination Heuristic Deterministic

Azevedo et al.

Gateway Heuristic Deterministic Lombard

Labeled Heuristic DeterministicBen-akiva et al.

Monte-Carlo Heuristic Stochastic Ramming

Additional Approach

Page 8: A Branch-and-Bound Based Framework for Route Set Generation

Outline

Motivation and Objective

Background

Generate Realistic Route Set

Summary

Open Questions

Page 9: A Branch-and-Bound Based Framework for Route Set Generation

What is a Realistic Route (Set)?

Route that travelers are willing to use “Subjective” Not Operative

“Objective” and Operative Definition Coverage Rate Estimation Quality

But the definition of “realistic” route *is* subjective No Physical Rules

Solution: Ask “What is an unrealistic route?” Use Intuition Formalize the Rules The Rules are called Constraints

Subtraction Approach

Page 10: A Branch-and-Bound Based Framework for Route Set Generation

Branch-and-Bound

Branch: systematically enumerate all pathsBound: eliminate unrealistic paths

Page 11: A Branch-and-Bound Based Framework for Route Set Generation

Non-Cyclic Constraint

No Cycle in Route

Page 12: A Branch-and-Bound Based Framework for Route Set Generation

Detour Constraint

No Excessive Detour

Detour Factor = Path Length / Shortest Path Length

Page 13: A Branch-and-Bound Based Framework for Route Set Generation

(Local) Detour Constraint

Page 14: A Branch-and-Bound Based Framework for Route Set Generation

Turn Constraint

Without C(8,4) = 70 C(18, 9) = 48620 C(38, 19) = 35345263800

With e.g. max_turn = 1

NNNNEEEE

EEEENNNN

ENENENEN

Page 15: A Branch-and-Bound Based Framework for Route Set Generation

Other Constraints

How to identify new constraints?

Use Intuition Researcher Expert Opinion Survey

Page 16: A Branch-and-Bound Based Framework for Route Set Generation

Road Hierarchy

Distance Matters

Page 17: A Branch-and-Bound Based Framework for Route Set Generation

Road Hierarchy Aware Enumeration

Determine Access and Egress Point

Generate Sub-routes from origin to Access Point

Generate Sub-routes from Egress point to Destination

Generate Sub-routes from Access Point to Egress Point

Concatenate Sub-routes

Page 18: A Branch-and-Bound Based Framework for Route Set Generation

Choice Set Composition

Choice Set vs Route Set

Post Process Individual Avaibility/Perception Overall Quality Control

Page 19: A Branch-and-Bound Based Framework for Route Set Generation

Outline

Motivation and Objective

Background

Generate Realistic Route Set

Summary

Open Questions

Page 20: A Branch-and-Bound Based Framework for Route Set Generation

Summary

OD PairGrouping

Enumeration

End

Start

RH AwareEnumeration

Constraints

Composition

Subtraction Instead of Addition. Non-cyclic Constraint Detour Constraint Turn Constraint Others...(Use the

intuition, Luke)

Road Hierarchy Aware Enumeration

Composition

Overall Framework Route Set Generation

Page 21: A Branch-and-Bound Based Framework for Route Set Generation

Constrained Path Based Assignment

Converge?

Path Based Assignment ConstrainedPath Based Assignment

Find Free Flow Shortest

Path

Network Loading

Converge?Find CongestedShortest Path

Path Flow Set

End

Start

RouteEnumeration

Network Loading

Find ConstrainedShortest Path

Path Flow Set

End

Start

Page 22: A Branch-and-Bound Based Framework for Route Set Generation

Thank You!

[email protected]

and

Page 23: A Branch-and-Bound Based Framework for Route Set Generation

Open Question

With a given link impedance definition CPBA is not necessarily achieve equilibrium.(shortest path will not be considered due to constraints)

Equilibrium Assumption is True

Constraints are Valid

Why?

→ The impedance has latent factors which are not took into account in the current definition?

A

B