Please use this identifier to cite or link to this item:
|Title:||Transport logistics planning with service-level constraints||Authors:||Lau, H.C.
|Issue Date:||2004||Citation:||Lau, H.C.,Ng, K.M.,Wu, X. (2004). Transport logistics planning with service-level constraints. Proceedings of the National Conference on Artificial Intelligence : 519-524. ScholarBank@NUS Repository.||Abstract:||In this paper, we study a logistics problem arising in military transport planning. A military organization operates a large fleet of vehicles in a depot to serve the requests of various operational units. Each request has a fixed start and end time, and is served by a prescribed number of vehicles. We address the following two problems: (1) how many vehicles are at least needed to meet a given service level of requests; and (2) suppose we allow each request to shift its start time by a constant duration, can all the requests be met? A Niche genetic algorithm, together with a hybridized variant, are applied to the problem.||Source Title:||Proceedings of the National Conference on Artificial Intelligence||URI:||http://scholarbank.nus.edu.sg/handle/10635/43323|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 10, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.