David Lai

Dr. David Lai


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2016 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
DLDavid Lai
David Lai
ODOzgun Caliskan Demirag
Ozgun Caliskan Demirag
JLJanny M.Y. Leung
Janny M.Y. Leung

1 March 2020 in Transportation Science
Verified
Journal Article
Closed access
MHMaaike Hoogeboom
Maaike Hoogeboom
WDWout Dullaert
Wout Dullaert
DLDavid Lai
David Lai
DVDaniele Vigo
Daniele Vigo
In the vehicle routing problem with multiple time windows (VRPMTW), a single time window must be selected for each customer from the multiple time windows provided. Compared with classical vehicle routing problems with only a single time window per customer, multiple time windows increase the complexity of the routing problem. To minimize the duration of any given route, we present an exact polynomial time algorithm to efficiently determine the optimal start time for servicing each customer. The proposed algorithm has a reduced worst-case and average complexity than existing exact algorithms. Furthermore, the proposed exact algorithm can be used to efficiently evaluate neighborhood operations during a local search resulting in significant acceleration. To examine the benefits of exact neighborhood evaluations and to solve the VRPMTW, the proposed algorithm is embedded in a simple metaheuristic framework generating numerous new best known solutions at competitive computation times.

1 June 2018 in Transportation Research Part E: Logistics and Transportation Review
Verified
Journal Article
Closed access
MNMarije Noordhoek
Marije Noordhoek
WDWout Dullaert
Wout Dullaert
DLDavid Lai
David Lai
SLSander De Leeuw
Sander De Leeuw

1 February 2024 in Computers & Operations Research
Verified
Journal Article
Open access
DLDavid Lai
David Lai
YCYasel Costa
Yasel Costa
EDEmrah Demir
Emrah Demir
AFAlexandre M. Florio
Alexandre M. Florio
Tom Van WoenselTom Van Woensel
Tom Van Woensel

1 July 2019 in Transportation Science
Verified
Journal Article
Closed access
SDSaid Dabia
Said Dabia
DLDavid Lai
David Lai
DVDaniele Vigo
Daniele Vigo
The vehicle routing problem with private fleet and common carrier (VRPPC) is a generalization of the classical vehicle routing problem in which the owner of a private fleet can either visit a customer with one of the owner’s vehicles or assign the customer to a common carrier. The latter case occurs if the demand exceeds the total capacity of the private fleet or if it is more economically convenient to do so. The owner’s objective is to minimize the variable and fixed costs for operating the owner’s fleet plus the total cost charged by the common carrier. This family of problems has many practical applications, particularly in the design of last-mile distribution services and has received some attention in the literature, in which some heuristics were proposed. We extend here the VRPPC by considering more realistic cost structures that account for quantity discounts on outsourcing costs and by considering time windows resulting in a rich VRPPC (RVRPPC). We present an exact approach based on a branch-and-cut-and-price algorithm for the RVRPPC and test the algorithm on instances from the literature.

15 May 2017 in Transportmetrica B: Transport Dynamics
Verified
Journal Article
Open access
DLDavid Lai
David Lai
JLJanny M. Y. Leung
Janny M. Y. Leung
This research is motivated by the operations of a public transit company in Hong Kong. We investigate how real-time information can be utilized in combination with historical data to improve routing and scheduling decisions practically. A dynamic integrated vehicle and crew scheduling problem is studied where travel times are stochastic and time-dependent. The objective is to maximize the route frequencies and mileage to provide good passenger service and simultaneously minimize crew overtime and meal-break delays. To mitigate unexpected delays due to uncertainties in operations, various mathematical models are proposed for revising the schedules in real time under a rolling-horizon framework. Their efficiency and effectiveness are evaluated via simulation using real-world data. The simulation results also identify the potential benefits of revising the schedule dynamically in real time using optimization models. The results show that the proposed approaches can significantly reduce motormen overtime and meal-break delays while maintaining coverage and route frequency requirements.