Keymeulen, Didier
Comparison Training for a Rescheduling Problem in Neural Networks
Keymeulen, Didier, Gerlache, Martine de
Many events such as flight delays or the absence of a member require the crew pool rescheduling team to change the initial schedule (rescheduling). In this paper, we show that the neural network comparison paradigm applied to the backgammon game by Tesauro (Tesauro and Sejnowski, 1989) can also be applied to the rescheduling problem of an aircrew pool. Indeed both problems correspond to choosing the best solut.ion
Comparison Training for a Rescheduling Problem in Neural Networks
Keymeulen, Didier, Gerlache, Martine de
Many events such as flight delays or the absence of a member require the crew pool rescheduling team to change the initial schedule (rescheduling). In this paper, we show that the neural network comparison paradigm applied to the backgammon game by Tesauro (Tesauro and Sejnowski, 1989) can also be applied to the rescheduling problem of an aircrew pool. Indeed both problems correspond to choosing the best solut.ion
Comparison Training for a Rescheduling Problem in Neural Networks
Keymeulen, Didier, Gerlache, Martine de
Many events such as flight delays or the absence of a member require the crew pool rescheduling team to change the initial schedule (rescheduling). In this paper, we show that the neural network comparison paradigm applied to the backgammon game by Tesauro (Tesauro and Sejnowski, 1989)can also be applied to the rescheduling problem of an aircrew pool. Indeed both problems correspond to choosing the best solut.ion