Resolving Vehicle Routing Problem for Reverse Logistics using Edge Coloring
碩士 === 東吳大學 === 資訊科學系 === 96 === The vehicle routing problem with time windows constraints belongs to an optimization problem with a constraint assembly of large scale, nonlinear and mixed-integer, and while the problem scale is becoming larger, the operating time needed for a solution is becoming l...
Main Authors: | Yi-Xiang Liao, 廖翌翔 |
---|---|
Other Authors: | Wei-Min Jeng |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/10614347090410814864 |
Similar Items
-
The Rough Set Based Approach to Resolving Routing problem for Multistage Reverse Logistic
by: Pin-Hao Chen, et al.
Published: (2009) -
Reverse Logistics Vehicle Routing Optimization Problem Based on Multivehicle Recycling
by: Zhaohui Gao, et al.
Published: (2021-01-01) -
On resolving edge colorings in graphs
by: Varaporn Saenpholphat, et al.
Published: (2003-01-01) -
Static Vehicle Routing Problem for Logistics
by: Shau-Chiang Yu, et al.
Published: (2008) -
USING THE VEHICLE ROUTING PROBLEM (VRP) TO PROVIDE LOGISTICS SOLUTIONS IN AGRICULTURE
by: Seyyedhasani, Hasan
Published: (2017)