An ant colony-based algorithm for finding the shortest bidirectional path for automated guided vehicles in a block layout

被引：8
|
作者：
Mahdi Hamzheei
Reza Zanjirani Farahani
Hannaneh Rashidi-Bajgan
机构：
[1] University of Wisconsin,Department of Industrial and System Engineering
[2] Kingston University,Department of Informatics and Operations Management, Kingston Business School
[3] Islamic Azad University,Young Researchers Club, Karaj Branch
来源：
The International Journal of Advanced Manufacturing Technology | 2013年 / 64卷
关键词：
Bidirectional path; Automated guided vehicle; Block layout; Ant colony system; Branch-and-cut method;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper considers the shortest path design problem (SPDP) on bidirectional path topology as one of the best known types of network configurations for automated guided vehicles. An integer linear programming model has been developed to solve the problem. The model intends to minimize the length of the path, which needs to cover all cells at least in one edge. Due to the NP-hardness of the problem, which has been proved previously, this model is only able to solve problems with a small number of cells. So we develop an ant colony system (ACS) algorithm to solve the problem. Comparisons of the designed algorithm with a cutting-plane algorithm show the efficiency of the proposed ACS algorithm for this SPDP.
引用
收藏
页码：399 / 409
页数：10
相关论文
共 50 条
  • [1] An ant colony-based algorithm for finding the shortest bidirectional path for automated guided vehicles in a block layout
    Hamzheei, Mahdi
    Farahani, Reza Zanjirani
    Rashidi-Bajgan, Hannaneh
    [J]. International Journal of Advanced Manufacturing Technology, 2013, 64 (1-4): : 399 - 409
  • [2] An ant colony-based algorithm for finding the shortest bidirectional path for automated guided vehicles in a block layout
    Hamzheei, Mahdi
    Farahani, Reza Zanjirani
    Rashidi-Bajgan, Hannaneh
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (1-4): : 399 - 409
  • [3] Parallel Ant Colony Optimization Algorithm for Finding the Shortest Path for Mountain Climbing
    Alhenawi, Esra'a
    Abu Khurma, Ruba
    Sharieh, Ahmad A.
    Al-Adwan, Omar
    Al Shorman, Areej
    Shannaq, Fatima
    [J]. IEEE ACCESS, 2023, 11 : 6185 - 6196
  • [4] Congested Traffic Based on Ant Colony Algorithm for Shortest Path Algorithm
    Yang Haoxiong
    Hu Yang
    [J]. 2015 INTERNATIONAL CONFERENCE ON LOGISTICS, INFORMATICS AND SERVICE SCIENCES (LISS), 2015,
  • [5] A dynamic shortest path algorithm based on an improved ant colony algorithm
    Zhang, S. J.
    [J]. 2018 INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SCIENCE AND APPLICATION TECHNOLOGY, 2019, 1168
  • [6] A Hybrid Genetic and Ant Colony Algorithm for Finding the Shortest Path in Dynamic Traffic Networks
    Zhang S.
    Zhang Y.
    [J]. Zhang, Shuijian (zsj_south@sohu.com), 2018, Pleiades journals (52) : 67 - 76
  • [7] Parallel Ant Colony Algorithm for Shortest Path Problem
    Katona, Geza
    Lenart, Balazs
    Juhasz, Janos
    [J]. PERIODICA POLYTECHNICA-CIVIL ENGINEERING, 2019, 63 (01): : 243 - 254
  • [8] A NEURAL ALGORITHM FOR FINDING THE SHORTEST FLOW PATH FOR AN AUTOMATED GUIDED VEHICLE SYSTEM
    CHUNG, YK
    FISCHER, GW
    [J]. IIE TRANSACTIONS, 1995, 27 (06) : 773 - 783
  • [9] THREE-PHASE QUBITS-BASED QUANTUM ANT COLONY OPTIMIZATION ALGORITHM FOR PATH PLANNING OF AUTOMATED GUIDED VEHICLES
    Li, Junjun
    Xu, Bowei
    Yang, Yongsheng
    Wu, Huafeng
    [J]. INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2019, 34 (02): : 156 - 163
  • [10] A Modified Ant Colony Algorithm to Solve the Shortest Path Problem
    Yuan, Yabo
    Liu, Yi
    Wu, Bin
    [J]. 2014 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTERNET OF THINGS (CCIOT), 2014, : 148 - 151
12345