2 research outputs found

    Multiple Route Generation Using Simulated Niche Based Particle Swarm Optimization

    Get PDF
    This research presents an optimization technique for multiple routes generation using simulated niche based particle swarm optimization for dynamic online route planning, optimization of the routes and proved to be an effective technique. It effectively deals with route planning in dynamic and unknown environments cluttered with obstacles and objects. A simulated niche based particle swarm optimization (SN-PSO) is proposed using modified particle swarm optimization algorithm for dealing with online route planning and is tested for randomly generated environments, obstacle ratio, grid sizes, and complex environments. The conventional techniques perform well in simple and less cluttered environments while their performance degrades with large and complex environments. The SN-PSO generates and optimizes multiple routes in complex and large environments with constraints. The traditional route optimization techniques focus on good solutions only and do not exploit the solution space completely. The SN-PSO is proved to be an efficient technique for providing safe, short, and feasible routes under dynamic constraints. The efficiency of the SN-PSO is tested in a mine field simulation with different environment configurations and successfully generates multiple feasible routes

    Comparative Analysis of Multi-Objective Feature Subset Selection using Meta-Heuristic Techniques

    Get PDF
    ABSTRACT This paper presents a comparison of evolutionary algorithm based technique and swarm based technique to solve multi-objective feature subset selection problem. The data used for classification contains large number of features called attributes. Some of these attributes are not significant and need to be removed. In the process of classification, a feature effects accuracy, cost and learning time of the classifier. So, before building a classifier there is a strong need to choose a subset of the attributes (features). This research treats feature subset selection as multi-objective optimization problem. The latest multi-objective techniques have been used for the comparison of evolutionary and swarm based algorithms. These techniques are Non-dominated Sorting Genetic Algorithms (NSGA -II) and Multiobjective Particle Swarm Optimization (MOPSO).MOPSO has also been converted into Binary MOPSO (BMOPSO) in order to deal with feature subset selection. The fitness value of a particular feature subset is measured by using ID3. The testing accuracy acquired is then assigned to the fitness value. The techniques are tested on several datasets taken from the UCI machine repository. The experiments demonstrate the feasibility of treating feature subset selection as multi-objective problem. NSGA-II has proved to be a better option for solving feature subset selection problem than BMOPSO
    corecore