Payakorn Saksuriya

Dr. Payakorn Saksuriya

Chiang Mai University, Chiang Mai, Thailand
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 June 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Payakorn SaksuriyaPayakorn Saksuriya
Payakorn Saksuriya
CLChulin Likasiri
Chulin Likasiri
This work involves a heuristic for solving vehicle routing problems with time windows (VRPTW) with general compatibility-matching between customer/patient and server/caretaker constraints to capture the nature of systems such as caretakers’ home visiting systems or home healthcare (HHC) systems. Since any variation of VRPTW is more complicated than regular VRP, a specific, custom-made heuristic is needed to solve the problem. The heuristic proposed in this work is an efficient hybrid of a novice Local Search (LS), Ruin and Recreate procedure (R&R) and Particle Swarm Optimization (PSO). The proposed LS acts as the initial solution finder as well as the engine for finding a feasible/local optimum. While PSO helps in moving from current best solution to the next best solution, the R&R part allows the solution to be over-optimized and LS moves the solution back on the feasible side. To test our heuristic, we solved 56 benchmark instances of 25, 50, and 100 customers and found that our heuristics can find 52, 21, and 18 optimal cases, respectively. To further investigate the proficiency of our heuristic, we modified the benchmark instances to include compatibility constraints. The results show that our heuristic can reach the optimal solutions in 5 out of 56 instances.

1 December 2023 in Mathematics
Verified
Journal Article
Open access
PDF file
Payakorn SaksuriyaPayakorn Saksuriya
Payakorn Saksuriya
CLChulin Likasiri
Chulin Likasiri
We propose a vehicle routing problem with time windows (VRPTW) with compatibility-matching constraints and total completion time as the objective function, with applications in home healthcare routing and scheduling. Mixed integer linear programming is provided with total completion time minimization as the objective function. The solution approach has two objectives, total completion time (primary objective) and total distance (secondary objective). A heuristic is proposed comprising three phases: initializing to find an initial feasible routing (inserting the procedure with a modified K-means algorithm), swapping and moving the procedure to find a local optimal routing, and shooting the procedure to move away from the local optimum. Proof of feasibility for the inserting procedure is provided to prevent unnecessary insertions. Phases 2 and 3 will be repeated as needed to ensure solution quality. Solving our model with the proposed heuristic algorithm increases the total distance by 90.00% but reduces the total completion time by 25.86%. To test our model and heuristic, we examined a system with 400 home-healthcare cases in Chiang Mai. The heuristic quickly solved the problem. When total completion time is minimized, some caretakers serve up to twice as many patients as their coworkers; when total distance is minimized, workload discrepancies can increase up to seven-fold.

22 October 2024 in Axioms
Verified
Journal Article
Open access
PDF file
Raweerote SuparatulatornRaweerote Suparatulatorn
Raweerote Suparatulatorn
Payakorn SaksuriyaPayakorn Saksuriya
Payakorn Saksuriya
TSTeeranush Suebcharoen
Teeranush Suebcharoen
KCKhuanchanok Chaichana
Khuanchanok Chaichana
This study presents an iterative method for approximating common fixed points of a finite set of G-nonexpansive mappings within a real Hilbert space with a directed graph. We establish definitions for left and right coordinate convexity and demonstrate both weak and strong convergence results based on reasonable assumptions. Furthermore, our algorithm’s effectiveness in solving the heat equation is highlighted, contributing to energy optimization and sustainable development.

21 August 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Payakorn SaksuriyaPayakorn Saksuriya
Payakorn Saksuriya
CLChulin Likasiri
Chulin Likasiri
Cost reduction and staff retention are important optimization objectives in home healthcare (HHC) systems. Home healthcare operators need to balance their objectives by optimizing resource use, service delivery and profits. Minimizing total travel distances to control costs is a common routing problem objective while minimizing total finishing time differences is a scheduling objective whose purpose is to enhance staff satisfaction. To optimize routing and scheduling, we propose mixed integer linear programming with a bi-objective function, which is a subset of the vehicle routing problem with time windows (VRPTWs). VRPTWs is a known NP-hard problem, and optimal solutions are very hard to obtain in practice. Metaheuristics offer an alternative solution to this type of problem. Our metaheuristic uses the simulated annealing algorithm and weighted sum approach to convert the problems to single-objective problems and is equipped with operators including swapping, moving, path exchange and ruin and recreate. The results show, firstly, that the algorithm can effectively find the Pareto front, and secondly, that minimizing total finishing time differences to balance the number of jobs per caretaker is an efficient way to tackle HHC scheduling. A statistical test shows that the algorithm can obtain the Pareto front with a lower number of weighted sum problems.

26 December 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
WCWipawinee Chaiwino
Wipawinee Chaiwino
Payakorn SaksuriyaPayakorn Saksuriya
Payakorn Saksuriya
Raweerote SuparatulatornRaweerote Suparatulatorn
Raweerote Suparatulatorn
This article introduces an iterative algorithm that is created by integrating the S*-iteration process with the inertial forward-backward algorithm. The algorithm is designed to solve optimization problems formulated as variational inclusions in a real Hilbert space. We establish the weak convergence of the algorithm under conventional assumptions. One of the applications of the algorithm is to solve the extreme learning machine, which can be transformed into the variational inclusion problem. Different algorithms, with all parameters set to be identical, are employed to solve the stroke classification problem in order to evaluate the algorithm’s performance. The results indicate that our algorithm converges faster than others and achieves a precision of 93.90%, a recall of 100%, and an F1-score of 96.58%.

4 November 2026 in Mathematics
Verified
Journal Article
Open access
PDF file
Adsadang HimakalasaAdsadang Himakalasa
Adsadang Himakalasa
TRThaned Rojsiraphisal
Thaned Rojsiraphisal
TCTanapat Chalarux
Tanapat Chalarux
WKWoratham Khangtragool
Woratham Khangtragool
WCWipawinee Chaiwino
Wipawinee Chaiwino
Payakorn SaksuriyaPayakorn Saksuriya
Payakorn Saksuriya
Upper Northern Thailand is a critical region reflecting the severity of seasonal PM2.5 pollution and its transboundary spread, yet accurate spatial monitoring remains difficult due to complex mountainous terrain and a sparse network of physical monitoring stations. To resolve this observational limitation under a fixed sensor budget, this study develops a multi-criteria spatial optimization framework using weighted-sum scalarization to identify optimal locations for network expansion. We integrate set-dependent geostatistical Average Kriging Variance (AKV) reduction, meteorological correlation graphs, and cross-source satellite discrepancy into a unified combinatorial objective. Feature selection reveals that coupling rainfall, relative humidity, and temperature yields the best predictive performance, achieving an R2 of 0.8785 and minimizing RMSE to 33.91μg/m3 under Universal Kriging (UK). While Ordinary Kriging (OK) and Universal Kriging produce consistent spatial patterns, UK systematically secures superior variance reduction by accounting for coordinate-based spatial trends. Comparing optimization algorithms demonstrates distinct search dynamics: Genetic Algorithms (GAs) converge faster for smaller network expansion sizes, whereas Simulated Annealing (SA) becomes more scalable and efficient when adding 20 or more stations. Incorporating graph centrality measures (betweenness centrality and clustering coefficient) actively promotes spatial dispersion and prevents candidate stations from clustering redundantly in high-uncertainty areas. Furthermore, retrospective ground-station masking experiments demonstrate that the framework reliably targets genuine observational blind spots, reducing out-of-sample prediction RMSE by up to 40.98% upon network expansion. The proposed framework provides a practical, data-driven decision-support screening tool for environmental agencies seeking cost-effective air quality infrastructure expansion in data-sparse regions.