Assoc. Prof. Pisit Jarumaneeroj, Ph.D.
- 7th Floor of Engineering 4 Bldg., Room 702
- +66-2218-6842
- pisit.ja@chula.ac.th
Overview
Dr. Pisit Jarumaneeroj is an Associate Professor at the Department of Industrial Engineering, Chulalongkorn University. His research focuses not only on the applications of optimization in the field of Logistics and Supply Chain Management but also the analysis of complicated transportation networks, where one of his publications concerning a development of new connectivity index for container ports is awarded a prize from the publisher.
Education
Ph.D. Supply Chain Engineering
Georgia Institute of Technology, United States, 2014
M.S. Industrial Engineering
Georgia Institute of Technology, United States, 2009
B.Eng Industrial Engineering (First Class Honours)
Chulalongkorn University, Thailand, 2004
Expertise
Operations Research
Publications
2017
Chakrit Pakprajum, Pisit Jarumaneeroj
An integrated MILP for music rehearsal problems with waiting time Conference
Institute of Electrical and Electronics Engineers Inc., 2017, (Cited by: 1).
@conference{Pakprajum2017214,
title = {An integrated MILP for music rehearsal problems with waiting time},
author = {Chakrit Pakprajum and Pisit Jarumaneeroj},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021448704&doi=10.1109%2fIEA.2017.7939209&partnerID=40&md5=381333b979b78cddd7fb3117802b677a},
doi = {10.1109/IEA.2017.7939209},
year = {2017},
date = {2017-01-01},
journal = {2017 4th International Conference on Industrial Engineering and Applications, ICIEA 2017},
pages = {214 – 218},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {Music rehearsal is crucial for any concerts and orchestral performances as it helps those related players ready for the lives. Frequent rehearsing is preferable; but, not that practical in real life due to immense operational costs, including major costs of rental and wages. The number of rehearsal components, i.e. music pieces and musicians, also affects the rehearsal planning as it complicates the assigning and sequencing of those underlining elements in multiple rehearsal days. Improper planning may also leave uninvolved players stay idle in the rehearsal place. While this so-called music rehearsal problem is typically solved by two-stage heuristics, this paper aims to develop an integrated MILP that solves such a problem to optimality in one stage. This model is a combination of the capacitated vehicle routing problem and traditional music rehearsal problem. We test our model with 16 benchmark instances from previous studies. The optimal solutions to those instances are successfully found and reported with total computational time. © 2017 IEEE.},
note = {Cited by: 1},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Music rehearsal is crucial for any concerts and orchestral performances as it helps those related players ready for the lives. Frequent rehearsing is preferable; but, not that practical in real life due to immense operational costs, including major costs of rental and wages. The number of rehearsal components, i.e. music pieces and musicians, also affects the rehearsal planning as it complicates the assigning and sequencing of those underlining elements in multiple rehearsal days. Improper planning may also leave uninvolved players stay idle in the rehearsal place. While this so-called music rehearsal problem is typically solved by two-stage heuristics, this paper aims to develop an integrated MILP that solves such a problem to optimality in one stage. This model is a combination of the capacitated vehicle routing problem and traditional music rehearsal problem. We test our model with 16 benchmark instances from previous studies. The optimal solutions to those instances are successfully found and reported with total computational time. © 2017 IEEE.
Kant Chareancholwanich, Pisit Jarumaneeroj
A network-based model for solving Inventory Routing Problem in the asphalt industry: A case study Conference
Association for Computing Machinery, 2017, (Cited by: 0).
@conference{Chareancholwanich2017294,
title = {A network-based model for solving Inventory Routing Problem in the asphalt industry: A case study},
author = {Kant Chareancholwanich and Pisit Jarumaneeroj},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85019497638&doi=10.1145%2f3056662.3056720&partnerID=40&md5=8fa77442d54898319118190a9156dc60},
doi = {10.1145/3056662.3056720},
year = {2017},
date = {2017-01-01},
journal = {ACM International Conference Proceeding Series},
pages = {294 – 298},
publisher = {Association for Computing Machinery},
abstract = {This paper proposes a network-based model, called the Time-Expanded Network Optimization Model, for solving a real-world Three-Tier Inventory Routing Problem combined with split delivery (Three-Tier SDIRP) in the asphalt industry. This network model, together with its associated elements, is constructed based on the information of a leading local asphalt company, located in Thailand. We show that the proposed methodology, with proper modifications, efficiently solves the problem and provides quite outstanding results. The numerical results notably indicate considerable improvement on both total operational costs and delivery quantity per travelled distance, a wildly used performance index for fluid transportation industries; approximately 32.2% and 47.5%, respectively. © 2017 ACM.},
note = {Cited by: 0},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
This paper proposes a network-based model, called the Time-Expanded Network Optimization Model, for solving a real-world Three-Tier Inventory Routing Problem combined with split delivery (Three-Tier SDIRP) in the asphalt industry. This network model, together with its associated elements, is constructed based on the information of a leading local asphalt company, located in Thailand. We show that the proposed methodology, with proper modifications, efficiently solves the problem and provides quite outstanding results. The numerical results notably indicate considerable improvement on both total operational costs and delivery quantity per travelled distance, a wildly used performance index for fluid transportation industries; approximately 32.2% and 47.5%, respectively. © 2017 ACM.
Kanok Kitisook, Pisit Jarumaneeroj
A variable arc exchange heuristic for float glass manufacturing problems Conference
Institute of Electrical and Electronics Engineers Inc., 2017, (Cited by: 2).
@conference{Kitisook201750,
title = {A variable arc exchange heuristic for float glass manufacturing problems},
author = {Kanok Kitisook and Pisit Jarumaneeroj},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021452420&doi=10.1109%2fIEA.2017.7939177&partnerID=40&md5=98f4bc3230362ca7f7b534b3d1ea215f},
doi = {10.1109/IEA.2017.7939177},
year = {2017},
date = {2017-01-01},
journal = {2017 4th International Conference on Industrial Engineering and Applications, ICIEA 2017},
pages = {50 – 54},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {Float glass manufacturing problems concern a finding of cost minimizing production sequence such that total scraps are minimized. We show that these problems could be transformed into Asymmetric Traveling Salesman Problems with Time Window (ATSPTW), where a customer is defined as a production order and an arc connecting two orders indicates changeover scraps and setup time. A variable arc exchange heuristic, comprising of 2-opt and 3-opt, is proposed for solving those large problem instances. The results from the proposed heuristic, when compared with those of the optimization model, indicate that both could successfully find the optimal solution to the problems of smaller size. When the problems get bigger, the solution quality of our proposed heuristic deteriorates; but, with tractable computational time compared with that of the optimization model, whose solution could not be found due to a run-out-of-memory error. © 2017 IEEE.},
note = {Cited by: 2},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Float glass manufacturing problems concern a finding of cost minimizing production sequence such that total scraps are minimized. We show that these problems could be transformed into Asymmetric Traveling Salesman Problems with Time Window (ATSPTW), where a customer is defined as a production order and an arc connecting two orders indicates changeover scraps and setup time. A variable arc exchange heuristic, comprising of 2-opt and 3-opt, is proposed for solving those large problem instances. The results from the proposed heuristic, when compared with those of the optimization model, indicate that both could successfully find the optimal solution to the problems of smaller size. When the problems get bigger, the solution quality of our proposed heuristic deteriorates; but, with tractable computational time compared with that of the optimization model, whose solution could not be found due to a run-out-of-memory error. © 2017 IEEE.
Pisit Jarumaneeroj, Siriwat Kunaporn
A variable neighbourhood search approach for crew transportation problems Conference
Institute of Electrical and Electronics Engineers Inc., 2017, (Cited by: 2).
@conference{Jarumaneeroj2017229,
title = {A variable neighbourhood search approach for crew transportation problems},
author = {Pisit Jarumaneeroj and Siriwat Kunaporn},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021418321&doi=10.1109%2fIEA.2017.7939212&partnerID=40&md5=35140f1c89d0ec5dbb3b030ee447a463},
doi = {10.1109/IEA.2017.7939212},
year = {2017},
date = {2017-01-01},
journal = {2017 4th International Conference on Industrial Engineering and Applications, ICIEA 2017},
pages = {229 – 233},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {Transporting products from the depot to various destinations is a general problem in logistics world. However, complications arise when the objective is changed from transporting goods to transferring people, as both distance-related costs and man-hour loss must be taken into account. This paper presents a Variable Neighbourhood Search (VNS) based heuristic that helps route planners of an oil and gas exploration company identify a set of promising least-cost routes, including the implicit cost of man-hour loss. Such a heuristic is developed based on a combination of several well-known heuristics in a two-phase manner. More specifically, in the first phase, an initial solution is constructed by the least man-hour loss insertion method; then, it is further improved by a series of intra-route and inter-route exchanges in the latter phase - 2-opt is applied for intra-route improvement; lambda-interchange and b-cyclic k-transfer are performed for inter-route improvement. Compared with the actual plan, an improvement on both average travelled distance and man-hour loss reduction is evident, where the magnitude of savings depends on weights assigned to each criterion. © 2017 IEEE.},
note = {Cited by: 2},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Transporting products from the depot to various destinations is a general problem in logistics world. However, complications arise when the objective is changed from transporting goods to transferring people, as both distance-related costs and man-hour loss must be taken into account. This paper presents a Variable Neighbourhood Search (VNS) based heuristic that helps route planners of an oil and gas exploration company identify a set of promising least-cost routes, including the implicit cost of man-hour loss. Such a heuristic is developed based on a combination of several well-known heuristics in a two-phase manner. More specifically, in the first phase, an initial solution is constructed by the least man-hour loss insertion method; then, it is further improved by a series of intra-route and inter-route exchanges in the latter phase – 2-opt is applied for intra-route improvement; lambda-interchange and b-cyclic k-transfer are performed for inter-route improvement. Compared with the actual plan, an improvement on both average travelled distance and man-hour loss reduction is evident, where the magnitude of savings depends on weights assigned to each criterion. © 2017 IEEE.
Saranya Ramchuankiat, Pisit Jarumaneeroj, Chusak Limotai, Supatporn Tepmongkol, Yothin Rakvongthai
Impact of injection time on migration of SPECT seizure onset in temporal lobe epilepsy Conference
Institute of Electrical and Electronics Engineers Inc., 2017, (Cited by: 15).
@conference{Ramchuankiat20171465,
title = {Impact of injection time on migration of SPECT seizure onset in temporal lobe epilepsy},
author = {Saranya Ramchuankiat and Pisit Jarumaneeroj and Chusak Limotai and Supatporn Tepmongkol and Yothin Rakvongthai},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85032175991&doi=10.1109%2fEMBC.2017.8037111&partnerID=40&md5=0fe97298cffd0a3c8bd3562d9b77c6cd},
doi = {10.1109/EMBC.2017.8037111},
year = {2017},
date = {2017-01-01},
journal = {Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS},
pages = {1465 – 1468},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {In this work, we investigated an impact of injection time on migration of seizure-onset in ictal/interictal single photon emission computed tomography (SPECT) study for patients with temporal lobe epilepsy. We selected 33 patients with refractory temporal lobe epilepsy who underwent ictal/interictal SPECT studies and had preoperative intracranial EEG result or surgical resection which was used as reference for seizure location. We divided all patients into two groups, which are the fast and the delayed groups; the delayed group comprised patients with injection time more than a cutoff time and vice versa. Using the subtraction ictal-interictal SPECT co-registered with SPECT (SISCOS) with varied Z-threshold (1.0, 1.5, 2.0 and 2.5), a method similar to subtraction ictal SPECT co-registered to magnetic resonance imaging (MRI) (SISCOM), a seizure-onset region in the SISCOS image was localized at the region with maximum sum of Z-scores. For each pair of cutoff time and Z-threshold, we determined the migratory proportion which was defined as the proportion of patients whose seizure-onset location based on SISCOS image was discordant with the reference. At cutoff time of 32-35 seconds and the Z-threshold of 2.0, the migratory proportion values were 7/26 (26.9%) and 5/7 (71.4%) in the fast and the delayed groups, respectively. At the same range of cutoff time with the Z-threshold of 2.5, the migratory proportion was 8/26 (30.8%) in the fast group while the proportion was 5/7 (71.4%) in the delayed group. Using Fisher's exact test, the migratory proportion values at the Z-threshold of 2.0 and 2.5 were significantly different between the fast and the delayed groups (p = 0.0709 and 0.0838, respectively), suggesting that patients with temporal lobe epilepsy who undergo an ictal/interictal SPECT study with injection time longer than 35 seconds tend to have seizure-onset zone migration in the SISCOS analysis with the traditionally-used Z-threshold of 2.0. © 2017 IEEE.},
note = {Cited by: 15},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
In this work, we investigated an impact of injection time on migration of seizure-onset in ictal/interictal single photon emission computed tomography (SPECT) study for patients with temporal lobe epilepsy. We selected 33 patients with refractory temporal lobe epilepsy who underwent ictal/interictal SPECT studies and had preoperative intracranial EEG result or surgical resection which was used as reference for seizure location. We divided all patients into two groups, which are the fast and the delayed groups; the delayed group comprised patients with injection time more than a cutoff time and vice versa. Using the subtraction ictal-interictal SPECT co-registered with SPECT (SISCOS) with varied Z-threshold (1.0, 1.5, 2.0 and 2.5), a method similar to subtraction ictal SPECT co-registered to magnetic resonance imaging (MRI) (SISCOM), a seizure-onset region in the SISCOS image was localized at the region with maximum sum of Z-scores. For each pair of cutoff time and Z-threshold, we determined the migratory proportion which was defined as the proportion of patients whose seizure-onset location based on SISCOS image was discordant with the reference. At cutoff time of 32-35 seconds and the Z-threshold of 2.0, the migratory proportion values were 7/26 (26.9%) and 5/7 (71.4%) in the fast and the delayed groups, respectively. At the same range of cutoff time with the Z-threshold of 2.5, the migratory proportion was 8/26 (30.8%) in the fast group while the proportion was 5/7 (71.4%) in the delayed group. Using Fisher’s exact test, the migratory proportion values at the Z-threshold of 2.0 and 2.5 were significantly different between the fast and the delayed groups (p = 0.0709 and 0.0838, respectively), suggesting that patients with temporal lobe epilepsy who undergo an ictal/interictal SPECT study with injection time longer than 35 seconds tend to have seizure-onset zone migration in the SISCOS analysis with the traditionally-used Z-threshold of 2.0. © 2017 IEEE.
Intira Thechamani, Supattra Visessri, Pisit Jarumaneeroj
Modeling of Multi-Reservoir Systems Operation in the Chao Phraya River Basin Conference
Institute of Electrical and Electronics Engineers Inc., 2017, (Cited by: 2).
@conference{Thechamani2017,
title = {Modeling of Multi-Reservoir Systems Operation in the Chao Phraya River Basin},
author = {Intira Thechamani and Supattra Visessri and Pisit Jarumaneeroj},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85027876244&doi=10.1109%2fICIMSA.2017.7985595&partnerID=40&md5=100e2c7b764297568b4fdab1925aff5b},
doi = {10.1109/ICIMSA.2017.7985595},
year = {2017},
date = {2017-01-01},
journal = {2017 International Conference on Industrial Engineering, Management Science and Application, ICIMSA 2017},
publisher = {Institute of Electrical and Electronics Engineers Inc.},
abstract = {Reservoir is one of water management facilities. The role of the reservoir has become prominent in recent years due to increased demand for water, intensified pressure on limited water resources, more frequent extreme weather, and heightened degree of climate change. The management of multiple and multi-purpose reservoir systems is complex as it involves the issues of dimensionalities, nonlinearities and conflicts between different objectives. Optimization and simulation models have been used as a tool for providing quantitative information regarding optimal reservoir operation. This research demonstrates the use of optimization techniques to improve water allocation for multiple and multi-purpose reservoir systems. The optimal reservoir releases were determined by linear programing using IBM ILOG CPLEX Optimization Studio software. The objective function was developed to minimize water deficit in dry years under the constraints of reservoir storage, reservoir continuity, and water balance at each node of the river network. Two modeling approaches including time horizon and non-time horizon were applied to a case study of the Lower Chao Phraya River basin which is characterized by two reservoirs and a number of control structures along the channels. When compared to non- time horizon, the time horizon gave higher accuracy of the results. This suggested that using time horizon framework could provide beneficial support for better reservoir management and operational efficiency. © 2017 IEEE.},
note = {Cited by: 2},
keywords = {},
pubstate = {published},
tppubtype = {conference}
}
Reservoir is one of water management facilities. The role of the reservoir has become prominent in recent years due to increased demand for water, intensified pressure on limited water resources, more frequent extreme weather, and heightened degree of climate change. The management of multiple and multi-purpose reservoir systems is complex as it involves the issues of dimensionalities, nonlinearities and conflicts between different objectives. Optimization and simulation models have been used as a tool for providing quantitative information regarding optimal reservoir operation. This research demonstrates the use of optimization techniques to improve water allocation for multiple and multi-purpose reservoir systems. The optimal reservoir releases were determined by linear programing using IBM ILOG CPLEX Optimization Studio software. The objective function was developed to minimize water deficit in dry years under the constraints of reservoir storage, reservoir continuity, and water balance at each node of the river network. Two modeling approaches including time horizon and non-time horizon were applied to a case study of the Lower Chao Phraya River basin which is characterized by two reservoirs and a number of control structures along the channels. When compared to non- time horizon, the time horizon gave higher accuracy of the results. This suggested that using time horizon framework could provide beneficial support for better reservoir management and operational efficiency. © 2017 IEEE.
2016
John J Bartholdi, Pisit Jarumaneeroj, Amar Ramudhin
A new connectivity index for container ports Journal Article
In: Maritime Economics and Logistics, vol. 18, no. 3, pp. 231 – 249, 2016, (Cited by: 64; All Open Access, Green Open Access).
@article{Bartholdi2016231,
title = {A new connectivity index for container ports},
author = {John J Bartholdi and Pisit Jarumaneeroj and Amar Ramudhin},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048854752&doi=10.1057%2fmel.2016.5&partnerID=40&md5=d5093745e03b210eaff6810b2ffc2248},
doi = {10.1057/mel.2016.5},
year = {2016},
date = {2016-01-01},
journal = {Maritime Economics and Logistics},
volume = {18},
number = {3},
pages = {231 – 249},
publisher = {Palgrave Macmillan Ltd.},
abstract = {We propose a new index, the Container Port Connectivity Index, to measure the trade connectivity of ports within the network of container shipping. This index is based on both economics and network topology, and a distinctive feature is that the strength of a port is based on its position within the global structure of the shipping network, and not just on local information such as the number of TEUs handled, or direct links to other ports. Furthermore, the index produces separate scores for inbound and outbound container movements and in so doing it supports more detailed analyses. We explore the usefulness of the index by analyzing the global network of scheduled mainline container-shipping services as it existed in September 2011. © 2016 Macmillan Publishers Ltd.},
note = {Cited by: 64; All Open Access, Green Open Access},
keywords = {},
pubstate = {published},
tppubtype = {article}
}
We propose a new index, the Container Port Connectivity Index, to measure the trade connectivity of ports within the network of container shipping. This index is based on both economics and network topology, and a distinctive feature is that the strength of a port is based on its position within the global structure of the shipping network, and not just on local information such as the number of TEUs handled, or direct links to other ports. Furthermore, the index produces separate scores for inbound and outbound container movements and in so doing it supports more detailed analyses. We explore the usefulness of the index by analyzing the global network of scheduled mainline container-shipping services as it existed in September 2011. © 2016 Macmillan Publishers Ltd.