A Hyper-Heuristic Based on An Adapter Layer for Transportation Combinatorial Problems

Enrique Urra, Claudio Cubillos, Daniel Cabrera Paniagua

Research output: Contribution to journalArticlepeer-review

1 Scopus citations


Hyper-heuristics are optimization techniques for solving hard combinatorial problems. Their main feature is that their design involves an important decoupling of the search components from the problem domain ones. This allows them to extend their applicability to different problem domains without major redesign, unlike traditional methods such as metaheuristics. In this work, a hyper-heuristic is evaluated for a transportation problem. The implemented hyper-heuristic uses a greedy operator, and it implements an adapter layer that would allow it to be used in other similar problems. Experimental results shows balanced solution quality and CPU time performance, regarding other metaheuristics in literature.

Original languageEnglish
Article number7555251
Pages (from-to)2764-2769
Number of pages6
JournalIEEE Latin America Transactions
Issue number6
StatePublished - Jun 2016
Externally publishedYes


  • Optimization
  • Transport
  • efficient algorithms
  • hyper-heuristics


Dive into the research topics of 'A Hyper-Heuristic Based on An Adapter Layer for Transportation Combinatorial Problems'. Together they form a unique fingerprint.

Cite this