English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14409885      Online Users : 34
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 工學院  > 工業工程與工程管理學系 > 期刊論文 >  An algorithm for routeing control of a tandem automated guided vehicle system

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/41706

    Title: An algorithm for routeing control of a tandem automated guided vehicle system
    Authors: J. T. Lin;P.-K. Dgen
    教師: 林則孟
    Date: 1994
    Publisher: Taylor & Francis
    Relation: International Journal of Production Research, Volume 32, Issue 12, December 1994, pages 2735 - 2750
    Keywords: automatic guided vehicles
    Abstract: © 1994 Taylor & Francis - A tandem AGV (automated guided vehicle) system is composed of several non-overlapping closed loops. Stations within each loop are served by a single dedicated vehicle. The transit area located between two adjacent loops serves as an interface and allows loads to be transferred from one loop to another. If a load needs to be delivered to a station not located within the same loop, the load needs more than one vehicle to carry it to its destination. We regard this routeing problem as a problem of finding the shortest travel time. After a command to deliver a load is issued, finding a route from the source to the destination as rapidly as possible without disrupting other active travel schedules was the objective of this study. A task-list time-window algorithm to find a shortest travel time based on the current status to route a load from point A to point B is presented. Two idle-vehicle managements are considered: circulating (CIRC) and STAY policies. Experiments showed that the STAY policy is more efficient than the CIRC policy in routeing control.
    URI: http://www.tandf.co.uk/journals/default.asp
    Appears in Collections:[工業工程與工程管理學系] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback