Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Heuristic algorithms for the multiple depot vehicle scheduling problem
Management Science
A tabu search heuristic for the vehicle routing problem
Management Science
Vehicle scheduling in public transit and Lagrangean pricing
Management Science
Tabu Search
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Models and Algorithms for Single-Depot Vehicle Scheduling
Transportation Science
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
Operations Research
Multiple-Depot Integrated Vehicle and Crew Scheduling
Transportation Science
Iterated local search for the multiple depot vehicle scheduling problem
Computers and Industrial Engineering
A DSS for integrated distribution of empty and full containers
Decision Support Systems
Transit network timetabling and vehicle assignment for regulating authorities
Computers and Industrial Engineering
Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling
Transportation Science
Computers and Operations Research
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
Software framework for vehicle routing problem with hybrid metaheuristic algorithms
ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm
ACC'11/MMACTEE'11 Proceedings of the 13th IASME/WSEAS international conference on Mathematical Methods and Computational Techniques in Electrical Engineering conference on Applied Computing
The inventory-routing problem with transshipment
Computers and Operations Research
Journal of Mathematical Modelling and Algorithms
The synchronized arc and node routing problem: Application to road marking
Computers and Operations Research
Incremental multiple-scan chain ordering for ECO flip-flop insertion
Proceedings of the International Conference on Computer-Aided Design
Hi-index | 0.00 |
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 exactly once by a vehicle. In this paper, we propose to compare the performance of five different heuristics for this well-known problem, namely, a truncated branch-and-cut method, a Lagrangian heuristic, a truncated column generation method, a large neighborhood search heuristic using truncated column generation for neighborhood evaluation, and a tabu search heuristic. The first three methods are adaptations of existing methods, while the last two are new in the context of this problem. Computational results on randomly generated instances show that the column generation heuristic performs the best when enough computational time is available and stability is required, while the large neighborhood search method is the best alternative when looking for good quality solutions in relatively fast computational times.