TY - JFULL AU - W. Wongthatsanekorn and N. Matheekrieangkrai PY - 2014/8/ TI - A Case Study of Bee Algorithm for Ready Mixed Concrete Problem T2 - International Journal of Industrial and Manufacturing Engineering SP - 1252 EP - 1258 VL - 8 SN - 1307-6892 UR - https://publications.waset.org/pdf/9998840 PU - World Academy of Science, Engineering and Technology NX - Open Science Index 91, 2014 N2 - This research proposes Bee Algorithm (BA) to optimize Ready Mixed Concrete (RMC) truck scheduling problem from single batch plant to multiple construction sites. This problem is considered as an NP-hard constrained combinatorial optimization problem. This paper provides the details of the RMC dispatching process and its related constraints. BA was then developed to minimize total waiting time of RMC trucks while satisfying all constraints. The performance of BA is then evaluated on two benchmark problems (3 and 5construction sites) according to previous researchers. The simulation results of BA are compared in term of efficiency and accuracy with Genetic Algorithm (GA) and all problems show that BA approach outperforms GA in term of efficiency and accuracy to obtain optimal solution. Hence, BA approach could be practically implemented to obtain the best schedule. ER -