Loo Hay Lee

Loo Hay Lee

Auto-generated profile, based on publicly available information

Loo Hay Lee

Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
1 August 2013 in International Journal of Production Economics
Verified
Journal Article
Closed access
MHMin Huang
Min Huang
MSMin Song
Min Song
LLLoo Hay Lee
Loo Hay Lee
WCWai Ki Ching
Wai Ki Ching

1 September 2016 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
YWYuan Wang
Yuan Wang
DZDongxiang Zhang
Dongxiang Zhang
QLQing Liu
Qing Liu
FSFumin Shen
Fumin Shen
LLLoo Hay Lee
Loo Hay Lee

1 February 2019 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
YWYuan Wang
Yuan Wang
DZDongxiang Zhang
Dongxiang Zhang
YLYing Liu
Ying Liu
BDBo Dai
Bo Dai
LLLoo Hay Lee
Loo Hay Lee

1 November 2008 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
CCChun-Hung Chen
Chun-Hung Chen
DHDonghai He
Donghai He
MFMichael Fu
Michael Fu
LLLoo Hay Lee
Loo Hay Lee
We consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correctly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this correct selection probability, we derive an asymptotically optimal allocation and propose an easy-to-implement heuristic sequential allocation procedure. Numerical experiments indicate that the resulting allocations are superior to other methods in the literature that we tested, and the relative efficiency increases for larger problems. In addition, preliminary numerical results indicate that the proposed new procedure has the potential to enhance computational efficiency for simulation optimization.

1 November 2011 in Transportation Science
Verified
Journal Article
Closed access
LZLu Zhen
Lu Zhen
ECEk Peng Chew
Ek Peng Chew
LLLoo Hay Lee
Loo Hay Lee
This paper studies two tactical level decision problems arising in transshipment hubs: berth template planning that is concerned with allocating berths and quay cranes to arriving vessels, and yard template planning that is concerned with assigning yard storage locations to vessels. These two tactical level decisions interact with each other. A mixed-integer programming model is proposed to integrate the berth template and the yard template planning with the aim to minimize the service cost that is incurred by the deviation from vessels' expected turnaround time intervals, and the operation cost that is related to the route length of transshipment container flows in yard. Moreover, a heuristic algorithm is developed for solving the problem in large-scale realistic environments. Numerical experiments are conducted to prove the necessity of the proposed model and also validate the efficiency of the proposed heuristic algorithm. For a set of real-world like instances, the heuristic algorithm can obtain good berth and yard templates within a reasonable time.

18 October 2005 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
KTK. C. Tan
K. C. Tan
YCY. H. Chew
Y. H. Chew
LLL. H. Lee
L. H. Lee