| Summary: | 碩士 === 國立臺灣大學 === 商學研究所 === 96 === This thesis proposed a state-dependent velocity-scheduling (SDVS) problem which tries to optimize travel utilities, such as traffic-time, driving smoothness…etc, by altering the entity’s traveling velocity. The SDVS problem consists of three major physical characteristics: 1) A State-dependent problem, 2) Open-state configuration, 3) Multi-objective optimization. Such characteristics make formal model of SDVS problem to be computational complex, with a high-ordered complexity. Therefore, in this thesis, we propose geometrical representation for the SDVS problem. By adopting the geometrical representation, we discover the inner-state and inter-state behavior of SDVS problem. Based on the geometrical representation, we identify the solution cluster of SDVS problem. Hence, we propose an optimization model and an efficient algorithm (Fast-searching Algorithm, FSA) to solve SDVS problem. Finally, we use a real world data as experiment and get the optimized result as a real world case. The contribution of this thesis is successfully resolve the ambiguity of the SDVS problem as initiative, which can be adopted into GPS guiding system and extended to other state-dependent applications.
|
|---|
