Combining metaheuristic algorithms to solve a scheduling problem

Authors:
Ma Belén Vaquerizo;Bruno Baruque;Emilio Corchado
Affiliations:
Computer Languages and Systems Area, University of Burgos, Spain;Computer Languages and Systems Area, University of Burgos, Spain;Depart. de Informática y Automática, University of Salamanca, Spain
Venue:
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II
Year:
2012

Citing 7
Cited 0

Personnel Tour Scheduling When Starting-Time Restrictions Are Present

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scatter search

Advances in evolutionary computing
Simultaneous vehicle and driver scheduling: A case study in a limousine rental company

Computers and Industrial Engineering
Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem

Computers and Operations Research
The train driver recovery problem-A set partitioning based model and solution method

Computers and Operations Research
A scatter search algorithm for solving vehicle routing problem with loading cost

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Labour Scheduling problem in the context of any transport company is a complex optimization problem of that belongs to the class of NP-Hard problems. In these cases, it is not viable to try to find an exact solution and therefore, they require methods that assure the optimal management of the available resources in the tracing of the work calendars under the most suitable criteria of economy of times and costs. The main purpose of this research is to propose an efficient method to determine optimal shifts in a generic transport company, using bio-inspired methods. This method employs a two-step approach to obtain a solution. In a first stage, a Grasp algorithm is used to generate a viable solution. Then in a second stage, this preliminary solution is tuned, in order to obtain an optimal one, by using a Scatter Search algorithm.