Skip to main content
SpringerLink
Log in
Book cover

Meta-Heuristics pp 213–229Cite as

Hybrid Genetic Tabu Search for a Cyclic Scheduling Problem

  • Chapter

Abstract

This paper considers a cyclic scheduling problem, which especially is applicable in the area of public transport. The problem is the so-called Irregular Polygon Scheduling Problem with the objective to maximize the distance between the nearest vertices of two different polygons. We give a mixed integer LP-formulation of this NP-hard problem, derive some bounds and present a hybrid meta-heuristic algorithm for solving the problem. The main idea is to combine a Tabu Search with a Genetic Algorithm component. Computational experience, based on comparative results obtained from CPLEX, shows the efficiency of the hybridization approach.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Brucker, R. E. Burkard, and J. Hurink. Cyclic schedules for r irregularly occurring events. J. Comput Appl. Math., 30:173–189, 1990.

    Article  Google Scholar 

  2. P. Brucker and W. Meyer. Scheduling two irregular polygons. Discr. Appl. Math., 20:91–100, 1988.

    Article  Google Scholar 

  3. R. E. Burkard. Optimal schedules for periodically recurring events. Discr. Appl. Math., 15:167–180, 1986.

    Article  Google Scholar 

  4. J. Cerny. Problems for systems of regular polygons on a circumference and their application in transport. (Czech) Matematiché obzory, pages 51–59, 1972.

    Google Scholar 

  5. D. Costa. An evolutionary Tabu Search algorithm and the NHL scheduling problem. INFOR, 33:161–178, 1995.

    Google Scholar 

  6. CPLEX Optimization. CPLEX base system with callable library, barrier and mixed integer solver. Version 4.0., 1995.

    Google Scholar 

  7. C. Fleurent and J. A. Ferland. Genetic hybrids for the quadratic assignment problem. DIMACS Series in Disc. Maths & Theor. Comp. Sci., 16:173–187, 1994.

    Google Scholar 

  8. F. Glover. Future paths for integer programming and links to artificial intelligence. Computers Oper. Res., 5:533–549, 1986.

    Article  Google Scholar 

  9. F. Glover. Tabu Search — Part II. ORSA J. Comput, 2:4–32, 1990.

    Article  Google Scholar 

  10. F. Glover. Tabu Search and adaptive memory programming — Advances, applications and challenges. In R. S. Barr, R. V. Helgason and J. L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1–75. Kluwer Academic Publishers, 1996.

    Google Scholar 

  11. F. Glover. A template for Scatter Search and Path Relinking. In J. K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, editors, Lecture Notes in Computer Science. 1997. To appear.

    Google Scholar 

  12. F. Glover, J. P. Kelly, and M. Laguna. Genetic Algorithms and Tabu Search: Hybrids for optimization. Computers Oper. Res., 22:111–134, 1995.

    Article  Google Scholar 

  13. F. Glover and M. Laguna. Tabu Search. In Reeves C. R., editor, Modern heuristic techniques for combinatorial problems, pages 70–150. Blackwell Scientific Publications, 1993.

    Google Scholar 

  14. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.

    Google Scholar 

  15. P. Greistorfer and H. Kellerer. Bounds and Tabu Search for a cyclic maxmin scheduling problem. Technical report, Dept. of Industrial Management. University of Graz, 1998. Updated version.

    Google Scholar 

  16. F. Guldan. Maximization of distances of regular polygons on a circle. Aplikace Matematiky, 25:182–195, 1980.

    Google Scholar 

  17. J. Hurink. Polygon scheduling. Discr. Appl. Math., 70:37–55, 1996.

    Article  Google Scholar 

  18. H. Kim, K. Nara, and M. Gen. A method for maintenance scheduling using GA combined with SA. Computers Ind. Eng., 27:477–480, 1994.

    Article  Google Scholar 

  19. M. Laguna and F. Glover. Bandwith packing: A Tabu Search approach. Management Sci., 39:492–500, 1993.

    Article  Google Scholar 

  20. O. Martin, S. W. Otto, and E. W. Feiten. Large-step Markov chains for the TSP incorporating local search heuristics. Oper. Res. Lett., 11:219–224, 1992.

    Article  Google Scholar 

  21. H. Mühlenbein, M. Georges-Schleuter, and O. Kramer. Evolution algorithms in combinatorial optimization. Parallel Comput., 7:65–88, 1988.

    Article  Google Scholar 

  22. H. Mühlenbein and H.-M. Voigt. Gene pool recombination in Genetic Algorithms. In I. H. Osman and J. P. Kelly, editors, Meta-Heuristics: Theory & Applications, pages 53–62. Kluwer Academic Publishers, 1996.

    Google Scholar 

  23. I. H. Osman and J. P. Kelly, editors. Meta-Heuristics: Theory & Applications. Kluwer Academic Publishers, 1996.

    Google Scholar 

  24. I. H. Osman and G. Laporte. Metaheuristics: A bibliography. Ann. Oper. Res., 63:513–628, 1996.

    Article  Google Scholar 

  25. C. R. Reeves. Genetic Algorithms. In Reeves C. R., editor, Modern heuristic techniques for combinatorial problems, pages 151–196. Blackwell Scientific Publications, 1993.

    Google Scholar 

  26. S. R. Thangiah, I. H. Osman, and T. Sun. Hybrid Genetic Algorithm, Simulated Annealing and Tabu Search methods for vehicle routing problems with time windows. Technical report, Dept. of Computer Science. Slippery Rock University, 1994.

    Google Scholar 

  27. A. Vince. Scheduling periodic events. Discr. Appl. Math., 25:299–310, 1988.

    Article  Google Scholar 

  28. S. Voß. Observing logical interdependencies in Tabu Search — Methods and results. In V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith, editors, Modern heuristic search methods, pages 41–59. John Wiley & Sons Ltd., 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Industrie und Fertigungswirtschaft, Karl-Franzens-Universität, Universitätsstraße 15/G2, 8010, Graz, Austria

    Peter Greistorfer

Authors
  1. Peter Greistorfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Braunschweig, Germany

    Stefan Voß

  2. University of Bologna, Italy

    Silvano Martello

  3. University of Kent, UK

    Ibrahim H. Osman

  4. University of Versailles, France

    Catherine Roucairol

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Greistorfer, P. (1999). Hybrid Genetic Tabu Search for a Cyclic Scheduling Problem. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5775-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5775-3_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7646-0

  • Online ISBN: 978-1-4615-5775-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation