A hyper-heuristic framework for solving the delivery problem with time windows
by Hiba Yahyaoui; Saoussen Krichen; Abdelkader Dekdouk
International Journal of Services and Operations Management (IJSOM), Vol. 33, No. 4, 2019

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.

Online publication date: Tue, 13-Aug-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com