Dynamically Configured λ-opt Heuristics for Bus Scheduling

There are two types of operational cost involved, th ese are layover (idle time) and dead running (relocating the bus between locations without passenger, this includes leaving and returning to the depot). The objective i s to minimise the operational cost and the number of buses. Given the nature of the pr oblem it is almost always impossible to reduce the layover and dead running cost t o zero. The complexity of the problem quickly increases as the number of the depo ts and the types of vehicle increases.