Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
A Guided Ant Colony Optimization Algorithm for Conflict-free Routing Scheduling of AGVs Considering Waiting Time
View through CrossRef
<p>Efficient conflict-free routing scheduling of automated guided vehicles (AGVs) in automated logistic systems can improve delivery time, prevent delays, and decrease handling cost. Once potential conflicts present themselves on their road ahead, AGVs may wait for a while until the potential conflicts disappear besides altering their routes. Therefore, AGV conflict-free routing scheduling involves making routing and waiting time decisions simultaneously. This work constructs a conflict-free routing scheduling model for AGVs with consideration of waiting time. The process of the model is based on calculation of the travel time and conflict analysis at the links and nodes. A guided ant colony optimization (GACO) algorithm, in which ants are guided to avoid conflicts by adding a guidance factor to the state transition rule, is developed to solve the model. Simulations are conducted to validate the effectiveness of the model and the solution method.</p>
Institute of Advanced Engineering and Science
Title: A Guided Ant Colony Optimization Algorithm for Conflict-free Routing Scheduling of AGVs Considering Waiting Time
Description:
<p>Efficient conflict-free routing scheduling of automated guided vehicles (AGVs) in automated logistic systems can improve delivery time, prevent delays, and decrease handling cost.
Once potential conflicts present themselves on their road ahead, AGVs may wait for a while until the potential conflicts disappear besides altering their routes.
Therefore, AGV conflict-free routing scheduling involves making routing and waiting time decisions simultaneously.
This work constructs a conflict-free routing scheduling model for AGVs with consideration of waiting time.
The process of the model is based on calculation of the travel time and conflict analysis at the links and nodes.
A guided ant colony optimization (GACO) algorithm, in which ants are guided to avoid conflicts by adding a guidance factor to the state transition rule, is developed to solve the model.
Simulations are conducted to validate the effectiveness of the model and the solution method.
</p>.
Related Results
METAPHORICAL REPRESENTATION OF THE CONCEPT CONFLICT IN AMERICAN AND BRITISH POLITICAL DISCOURSE (BASED ON IMAGE METAPHORS)
METAPHORICAL REPRESENTATION OF THE CONCEPT CONFLICT IN AMERICAN AND BRITISH POLITICAL DISCOURSE (BASED ON IMAGE METAPHORS)
The article is devoted to the metaphorical representation of the concept CONFLICT in the English-language political discourse, namely American and British. The figurative content o...
Integrated Scheduling Method for Flexible Square Part Processing Machines and AGVs based on the Two-Stage GP Algorithm
Integrated Scheduling Method for Flexible Square Part Processing Machines and AGVs based on the Two-Stage GP Algorithm
With the accelerated transition towards intelligent manufacturing, research on the integrated scheduling of machines and AGVs in a flexible square parts processing workshop is esse...
Intelligent Path Control of Autonomous Agvs Using Reinforcement Learning Approach for Flexible Manufacturing Industries (Fms)
Intelligent Path Control of Autonomous Agvs Using Reinforcement Learning Approach for Flexible Manufacturing Industries (Fms)
In the automated manufacturing industry, material handling and transportation are carried out using automated guided vehicles (AGVs) to improve production efficiency and accuracy. ...
An ant colony algorithm for job shop scheduling problem with tool flow
An ant colony algorithm for job shop scheduling problem with tool flow
In this article, we present a developed bidirectional convergence ant colony algorithm to solve the integrated job shop scheduling problem with tool flow in flexible manufacturing ...
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Analisa dan Perbandingan Kinerja Routing Protocol OSPF dan EIGRP dalam Simulasi GNS3
Router is the network equipment for route the packet from one network segment to another in a bigscale network. Router can route packet because there is a routing table in router c...
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Analisa Perbandingan Kinerja Protokol Routing Rip Dan Ospf Menggunakan IPv4
Abstrak - Penelitian bertujuan untuk dapat membandingkan kinerja protokol routing RIP dan OSPF menggunakan IPv4 bertujuan untuk dapat melakukan perbaingan dua metode touting yaitu ...
Comparison of Ant Colony Optimization Algorithms for Routing Problems in Ad Hoc Network
Comparison of Ant Colony Optimization Algorithms for Routing Problems in Ad Hoc Network
Mobile ad-hoc network (MANET) is a dynamic wireless network which can have fixed or a variable infrastructure. Nodes have the ability to move randomly and arrange themselves in a h...
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
PENGARUH MODEL JARINGAN TERHADAP OPTIMASI ROUTING OPEN SHORTEST PATH FIRST (OSPF)
ABSTRAK Routing merupakan proses mengirim data dari satu network ke network lain. Dengan dynamic routing maka mekanisme routing dilakukan secara dinamis dengan menentukan jarak ter...