A selection hyper-heuristic for scheduling deliveries of ready-mixed concrete
Mustafa Mısır, Wim Vancroonenburg, Katja Verbeeck, Greet Van den Berghe
Abstract
Mustafa Mısır, Wim Vancroonenburg, Katja Verbeeck, Greet Van den Berghe
Abstract
The existence of several solution strategies for different search and optimisation problems motivates the use of these strategies in a collaborative way. The se collaborative approaches are considered in the context of hybridisation. Hyper-heuristics provide hybridisation by performing search on multiple low-level heuristics for finding efficient solutions i n a problem-independent manner. In this study, a suite of simple moves is employed to solve real world instances of the ready-mixed concrete delivery problem. These basic moves are used under a selection hyper-heuristic that makes use of the new adaptive iteration limited list-based threshold ac cepting with a fixed limit and four others for comparison. These hyper-heuristics are tested on a set of real world ready-mixed concrete delivery problem instances and a performance analysis is carried out.
OpenAlex reports 22 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The existence of several solution strategies for different search and optimisation problems motivates the use of these strategies in a collaborative way. The se collaborative approaches are considered in the context of hybridisation. Hyper-heuristics provide hybridisation by performing search on multiple low-level heuristics for finding efficient solutions i n a problem-independent manner. In this study, a suite of simple moves is employed to solve real world instances of the ready-mixed concrete delivery problem. These basic moves are used under a selection hyper-heuristic that makes use of the new adaptive iteration limited list-based threshold ac cepting with a fixed limit and four others for comparison. These hyper-heuristics are tested on a set of real world ready-mixed concrete delivery problem instances and a performance analysis is carried out.
Key concepts: Heuristics, Computer science, Suite, Scheduling (production processes), Heuristic, Selection (genetic algorithm), Mathematical optimization, Time limit