Vehicle Distribution and Routing in a Large Automated Transportation Network

Computational studies of a 4 station, 58 link network is used to demonstrate the efficacy of the proposed algorithm. It is shown and proven that no duality gap exists for the problem (convex cost and non-convex constraints). Moreover, several suboptimal control schemes with reduced computational requirements are presented and evaluated.