An iterated local search heuristic for the split delivery vehicle routing problem
نویسندگان
چکیده
منابع مشابه
An iterated local search heuristic for the split delivery vehicle routing problem
This paper concerns the Split Delivery Vehicle Routing Problem (SDVRP). This problem is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) since the customers’ demands are allowed to be split. We deal with the cases where the fleet is unlimited (SDVRP-UF) and limited (SDVRP-LF). In order to solve them, we implemented a multi-start Iterated Local Search (ILS) based heuristic that inc...
متن کاملAn Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP is N P-hard since it is a generalization of the classical Vehicle Routing Problem (VRP), in which clients are served by a heterogeneous fleet of vehicles with distinct capacities and costs. The objective is to design a set of routes in such a way that the sum of the costs is minimized. The proposed algorith...
متن کاملA Construction Heuristic for the Split Delivery Vehicle Routing Problem
The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favora...
متن کاملAn Efficient Iterated Local Search Algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
This paper deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). A procedure based on the Iterated Local Search (ILS) metaheuristic that uses the Variable Neighborhood Descent (VND) method for performing the local search is proposed. According to literature, the most successful algorithms for the VRPSPD are pure or hybrid versions of the Tabu Search metaheuristi...
متن کاملA Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem
The Split Delivery Vehicle Routing Problem (SDVRP) is a variant of the classical Capacitated Vehicle Routing Problem where multiple visits to each customer are allowed. It is an NP-hard problem where exact solutions are difficult to obtain in a reasonable time. This paper shows a tabu search heuristic with granular neighborhood called Randomized Granular Tabu Search that uses a tabu search tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2015
ISSN: 0305-0548
DOI: 10.1016/j.cor.2014.08.005