Now showing items 1-5 of 5
Smallest position value approach
In a traveling salesman problem, if the set of nodes is divided into clusters for a single node from each cluster to be visited, then the problem is known as the generalized traveling salesman problem (GTSP). Such problem ...
The Modified Fuzzy Art and a Two-Stage Clustering Approach to Cell Design
(ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, NY 10010-1710 USA, 2007-12-01)
This study presents a new pattern recognition neural network for clustering problems, and illustrates its use for machine cell design in group technology. The proposed algorithm involves modifications of the learning ...
A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
(ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS, 2007-03-16)
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutation flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. For this ...
Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
(TAYLOR & FRANCIS LTD, 4 PARK SQUARE, MILTON PARK, ABINGDON OX14 4RN, OXON, ENGLAND, 2006-11-15)
In this paper we present two recent metaheuristics, particle swarm optimization and differential evolution algorithms, to solve the single machine total weighted tardiness problem, which is a typical discrete combinatorial ...
Particle swarm optimization algorithm for permutation flowshop sequencing problem
(SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY, 2004)
This paper presents a particle swarm optimization algorithm (PSO) to solve the permutation flowshop sequencing problem (PFSP) with makespan criterion. Simple but very efficient local search based on the variable neighborhood ...