3 0 0 0 OA 個別輸送システムにおける2重待ち行列の解析と合流制御戦略
- 著者
- 曹 凱 松田 隆太 矢野 陽平 浜松 芳夫
- 出版者
- 一般社団法人 電気学会
- 雑誌
- 電気学会論文誌D(産業応用部門誌) (ISSN:09136339)
- 巻号頁・発行日
- vol.125, no.6, pp.645-651, 2005 (Released:2005-09-01)
- 参考文献数
- 11
- 被引用文献数
- 2
This paper deals with a merging section of Personal Rapid Transit system. Several schemes have been proposed for the control of vehicles in PRT systems. In quasi-synchronous control systems, one flow of traffic must form a queue at a merging section in order to avoid the collision of vehicles. In other words, a queue is formed on one of the lines, which is called the sub line; the other line is called the main line. Basically, vehicles on the main line have priority. We propose a control strategy whereby vehicles on the main line are usually not stopped; vehicles on the main line are only stopped when the number of waiting vehicles on the sub line exceeds some specific number. Therefore, queues are formed on the main line and the sub line, respectively. This paper presents a fundamental discussion of the effects of the double queue and the relationship between traffic density and the behavior of traffic.
1 0 0 0 OA 巡回セールスマン問題に対するヒューリスティック解法
- 著者
- 星野 貴弘 浜松 芳夫
- 雑誌
- 研究報告 高度交通システム(ITS)
- 巻号頁・発行日
- vol.2011-ITS-46, no.3, pp.1-4, 2011-09-21
In this study, we propose an algorithm based on convex hull insertion (CHI) method for the traveling salesman problem (TSP). CHI method and proposed algorithm construct solutions by inserting city to a partial tour. Proposed algorithm is an improvement of insertion procedure in CHI method. This algorithm sets a threshold of the angle between the route from the inserted city to next city and the route from the inserted city to previous city. The city of the maximum angle is inserted, if there are angles being greater than a threshold. Insertion procedure is changed, if there is no angle being greater than a threshold. In order to evaluate the accuracy of solutions obtained using the algorithm, the proposed algorithm and CHI method are applied to 19 benchmark problems: 51-783 city problem in TSPLIB 95. As a result, proposed algorithm nds shorter tours than CHI in 16 problems.