GAMS example code for: Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in Phase-Time-Traffic hypernetwork

Name: GAMS example code for: Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in Phase-Time-Traffic hypernetwork
Creator: PENGFEI LI
Published: 2017-10-14T09:19:34.647Z
Keywords: Network Optimization, Road Transportation, Surface Intersection

LI, PENGFEI; Zhou, Xuesong

doi:10.17632/mbhtt8xzdg.2

GAMS example code for: Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in Phase-Time-Traffic hypernetwork

Published: 14-10-2017| Version 2 | DOI: 10.17632/mbhtt8xzdg.2

Contributors:

PENGFEI LI,

Xuesong Zhou

Description

This is an example code IN GAMS of a Mixed-interger linear programming formulation for fully automated intersection management.

GAMS example code for: Recasting and optimizing intersection automation as a connected-and-automated-vehicle (CAV) scheduling problem: A sequential branch-and-bound search approach in Phase-Time-Traffic hypernetwork

Description

Files