2021-04-23T07:49:28Zhttps://gredos.usal.es/oai/requestoai:gredos.usal.es:10366/1348702020-06-18T14:43:45Zcom_10366_122575com_10366_4512com_10366_3823col_10366_134811
00925njm 22002777a 4500
dc
Vaquerizo, M. Belén
author
Baruque, Bruno
author
Corchado Rodríguez, Emilio Santiago
author
2012
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.
Hybrid Artificial Intelligent Systems Lecture Notes in Computer Science. 7th International Conference, HAIS 2012, Salamanca, Spain, March 28-30th, 2012. Proceedings, Part II. Lecture Notes in Computer Science. Volumen 7209, pp. 381-391.
978-3-642-28930-9 (Print) / 978-3-642-28931-6 (Online)
0302-9743 (Print) / 1611-3349 (Online)
http://hdl.handle.net/10366/134870
Computer Science
Combining Metaheuristic Algorithms to Solve a Scheduling Problem