Applications of combinatorial
optimisation
Keynote talk presented at National Operations Research Conference,
8-9 Sept, 2011, Thailand.
Abstract
Combinatorial optimisation is the optimisation where the domains of
feasible solutions are discrete. Examples of this domain are
traveling salesman problem, minimum spanning tree problem,
set-covering problem, knapsack problem, etc. Combinatorial
optimisation has many applications for operational research. In this
talk I will outline Coincidence Algorithm. It is an algorithm in the
class of Evolutionary Algorithm, specialised to solve combinatorial
problems. It makes use of models to generate solutions instead of
searching traditional population. I will illustrate its applications
to some interesting problems in manufacturing, both in
single-objective and multi-objective domain.
CV of the speaker
Prabhas Chongstitvatana is a professor in the department of computer
engineering, Chulalongkorn University since 2007. He earned B.Eng.
in Electrical Engineering from Kasetsart University, Thailand in
1980 and Ph.D. from the department of artificial intelligence,
Edinburgh University, U.K. in 1992. His research involves robotics,
evolutionary computation, computer architecture, bioinformatics and
grid computing. He is actively promote the collaboration to create
Thai national grid for sustainable computing. He is the member of
Thailand Engineering Institute, Thai Academy of Science and
Technology, Thai Robotics Society, Thai Embedded System Association,
ECTI Association of Thailand and IEEE Robotics and Automation
Society.