Showing papers by "Shu-Chuan Chu published in 1999"

Genetic algorithms vs. Tabu search in timetable scheduling

Abstract: In a timetabling problem, exam subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead to satisfactory but sub-optimal solutions. This paper investigates and compares Genetic Algorithm and Tabu Search approaches to solve these kinds of problem. The experiment shows that TS approach can produce better timetables than those of GA approach can. Further, the search time spent in TS is less than that of GA. However, GA can produce several different near optimal solutions simultaneously.

Non-redundant VQ channel coding using modified tabu search approach with simulated annealing

Abstract: Codeword Index Assignment (CIA) is a key issue to vector quantization (VQ). A new algorithm called Modified Tabu Search Algorithm (MTSA) is applied to codeword index assignment for noisy channels for the purpose of minimizing the distortion due to bit errors. Simulated annealing (SA) technique and a new parameter are introduced in the Tabu Search Approach (TSA) to improve the performance of the tabu search approach. Experimental tests show the modified tabu search algorithm is superior to the tabu search algorithm by evaluating the performance of channel distortion after the same number of iterations.