Modified clarke wright algorithms for solving the realistic vehicle routing problem
The Vehicle Routing Problem (VRP) is a well-known management problem in large enterprises' logistic departments; in fact, it is classified as a combinatorial problem, where customers of known demands are supplied by one or several depots. Several realistic constraints are related to the vehicle...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | conferenceObject |
| منشور في: |
2015
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/11304 https://doi.org/10.1109/TAEECE.2015.7113606 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/7113606 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|