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

被引：21

作者：

Hamzheei, Mahdi ^{[1
]}

Farahani, Reza Zanjirani ^{[2
]}

Rashidi-Bajgan, Hannaneh ^{[3
]}

机构：

[1] Univ Wisconsin, Dept Ind & Syst Engn, Madison, WI USA

[2] Univ Kingston, Dept Informat & Operat Management, Kingston Business Sch, London, England

[3] Islamic Azad Univ, Karaj Branch, Alborz, Iran

来源：

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2013年 / 64卷 / 1-4期

关键词：

Bidirectional path; Automated guided vehicle; Block layout; Ant colony system; Branch-and-cut method; FLOW-PATH; NETWORK DESIGN; EFFICIENT METHOD; P/D STATIONS; TABU SEARCH; LOOP; OPTIMIZATION; SYSTEMS; LOCATION; DEADLOCK;

D O I：

10.1007/s00170-012-3999-1

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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

页数：11

共 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
Farahani, R.Z. (zanjiranireza@gmail.com), 1600, Springer London (64): : 1 - 4
[2] An ant colony-based algorithm for finding the shortest bidirectional path for automated guided vehicles in a block layout
Mahdi Hamzheei
Reza Zanjirani Farahani
Hannaneh Rashidi-Bajgan
The International Journal of Advanced Manufacturing Technology, 2013, 64 : 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
IEEE ACCESS, 2023, 11 : 6185 - 6196
[4] Congested Traffic Based on Ant Colony Algorithm for Shortest Path Algorithm
Yang Haoxiong
Hu Yang
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.
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.
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
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
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
INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2019, 34 (02): : 156 - 163
[10] Approach to Find Shortest Path Using Ant Colony Algorithm
Basha, Mudasar
Kumar, M. Siva
Pranav, Vemulapalli Sai
Rehman, B. Khaleelu
INTELLIGENT COMMUNICATION, CONTROL AND DEVICES, ICICCD 2017, 2018, 624 : 1243 - 1252

← 1 2 3 4 5 →