An efficient estimation function for the crew scheduling problem

Authors:
Javier Murillo;Beatriz Lopez
Affiliations:
University of Girona;University of Girona
Venue:
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Year:
2007

Citing 5
Cited 0

Exploiting symmetries within constraint satisfaction search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Heuristics Ancient and Modern: Transport Scheduling Through the Ages

Journal of Heuristics
Specializing Russian Doll Search

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Multiobjective Metaheuristics for the Bus Driver Scheduling Problem

Transportation Science
Russian doll search for solving constraint optimization problems

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we explain an estimation function for the crew scheduling problem in the coach transportation domain. Thanks to this function we obtain an estimation that is very close to the real cost of the solution and we can efficiently prune the search space with a branch and bound approach. Consequently we find the optimal solution in less time than with other estimations such as the Russian doll method.