A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem

This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to assess the quality of the proposed neighborhood and to compare it with two existing neighborhoods using shift and swap. The ”block moves” neighborhood can be beneficial for any local search algorithm.

• Type: Conference
• Year: 2007
• Where: SLS
• Authors: Benoît Laurent, Jin-Kao Hao
• Keywords: Benchmark Instances, Depot Vehicle Scheduling, Local Search Algorithm, SLS 2007