A hyper-heuristic framework for solving the delivery problem with time windows

Hiba Yahyaoui, Saoussen Krichen and Abdelkader Dekdouk

International Journal of Services and Operations Management, 2019, vol. 33, issue 4, 529-544

Abstract: We address in this paper a delivery process with time requirements in the supply chain stated as follows: orders launched from customers are centralised and assigned to firms' depots for the delivery process. The consideration of a depot and a set of customers belonging to different firms are seen as a VRPTW that serves n customers using a subset of vehicles. We implement in this paper a DSS that handles the delivering activity in the supply chain. The DSS embeds a GRASP and genetic components for generating promising solution in a concurrently run time. In addition we proposed a V NSH-based hyper-heuristic that tries to select the most accurate neighbourhood at each iteration to apply according to its previous performance. Simulation results are conducted on Solomon's benchmarks. The DSS recorded very competitive results regarding state-of-the-art approaches.

Keywords: hybrid genetic algorithm; variable neighbourhood search; VRPTW; hyper-heuristic. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=101580 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijsoma:v:33:y:2019:i:4:p:529-544

Access Statistics for this article

More articles in International Journal of Services and Operations Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().