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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have