|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||Vehicle routing and adaptive iterated local search within the HyFlex hyper-heuristic framework|
|Citation:||Walker J, Ochoa G, Gendreau M & Burke E (2012) Vehicle routing and adaptive iterated local search within the HyFlex hyper-heuristic framework. In: Hamadi Y & Schoenauer M (eds.) Learning and Intelligent Optimization 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers. Lecture Notes in Computer Science, Vol. 7219. 6th International Conference, LION 6,, Paris, France, 16.01.2012-20.01.2012. Amsterdam: Springer, pp. 265-276. http://link.springer.com/chapter/10.1007/978-3-642-34413-8_19#; https://doi.org/10.1007/978-3-642-34413-8_19|
|Series/Report no.:||Lecture Notes in Computer Science, Vol. 7219|
|Conference Name:||6th International Conference, LION 6,|
|Conference Dates:||2012-01-16 - 2012-01-20|
|Conference Location:||Paris, France|
|Abstract:||HyFlex (Hyper-heuristic Flexible framework)  is a soft- ware framework enabling the development of domain independent search heuristics (hyper-heuristics), and testing across multiple problem do- mains. This framework was used as a base for the first Cross-domain Heuristic Search Challenge, a research competition that attracted signif- icant international attention. In this paper, we present one of the prob- lems that was used as a hidden domain in the competition, namely, the capacitated vehicle routing problem with time windows. The do- main implements a data structure and objective function for the vehicle routing problem, as well as many state-of- the-art low-level heuristics (search operators) of several types. The domain is tested using two adap- tive variants of a multiple-neighborhood iterated local search algorithm that operate in a domain independent fashion, and therefore can be con- sidered as hyper-heuristics. Our results con¯rm that adding adaptation mechanisms improve the performance of hyper-heuristics. It is our hope that this new and challenging problem domain can be used to promote research within hyper-heuristics, adaptive operator selection, adaptive multi-meme algorithms and autonomous control for search algorithms|
|Status:||VoR - Version of Record|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|VRPHyflexLION12.pdf||Fulltext - Published Version||206.25 kB||Adobe PDF||Under Embargo until 3000-01-01 Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.