Results 211 to 220 of about 100,368 (278)
Some of the next articles are maybe not open access.
Swarm and Evolutionary Computation, 2020
This article addresses a Periodic Vehicle Routing Problem with Time Window and Service Choice problem. This problem is basically a combination of existing Periodic Vehicle Routing Problem with Time Window and Periodic Vehicle Routing Problem with Service
Yuan Wang +5 more
semanticscholar +1 more source
This article addresses a Periodic Vehicle Routing Problem with Time Window and Service Choice problem. This problem is basically a combination of existing Periodic Vehicle Routing Problem with Time Window and Periodic Vehicle Routing Problem with Service
Yuan Wang +5 more
semanticscholar +1 more source
Network optimization using ant colony algorithm
2016 International Conference on Automatic Control and Dynamic Optimization Techniques (ICACDOT), 2016Computer network plays vital role in our day to day life's critical issues such as hospitals, fire brigade, military. The errors or failures in such computer network create significant loss. These failures or errors should be taken into account while designing a computer network.
Mamta Munge, Handore Shubhangi
openaire +1 more source
Information Sciences, 2019
In this paper, we present a multi-objective vehicle routing problem with flexible time windows (MOVRPFlexTW). In this problem, a fleet of vehicles can service a set of customers earlier and later than the required time with a given tolerance.
Huizhen Zhang +4 more
semanticscholar +1 more source
In this paper, we present a multi-objective vehicle routing problem with flexible time windows (MOVRPFlexTW). In this problem, a fleet of vehicles can service a set of customers earlier and later than the required time with a given tolerance.
Huizhen Zhang +4 more
semanticscholar +1 more source
Ant Colony Optimization based scheduling algorithm
2013 International Conference on Open Source Systems and Technologies, 2013Scheduling of processes has a significant effect in overall system performance. Moreover, scheduling of n-processes to optimize certain objective is a well-known NP hard problem. This paper presents a scheduling algorithm for n-processes based on Ant Colony Optimization (ACO) technique.
Fariha Nosheen, Sadia Bibi, Salabat Khan
openaire +1 more source
2024 IEEE International Conference on Communication, Computing and Signal Processing (IICCCS)
The Monarch Butterfly Optimization (MBO) algorithm for clustering in Underwater Wireless Sensor Networks (UWSNs) is investigated and compared to the performance of the Ant Colony Optimization (ACO) algorithm in this paper. As is evident from the outcomes
G.Indira +5 more
semanticscholar +1 more source
The Monarch Butterfly Optimization (MBO) algorithm for clustering in Underwater Wireless Sensor Networks (UWSNs) is investigated and compared to the performance of the Ant Colony Optimization (ACO) algorithm in this paper. As is evident from the outcomes
G.Indira +5 more
semanticscholar +1 more source
Riverview on ant colony optimization algorithms
World Journal of Engineering, 2013Ant colony algorithm is widely used in recent years as a heuristic algorithm. It provides a new way to solve complicated combinatorial optimization problems. Having been enlightened by the behavior of ant colony's searching for food, positive feedback construction and distributed computing combined with certain heuristics are adopted in the algorithm ...
Yancang Li, Chenguang Ban, Rouya Li
openaire +1 more source
An optimization algorithm based on ant colony algorithm
International Conference on Automatic Control and Artificial Intelligence (ACAI 2012), 2012This paper proposes an optimization algorithm to resolve combinatorial optimization problem. Congestion degree in the artificial fish school algorithm is used in ant colony algorithm in this paper. During the initial process of the optimization, the congestion degree plays the main role to guide the ants to search the new path randomly, which makes the
null Kuang Xiangling +1 more
openaire +1 more source
An ant colony optimization based layout optimization algorithm
2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings., 2004Ant colony optimization (ACO) has been applied to several NP-hard combinatorial optimization problems with considerable success while little experience is available on continuous constrained optimization problems. In this paper ACO was adopted in the solution of a layout optimization problem with dynamic constraints. A quasi traveling salesman problem (
null Zhi-Guo Sun, null Hong-Fei Teng
openaire +1 more source
Optimization of K-means algorithm: Ant colony optimization
2017 International Conference on Computing Methodologies and Communication (ICCMC), 2017Significance of a versatile and simple clustering algorithm is becoming indispensable with the huge data growth in recent years. K-Means clustering is one such clustering algorithm which is simple yet elegant. But K-Means Algorithm has its disadvantages, dependence on the initial cluster centers and the algorithm tends to converge at a local minima. To
T Namratha Reddy, K. P. Supreethi
openaire +1 more source
Image hiding optimization using ant colony optimization algorithm
2016 International Conference on Data and Software Engineering (ICoDSE), 2016Deterioration in the quality on host media (such as image) usually occurs when the information (such as text or image) is hidden or embedded in the host. The smaller deterioration on host media after embedding the information, the system hiding is more successful because it shows there is no significant different between the original host image and the
Abba Suganda Girsang +1 more
openaire +1 more source