A fuzzy genetic algorithm for driver scheduling

European Journal of Operational Research

Volumn 147, Issue 2, 2003, Pages 334-344

  Li, Jingpeng ^a   Kwan, Raymond S K ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Driver scheduling; Fuzzy sets; Genetic algorithms

Indexed keywords

FUZZY SETS; GENETIC ALGORITHMS; MATHEMATICAL MODELS; SCHEDULING;

DRIVER SCHEDULING;

OPERATIONS RESEARCH;

EID: 0037410247     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00564-7     Document Type: Article

References (35)

1. Ackley D.H. A Connectionist Machine for Genetic Hillclimbing. 1987;Kluwer Academic Press.
2. Boese K., Kahng A., Muddu S. A new adaptive multi-start technique for combinatorial global optimization. Operations Research Letters. 16:1994;101-113.
3. Chvátal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research. 4:1979;233-235.
4. Daduna J.R., Branco I., Paixao J.M.P. Computer-Aided Transit Scheduling, Proceedings, Lisbon, Portugal. 1995;Springer-Verlag.
5. Davis L. Genetic Algorithms and Simulated Annealing. 1987;Pitman, London.
6. Desrochers M., Rousseau J.M. Computer-Aided Transit Scheduling, Proceedings, Montreal, Canada. 1992;Springer-Verlag.
7. Dubois D., Prade H. Fuzzy Sets and Systems: Theory and Applications. 1980;Academic Press, New York.
8. Feo T., Resende M. Greedy randomized adaptive search procedures. Journal of Global Optimization. 6:1995;109-133.
9. Fores S., Proll L., Wren A. An improved ILP system for driver scheduling. Wilson N.H.M. Computer-Aided Transit Scheduling. 1999;43-62 Springer-Verlag.
10. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
11. Goldberg D.E. Genetic Algorithms in Search, Optimization and Machine Leaning. 1989;Addison-Wesley.
12. Holland J.H. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. 1975;University of Michigan Press.
13. Ishibuchi H., Murata T. Multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transaction on System, Man, and Cybernetics. 28:1998;392-403.
14. Jaszkiewicz A., Hapke M., Kominek P. Performance of multiple objective evolutionary algorithms on distribution system design problem - computational experiments. Zitzler E., Deb K., Thiele L., Coello Coello C.A., Corne D. Evolutionary Multi-Criteria Optimization, LNCS 1993. 2001;241-255 Springer, Berlin.
15. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Science. 9:1974;256-278.
16. Johnson D.S. Local optimization and the traveling salesman problem. Proceedings of the 17th International Colloquium on Automata, Language and Programming. 1990;446-460.
17. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica. 4:1984;373-395.
18. Karp R.M. Reducibility among combinatorial problems. Miller R.E., Thatcher J.W. Complexity of Computer Computations. 1972;85-103 Plenum Press, New York.
19. Kaufmann A. Introduction to the theory of fuzzy subsets. Fundamental Theoretical Elements. 1975;Academic Press, New York.
20. A.S.K. Kwan, Train driver scheduling, Ph.D. thesis, University of Leeds, 1999.
21. Kwan A.S.K., Kwan R.S.K., Wren A. Driver scheduling using genetic algorithms with embedded combinatorial traits. Wilson N.H.M. Computer-Aided Transit Scheduling. 1999;81-102 Springer-Verlag.
22. Lovász L. On the ratio of optimal integral and fractional covers. Discrete Mathematics. 13:1975;383-390.
23. Moscato P., Norman M.G. A "memetic" approach for the traveling salesman problem. Implementation of a computational ecology for combinatorial optimization on message-passing systems. Valero M., Onate E., Jane M., Larriba J.L., Suarez B. Parallel Computing and Transputer Applications. 1992;187-194 IOS Press, Amsterdam.
24. Proll L. Stronger formulations of mixed integer linear programs: An example. International Journal of Mathematical Education in Science and Technology. 28:1997;707-712.
25. Radcliffe N.J., Surry P.D. Formal memetic algorithms. Fogarty T. Evolutionary Computing. 1994;1-16 Springer-Verlag, Berlin.
26. Slavík P. A tight analysis of the greedy algorithm for set cover. ACM Symposium on Theory of Computing. 1996;435-441.
27. Spears W.M., Dejong K.A. An analysis of multipoint crossover. Proceedings of the 1990 Workshop of the Foundations of Genetic Algorithms. 1991;301-315.
28. Srinivas M., Patnaik L.M. Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transaction on System, Man and Cybernetics. 24:1994;656-667.
29. Srinivasan A. Improved approximations of packing and covering problems. ACM Symposium on Theory of Computing. 1995;268-276.
30. Steuer R.E. Multiple Criteria Optimization - Theory, Computation and Application. 1986;Wiley, New York.
31. Ulungu E.L., Teghem J. Multi-objective combinatorial optimization problems: A survey. Journal of Multi-Criteria Decision Analysis. 3:1994;83-101.
32. Wilson N.H.M. Computer-Aided Transit Scheduling, Proceedings, Cambridge, MA, USA. 1999;Springer-Verlag.
33. Wren A., Rousseau J.M. Bus driver scheduling - an overview. Daduna J.R., Branco I., Paixao J.M.P. Computer-Aided Transit Scheduling, Proceedings, Lisbon, Portugal. 1995;173-187 Springer-Verlag.
34. Zadeh L.A. Fuzzy sets. Information and Control. 8:1965;338-353.
35. Zimmermann H.J. Fuzzy Set Theory and its Applications. 1985;Kluwer-Nijhoff Publishers, Boston.