主 講 人：官大智 教授 (中山大學應用數學系)

講 題：Multiple Capacity Vehicle Routing on Paths

時 間：86年 5月31日(星期六) 10:00~12:00

地 點：國立中山大學理4009-1教室

茶 會：上午11:00於理4010室

Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest tour for the vehicle to transport all objects from their initial vertices to their destination vertices is called the The problem is the vehicle can handle more than one objects at a time. The problem is if objects can be unloaded at the intermediate vertices. In this talk, I will present an time algorithms for multiple capacity preemptive vehicle routing problem on paths, where is the number of objects to be moved and is the number of vertices in the path.

報名方式：現場報名

連 絡 人：朱緒鼎 (07) 525-2000轉3827 zhu@math.nsysu.edu.tw

主辦單位：國立中山大學應用數學系

協辦單位：國科會數學研究推動中心