ANALYSIS AND OPTIMIZATION FOR AUTOMATED VEHICLE ROUTING ON A SINGLE LOOP(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management)
スポンサーリンク
概要
- 論文の詳細を見る
This paper treats with an automated material handling system called a permutation circulation-type vehicle routing system (denoted PCVRS). In the PCVRS a fleet of vehicles unidirectionally and repeatedly circulate on a single loop to carry items to stations located along by the loop where items are served. No passing is allowed between vehicles on the loop. This may induce interferences or blocking between vehicles which may deteriorate the performance of the PCVRS. One of the most serious interferences is the one lap behind (denoted OLB) interference which occurs when the first vehicle is interfered by the last vehicle in a fleet of vehicles. Once the OLB interference occurs, the system can not reach the steady state in which no interference occur. This paper theoretically analyzes the steady state with no interference and the transient state with interferences including the OLB one. This paper considers both the infinite acceleration and deceleration and the finite ones on the vehicles, and four vehicle routing rules by which each job (and each vehicle) is allocated to a processing station for service. Two of them are existing ones and the other two are newly introduced to improve the existing ones. This paper adopts the throughput and the mean interference time for evaluating the vehicle routing rules. This paper confirms the theoretically obtained results by means of numerical simulation.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Karuno Yoshiyuki
Kyoto Institute of Technology
-
Lu Mingzhe
Dongbei University of Finance & Economics
-
Kise Hiroshi
Kyoto Institute of Technology
-
Lu Mingzhe
Dongbei Finance University
-
Li Juntao
Kyoto Institute Of Technology
-
Kuwata Joe
Murata Machinery Co. Ltd.
関連論文
- AN INAPPROXIMABILITY OF TRANSSHIPMENT PROBLEMS WITH PERMUTABLE TRANSIT VECTORS
- 1A1 COMBINATORIAL OPTIMIZATION PROBLEMS AND ALGORITHMS IN DOUBLE-LAYERED FOOD PACKING EQUIPMENTS
- 3B4 ON OPTIMAL SCHEDULING PROBLEMS FOR PARALLLEL MACHINES WITH A SINGLE SERVER(Technical session 3B : Combinatorics 2)
- BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(the 50th Anniversary of the Operations Research Society of Japan)
- B34 Hardness of Approximating Transshipment Problems with Permutable Transit Vectors(Advanced machining technology)
- ANALYSIS AND OPTIMIZATION FOR AUTOMATED VEHICLE ROUTING ON A SINGLE LOOP(Advanced Planning and Scheduling for Supply Chain Management)
- 2-B-5 A HEURISTIC ALGORITHM FOR OPERATING A PERMUTATIONAL CIRCULATION-TYPE VEHICLE ROUTING SYSTEM
- A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
- OPTIMAL SCHEDULING FOR AN AUTOMATED m-MACHINE FLOWSHOP
- OPTIMIZATION IN PRODUCTION SYSTEMS: A SURVEY ON QUEUING APPROACHES
- CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS