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
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...
Routing Security in Wireless Sensor Networks
Routing Security in Wireless Sensor Networks
Since routing is a fundamental operation in all types of networks, ensuring routing security is a necessary requirement to guarantee the success of routing operation. Securing rout...
Hybrid Optimization Algorithm for Multi-level Image Thresholding Using Salp Swarm Optimization Algorithm and Ant Colony Optimization
Hybrid Optimization Algorithm for Multi-level Image Thresholding Using Salp Swarm Optimization Algorithm and Ant Colony Optimization
The process of identifying optimal threshold for multi-level thresholding in image segmentation is a challenging process. An efficient optimization algorithm is required to find th...
Integration of Kalman Filter with Ant Colony Optimization for Solving the Job Shop Scheduling Problem
Integration of Kalman Filter with Ant Colony Optimization for Solving the Job Shop Scheduling Problem
Abstract
In smart manufacturing, the job-shop scheduling problem (JSP) is a major obstacle that must be solved by the best possible sequencing of task operations. Dynamic j...
A new method for robot path planning based on double-starting point ant colony algorithm
A new method for robot path planning based on double-starting point ant colony algorithm
Due to the problems of insufficient search accuracy and easy to fall into local extreme values, too many iterations, and single solution goals in the global path planning of real e...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
Modeling Hybrid Metaheuristic Optimization Algorithm for Convergence Prediction
The project aims at the design and development of six hybrid nature inspired algorithms based on Grey Wolf Optimization algorithm with Artificial Bee Colony Optimization algorithm ...
A declarative approach for AGVs modeling and cyclic scheduling
A declarative approach for AGVs modeling and cyclic scheduling
In this paper, we deal with the cyclic scheduling problem usually observed in the FMS producing multi-type parts where the AGVS plays a role of a material handling system. Finding ...