Page
%P
![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
An Effective PSO-Based Memetic Algorithm for TSP
This paper proposes an effective Particle Swarm Optimization (PSO) based Memetic Algorithm (MA) for Traveling Salesman Problem (TSP) which is a typical NP-hard combinatorial optimization problem with strong en...
-
Chapter
Multi-objective Flow Shop Scheduling Using Differential Evolution
This paper proposes an effective Differential Evolution (DE) based hybrid algorithm for Multi-objective Permutation Flow Shop Scheduling Problem (MPFSSP), which is a typical NP-hard combinatorial optimization ...