Case study and proofs of ant colony optimisation improved particle filter algorithm

2012 ◽  
Vol 6 (5) ◽  
pp. 689 ◽  
Author(s):  
J. Zhong ◽  
Y.-F. Fung
Keyword(s):  
Particle Filter ◽  
Ant Colony ◽  
Ant Colony Optimisation ◽  
Particle Filter Algorithm

scholarly journals Electric Vehicle Fleet Management Using Ant Colony Optimisation

2020 ◽  
Vol 3 (1) ◽  
pp. 1-16
Author(s):  
Javier Biera Muriel ◽  
Abbas Fotouhi
Keyword(s):  
Limited Range ◽  
Ant Colony ◽  
Fleet Management ◽  
Ant Colony Optimisation ◽  
Routing Problem ◽  
Charging Time ◽  
Battery Degradation ◽  
Optimum Solution ◽  
Advanced Version

This research is focused on implementation of the ant colony optimisation (ACO) technique to solve an advanced version of the vehicle routing problem (VRP), called the fleet management system (FMS). An optimum solution of VRP can bring benefits for the fleet operators as well as contributing to the environment. Nowadays, particular considerations and modifications are needed to be applied in the existing FMS algorithms in response to the rapid growth of electric vehicles (EVs). For example, current FMS algorithms do not consider the limited range of EVs, their charging time or battery degradation. In this study, a new ACO-based FMS algorithm is developed for a fleet of EVs. A simulation platform is built in order to evaluate performance of the proposed FMS algorithm under different simulation case-studies. The simulation results are validated against a well-established method in the literature called nearest-neighbour technique. In each case-study, the overall mileage of the fleet is considered as an index to measure the performance of the FMS algorithm.

Ant Colony Optimisation Applied to Non-Slicing Floorplanning

2015 ◽  
Vol 9 ◽  
pp. 193-203
Author(s):  
Mirzakhmet SYZDYKOV ◽  
◽  
Madi UZBEKOV ◽  
Keyword(s):  
Ant Colony ◽  
Ant Colony Optimisation

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Population Decline ◽  
Innovation System ◽  
Federal District ◽  
Original Model ◽  
Ant Colony ◽  
Industrial Agglomeration ◽  
Ant Colony Optimization Algorithm

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.

scholarly journals Unscented Particle Filter Algorithm Based on Divide-and-Conquer Sampling for Target Tracking

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2236
Author(s):  
Sichun Du ◽  
Qing Deng
Keyword(s):  
Particle Filter ◽  
State Space ◽  
Adaptive Filtering ◽  
Divide And Conquer ◽  
Particle Swarm Algorithm ◽  
Tracking Accuracy ◽  
Filtering Algorithm ◽  
Maneuvering Target ◽  
Unscented Particle Filter ◽  
Particle Filter Algorithm

Unscented particle filter (UPF) struggles to completely cover the target state space when handling the maneuvering target tracing problem, and the tracking performance can be affected by the low sample diversity and algorithm redundancy. In order to solve this problem, the method of divide-and-conquer sampling is applied to the UPF tracking algorithm. By decomposing the state space, the descending dimension processing of the target maneuver is realized. When dealing with the maneuvering target, particles are sampled separately in each subspace, which directly prevents particles from degeneracy. Experiments and a comparative analysis were carried out to comprehensively analyze the performance of the divide-and-conquer sampling unscented particle filter (DCS-UPF). The simulation result demonstrates that the proposed algorithm can improve the diversity of particles and obtain higher tracking accuracy in less time than the particle swarm algorithm and intelligent adaptive filtering algorithm. This algorithm can be used in complex maneuvering conditions.

scholarly journals Allocating Students to Industry Placements Using Integer Programming and Ant Colony Optimisation

Algorithms ◽  
2021 ◽  
Vol 14 (8) ◽  
pp. 219
Author(s):  
Dhananjay Thiruvady ◽  
Kerri Morgan ◽  
Susan Bedingfield ◽  
Asef Nazari
Keyword(s):  
Integer Programming ◽  
Gender Equity ◽  
Programming Model ◽  
Original Data ◽  
Ant Colony ◽  
Ant Colony Optimisation ◽  
Integer Programming Model ◽  
Problem Instances ◽  
Work Integrated Learning ◽  
Time Required

The increasing demand for work-ready students has heightened the need for universities to provide work integrated learning programs to enhance and reinforce students’ learning experiences. Students benefit most when placements meet their academic requirements and graduate aspirations. Businesses and community partners are more engaged when they are allocated students that meet their industry requirements. In this paper, both an integer programming model and an ant colony optimisation heuristic are proposed, with the aim of automating the allocation of students to industry placements. The emphasis is on maximising student engagement and industry partner satisfaction. As part of the objectives, these methods incorporate diversity in industry sectors for students undertaking multiple placements, gender equity across placement providers, and the provision for partners to rank student selections. The experimental analysis is in two parts: (a) we investigate how the integer programming model performs against manual allocations and (b) the scalability of the IP model is examined. The results show that the IP model easily outperforms the previous manual allocations. Additionally, an artificial dataset is generated which has similar properties to the original data but also includes greater numbers of students and placements to test the scalability of the algorithms. The results show that integer programming is the best option for problem instances consisting of less than 3000 students. When the problem becomes larger, significantly increasing the time required for an IP solution, ant colony optimisation provides a useful alternative as it is always able to find good feasible solutions within short time-frames.

Sign in / Sign up

Export Citation Format

Share Document