OUOrachun Udomkasemsub

Orachun Udomkasemsub

*This is an algorithmically generated author record based on publicly available information.

Orachun Udomkasemsub has a total of 3 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Performance Analysis of TSP Training Instance Generation Methods in Policy-Based Hyper-Heuristic Optimization Framework

    by Orachun Udomkasemsub, Booncharoen Sirinaovakul, Tiranee Achalakul

    The Policy-Based Hyper-Heuristic Optimization framework (PHH), which utilizes reinforcement learning to solve combinatorial optimization problems, has demonstrated promising results in prior studies. However, training PHH models with real problem instances can be resource-intensive and challenging to obtain. To address this issue, this paper explores the effects of different randomization methods for generating training instances in the context of the traveling salesman problem (TSP). Seven randomization methods, namely grid, uniform, square, circle, Gaussian, wave, and mixed, were employed to generate TSP instances. The PHH models were trained using these instances, and their performance was evaluated on unseen TSP instances from TSPLIB. Experimental results indicate that training with TSP instances generated by the square method consistently achieved the lowest travel distances across small, medium, and large test instances. This research contributes to the understanding of instance-generation techniques for combinatorial optimization problems and provides insights for designing efficient hyper-heuristic frameworks.

  • Open Access

    PHH: Policy-Based Hyper-Heuristic With Reinforcement Learning

    by Orachun Udomkasemsub, Booncharoen Sirinaovakul, Tiranee Achalakul

    Hyper-heuristics have a high level of generality and adaptability, allowing them to effectively solve a wide range of complex optimization problems. With reinforcement learning, hyper-heuristics can use experience and knowledge gained to tackle unforeseen problems, allowing hyper-heuristics to adapt and improve over time. Our paper proposes a framework for using policy-based reinforcement learning to improve the performance of hyper-heuristics. The framework trains hyper-heuristic agents to select the best generalized constructive low-level heuristics to solve combinatorial optimization problems. The framework evaluation was performed using three benchmarking problems: traveling salesman, capacitated vehicle routing, and bin packing problems. The results showed that the proposed framework can outperform existing meta-heuristic and hyper-heuristic-based algorithms for all large problem instances in all problem domains. The proposed framework was also evaluated by applying it to a cost optimization problem for workflow scheduling on a hybrid cloud with a deadline constraint. Eight agents were trained on medium-sized workflows with two deadlines and tested against traditional meta-heuristic and hyper-heuristic methods to solve smaller and larger workflows with unforeseen deadlines. Four workflow applications, three workflow sizes, and three deadlines were used in the evaluation. The results showed that our proposed framework provided significantly better solutions of up to 98% for benchmarking problems, and up to 22% for cost optimization in workflow scheduling. Moreover, trained with small problem instances, the framework performed well for unforeseen larger problem instances implying its generalization. The proposed framework, thus, has the potential to improve both the generality and performance of solving large combinatorial optimization problems.