@conference{Sritrakool2020895,

title = {An Integer Programming Model for the Deterministic Wave-Based Same-Day Pickup and Delivery Problem},

author = {Wichaya Sritrakool and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85086079631&doi=10.1109%2fICIEA49774.2020.9102097&partnerID=40&md5=032f9992e575b634895dcd145bb3793e},

doi = {10.1109/ICIEA49774.2020.9102097},

year  = {2020},

date = {2020-01-01},

journal = {2020 IEEE 7th International Conference on Industrial Engineering and Applications, ICIEA 2020},

pages = {895 – 899},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {This paper focuses on the development an Integer Programming (IP) model for the Deterministic Wave-based Same-day Pickup and Delivery Problem (D-WSDPD), where a vehicle is allowed to leave the depot at specific time periods, called waves. Moreover, each customer request comprises of a pair of services - namely pickup and delivery - not necessarily be completed in the same wave. If the request had been picked, it must be also be delivered by the end of the day. We explored how numbers of daily dispatch waves affect major service performance metrics, including total rewards from serving customer orders and the overall service level on 20 randomly generated instances. We found that, by increasing the numbers of daily dispatch waves, all service performance metrics could be potentially improved as expected, with greater numbers of dispatched waves. However, having too frequent daily dispatch waves would not significantly improve such metrics due to limited operational interval, i.e. planning horizon. In contrast, the computational times required grow exponentially; and, thence, cautious trade-offs between the desired service performance and operational costs must be made. While our mathematical formulation is only preliminary for the practical WSDPD, with high level of uncertainty, it could be regarded as a prelude to the development of efficient heuristics and policies that will be explored in the next steps. © 2020 IEEE.},

note = {Cited by: 0},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Chotivanich202087,

title = {Mixed-integer linear program for the operational harvest scheduling problem: An application to the thai sugar industry},

author = {Tharin Chotivanich and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85092735843&doi=10.1145%2f3416028.3416035&partnerID=40&md5=2916d32c966495887707a9208ab75967},

doi = {10.1145/3416028.3416035},

year  = {2020},

date = {2020-01-01},

journal = {ACM International Conference Proceeding Series},

pages = {87 – 92},

publisher = {Association for Computing Machinery},

abstract = {Thai sugar industry is relatively unique due to the existence of local restrictions and practices, such as grower equity and sugarcane farm burning. All of which are interrelated and stipulated by different conflicting objectives of different key supply chain actors. In order to address these issues, a mixed-integer linear programming model for this so-called Operational Harvest Scheduling Problem (OHSP) is formulated and solved under four different aspects: (i) maximizing sugarcane input, (ii) maximizing grower profits, (iii) minimizing industrial yield loss, and (iv) minimizing environmental impact. Our preliminary computational results on 30 fictitious instances indicated that, regardless of the chosen objectives, the resulting sugarcane input did not differ much, with the maximal gap around 10% across four settings. Nonetheless, the other three objective values differed greatly and depended on the harvesting resource selection. More specifically, green sugarcane harvesting was the best in terms of both carbon emission and grower interests, while burnt sugarcane harvesting was the best in terms of extractable sugar amount. We also found that the number of harvesting resources largely affected the quality of the OHSP solutions. © 2020 ACM.},

note = {Cited by: 0},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Promjun2019,

title = {Heuristic Based Scheduling for Toothpaste Filling Problem},

author = {S. Promjun and P. Jarumaneeroj},

editor = {Ratnam M.M.},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85070248475&doi=10.1088%2f1757-899X%2f530%2f1%2f012043&partnerID=40&md5=c182bec6e4a95bce6d0db9d7fe97792f},

doi = {10.1088/1757-899X/530/1/012043},

year  = {2019},

date = {2019-01-01},

journal = {IOP Conference Series: Materials Science and Engineering},

volume = {530},

number = {1},

publisher = {Institute of Physics Publishing},

abstract = {This research focuses on the development of a heuristic method for the Toothpaste Filling Problem (TFP) whose complication lies on a vast variety of products (formulae and sizes), together with specific restrictions on filling machines and storage tanks. More specifically, filling machines are non-identical, each of which has different speeds and capacities for filling toothpaste of various sizes. As unloading requires storage tanks, each with much larger capacity when compared to one particular production order, a tank will be then matched with several production orders and be repositioned among filling machines to avoid unnecessary changeovers. We solve the TFP by means of a two-phase method, where the initial solution is constructed by an Earliest Due Date (EDD) dispatching rule. Once completed, the initial solution is then iteratively improved by a series of improvement operators, mimicking the concept of Variable Neighbourhood Search (VNS), until no improvement could be found. We test our heuristic on a set of sample instances acquired from one of the biggest consumer products manufacturers in Thailand. Impressively, when compared to the current practice, our proposed heuristic could help reduce makespan by 32% on average, or equivalently an annual saving of $0.6 million, mainly from the reduction on overtime payment and changeovers. © 2019 IOP Publishing Ltd. All rights reserved.},

note = {Cited by: 0; All Open Access, Gold Open Access},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Sangonsub2018285,

title = {A development of a prediction model for ungauged catchment in the north of Thailand},

author = {Nutthanon Sangonsub and Supattra Visessri and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85049844762&doi=10.1145%2f3177457.3177499&partnerID=40&md5=a144251d87c0fe946271d1f7649d0caf},

doi = {10.1145/3177457.3177499},

year  = {2018},

date = {2018-01-01},

journal = {ACM International Conference Proceeding Series},

pages = {285 – 289},

publisher = {Association for Computing Machinery},

abstract = {Flow data are essential for hydrological study, planning, and management to prevent drought and flood in a region. In catchments where flow data are not recorded or of poor quality, hydrological indices could be an alternative for predicting flow in ungauged catchments. This study demonstrates the methodology for predicting flow in ungauged catchments through the case study of 37 sub-catchments of the upper Ping catchment in northwest Thailand from 2006-2014. The regression method was applied to investigate the relationship between three flow indices including runoff coefficient, base flow index, and 95th percentile of flow, and catchment properties. The prediction interval of the regression relationship was used to condition rainfall-runoff model parameters. The model performance was tested by NSE∗ and reliability. The 95th percentile of flow was found to be the most informative index to regionalize flow followed by RC. The BFI had least contribution to the prediction of flow with poor NSE∗ and large uncertainty. The 95th percentile of flow and RC generally worked well for small sub-catchments. © 2018 Association for Computing Machinery.},

note = {Cited by: 0},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Pontrakul2018238,

title = {Heuristic based scheduling for tablets film coating process},

author = {Chutamas Pontrakul and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85055441834&doi=10.1145%2f3242840.3242870&partnerID=40&md5=95b9fe1fa41b7444c6b3b7dc2bbfd235},

doi = {10.1145/3242840.3242870},

year  = {2018},

date = {2018-01-01},

journal = {ACM International Conference Proceeding Series},

pages = {238 – 242},

publisher = {Association for Computing Machinery},

abstract = {In the pharmaceutical industry, tablets film coating planning concerns a finding of coating sequences on parallel machines such that both the completion time and number of tardy jobs are minimized. This problem is made more difficult when a wide variety of drugs is produced as changing from one to another drug requires considerably long period of cleaning and setup times - these times also vary depending on the previously coated drug. We show that this problem could be transformed into the Vehicle Routing Problem with Time Window (VRPTW), where a variable arc exch an ge heur istic - whose concep t is based on the Variable Neighborhood Search (VNS) - is devised to solve such a problem. Our proposed heuristic is a two-phase one, where the initial solutions are constructed from easy-to-implement dispatching heuristics, i.e. Earliest Due Date (EDD) and Longest Processing Time (LPT). The initial solution is then iteratively improved by a series of local-search operators, including 2OPT, RELOCATION, and SWAP. The results from our proposed heuristic is comparatively good, when compared to those of the optimization model in terms of solution quality as the gap is less than 5% for instances of 20 orders; but, it requires much less computation time, which is crucial from a practical point of view. © 2018 Association for Computing Machinery.},

note = {Cited by: 3},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Bangxang2018410,

title = {Topological evolution of public transportation network: A case study of Bangkok rail transit network},

author = {Pijaya Na Bangxang and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050080433&doi=10.1109%2fIEA.2018.8387135&partnerID=40&md5=2748d89906e39e796bab479866745d83},

doi = {10.1109/IEA.2018.8387135},

year  = {2018},

date = {2018-01-01},

journal = {2018 5th International Conference on Industrial Engineering and Applications, ICIEA 2018},

pages = {410 – 414},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {Bangkok Rail Transit Network (BRTN) is the first urban rail transit system in Thailand, initially operated in 1999. Once completed in 2029, the BRTN will be one of the world largest urban rail transit networks, with 285 stations accounting for 508 kilometers of travel distance. To investigate and explain the topological evolution of BRTN from 1999 to 2029, five network indicators were selected, including network diameter, gamma index, degree centrality, closeness centrality, and betweenness centrality. We found that, as the BRTN evolves, both diameter and gamma index seemingly rise indicating better spread and connectivity over time. Likewise, average degree centrality increases from 1.91 to 2.27, while both average closeness and betweenness centrality gradually decline; but with different intensity patterns. More specifically, stations with high closeness tend to be those in the central Bangkok area as they conveniently reach the rest of the network with fewer links; however, as betweenness gives more weights to stations that facilitate transportation, stations with high betweenness tend to be those joining central area to the suburbs. © 2018 IEEE.},

note = {Cited by: 4},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Phongmekin2018,

title = {Classification models for stock's performance prediction: A case study of finance sector in the stock exchange of Thailand},

author = {Athit Phongmekin and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85053116128&doi=10.1109%2fICEAST.2018.8434395&partnerID=40&md5=09a7281d18ea3903e5ab4dca161fe1b5},

doi = {10.1109/ICEAST.2018.8434395},

year  = {2018},

date = {2018-01-01},

journal = {ICEAST 2018 - 4th International Conference on Engineering, Applied Sciences and Technology: Exploring Innovative Solutions for Smart Society},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {Within stock market, the objective of both stock buyers and sellers is to make profit on price difference based on their expectation on a company's current and future value. There is no investing strategy that is considered to be the best by experts, and investing decision criteria remain contingent upon an individual investor's experiences and bias. To address the challenges, this paper uses financial ratios and company's industry data of stocks in finance sector of the Stock Exchange of Thailand (SET) to construct two classification models predicting (i) whether stock's one-year return will outperform the SET Index and (ii) whether the return will be positive. Various classification techniques, including Logistic Regression (LR), Decision Tree (DT), Linear Discriminant Analysis (LDA), and K-Nearest Neighbor (KNN) are explored, whose performances are evaluated by Area Under the Curve (AUC) of the Receiver Operating Characteristic (ROC) curve. Based on the AUC values, we can conclude that, on average, all methods are comparatively good, with LR and LDA being the most useful classifiers for risk averse investors- A s both are not subject to uncertainty due to true positive counting bias. © 2018 IEEE.},

note = {Cited by: 7},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Ngamsirijit20172932,

title = {Analysis of dynamic antral scintigraphy using empirical mode decomposition},

author = {Panasun Ngamsirijit and Pisit Jarumaneeroj and Tawatchai Chaiwatanarat and Yothin Rakvongthai},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032222781&doi=10.1109%2fEMBC.2017.8037471&partnerID=40&md5=694acbbd4e7c03babded167019971fbb},

doi = {10.1109/EMBC.2017.8037471},

year  = {2017},

date = {2017-01-01},

journal = {Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS},

pages = {2932 – 2935},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {In this work, we proposed to use the empirical mode decomposition (EMD) to analyze signals from dynamic antral scintigraphy (DAS) for antral contraction rate estimation. The proposed EMD-Fourier method analyzes a DAS time-activity curve (TAC) which is called a DAS signal by estimating the frequency from the Fourier transform of each intrinsic mode function (IMF), thus yielding multiple frequency values for each TAC as opposed to one frequency value obtained from the conventional Fourier method. Twenty-three TACs extracted from DAS data acquired on twenty-three healthy volunteers were analyzed using both the EMD-Fourier method and the Fourier method. The mean and standard deviation of frequency across all volunteers were computed. The result showed that the EMD-Fourier method provided a reduction of SD-to-mean ratio from the Fourier method ranging from 64.3% to 85.8%. The mean frequencies from the third IMF in the EMD-Fourier method and from the Fourier method were 2.76 and 3.44 cycles per minute were close to a widely-used normal antral contraction rate (3.0 cycles per minute), while the EMD-Fourier method yielded significant SD reduction (from 4.77 to 0.57: p < 0.0001). Moreover, it was found that the first IMF yielded a frequency estimate of 11.26 ± 2.2 cycles per minute, while the second IMF yielded a frequency estimate of 4.3 ± 1.3 cycles per minute, which are similar to the contraction rates of the duodenum and the large intestine, respectively. © 2017 IEEE.},

note = {Cited by: 2},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Srikram2017624,

title = {Preoperative parathyroid localization using joint planar imaging},

author = {Richalannaphat Srikram and Pisit Jarumaneeroj and Tawatchai Chaiwatanarat and Yothin Rakvongthai},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032188432&doi=10.1109%2fEMBC.2017.8036902&partnerID=40&md5=c3eb3add1a4ded3aff9466916a77161c},

doi = {10.1109/EMBC.2017.8036902},

year  = {2017},

date = {2017-01-01},

journal = {Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS},

pages = {624 – 627},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {The conventional approach for preoperative parathyroid localization with the dual 99mTc-sestamibi (99mTc-MIBI) and 99mTc-pertechnetate (99mTcO4- ) scintigraphy technique obtains the differential image by subtracting images from the two scans; the former depicts both the thyroid and parathyroid glands while the latter depicts the thyroid only. In this study, we developed a novel method based on Poisson noise modeling and maximum-likelihood estimation to generate the differential image in an iterative fashion using both planar images jointly. We demonstrated improved performance of our joint method as compared with the subtraction method in both phantom and patient studies. In the phantom study, we acquired two noise-free planar datasets using 99mTc on an in-house thyroid phantom and a 'lesion' bead (representing a parathyroid gland) with the same attenuation background as the thyroid phantom. These two planar datasets were combined and scaled to simulate noise-free clinical MIBI (four lesion-to-background contrast (LBC) values: 1.2, 1.3, 1.4 and 1.5), and 99mTcO4- datasets. One-hundred Poisson noise realizations were generated for each datasets. The mean and standard deviation (SD) of the lesion contrast in the differential images were computed for both the subtraction and the joint methods. We also applied both the subtraction and the joint methods to one parathyroid patient dataset. The voxel-wise mean-to-SD ratios in four hyperfunctioning parathyroid lesions were calculated. The phantom results showed that the joint method at the 50th iteration yielded a significant SD reduction compared with the subtraction method ranging from 20% to 45% (p < 0.05). Similarly, the voxel-wise mean-to-SD ratios were substantially improved in the patient study from 0.40-1.60 (subtraction) to 2.68-3.16 (joint). © 2017 IEEE.},

note = {Cited by: 0},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}

@conference{Kiettitanabumroong2017204,

title = {An application of geographic information system for locating sanitary landfill sites: A case study of Bangkok},

author = {Warot Kiettitanabumroong and Garavig Tanaksaranond and Pisit Jarumaneeroj},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021446794&doi=10.1109%2fIEA.2017.7939207&partnerID=40&md5=67e12eb3ce92c0394cb47913098fb47c},

doi = {10.1109/IEA.2017.7939207},

year  = {2017},

date = {2017-01-01},

journal = {2017 4th International Conference on Industrial Engineering and Applications, ICIEA 2017},

pages = {204 – 208},

publisher = {Institute of Electrical and Electronics Engineers Inc.},

abstract = {The continuous population growth of Bangkok has been the main cause of numerous pollution issues, including the significant accumulation of municipal solid waste (MSW). This form of waste has currently been underutilized, as little is used for the production of compost fertilizers, while a there exists no implementation of a bioenergy recovery system. In order to fully utilize MSW, long-term planning for the construction of capable waste management facilities must be developed and executed. To assist the Bangkok Metropolitan Administration (BMA) in understanding the consequences of actions that will take place over the next 20 years, a Geographic Information System (GIS) based a mathematical model has been developed. In terms of optimal financial feasibility, only one candidate location for a waste-to-energy facility exists in Bangkok's Bang Khun Thain district, worth 49 million USD in net present value. Unfortunately, this facility can accommodate only 12 years of generated MSW. If the BMA wishes to handle all of Bangkok's accumulation of MSW in a financially feasible manner, an additional landfill site must be constructed in Lat Krabang district. However, this would reduce the net present value to 11.1 million USD. To better understand the effect of the model's parameters, a sensitivity analysis has also been performed. © 2017 IEEE.},

note = {Cited by: 0},

keywords = {},

pubstate = {published},

tppubtype = {conference}

}