Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2739482.2764686acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics

Published: 11 July 2015 Publication History

Abstract

Generally, we distinguish between two classes of hyper-heuristic approaches, heuristic selection and heuristic generation. The former one works with existing heuristics and tries to find their optimal order for solving the instance. The later approach automatically generates new heuristic. Here, these two approaches are combined so that, first, a number of various heuristics are derived from a limited set of pre-existing heuristics for the selected optimization problem with regard to the diversity among the heuristics. Then, the heuristic selection approach is used to find the optimal sequence of heuristics leading to the best solution. Proof-of-concept experiments on the Capacitated Vehicle Routing Problem were carried out with the well-known Clarke-Wright, Mole-Jameson and Kilby constructive heuristics. Results show that the derived heuristics produce consistently better results than the original ones.

References

[1]
P. Augerat, J. Belenguer, E. Benavent, A. Corberán, D. Naddef, and G. Rinaldi. Computational results with a branch and cut code for the capacitated vehicle routing problem. IMAG, 1995.
[2]
E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and R. Qu. Hyper-heuristics: a survey of the state of the art. J Oper Res Soc, 64(12):1695--1724, Dec 2013.
[3]
G. Clarke and J. W. Wright. Scheduling of vehicles from a central depot to a number of delivery points, 1964.
[4]
G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Management Science, 6(1):80--91, 1959.
[5]
P. Kilby, P. Prosser, and P. Shaw. Dynamic vrps: A study of scenarios. Technical report, 1998.
[6]
G. Laporte, M. Gendreau, J.-Y. Potvin, and F. Semet. Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research, 7(4--5):285--300, 2000.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
July 2015
1568 pages
ISBN:9781450334884
DOI:10.1145/2739482
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 July 2015

Check for updates

Author Tags

  1. capacitated vehicle routing problem
  2. genetic algorithms
  3. genetic programming
  4. hyper-heuristics

Qualifiers

  • Poster

Funding Sources

Conference

GECCO '15
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 65
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media