the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

In light of the accuracy of particle swarm optimization-particle filter (PSO-PF) inadequate for multi-robot cooperative positioning, the paper presents population density particle swarm optimization-particle filter (PDPSO-PF), which draws cooperative coevolutionary algorithm in ecology into particle swarm optimization. By taking full account of the competitive relationship between the environme...

Determination of optimum location for drilling a new well not only requires engineering judgments but also consumes excessive computational time. Additionally, availability of many physical constraints such as the well length, trajectory, and completion type and the numerous affecting parameters including, well type, well numbers, well-control variables prompt that the optimization approaches b...

This study presents a robust and rigorous method based on intelligent models, namely radial basis function networks optimized by particle swarm optimization (PSO-RBF), multilayer perceptron neural networks (MLP-NNs), and adaptive neuro-fuzzy inference system optimized by particle swarm optimization methods (PSO-ANFIS), for predicting the equilibrium and kinetics of the adsorption of sulfur and ...

the simultaneous optimization of multiple responses is an important problem in the design of industrial processes in order to achieve improved quality. in this paper, we present a new metaheuristic approach including simulated annealing and particle swarm optimization to optimize all responses simultaneously. for the purpose of illustration and comparison, the proposed approach is applied to tw...

We propose a new Memetic Particle Swarm Optimization scheme that incorporates local search techniques in the standard Particle Swarm Optimization algorithm, resulting in an efficient and effective optimization method, which is analyzed theoretically. The proposed algorithm is applied to different unconstrained, constrained, minimax and integer programming problems and the obtained results are c...

This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...