Search results

The purpose of this paper is to propose an improved optimization method for image matching problem, which is based on multi-scale Gaussian mutation pigeon-inspired optimization (MGMPIO) algorithm, with the objective of accomplishing the complicated image matching quickly.

The hybrid model of multi-scale Gaussian mutation (MGM) mechanism and pigeon-inspired optimization (PIO) algorithm is established for image matching problem. The MGM mechanism is a nonlinear model, which can adjust the position of pigeons by mutation operation. In addition, the variable parameter (VP) mechanism is exploited to adjust the map and compass factor of the original PIO. Low-cost quadrotor, a type of electric multiple rotorcraft, is used as a carrier of binocular camera to obtain the images.

This work improved the PIO algorithm by modifying the search strategy and adding some limits, so that it can have better performance when applied to the image matching problem. Experimental results show that the proposed method demonstrates satisfying performance in convergence speed, robustness and stability.

The proposed MGMPIO algorithm can be easily applied to solve practical problems and accelerate convergence speed of the original PIO, and thus enhancing the speed of matching process, which will considerably increase the effectiveness of algorithm.

A hybrid model of the MGM mechanism and PIO algorithm is proposed for image matching problem. The VP mechanism and low-cost quadrotor is also utilized in image matching problem.

The purpose of this paper is to solve the capacitated location routing problem (CLRP), which is an NP-hard problem that involves making strategic decisions as well as tactical and operational decisions, using a hybrid particle swarm optimization (PSO) algorithm.

PSO, which is a population-based metaheuristic, is combined with a variable neighborhood strategy variable neighborhood search to solve the CLRP.

The algorithm is tested on a set of instances available in the literature and gave good quality solutions, results are compared to those obtained by other metaheuristic, evolutionary and PSO algorithms.

Local search is a time consuming phase in hybrid PSO algorithms, a set of neighborhood structures suitable for the solution representation used in the PSO algorithm is proposed in the VNS phase, moves are applied directly to particles, a clear decoding method is adopted to evaluate a particle (solution) and there is no need to re-encode solutions in the form of particles after applying local search.