Sakkayaphop Pravesjit
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Sakkayaphop Pravesjit has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Arit Thammano
Computational Intelligence Laboratory, School of Information Technology, King Mongkut’s Institute of Technology Ladkrabang, Bangkok 10520
2 shared publications - Krittika Kantawong
School of Information and Communication Technology, University of Phayao, 19 Moo 2, Maeka, Muang, Phayao 56000, Thailand
1 shared publication - Krittika Kantawong
School of Information and Communication Technology, University of Phayao
1 shared publication - Roungsan Chaisricharoen
Excellence Center in Industry 4.0, Computer and Communication Engineering for Capacity Building Research Center, School of Applied Digital Technology, Mae Fah Luang University, Chiang Rai, Thailand
1 shared publication
Latest Publications
- Open Access
- 31 March 2020
- Published by ECTI in ECTI Transactions on Computer and Information Technology (ECTI-CIT)
- Vol. 14 (1) , 46-52
An Enhanced ABC algorithm to Solve the Vehicle Routing Problem with Time Windows
This work proposes an enhanced artificial bee colony algorithm (ABC) to solve the vehicle routing problem with time windows (VRPTW). In this work, the fuzzy technique, scatter search method, and SD-based selection method are combined into the artificial bee colony algorithm. Instead of randomly producing the new solution, the scout randomly chooses the replacement solution from the abandoned solutions from the onlooker bee stage. Effective customer location networks are constructed in order to minimize the overall distance. The proposed algorithm is tested on the Solomon benchmark dataset where customers live in different geographical locations. The results from the proposed algorithm are shown in comparison with other algorithms in the literature. The findings from the computational results are very encouraging. Compared to other algorithms, the proposed algorithm produces the best result for all testing problem sets. More significantly, the proposed algorithm obtains better quality than the other algorithms for 39 of the 56 problem instances in terms of vehicle numbers. The proposed algorithm obtains a better number of vehicles and shorter distances than the other algorithm for 20 of the 39 problem instances.
- 31 March 2020
- Published by ECTI in ECTI Transactions on Computer and Information Technology (ECTI-CIT)
- Vol. 14 (1) , 46-52
Open AccessAn Enhanced ABC algorithm to Solve the Vehicle Routing Problem with Time Windows
This work proposes an enhanced artificial bee colony algorithm (ABC) to solve the vehicle routing problem with time windows (VRPTW). In this work, the fuzzy technique, scatter search method, and SD-based selection method are combined into the artificial bee colony algorithm. Instead of randomly producing the new solution, the scout randomly chooses the replacement solution from the abandoned solutions from the onlooker bee stage. Effective customer location networks are constructed in order to minimize the overall distance. The proposed algorithm is tested on the Solomon benchmark dataset where customers live in different geographical locations. The results from the proposed algorithm are shown in comparison with other algorithms in the literature. The findings from the computational results are very encouraging. Compared to other algorithms, the proposed algorithm produces the best result for all testing problem sets. More significantly, the proposed algorithm obtains better quality than the other algorithms for 39 of the 56 problem instances in terms of vehicle numbers. The proposed algorithm obtains a better number of vehicles and shorter distances than the other algorithm for 20 of the 39 problem instances.
- 23 December 2019
- Published by Univ. of Malaya in Malaysian Journal of Computer Science
- p. 35-53
THE NEW METHODOLOGY FOR VEHICULAR NETWORK WITH FUZZY TIME WINDOWS
This work proposes the new methodology for the vehicular network with fuzzy time windows. The Fuzzy technique is applied to produce an initial population and then the evolutionary algorithm is employed to improve the solution. In this work, the inter-route crossover, intra-route mutation, elitism strategy, and onlooker bee probability selection method were enhanced in the original processes of the evolutionary algorithm. The proposed algorithm is tested on 56 datasets of Solomon. The results from the proposed algorithm are shown in comparison with other algorithms in the literature. The findings from the computational results are very inspiring, it shows that the algorithm is very competitive. Comparing with the algorithm in the literature, the proposed algorithm obtains the best solution in terms of the coefficient of variation values for almost 40 instances from the 56 problem instances. In addition, the information regarding the p-value was resolved by the Wilcoxon signed-rank test for the considered testing instances that display statistically superior performance at the 95% significance level (α = 0.05) on comparing algorithms.
- 23 December 2019
- Published by Univ. of Malaya in Malaysian Journal of Computer Science
- p. 35-53
THE NEW METHODOLOGY FOR VEHICULAR NETWORK WITH FUZZY TIME WINDOWS
This work proposes the new methodology for the vehicular network with fuzzy time windows. The Fuzzy technique is applied to produce an initial population and then the evolutionary algorithm is employed to improve the solution. In this work, the inter-route crossover, intra-route mutation, elitism strategy, and onlooker bee probability selection method were enhanced in the original processes of the evolutionary algorithm. The proposed algorithm is tested on 56 datasets of Solomon. The results from the proposed algorithm are shown in comparison with other algorithms in the literature. The findings from the computational results are very inspiring, it shows that the algorithm is very competitive. Comparing with the algorithm in the literature, the proposed algorithm obtains the best solution in terms of the coefficient of variation values for almost 40 instances from the 56 problem instances. In addition, the information regarding the p-value was resolved by the Wilcoxon signed-rank test for the considered testing instances that display statistically superior performance at the 95% significance level (α = 0.05) on comparing algorithms.
- 24 December 2015
- Published by Springer Nature in Artificial Life and Robotics
- Vol. 21 (1) , 112-119
A hybrid bat algorithm with natural-inspired algorithms for continuous optimization problem
- 24 December 2015
- Published by Springer Nature in Artificial Life and Robotics
- Vol. 21 (1) , 112-119
A hybrid bat algorithm with natural-inspired algorithms for continuous optimization problem
- 12 February 2015
- Published by Springer Nature in Memetic Computing
- Vol. 7 (1) , 3-17
Recognition of archaic Lanna handwritten manuscripts using a hybrid bio-inspired algorithm
- 12 February 2015
- Published by Springer Nature in Memetic Computing
- Vol. 7 (1) , 3-17
Recognition of archaic Lanna handwritten manuscripts using a hybrid bio-inspired algorithm