Multi-Objective Particle Swarm Optimization Algorithm for the Minimum Constraint Removal Problem

• DOI: 10.2991/ijcis.d.200310.005
• Publication Date: 2020-03-16T17:03:14Z
• Authors: Bo Xu; Feng Zhou; Antonio Marcel Gates
• Keywords: Multi-objective optimization; Minimum constraint removal; Minimum constraint set; Electronic computers. Computer science; 0202 electrical engineering, electronic engineering, information engineering; Multi-objective particle swarm optimization algorithm; QA75.5-76.95; 02 engineering and technology; Path planning

This paper proposes a multi-objective approach for the minimum constraint removal (MCR) A problem. First, a multi-objective model for MCR path planning is constructed. This model takes into account factors such as the minimum constraint set, the route length, and the cost. A multi-objective particle swarm optimization (MOPSO) algorithm is then designed based on the fitness function of the multi-objective MCR problem, and an iteration formula based on the personal best (pbest) and global best (gbest) of the algorithm is constructed to update the particle velocity and position. Finally, compared with ant colony optimization (ACO) A and the crow search algorithm (CSA) A, the experimental results show that the MOPSO-based path planning algorithm can find a shorter path that traverses fewer obstacle areas and can thus perform MCR path planning more effectively.