A hyper-heuristic approach for the PDPTW

Le résumé fourni par la source

The one-to-one pickup and delivery problem with time-windows (PDPTW) is one of the most important problems in Operations Research (OR). In this problem a set of goods need to be transported in a given time-window with a fleet of vehicles. The pickup and delivery problem is one of the most challenging and important combinatorial optimisation problems as it has many real-world applications. Selection hyper-heuristics that learn heuristic utility during optimisation have been successfully applied to a variety of different optimisation problems including those in OR. In this paper we investigate the application of a sequence-based selection hyper-heuristic to the one-to-one, static and deterministic variant of the pickup and delivery problem with time-windows and will compare the results against two well known approaches in the Adaptive Large Neighbourhood Search and Grouping Genetic Algorithm.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.