ดาวน์โหลด All Proceeding - AS Nida

Applications of Combinatorial Optimization
A
การประชุมวิชาการดานการวิจัยดําเนินงานแหงชาติ ประจําป 2554
วันที่
8-9 กันยายน 2554 ณ โรงแรม เอส ดี อเวนิว กรุงเทพฯ
Prof. Prabhas Chongstitvatana, Ph.D.
Department of Computer Engineering, Faculty of Engineering, Chulalongkorn University
Abstract
Combinatorial optimization is the optimization 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 optimization has many applications
for operational research. The talking will outline Coincidence Algorithm. It is an algorithm in the class of Evolutionary Algorithm, specialized to
solve combinatorial problems. It makes use of models to generate solutions instead of searching traditional population. The presentation also
illustrates its applications to some interesting problems in manufacturing, both in single-objective and multi-objective domain.
Speaker Background
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.