DVRP: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic. Garrido, P. P. & Riff Rojas, M. C. Journal of Heuristics, 16(6):795-834, 2010. doi abstract bibtex In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach, called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper-heuristic is a high-level algorithm, which generates or chooses a set of low-level heuristics in a common framework, to solve the problem at hand. In our collaborative framework, we have included three different types of low-level heuristics: constructive, perturbative, and noise heuristics. Basically, the hyper-heuristic manages and evolves a sophisticated sequence of combinations of these low-level heuristics, which are sequentially applied in order to construct and improve partial solutions, i.e., partial routes. In presenting some design considerations, we have taken into account the allowance of a proper cooperation and communication among low-level heuristics, and as a result, find the most promising sequence to tackle partial states of the (dynamic) problem. Our approach has been evaluated using the Kilby's benchmarks, which comprise a large number of instances with different topologies and degrees of dynamism, and we have compared it with some well-known methods proposed in the literature. The experimental results have shown that, due to the dynamic nature of the hyper-heuristic, our proposed approach is able to adapt to dynamic scenarios more naturally than low-level heuristics. Furthermore, the hyper-heuristic can obtain high-quality solutions when compared with other (meta) heuristic-based methods. Therefore, the findings of this contribution justify the employment of hyper-heuristic techniques in such changing environments, and we believe that further contributions could be successfully proposed in related dynamic problems. © 2010 Springer Science+Business Media, LLC.
@article{10.1007/s10732-010-9126-2,
abstract = "In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach, called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper-heuristic is a high-level algorithm, which generates or chooses a set of low-level heuristics in a common framework, to solve the problem at hand. In our collaborative framework, we have included three different types of low-level heuristics: constructive, perturbative, and noise heuristics. Basically, the hyper-heuristic manages and evolves a sophisticated sequence of combinations of these low-level heuristics, which are sequentially applied in order to construct and improve partial solutions, i.e., partial routes. In presenting some design considerations, we have taken into account the allowance of a proper cooperation and communication among low-level heuristics, and as a result, find the most promising sequence to tackle partial states of the (dynamic) problem. Our approach has been evaluated using the Kilby's benchmarks, which comprise a large number of instances with different topologies and degrees of dynamism, and we have compared it with some well-known methods proposed in the literature. The experimental results have shown that, due to the dynamic nature of the hyper-heuristic, our proposed approach is able to adapt to dynamic scenarios more naturally than low-level heuristics. Furthermore, the hyper-heuristic can obtain high-quality solutions when compared with other (meta) heuristic-based methods. Therefore, the findings of this contribution justify the employment of hyper-heuristic techniques in such changing environments, and we believe that further contributions could be successfully proposed in related dynamic problems. © 2010 Springer Science+Business Media, LLC.",
number = "6",
year = "2010",
title = "DVRP: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic",
volume = "16",
keywords = "Dynamic vehicle routing problem , Evolutionary algorithms , Heuristic search , Hyper-heuristics",
pages = "795-834",
doi = "10.1007/s10732-010-9126-2",
journal = "Journal of Heuristics",
author = "Garrido, Pablo Pablo and Riff Rojas, Maria Cristina"
}
Downloads: 0
{"_id":"jSvEFgZG9F47Ai2ma","bibbaseid":"garrido-riffrojas-dvrpaharddynamiccombinatorialoptimisationproblemtackledbyanevolutionaryhyperheuristic-2010","downloads":0,"creationDate":"2017-04-03T15:16:25.841Z","title":"DVRP: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic","author_short":["Garrido, P. P.","Riff Rojas, M. C."],"year":2010,"bibtype":"article","biburl":"https://1fichier.com/?yjj84y68k0","bibdata":{"bibtype":"article","type":"article","abstract":"In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach, called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper-heuristic is a high-level algorithm, which generates or chooses a set of low-level heuristics in a common framework, to solve the problem at hand. In our collaborative framework, we have included three different types of low-level heuristics: constructive, perturbative, and noise heuristics. Basically, the hyper-heuristic manages and evolves a sophisticated sequence of combinations of these low-level heuristics, which are sequentially applied in order to construct and improve partial solutions, i.e., partial routes. In presenting some design considerations, we have taken into account the allowance of a proper cooperation and communication among low-level heuristics, and as a result, find the most promising sequence to tackle partial states of the (dynamic) problem. Our approach has been evaluated using the Kilby's benchmarks, which comprise a large number of instances with different topologies and degrees of dynamism, and we have compared it with some well-known methods proposed in the literature. The experimental results have shown that, due to the dynamic nature of the hyper-heuristic, our proposed approach is able to adapt to dynamic scenarios more naturally than low-level heuristics. Furthermore, the hyper-heuristic can obtain high-quality solutions when compared with other (meta) heuristic-based methods. Therefore, the findings of this contribution justify the employment of hyper-heuristic techniques in such changing environments, and we believe that further contributions could be successfully proposed in related dynamic problems. © 2010 Springer Science+Business Media, LLC.","number":"6","year":"2010","title":"DVRP: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic","volume":"16","keywords":"Dynamic vehicle routing problem , Evolutionary algorithms , Heuristic search , Hyper-heuristics","pages":"795-834","doi":"10.1007/s10732-010-9126-2","journal":"Journal of Heuristics","author":[{"propositions":[],"lastnames":["Garrido"],"firstnames":["Pablo","Pablo"],"suffixes":[]},{"propositions":[],"lastnames":["Riff","Rojas"],"firstnames":["Maria","Cristina"],"suffixes":[]}],"bibtex":"@article{10.1007/s10732-010-9126-2,\n abstract = \"In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach, called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper-heuristic is a high-level algorithm, which generates or chooses a set of low-level heuristics in a common framework, to solve the problem at hand. In our collaborative framework, we have included three different types of low-level heuristics: constructive, perturbative, and noise heuristics. Basically, the hyper-heuristic manages and evolves a sophisticated sequence of combinations of these low-level heuristics, which are sequentially applied in order to construct and improve partial solutions, i.e., partial routes. In presenting some design considerations, we have taken into account the allowance of a proper cooperation and communication among low-level heuristics, and as a result, find the most promising sequence to tackle partial states of the (dynamic) problem. Our approach has been evaluated using the Kilby's benchmarks, which comprise a large number of instances with different topologies and degrees of dynamism, and we have compared it with some well-known methods proposed in the literature. The experimental results have shown that, due to the dynamic nature of the hyper-heuristic, our proposed approach is able to adapt to dynamic scenarios more naturally than low-level heuristics. Furthermore, the hyper-heuristic can obtain high-quality solutions when compared with other (meta) heuristic-based methods. Therefore, the findings of this contribution justify the employment of hyper-heuristic techniques in such changing environments, and we believe that further contributions could be successfully proposed in related dynamic problems. © 2010 Springer Science+Business Media, LLC.\",\n number = \"6\",\n year = \"2010\",\n title = \"DVRP: A hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic\",\n volume = \"16\",\n keywords = \"Dynamic vehicle routing problem , Evolutionary algorithms , Heuristic search , Hyper-heuristics\",\n pages = \"795-834\",\n doi = \"10.1007/s10732-010-9126-2\",\n journal = \"Journal of Heuristics\",\n author = \"Garrido, Pablo Pablo and Riff Rojas, Maria Cristina\"\n}\n\n","author_short":["Garrido, P. P.","Riff Rojas, M. C."],"key":"10.1007/s10732-010-9126-2","id":"10.1007/s10732-010-9126-2","bibbaseid":"garrido-riffrojas-dvrpaharddynamiccombinatorialoptimisationproblemtackledbyanevolutionaryhyperheuristic-2010","role":"author","urls":{},"keyword":["Dynamic vehicle routing problem","Evolutionary algorithms","Heuristic search","Hyper-heuristics"],"downloads":0},"search_terms":["dvrp","hard","dynamic","combinatorial","optimisation","problem","tackled","evolutionary","hyper","heuristic","garrido","riff rojas"],"keywords":["dynamic vehicle routing problem","evolutionary algorithms","heuristic search","hyper-heuristics"],"authorIDs":[],"dataSources":["mqyNxb9twi6rYAXFv"]}