Skip to main content
Springer Nature Link
Log in

Parametrized Greedy Heuristics in Theory and Practice

  • Conference paper
Hybrid Metaheuristics (HM 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3636))

Included in the following conference series:

  • 632 Accesses

Abstract

A parametrized greedy heuristic (pgreedy) is a hybridization of a classical greedy construction heuristic with a parametrized scoring function and improving hit-and-run, a concept from the field of Global Optimization for automated parameter selection. In this article we introduce this new metaheuristic concept and apply it to a real-world planning problem: the integrated coordination of school starting times and public transport in rural areas.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bar-Yehuda, R., Rawitz, D.: Efficient algorithms for integer programs with two variables per constraint. Algorithmica 29(4), 595–609 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  2. Lagarias, J.C.: The computational complexity of simultaneous diophantine approximation problems. SIAM Journal on Computing 14, 196–209 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Information available at, http://www.cplex.com

  4. Savelsbergh, M.: Local Search for Routing Problems with Time Windows. Annals of Operations Research 4, 285–305 (1986)

    Article  MathSciNet  Google Scholar 

  5. Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2002)

    Book  MATH  Google Scholar 

  6. Zabinsky, Z.B.: Stochastic Adaptive Search for Global Optimization. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Boston (2003)

    Google Scholar 

  7. Zabinsky, Z.B., Smith, R.L., McDonald, J.F., Romeijn, H.E., Kaufman, D.E.: Improving Hit-and-Run for Global Optimization. Journal of Global Optimization 3, 171–192 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Darmstadt University of Technology, Schlossgartenstr. 7, 64289, Darmstadt, Germany

    Armin Fügenschuh

Authors
  1. Armin Fügenschuh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Barcelona, Spain

    María J. Blesa

  2. ALBCOM, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain

    Christian Blum

  3. DEIS, Campus of Cesena Alma Mater Studiorum, Università di Bologna, Cesena, Italy

    Andrea Roli

  4. Université Libre de Bruxelles, IRIDIA CP 194/6,, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fügenschuh, A. (2005). Parametrized Greedy Heuristics in Theory and Practice. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2005. Lecture Notes in Computer Science, vol 3636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546245_3

Download citation

  • DOI: https://doi.org/10.1007/11546245_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28535-9

  • Online ISBN: 978-3-540-31898-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics