| Summary: | 碩士 === 東吳大學 === 資訊管理學系 === 99 === The vehicle routing problem with time windows constraints belongs to an optimization problem with large scale, non-linear, and integer solution aggregate constraints. The computational time required for getting the solution becomes longer with the increasing of the problem scale. And hence, the optimum solution cannot be obtained. Currently, the vehicle routing problems mostly focus on the problem of forward logistics and not many studies in reverse logistics have been conducted. In this study, the concept of coloring theory is used to compute the number of the dispatched cars with both time windows and the capacity constraints. The objective is to find the approximated number of cars for vehicle routing problem by utilizing coloring algorithm.
|
|---|
