Results 71 to 80 of about 2,660,584 (180)
GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM [PDF]
ICTACT Journal on Soft Computing, 2010 Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem.
P. Mathiyalagan +2 more
doaj
Advances in Mechanical Engineering, 2017 Different optimization algorithms are used in fast medicine dispensing system to improve the efficiency of refilling. To achieve rapid replenishing of the manipulator and improve efficiency in pharmacy automation system.
Hui Jin +4 more
doaj +1 more source
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In a multi‐row facility layout problem (MRFLP), facilities are arranged in more than one row under the limited layout area. Considering different layout factors, various extensions of MRFLP have been modelled. However, the orientation of input/output (I/O) point in a facility, as a key factor that plays a direct impact on flow cost, is seldom ...
Yinan Guo +5 more
wiley +1 more source
Chemical Engineering Transactions, 2018 Exploring structure of parameter prediction model for signal reconstruction fluctuating operation state of chemical machinery equipment based on ant colony algorithm, and optimizing the global performance.
Yuanshao Hou
doaj +1 more source
Path planning of lunar robot based on dynamic adaptive ant colony algorithm and obstacle avoidance
International Journal of Advanced Robotic Systems, 2020 Path planning of lunar robots is the guarantee that lunar robots can complete tasks safely and accurately. Aiming at the shortest path and the least energy consumption, an adaptive potential field ant colony algorithm suitable for path planning of lunar ...
Shinan Zhu +3 more
doaj +1 more source
Building Blocks as Experiences in Dynamic Capacitated Arc Routing Problems
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The dynamic capacitated arc routing problem (DCARP) aims to update the service paths of vehicles in the capacitated arc routing problem when uncertain factors deteriorate the current schedule of vehicles' services. A DCARP scenario comprises a series of DCARP instances that share similarities with each other. Therefore, optimisation experience
Hao Tong +4 more
wiley +1 more source
Toward Optimization of AGV Path Planning: An RRT*-ACO Algorithm
IEEE AccessAutomated guided vehicle (AGV) smart parking provides a new solution to solve the problem of urban parking difficulties. In the AGV parking lot, whether the AGV running path is reasonable affects the transportation efficiency of the entire parking lot ...
Wenjuan Wang +4 more
doaj +1 more source
cAnt-Miner: an ant colony classification algorithm to cope with continuous attributes [PDF]
, 2008 This paper presents an extension to Ant-Miner, named cAnt-Miner (Ant-Miner coping with continuous attributes), which incorporates an entropy-based discretization method in order to cope with continuous attributes during the rule construction process.
Otero, Fernando E.B. +5 more
core +1 more source
Improving the Interpretability of Classification Rules Discovered by an Ant Colony Algorithm: Extended Results [PDF]
, 2016 The vast majority of Ant Colony Optimization (ACO) algorithms for inducing classification rules use an ACO-based procedure to create a rule in an one-at-a-time fashion. An improved search strategy has been proposed in the cAnt-MinerPB algorithm, where an
Otero, Fernando E.B., Freitas, Alex A.
core +1 more source
Automatic MGA trajectory planning with a modified ant colony optimization algorithm [PDF]
, 2009 This paper assesses the problem of designing multiple gravity assist (MGA) trajectories, including the sequence of planetary encounters. The problem is treated as planning and scheduling of events, such that the original mixed combinatorial-continuous ...
Vasile, M., Ceriotti, M.
core +3 more sources