Skip to main content

and
  1. No Access

    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...

    Bo Liu, Ling Wang, Yi-hui **, De-xian Huang in Intelligent Computing in Signal Processing… (2006)

  2. No Access

    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 ...

    Bin Qian, Ling Wang, De-**an Huang in Intelligent Computing in Signal Processing… (2006)