Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article
Author

Juta Pichitlamken

Kasetsart University, Thailand
3 articles in our journals

Articles where this person is an author, newest first. People are matched by their name as printed (no ORCID iD is recorded for them), not by name alone; search the name as text to find namesakes too.

Research ArticleOpen accessAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,053 accessesView PDFCite
Research ArticleOpen accessNelder-Mead Method with Local Selection Using Neighborhood and Memory for Stochastic OptimizationNoocharin Tippayawannakorn, Juta PichitlamkenWe consider the Nelder-Mead (NM) simplex algorithm for optimization of discrete-event stochastic simulation models. We propose new modifications of NM to reduce computational time and to improve quality of the estimated optimal solutions. Our means include utilizing past information of already seen solutions, expanding search space to their neighborhood and using adaptive sample sizes. We compare performance of these extensions … …Journal of Computer Science, Vol. 9, Issue 4 · 10 May 2013 · 6,126 accessesView PDFCite
Research ArticleOpen accessA Gaussian Process Regression Model for the Traveling Salesman ProblemWanatchapong Kongkaew, Juta PichitlamkenProblem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. … …Journal of Computer Science, Vol. 8, Issue 10 · 30 Aug 2012 · 7,373 accessesView PDFCite