scispace - formally typeset
H

Hsin-Vonn Seow

Researcher at University of Nottingham Malaysia Campus

Publications -  29
Citations -  1029

Hsin-Vonn Seow is an academic researcher from University of Nottingham Malaysia Campus. The author has contributed to research in topics: Vehicle routing problem & Ant colony optimization algorithms. The author has an hindex of 9, co-authored 26 publications receiving 735 citations. Previous affiliations of Hsin-Vonn Seow include University of Southampton & University of Nottingham.

Papers
More filters
Journal ArticleDOI

Benchmarking state-of-the-art classification algorithms for credit scoring: An update of research

TL;DR: The study of Baesens et al. (2003) is updated and several novel classification algorithms to the state-of-the-art in credit scoring are compared, providing an independent assessment of recent scoring methods and offering a new baseline to which future approaches can be compared.
Journal ArticleDOI

The efficiency of the hotel industry in Singapore

TL;DR: In this article, the Slacks-Based Measure (SBM) model was used to identify the efficient years and then the efficient DMUs were ranked with the SBM model of super-efficiency.
Journal ArticleDOI

Genetic Algorithm for Biobjective Urban Transit Routing Problem

TL;DR: The proposed algorithm employs an adding-node procedure which helps in converting an infeasible solution to a feasible solution and a simple yet effective route crossover operator is proposed by utilizing a set of feasibility criteria to reduce the possibility of producing aninfeasible network.
Journal ArticleDOI

Forex exchange rate forecasting using deep recurrent neural networks

TL;DR: Empirical results indicate the suitability of deep networks for exchange rate forecasting in general but also evidence the difficulty of implementing and tuning corresponding architectures, especially with regard to trading profit.
Journal ArticleDOI

Ant Colony Optimization for Capacitated Vehicle Routing Problem

TL;DR: ACO with swap and 3-opt heuristic has the capability to tackle the Capacitated Vehicle Routing Problem with satisfactory solution quality and run time and is a viable alternative for solving the CVRP.