Multiobjective Metaheuristics for the Bus Driver Scheduling Problem

References

• Aggarwal C. C., Orlin J. R., Tai R. P. Optimized crossover for the independent set problem. Oper. Res. (1997) 45(2):226–234Link, Google Scholar
• Agra A. A method to generate feasible duties in a transportation system. (1993) (Faculdade de Ciências da Universidade de Lisboa, Lisbon, Portugal) . Working PaperGoogle Scholar
• Al-Sultan K. S., Hussain M. F., Nizami J. S. A genetic algorithm for the set covering problem. J. Oper. Res. Soc. (1996) 47:702–709Crossref, Google Scholar
• Beasley J. E. An algorithm for the set covering problem. Eur. J. Oper. Res. (1987) 31:85–93Crossref, Google Scholar
• Beasley J. E., Chu P. C. A genetic algorithm for the set covering problem. Eur. J. Oper. Res. (1996) 94:392–404Crossref, Google Scholar
• Campbell K. W., Durfee R. B., Hines G. S. FedEx Generates Bid Lines using Simulated Annealing. Interfaces (1997) 27(2):1–16Link, Google Scholar
• Caprara A., Fischetti M., Toth P. A heuristic method for the set covering problem. Oper. Res. (1999) 47:730–743Link, Google Scholar
• Chu P. C., Beasley J. E. A genetic algorithm for the set partition problem. (1995) (Imperial College, London, UK) . Working paperGoogle Scholar
• Clement R., Wren A. Greedy genetic algorithms, optimising mutations and bus driver scheduling. (1993) (Sixth International Workshop on Computer Aided Scheduling of Public Transportation, Lisbon, Portugal) Google Scholar
• Daduna J. R., Branco I., Paixão J. Computer-aided transit scheduling. (1995) (Springer-Verlag, Berlin, Germany) . Proceedings of the Sixth International WorkshopCrossref, Google Scholar
• Daduna J. R., Mojsilovic M., Daduna J. R., Wren A. Computer-aided vehicle and duty scheduling using HOT programme system. Computer-Aided Transit Scheduling (1988) (Springer-Verlag, Berlin, Germany) 133–146Crossref, Google Scholar
• Davis L.Handbook of Genetic Algorithms (1996) (Van Nostrand Reinhold, New York) Google Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adaptive search heuristic. J. Global Optim. (1995) 6:109–133Crossref, Google Scholar
• Fonseca C. M., Fleming P. J. An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Comput. (1995) 3:1–16Crossref, Google Scholar
• Freling R. Models and techniques for integrating vehicle and crew scheduling. (1997) (Erasmus University, Rotterdam, The Netherlands) . Ph.D. ThesisGoogle Scholar
• Galvão T., Pinho de Sousa J., Falcão e Cunha J. Genetic algorithms for the crew scheduling problem: a real experiment with relaxation models. (1998) . PreprintGoogle Scholar
• Garey M. R., Johnson D. S.Computers and Intractability—A Guide to the Theory of NP-Completeness (1979) . FreemanGoogle Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 5:533–549Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Norwell, MA) Crossref, Google Scholar
• Hansen M. P. Tabu search for multiobjective optimization: Mots. (1997) (University of Cape Town, South Africa) 574–586Proceedings of the 13th International Conference on Multiple Criteria Decision MakingGoogle Scholar
• Holland J.Adaptation in Natural and Artificial Systems (1975) (University of Michigan Press, Michigan) Google Scholar
• Karp R. M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) Crossref, Google Scholar
• Kwan A. S. K., Kwan R. S. K., Parker M. E., Wren A. Producing train driver schedules under operating strategies. Preprints of the 7th International Workshop on Computer-Aided Scheduling of Public Transportation (1997) (Boston, MA)Google Scholar
• Kwan A. S. K., Kwan R. S. K., Wren A. Driver scheduling using genetic algorithms with embedded combinatorial traits. Preprints of the 7th International Workshop on Computer-Aided Scheduling of Public Transportation (1997) (Boston, MA)Google Scholar
• Kwan R. S. K., Wren A., Bianco L., Toth P. Hybrid genetic algorithms for the bus driver scheduling. Advanced Methods in Transportation Analysis (1996) (Springer, Berlin, Germany) 609–619Crossref, Google Scholar
• Laguna M. A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times. IIE Trans. (1999) 31(2):125–134Crossref, Google Scholar
• Lourenço H. R. Job-shop scheduling: computational study of local search and large-step optimization methods. Eur. J. Oper. Res. (1995) 83:347–364Crossref, Google Scholar
• Lourenço H. R. OSH: Optimized Search Heuristics. (2001) (Universitat Pompeu Fabra, Barcelona, Spain) . ForthcomingGoogle Scholar
• Moscato P. On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. (1989) . C3P Report 826, Caltech Concurrent Computation ProgramGoogle Scholar
• Odoni A. R., Rousseau J. M., Wilson N. H. M., Pollock S. M., Rothkopf M. H., Barnett A. Models in urban and air transportation. Operations Research and the Public Sector (1994) 6(North-Holland, Amsterdam, The Netherlands) 129–150Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Osman I. H., Kelly J. P.Meta-Heuristics: Theory and Applications (1996) (Kluwer Academic Publishers)Crossref, Google Scholar
• Osman I. H., Laporte G. Metaheuristics: A bibliography. Ann. Oper. Res. (1996) 63:513–628Crossref, Google Scholar
• Paias A., Paixão J. State space relaxation for set covering problems related to bus driver scheduling. Eur. J. Oper. Res. (1993) 71:303–316Crossref, Google Scholar
• Portugal R. Metaheuristics for the bus-driver scheduling problems. (1998) (Faculdade de Ciências da Universidade de Lisboa, Lisbon, Portugal) . MSc. ThesisGoogle Scholar
• Rousseau J. M.Computer Scheduling of Public Transport—2 (1985) (North-Holland, Amsterdam, The Netherlands)Google Scholar
• Rousseau J. M., Lessard R., Blais J. Y., Rousseau J. M. Enhancements to the HAS-TUS crew scheduling algorithm. Computer Scheduling of Public Transport—2 (1985) (North-Holland, Amsterdam, The Netherlands) 295–310Google Scholar
• Smith B. M., Wren A. A bus driver scheduling system using a set covering formulation. Transportation Sci. (1988) 22A:97–108Google Scholar
• Steuer R. E.Multiple Criteria Optimization: Theory, Computation, and Application (1986) (John Wiley, New York) Google Scholar
• Vasko F. J., Wolf F. E. Solving large set covering problems on a personal computer. Comput. Oper. Res. (1988) 15:115–121Crossref, Google Scholar
• Viana A., Pinho de Sousa J. Some notes on multiobjective metaheuristics—a tutorial example. Eur. J. Oper. Res. (1999) . ForthcomingGoogle Scholar
• Voss S., Martello S., Osman I. H., Roucairol C.Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization (1998) (Kluwer Academic Publishers)Crossref, Google Scholar
• Wren A., Burke E. K., Ross P. Scheduling, timetabling and rostering—A special relationship? Practice and Theory of Automated Timetabling (1996) (Springer Verlag, Berlin, Germany) 46–75Crossref, Google Scholar
• Wren A., Rousseau J. M., Daduna J., Branco I., Paixão J. P. Bus driver scheduling—an overview. Computer-Aided Transit Scheduling (1995) (Springer Verlag, Berlin, Germany) 173–187Crossref, Google Scholar
• Wren A., Wren D. O. A genetic algorithm for public transport driver scheduling. Comput. Oper. Res. (1995) 22:101–110Crossref, Google Scholar