This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.
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
Yusuke MORIHIRO, Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, "Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 11, pp. 3229-3236, November 2008, doi: 10.1093/ietfec/e91-a.11.3229.
Abstract: This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.11.3229/_p
Copy
@ARTICLE{e91-a_11_3229,
author={Yusuke MORIHIRO, Toshiyuki MIYAMOTO, Sadatoshi KUMAGAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method},
year={2008},
volume={E91-A},
number={11},
pages={3229-3236},
abstract={This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.},
keywords={},
doi={10.1093/ietfec/e91-a.11.3229},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3229
EP - 3236
AU - Yusuke MORIHIRO
AU - Toshiyuki MIYAMOTO
AU - Sadatoshi KUMAGAI
PY - 2008
DO - 10.1093/ietfec/e91-a.11.3229
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2008
AB - This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.
ER -