Effective solutions for the split delivery vehicle routing problem with time windows

Harmanani, Haidar; Helal, Nathalie

Effective solutions for the split delivery vehicle routing problem with time windows

Harmanani, Haidar; Helal, Nathalie

URL: https://www.researchgate.net/profile/Haidar_Harmanani/publication/261251915_Effective_Solutions_for_the_Split_Delivery_Vehicle_Routing_Problem_with_Time_Windows/links/0f317533b374c23a6c000000.pdf

Date: 2017-03-28

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

The Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) is a variation of the vehicle routing problem (VRP) that incorporates time windows and split delivery constraints. The VRP is a generalization of the traveling salesman problem, and was initially proposed in order to find the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. In this paper, we present an efficient method for solving the SDVRPTW using simulated annealing. Experimental results are presented and favorable results comparisons are reported.

Citation:

Helal, N., & Harmanani, H. (2014). Effective solutions for the split delivery vehicle routing problem with time windows. In 29th International Conference on Computers and Their Applications, CATA (pp. 315-320).