A Matheuristic Algorithm for the Multiple-Depot Vehicle and Crew Scheduling Problem
This work addresses the multiple-depot vehicle and crew scheduling problem (MDVCSP).In MDVCSP, we deal with two NP-hard problems in an integrated way: the multiple-depot vehicle scheduling problem (MDVSP) and the crew scheduling problem (CSP).For solving Telephone Lead the MDVCSP, we define the vehicles’ operational routine and the workdays