| Summary: | 博士 === 國立中央大學 === 資訊管理研究所 === 92 === Time window has been a common form of time constraint extensively considered in the literature. Basically, a time window is a time period, defined by the earliest and latest times, when a node is ready for traveling through. Although many variants of transportation problem in time-window networks have been proposed, none of them considers the possibility that time windows may be associated with the moving travelers or vehicles who travel only in these time periods.
In this dissertation, a new variant of time-window constraint, we call it body clock constraint, is proposed at first. We assume that each vehicle has its own body clock and a capacity limitation on carrying goods, and we are trying to determine a minimal time schedule for sending a certain amount of goods from source to destination in a time-window network. The problem is studied by two cases, the first case considers single vehicle scheduling while the second one discusses multiple vehicles. Two different algorithms are presented to find the optimum schedule for each of the two cases.
Secondly, to plan and select a path under a constraint on the latest entering time at the destination node, we propose a systematic method to generate time information of the paths and nodes on a time-window network. Algorithms are proposed to generate various time characteristics of the nodes, including the earliest and latest times of arriving at, entering, and departing from each node on the network. Using the basic time characteristics, we identify inaccessible nodes that cannot be included in a feasible path. Concurrently, we evaluate the flexibilities of accessible nodes in the waiting time and staying time. We also propose a method to measure adverse effects when including an arc. Based on the time characteristics and the proposed analysis schemes, we develop an algorithm for finding the most flexible path in a time-window network.
We then extend the time window network to include body clock with traveler. Time characteristics of nodes and arcs are generated similarly. The flexibility and inaccessibility analyses of nodes and arcs are also discussed. Similarly, we provide an algorithm to find the most flexible path in this time-window network with traveler’s body clock.
|
|---|
