Abstract: Set covering problem is a classical problem in
computer science and complexity theory. It has many applications,
such as airline crew scheduling problem, facilities location problem,
vehicle routing, assignment problem, etc. In this paper, three
different techniques are applied to solve set covering problem.
Firstly, a mathematical model of set covering problem is introduced
and solved by using optimization solver, LINGO. Secondly, the
Genetic Algorithm Toolbox available in MATLAB is used to solve
set covering problem. And lastly, an ant colony optimization method
is programmed in MATLAB programming language. Results
obtained from these methods are presented in tables. In order to
assess the performance of the techniques used in this project, the
benchmark problems available in open literature are used.
Abstract: In this paper, a particle swarm optimization (PSO)
algorithm is proposed to solve machine loading problem in flexible
manufacturing system (FMS), with bicriterion objectives of
minimizing system unbalance and maximizing system throughput in
the occurrence of technological constraints such as available
machining time and tool slots. A mathematical model is used to
select machines, assign operations and the required tools. The
performance of the PSO is tested by using 10 sample dataset and the
results are compared with the heuristics reported in the literature. The
results support that the proposed PSO is comparable with the
algorithms reported in the literature.