Developing Issues for Ant Colony System Based Approach for Scheduling Problems

2013 ◽  
pp. 119-144
Author(s):  
Ana Madureira ◽  
Ivo Pereira ◽  
Ajith Abraham
Keyword(s):  
Ant Colony ◽  
Ant Colony System ◽  
Scheduling Problems

Research on Production Scheduling Problems in Process Industry Based on Ant Colony System

2010 ◽  
Vol 108-111 ◽  
pp. 519-524
Author(s):  
Lie Ping Zhang ◽  
Yun Sheng Zhang
Keyword(s):  
Production Scheduling ◽  
Stochastic Scheduling ◽  
Ant Colony ◽  
Process Industry ◽  
Process Time ◽  
Ant Colony System ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Process Step ◽  
Scheduling Model

In order to improve the production of process industry, the ant colony system(ACS) was applied to the production scheduling problem. Based on the analysis of the production scheduling problem for process industry, a production scheduling model was established, whose goal was to obtain the shortest total process time. The search strategy, heuristic information rules, pheromone updating mechanism, process step starting time and detailed algorithm implementation of ACS were discussed. Using a practical production scheduling problem as an example, the established model and designed algorithm were applied to implement the scheduling simulation. The simulation results show that the scheduling model and algorithm are feasible, and have a better scheduling performance than the stochastic scheduling method, and can be applied to solve practical production scheduling problem for process industry.

An ant colony system approach for scheduling problems

2003 ◽  
Vol 14 (1) ◽  
pp. 68-75 ◽  
Author(s):  
Kuo-Ching Ying ◽  
Ching-Jong Liao
Keyword(s):  
System Approach ◽  
Ant Colony ◽  
Ant Colony System ◽  
Scheduling Problems

Penerapan Algoritma ACO untuk Penjadwalan Kuliah Pengganti pada Perguruan Tinggi (Studi Kasus: Program Studi Informatika, Universitas Multimedia Nusantara)

2019 ◽  
Vol 9 (2) ◽  
pp. 79-85
Author(s):  
Indah Noviasari ◽  
Andre Rusli ◽  
Seng Hansun
Keyword(s):  
Ant Colony Optimization ◽  
Educational Institution ◽  
Ease Of Use ◽  
Perceived Usefulness ◽  
Ant Colony ◽  
Scheduling Problems ◽  
Perceived Ease Of Use ◽  
Ant Colony Optimization Algorithm ◽  
Scheduling System ◽  
Course Scheduling

Students and scheduling are both essential parts in a higher educational institution. However, after schedules are arranged and students has agreed to them, there are some occasions that can occur beyond the control of the university or lecturer which require the courses to be cancelled and arranged for replacement course schedules. At Universitas Multimedia Nusantara, an agreement between lecturers and students manually every time to establish a replacement course. The agreement consists of a replacement date and time that will be registered to the division of BAAK UMN which then enter the new schedule to the system. In this study, Ant Colony Optimization algorithm is implemented for scheduling replacement courses to make it easier and less time consuming. The Ant Colony Optimization (ACO) algorithm is chosen because it is proven to be effective when implemented to many scheduling problems. Result shows that ACO could enhance the scheduling system in Universitas Multimedia Nusantara, which specifically tested on the Department of Informatics replacement course scheduling system. Furthermore, the newly built system has also been tested by several lecturers of Informatics UMN with a good level of perceived usefulness and perceived ease of use. Keywords—scheduling system, replacement course, Universitas Multimedia Nusantara, Ant Colony Optimization

scholarly journals Path planning for mobile robot using an enhanced ant colony optimization and path geometric optimization

2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110192
Author(s):  
Songcan Zhang ◽  
Jiexin Pu ◽  
Yanna Si ◽  
Lifan Sun
Keyword(s):  
Path Planning ◽  
Convergence Rate ◽  
Mobile Robot ◽  
Local Optimization ◽  
Ant Colony ◽  
Ant Colony System ◽  
Geometric Features ◽  
Robot Path Planning ◽  
Computation Efficiency ◽  
Robot Path

Path planning of mobile robots in complex environments is the most challenging research. A hybrid approach combining the enhanced ant colony system with the local optimization algorithm based on path geometric features, called EACSPGO, has been presented in this study for mobile robot path planning. Firstly, the simplified model of pheromone diffusion, the pheromone initialization strategy of unequal allocation, and the adaptive pheromone update mechanism have been simultaneously introduced to enhance the classical ant colony algorithm, thus providing a significant improvement in the computation efficiency and the quality of the solutions. A local optimization method based on path geometric features has been designed to further optimize the initial path and achieve a good convergence rate. Finally, the performance and advantages of the proposed approach have been verified by a series of tests in the mobile robot path planning. The simulation results demonstrate that the presented EACSPGO approach provides better solutions, adaptability, stability, and faster convergence rate compared to the other tested optimization algorithms.

scholarly journals Suspicious Activity Recognition Using Proposed Deep L4-Branched-ActionNet with Entropy Coded Ant Colony System Optimization

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Tanzila Saba ◽  
Amjad Rehman ◽  
Rabia Latif ◽  
Suliman Mohamed Fati ◽  
Mudassar Raza ◽  
...  
Keyword(s):  
Activity Recognition ◽  
System Optimization ◽  
Ant Colony ◽  
Ant Colony System ◽  
Suspicious Activity
Sign in / Sign up

Export Citation Format

Share Document