Effective solutions for the split delivery vehicle routing problem with time windows
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 opt...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5446 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.researchgate.net/profile/Haidar_Harmanani/publication/261251915_Effective_Solutions_for_the_Split_Delivery_Vehicle_Routing_Problem_with_Time_Windows/links/0f317533b374c23a6c000000.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|