Kwong Meng Teo

Learn More
This paper introduces a variant of the vehicle routing problem with time windows where a limited number of vehicles is given (m-VRPTW). Under this scenario, a feasible solution is one that may contain either unserved customers and/or relaxed time windows. We provide a computable upper bound to the problem. To solve the problem, we propose a tabu search(More)
In engineering design, an optimized solution often turns out to be suboptimal, when errors are encountered. While the theory of robust convex optimization has taken significant strides over the past decade, all approaches fail if the underlying cost function is not explicitly given; it is even worse if the cost function is nonconvex. In this work, we(More)
W propose a new robust optimization method for problems with objective functions that may be computed via numerical simulations and incorporate constraints that need to be feasible under perturbations. The proposed method iteratively moves along descent directions for the robust problem with nonconvex constraints and terminates at a robust local minimum. We(More)
In engineering design, an optimized solution often turns out to be suboptimal, when implementation errors are encountered. While the theory of robust convex optimization has taken significant strides over the past decade, all approaches fail if the underlying cost function is not explicitly given; it is even worse if the cost function is nonconvex. In this(More)
The dynamic characteristic of an autonomous underwater vehicle (AUV) is affected when it is reconfigured with different payloads. It is desirable to have an updated model, such that the control and guidance law can be redesigned to obtain better performance. Hence, we develop a method to enable online identification of AUV dynamics via in-field experiments,(More)
1 Given many cities’ growing dependence on public rail transport, simple network disruptions can 2 lead to widespread confusion and significant productivity loss to the society. Therefore, a sys3 tematic approach to develop efficient disruption response and minimize the negative impacts is 4 required. In this paper, we develop a planning procedure to(More)
Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more(More)
Considering the dynamic environments where mechanical failures and/or ground-based threats take place, unmanned aerial vehicles (UAVs) may be lost when performing tasks. As such, designing path planning algorithms in such dynamic scenarios poses significant challenges. In this paper, we propose a cooperative path planning algorithm that is decentralized and(More)
Urban mobility is a prevalent problem in many cities around the world. Cycling offers a fast and cheap transportation option for short-distance trips, with smaller carbon and physical footprint than driving a car. Cycling can also encourage a modal shift from private car to public transport by providing efficient last mile connections. This has led to a(More)