Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Chin Soon. Chong"'
Autor:
Chin Soon Chong, Quan-Ke Pan, T.X. Cai, Kaizhou Gao, Tay Jin Chua, Ponnuthurai Nagaratnam Suganthan
Publikováno v:
Expert Systems with Applications. 65:52-67
Improved ABC algorithm is proposed for FJSP with fuzzy processing time.A heuristic, named MInEnd, is proposed to initialize population.New strategies are proposed to generate new solutions.The objectives are fuzzy maximum completion time and maximum
Autor:
Chin Soon Chong, Qan Ke Pan, T.X. Cai, Tay Jin Chua, Ponnuthurai Nagaratnam Suganthan, Kaizhou Gao
Publikováno v:
Expert Systems with Applications. 42:7652-7663
A heuristic is proposed for initializing ABC population.An ensemble local search method is proposed to improve the convergence of TABC.Three re-scheduling strategies are proposed and evaluated.TABC is tested using benchmark instances and real cases f
Publikováno v:
International Journal of Bio-Inspired Computation. 15:239
The unique foraging behaviour of bees via waggle dance has been computationally realised as an algorithm named bee colony optimisation (BCO) to solve different types of combinatorial optimisation problems such as travelling salesman problem (TSP). In
Publikováno v:
WODES
In this paper, we study the problem of supervisor synthesis for a class of discrete event systems for optimal throughput based on the timed discrete event modelling formalism. First, a language-based definition for the concept of throughput is presen
Publikováno v:
International Journal on Artificial Intelligence Tools. 19:305-334
Many real world industrial applications involve the Traveling Salesman Problem (TSP), which is a problem that finds a Hamiltonian path with minimum cost. Examples of problems that belong to this category are transportation routing problem, scan chain
Publikováno v:
ICARCV
This work presents a time-weighted finite state automaton modeling formalism for an alternative formulation of multi-commodity flow network problem with some "discrete event features". We introduce a procedure to translate the "multi-commodity flow p
Autor:
Appa Iyer Sivakumar, Chin Soon Chong
Publikováno v:
Computers in Industry. 45:59-78
This paper presents a preliminary analysis of the relationship between selected input and output variables in semiconductor backend manufacturing system, using a data driven discrete event simulation model. This study is of interest and importance fo
Publikováno v:
GECCO
This paper proposes a hybrid discrete harmony search algorithm for solving the re-processing scheduling problem in pump remanufacturing. The process of pump remanufacturing and the scheduling problem of re-processing for pump subassembly are modeled.
Publikováno v:
BIC-TA
Identifying the shortest Hamiltonian circuit is a task which appears in various types of industrial and logistics applications. It is a NP-hard problem [1]. This paper intends to find the shortest Hamiltonian circuit of the selected 68 towns/cities i
Publikováno v:
2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation.
Combinatorial Optimization Problems (COPs) appear in various types of industrial applications. Finding an optimum solution for COPs with large scale of data, constraints and variables is NP-hard. This paper proposed a generic Bee Colony Optimization