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

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

本示例代码为基于通用代数建模系统（General Algebraic Modeling System，GAMS）编写的、面向全自动交叉口管理的混合整数线性规划模型示例。