A new multi-state route scheduling algorithm based on traffic prediction
Keita Obara, Hiroshi Hasegawa, Ken-ichi Sato · 2010
We propose a disruption-free scheduled path relocation algorithm based on traffic prediction. The path disruption free characteristic is realized by the introduction of an additional operation stage called the transition stage, wherein all path connections of current/next operational timing coexist. During this stage all relocations are performed using the make-before-break scheme. Using the formulation of a convexly constrained feasibility problem for path location optimization for all time samples, we find a solution by the iterative procedure named POCS (Projections onto Convex Sets). Numerical experiments show that the proposed method not only outperforms a conventional method but offers almost the same blocking probability as our previously developed method that accepts disruption.