A new hybrid heuristic for driver scheduling

Authors:
G. R. Mauri;L. A. N. Lorena
Affiliations:
(Correspd. mauri@cca.ufes.br) Rural Eng. Dept., Ctr. for Agrarian Sci., CCA, Fed. Univ. of Espírito Santo, UFES, Alegre, ES and Lab. for Comp. and Appl. Math., LAC, Natnl. Inst. for Space Res ...;Laboratory for Computing and Applied Mathematics, LAC, National Institute for Space Research, INPE, São José dos Campos, SP, Brazil
Venue:
International Journal of Hybrid Intelligent Systems - VIII Brazilian Symposium On Neural Networks
Year:
2007

Citing 6
Cited 1

Computer-Aided Scheduling of Public Transport

Computer-Aided Scheduling of Public Transport
-Opt Population Training for Minimization of Open Stack Problem

SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Multiobjective Metaheuristics for the Bus Driver Scheduling Problem

Transportation Science
A flexible system for scheduling drivers

Journal of Scheduling
Constructive Genetic Algorithm for Clustering Problems

Evolutionary Computation
Population training heuristics

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization

A hybrid column generation approach for the berth allocation problem

EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in a public transport system. These methods are applied in an iterative way, where PTA is responsible for the generation of good columns (low cost and good covering of the tasks), and LP for solving a set partitioning problem formed by these columns. The PTA employs heuristics in fitness definition, guiding the population to settle down in search areas where the individuals cannot be improved by such heuristics. The driver schedules are represented by columns in a large-scale set partitioning problem, which are formed when solving the linear programming relaxation. The computational results are compared against a Simulated Annealing metaheuristic using randomly formed instances based on real problems.