HHHao Huang

Hao Huang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hao Huang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the Middle-Seed Anomaly for Single-Elimination Tournaments

    by Philip Charles Placek, Hao Huang

    We investigate the phenomenon known as the "middle-seed anomaly", which is the statistical fact that it is better to be a 10, 11 or 12 seed than an 8 or 9 seed in the NCAA Division I Men's and Women's Basketball March Madness Tournament. We use simulations to show that this anomaly persists beyond 16-team tournaments and applies to single-elimination tournaments of any size where the number of players is a power of two. We show which rounds of the tournament the anomaly occurs and estimate that some lower-seeds have over a 10% greater chance of reaching later rounds compared to some higher-seeds. This demonstrates that given certain distributions of player strength, the standard seeding may not provide the most fair tournament.

  • Nonlinear Multi-objective Optimization with Probabilistic Branch and Bound

    by Hao Huang, Zelda B. Zabinsky

    A multiple objective simulation optimization algorithm named Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)) is presented for approximating the Pareto optimal set and the associated efficient frontier for stochastic multi-objective optimization problems. MOPBnB(so) evaluates a noisy function exactly once at any solution and uses neighboring solutions to estimate the objective functions, in contrast to a variant that uses multiple replications at a solution to estimate the objective functions. A finite-time performance analysis for deterministic multi-objective problems provides a bound on the probability that MOPBnB(so) captures the Pareto optimal set. Asymptotic convergence of MOPBnB(so) on stochastic problems is derived, in that the algorithm captures the Pareto optimal set and the estimations converge to the true objective function values. Numerical results reveal that the variant with multiple replications is extremely intensive in terms of computational resources compared to MOPBnB(so). In addition, numerical results show that MOPBnB(so) outperforms a genetic algorithm NSGA-II on test problems.


  • Open Access

    Non-linear Multi-objective Optimization with Probabilistic Branch and Bound

    by Hao Huang, Zelda B. Zabinsky

    A multiple objective simulation optimization algorithm named Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)) is presented for approximating the Pareto optimal set and the associated efficient frontier for stochastic multi-objective optimization problems. MOPBnB(so) evaluates a noisy function exactly once at any solution and uses neighboring solutions to estimate the objective functions, in contrast to a variant that uses multiple replications at a solution to estimate the objective functions. A finite-time performance analysis for deterministic multi-objective problems provides a bound on the probability that MOPBnB(so) captures the Pareto optimal set. Asymptotic convergence of MOPBnB(so) on stochastic problems is derived, in that the algorithm captures the Pareto optimal set and the estimations converge to the true objective function values. Numerical results reveal that the variant with multiple replications is extremely intensive in terms of computational resources compared to MOPBnB(so). In addition, numerical results show that MOPBnB(so) outperforms a genetic algorithm NSGA-II on test problems.

  • Open Access

    A Tour Recommendation System Considering Implicit and Dynamic Information

    by Chieh-Yuan Tsai, Kai-Wen Chuang, Hen-Yi Jen, Hao Huang

    Tourism has become one of the world’s largest service industries. Due to the rapid development of social media, more people like self-guided tours than package itineraries planned by travel agencies. Therefore, how to develop itinerary recommendation systems that can provide practical tour suggestions for tourists has become an important research topic. This study proposes a novel tour recommendation system that considers the implicit and dynamic information of Point-of-Interest (POI). Our approach is based on users’ photo information uploaded to social media in various tourist attractions. For each check-in record, we will find the POI closest to the user’s check-in Global Positioning System (GPS) location and consider the POI as the one they want to visit. Instead of using explicit information such as categories to represent POIs, this research uses the implicit feature extracted from the textual descriptions of POIs. Textual description for a POI contains rich and potential information describing the POI’s type, facilities, or activities, which makes it more suitable to represent a POI. In addition, this study considers visiting sequences when evaluating user similarity during clustering so that tourists in each sub-group hold higher behavior similarity. Next, the Non-negative Matrix Factorization (NMF) dynamically derives the staying time for different users, time slots, and POIs. Finally, a personalized itinerary algorithm is developed that considers user preference and dynamic staying time. The system will recommend the itinerary with the highest score and the longest remaining time. A set of experiments indicates that the proposed recommendation system outperforms state-of-the-art next POI recommendation methods regarding four commonly used evaluation metrics.


  • Multiple Objective Simulation Optimization for Emergency Department Resource Allocation

    by Hao Huang, Chih-Wei Cheng

    Emergency departments (EDs) are among the most intensive and dynamic departments in hospital systems. This study considers the resource allocation problem at the ED of a hospital with two objective functions: the length of stay (LS) and wasted resources. The numbers of doctors, nurses, lab technicians, and other medical equipment must be constantly determined to effectively operate EDs with the two objective functions, representing the satisfaction of patients and unnecessary costs, respectively. The ED system is evaluated with a discrete event simulation (DES) model. Furthermore, a Pareto optimal set of solutions is approximated using the quantile-relaxed multiple objective probabilistic branch and bound (QR-MOPBnB), which was developed as an extension algorithm of MOPBnB to improve efficiency. QR-MOPBnB iteratively branches the solution space into subregions and identifies the subregions that are the most promising to be close to the Pareto optimal set. Using QR-MOPBnB, the trade-off between the LS and wasted resources is illustrated for decision makers to appropriately determine the ideal design based on their preferences, and the relaxed Pareto optimal set with statistical quality assurance provides further insights similar to those obtained through sensitivity analysis.