A BRANCH-AND-BOUND ALGORITHM FOR FLOW-PATH DESIGN OF AUTOMATED GUIDED VEHICLE SYSTEMS

被引：0
|
作者：
VENKATARAMANAN, MA
WILSON, KA
机构：
[1] Department of Decision and Information Systems, Indiana University, Bloomington, Indiana
来源：
NAVAL RESEARCH LOGISTICS | 1991年 / 38卷 / 03期
关键词：
D O I：
10.1002/1520-6750(199106)38:3<431::AID-NAV3220380311>3.0.CO;2-C
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
An algorithm for determining the optimal, unidirectional flow path for an automated guided vehicle system with a given facility layout is presented. The problem is formulated as an integer program. The objective is to minimize the total distance traveled by vehicles subject to the constraint that the resulting network consists of a single strongly connected component. A specialized branch-and-bound solution procedure is discussed in detail.
引用
收藏
页码：431 / 445
页数：15
相关论文
共 50 条
  • [1] FLOW PATH DESIGN FOR AUTOMATED GUIDED VEHICLE SYSTEMS
    GASKINS, RJ
    TANCHOCO, JMA
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1987, 25 (05) : 667 - 676
  • [2] Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems
    Yoonho Seo
    Chulung Lee
    Chiung Moon
    OR Spectrum, 2007, 29 : 471 - 487
  • [3] Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems
    Seo, Yoonho
    Lee, Chulung
    Moon, Chiung
    OR SPECTRUM, 2007, 29 (03) : 471 - 487
  • [4] Fuzzy branch-and-bound algorithm for flow shop scheduling
    İzzettİn Temİz
    Serpİl Erol
    Journal of Intelligent Manufacturing, 2004, 15 : 449 - 454
  • [5] Fuzzy branch-and-bound algorithm for flow shop scheduling
    Temiz, I
    Erol, S
    JOURNAL OF INTELLIGENT MANUFACTURING, 2004, 15 (04) : 449 - 454
  • [6] A Branch-and-Bound Algorithm for Concave Network Flow Problems
    Dalila B. M. M. Fontes
    Eleni Hadjiconstantinou
    Nicos Christofides
    Journal of Global Optimization, 2006, 34 : 127 - 155
  • [7] A Branch-and-Bound algorithm for concave Network Flow Problems
    Fontes, DBMM
    Hadjiconstantinou, E
    Christofides, N
    JOURNAL OF GLOBAL OPTIMIZATION, 2006, 34 (01) : 127 - 155
  • [8] A reduced dimension branch-and-bound algorithm for molecular design
    Ostrovsky, GM
    Achenie, LEK
    Sinha, M
    COMPUTERS & CHEMICAL ENGINEERING, 2003, 27 (04) : 551 - 567
  • [9] BRANCH-AND-BOUND ALGORITHM FOR PAGINATION
    DUNCAN, J
    SCOTT, LW
    OPERATIONS RESEARCH, 1975, 23 (02) : 240 - 259
  • [10] Guided dive for the spatial branch-and-bound
    Gerard, D.
    Koppe, M.
    Louveaux, Q.
    JOURNAL OF GLOBAL OPTIMIZATION, 2017, 68 (04) : 685 - 711
12345