Li‐Hsing Ho
Papers
1
Total Citations
10
H-Index
1
About
Li-Hsing Ho is a pioneer in the optimization of dynamic robotic assembly systems, with a career focused on advancing manufacturing efficiency through intelligent computational methods. His most-cited work introduces a novel tabu search approach that simultaneously solves the placement sequence and magazine assignment problem—a critical challenge in high-speed robotics. While prior research relied on the Traveling Salesman Problem (TSP) with fixed coordinates and arbitrary magazine assignments, Ho demonstrated that this approach is suboptimal for real-world dynamic assembly. By integrating tabu search, his algorithm significantly reduces robotic travel time and improves throughput, offering a more flexible and efficient solution. Though his seminal 1998 paper has garnered 10 citations, its conceptual impact is substantial, laying groundwork for later metaheuristic applications in manufacturing. Ho’s contribution lies in reframing a classic industrial problem, showing that optimization must account for the interdependence of placement sequencing and component feeding. His work remains a reference for researchers exploring hybrid metaheuristics in robotics and production systems, highlighting the enduring value of questioning established assumptions in engineering optimization.
Research Focus
Key Achievements
Top Papers
- 1