Simulated annealing: theory and applications
Simulated annealing: theory and applications
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Solving airline crew scheduling problems by branch-and-cut
Management Science
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
A column-generation technique for the long-haul crew-assignment problem
Optimization in industry 2
Parallel simulated annealing on a message-passing multi-computer
Parallel simulated annealing on a message-passing multi-computer
Computer-Aided Transit Scheduling: Proceedings, Lisbon, Portugal, July 1993
Computer-Aided Transit Scheduling: Proceedings, Lisbon, Portugal, July 1993
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
An Algorithm for 0-1 Programming with Application to Airline Crew Scheduling
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Scheduling fixtures for basketball New Zealand
Computers and Operations Research
Computers and Industrial Engineering
Multiobjective genetic algorithm to solve the train crew scheduling problem
ISTASC'10 Proceedings of the 10th WSEAS international conference on Systems theory and scientific computation
OPTIMIZING COST IN SOFTWARE DEVELOPMENT PROJECTS
Journal of Integrated Design & Process Science
| Hi-index | 0.00 |
We report about a study of a simulated annealing algorithmfor the airline crew pairing problem based on a run-cutting formulation. Computational results are reported for some real-world short- to medium-haul test problems with up to 4600 flights per month. Furthermore we find that run time can be saved and solution quality can be improved by using a problem specific initial solution,by relaxing constraints “as far as possible”,by combining simulated annealing with a problem specificlocal improvement heuristicand by multiple independent runs.