Kien Hua Ting
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kien Hua Ting has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Hsin-Vonn Seow
School of Business, University of Nottingham Malaysia Campus, Semenyih, Selangor, Malaysia
1 shared publication - Lai Soon Lee
Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia
1 shared publication Noraini Abdullah
Faculty of Science and Natural Resources Universiti Malaysia Sabah Kota Kinabalu Sabah Malaysia
1 shared publication- Stefan Pickl
Institute of Theoretical Computer Science, Mathematics and Operations Research University of the Bundeswehr Munich Neubiberg Germany
1 shared publication
Latest Publications
- Open Access
- 29 August 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (17) , 7996
Shared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches
The Shared Mobility Problems (SMP) with the rideshare concept based on sharing a vehicle are fast becoming a trend in many urban cities around the world. Examples of these problems are like ridesharing, carpooling, taxisharing, buspooling, vanpooling, and multi-modal ridesharing. This is the new way to access transportation services by those who are propelling the sharing economy, where access rather than ownership is the new norm. This paper provides a systematic review of SMP using the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method. A total of 110 papers from the last decade are selected from 12 abstracts and citation databases to be reviewed and classified. This is done based on the problem types, variants, characteristics, and solution approaches. The current trends and analysis of the survey findings are also summarised. From this systematic review, it is observed that both the time window and multi-objective problems are popular among the researchers, while the minimisation of the total cost is the main concern in the literature of the SMP. Both static and dynamic cases of the SMP are the most researched where heuristic and metaheuristic approaches are widely adopted by the researchers in the literature. Finally, challenges and suggestions for future work are discussed and highlighted.
- 29 August 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (17) , 7996
Open AccessShared Mobility Problems: A Systematic Review on Types, Variants, Characteristics, and Solution Approaches
The Shared Mobility Problems (SMP) with the rideshare concept based on sharing a vehicle are fast becoming a trend in many urban cities around the world. Examples of these problems are like ridesharing, carpooling, taxisharing, buspooling, vanpooling, and multi-modal ridesharing. This is the new way to access transportation services by those who are propelling the sharing economy, where access rather than ownership is the new norm. This paper provides a systematic review of SMP using the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method. A total of 110 papers from the last decade are selected from 12 abstracts and citation databases to be reviewed and classified. This is done based on the problem types, variants, characteristics, and solution approaches. The current trends and analysis of the survey findings are also summarised. From this systematic review, it is observed that both the time window and multi-objective problems are popular among the researchers, while the minimisation of the total cost is the main concern in the literature of the SMP. Both static and dynamic cases of the SMP are the most researched where heuristic and metaheuristic approaches are widely adopted by the researchers in the literature. Finally, challenges and suggestions for future work are discussed and highlighted.
- Open Access
- 16 July 2019
- Published by Universiti Malaysia Sabah (UMS) in Journal of the Asian Academy of Applied Business (JAAAB)
- Vol. 5
IDENTIFICATION OF LEAST CONGESTED AND SHORTEST DISTANCE PATH IN TRAFFIC NETWORK
Traffic congestion, a mobility problem that exists as the traffic volume demand exceeds the capacity of the existing intersections. Conventional approaches such as building flyover and road widening might not be very effective in solving traffic congestion. Therefore, a suggested approach in this study was to change the driver’s behavior in selecting the best path. The shortest path may not be the best path. The added criterion in selecting the best path was the level of service of the path, while the included parameter that determines the level of service was the degree of saturation. Dijkstra’s algorithm was applied to solve the network graph. Excel solver was used to find the solution. Percentage of difference between paths was carried out to find out the difference and significant of the paths. In conclusion, the path with combined criteria of shortest distance and least congested (degree of saturation) would be the best path, instead of solely based on the shortest distance or minimum degree of saturation. Keywords: Degree of Saturation, Distance, Least Congested, Shortest Path, Dijkstra’s Algorithm and Traffic Network
- 16 July 2019
- Published by Universiti Malaysia Sabah (UMS) in Journal of the Asian Academy of Applied Business (JAAAB)
- Vol. 5
Open AccessIDENTIFICATION OF LEAST CONGESTED AND SHORTEST DISTANCE PATH IN TRAFFIC NETWORK
Traffic congestion, a mobility problem that exists as the traffic volume demand exceeds the capacity of the existing intersections. Conventional approaches such as building flyover and road widening might not be very effective in solving traffic congestion. Therefore, a suggested approach in this study was to change the driver’s behavior in selecting the best path. The shortest path may not be the best path. The added criterion in selecting the best path was the level of service of the path, while the included parameter that determines the level of service was the degree of saturation. Dijkstra’s algorithm was applied to solve the network graph. Excel solver was used to find the solution. Percentage of difference between paths was carried out to find out the difference and significant of the paths. In conclusion, the path with combined criteria of shortest distance and least congested (degree of saturation) would be the best path, instead of solely based on the shortest distance or minimum degree of saturation. Keywords: Degree of Saturation, Distance, Least Congested, Shortest Path, Dijkstra’s Algorithm and Traffic Network