Corpus ID: 215868194

A comparison of five heuristics for the multiple depot vehicle scheduling problem

@article{PepinAnnSophie2009ACO,
  title={A comparison of five heuristics for the multiple depot vehicle scheduling problem},
  author={PepinAnn-Sophie and DesaulniersGuy and HertzAlain and HuismanDennis},
  journal={Journal of Scheduling},
  year={2009}
}
Given a set of timetabled tasks, the multi-depot vehicle scheduling problem consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished ... 
A state space reduction heuristic for multiple depot vehicle scheduling problem
Multiple Depot Vehicle Scheduling Problem (MDVSP) is the problem of assigning timetabled trips of di erent lines to a limited number of vehicles emanating from multiple depots. It is a component ofExpand
Driver scheduling based on "driver-friendly" vehicle schedules
TLDR
A driver friendly approach of the optimization of the scheduling, which is closer to the practice used by public transportation companies and gives test results for this. Expand
Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm
Vehicle routing problem with Time Window (VRPTW) has received much attention by researchers in solving many scheduling applications for transportation and logistics. The objective of VRPTW is to useExpand
Shared-Vehicle Mobility-on-Demand Systems: A Fleet Operator's Guide to Rebalancing Empty Vehicles
The authors consider the operation of automated mobility-on-demand systems, whereby users share access to a fleet of self-driving vehicles. In these systems, rebalancing, the process by which theExpand
Incremental Multiple-Scan Chain Ordering for ECO Flip-Flop insertion
  • A. Kahng, Ilgweon Kang, S. Nath
  • Engineering, Computer Science
  • 2013 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
  • 2013
TLDR
This work addresses a new Incremental Multiple-Scan Chain Ordering problem formulation to automate the tedious and time-consuming process of scan stitching for large functional ECOs and presents a heuristic with clustering, incremental clustering and ordering steps to minimize the maximum chain length, routing congestion, and disturbance to existing scan chains. Expand