A matheuristic approach for the split delivery vehicle routing  problem: an efficient set covering-based model with guided route  generation schemes

Nurul Huda Mohamed

QR Code Link :
Type :	article
Subject :	Q Science (General)
Main Author :	Nurul Huda Mohamed
Additional Authors :	Said Salhi Gabor Nagy Nurul Akmal Mohamed
Title :	A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes

Place of Production :	Tanjong Malim
Publisher :	Fakulti Sains dan Matematik
Year of Publication :	2019
Corporate Name :	Universiti Pendidikan Sultan Idris

Abstract : Universiti Pendidikan Sultan Idris

The split delivery vehicle routing problem (SDVRP) is a relaxed version of the classical VRP where customers can be visited more than once. The SDVRP is also applicable for problems where one or more of the customers require a demand larger than the vehicle capacity. Constructive heuristics adapted from the parallel savings and the sweep methods are first proposed to generate a set of solutions which is then used in the new and more efficient set covering-based formulation which we put forward. An effective repair mechanism to remedy any infeasibility due to the set covering problem is presented. A reduced set of promising routes is used in our model, instead of the original set of routes, proposing and using well defined reduction schemes. This set covering-based approach is tested on large datasets from the literature with encouraging results. In brief, seven best solutions including ties are found among the 137 SDVRP instances.

This material may be protected under Copyright Act which governs the making of photocopies or reproductions of copyrighted materials.
You may use the digitized material for private study, scholarship, or research.

Back to previous page