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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | 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 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | 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. |
|---|