Dynamic vehicle scheduling problem with changeable time window

A new dynamic vehicle scheduling model with changeable time window is presented. An effective algorithm is developed to solve the problem, which can consider bespoken demand and real-time demand. The time window adjusting policy, immune search strategy for improving on initial routings and dynamic insertion method for real-time demand are designed. The simulation results show that the algorithm can reduce the number of rejected customers significantly compared with the algorithm with hard constraints of time window, deal with real-time demand dynamically, and save traveling cost.