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 October 2017| Version 2 | DOI: 10.17632/mbhtt8xzdg.2
Contributors:PENGFEI LI, Xuesong Zhou
This is an example code IN GAMS of a Mixed-interger linear programming formulation for fully automated intersection management.
Network Optimization, Road Transportation, Surface Intersection