The authors propose a method to make a movement plan for relocation of the railway cars in preparation for the final assembly. It obtains solution through three steps. The first step is to extract the order constraints between the movements of the railway cars based on their locations before and after relocation. The second step is to introduce the movement which puts a railway car into another location temporarily, in order to avoid a deadlock in the movements. And the final step is to obtain the movement order for carrying out the relocation in the shortest time in accordance with the calculated order constraints by using the genetic algorithm (GA). The order constraints are resolved in advance and therefore the movement order can easily be decided by GA. As the result, the developed system takes time shorter than an expert for planning the relocation.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Yoichi NAGAO, Shinichi NAKANO, Akifumi HOSHINO, Yasushi KANETA, Toshiyuki KITA, Masakazu OKAMOTO, "A Relocation Planning Method for Railway Cars in Final Assembly Shop" in IEICE TRANSACTIONS on Fundamentals,
vol. E96-A, no. 2, pp. 554-561, February 2013, doi: 10.1587/transfun.E96.A.554.
Abstract: The authors propose a method to make a movement plan for relocation of the railway cars in preparation for the final assembly. It obtains solution through three steps. The first step is to extract the order constraints between the movements of the railway cars based on their locations before and after relocation. The second step is to introduce the movement which puts a railway car into another location temporarily, in order to avoid a deadlock in the movements. And the final step is to obtain the movement order for carrying out the relocation in the shortest time in accordance with the calculated order constraints by using the genetic algorithm (GA). The order constraints are resolved in advance and therefore the movement order can easily be decided by GA. As the result, the developed system takes time shorter than an expert for planning the relocation.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E96.A.554/_p
Copy
@ARTICLE{e96-a_2_554,
author={Yoichi NAGAO, Shinichi NAKANO, Akifumi HOSHINO, Yasushi KANETA, Toshiyuki KITA, Masakazu OKAMOTO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Relocation Planning Method for Railway Cars in Final Assembly Shop},
year={2013},
volume={E96-A},
number={2},
pages={554-561},
abstract={The authors propose a method to make a movement plan for relocation of the railway cars in preparation for the final assembly. It obtains solution through three steps. The first step is to extract the order constraints between the movements of the railway cars based on their locations before and after relocation. The second step is to introduce the movement which puts a railway car into another location temporarily, in order to avoid a deadlock in the movements. And the final step is to obtain the movement order for carrying out the relocation in the shortest time in accordance with the calculated order constraints by using the genetic algorithm (GA). The order constraints are resolved in advance and therefore the movement order can easily be decided by GA. As the result, the developed system takes time shorter than an expert for planning the relocation.},
keywords={},
doi={10.1587/transfun.E96.A.554},
ISSN={1745-1337},
month={February},}
Copy
TY - JOUR
TI - A Relocation Planning Method for Railway Cars in Final Assembly Shop
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 554
EP - 561
AU - Yoichi NAGAO
AU - Shinichi NAKANO
AU - Akifumi HOSHINO
AU - Yasushi KANETA
AU - Toshiyuki KITA
AU - Masakazu OKAMOTO
PY - 2013
DO - 10.1587/transfun.E96.A.554
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E96-A
IS - 2
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - February 2013
AB - The authors propose a method to make a movement plan for relocation of the railway cars in preparation for the final assembly. It obtains solution through three steps. The first step is to extract the order constraints between the movements of the railway cars based on their locations before and after relocation. The second step is to introduce the movement which puts a railway car into another location temporarily, in order to avoid a deadlock in the movements. And the final step is to obtain the movement order for carrying out the relocation in the shortest time in accordance with the calculated order constraints by using the genetic algorithm (GA). The order constraints are resolved in advance and therefore the movement order can easily be decided by GA. As the result, the developed system takes time shorter than an expert for planning the relocation.
ER -