Abstract
This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP results in a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). As an approach to this problem, a cooperative algorithm with autonomous distributed agents has been proposed. The algorithm is able to plan deadlock-free routes even though the buffer capacity is less, but includes reformability at the point that computation time of that case increases drastically. This paper proposes an initial task assignment method to reduce computation time on planning routes. Results of computational experiments show effectiveness of the proposed method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
