Conference Proceeding Article
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, call all the requests be met? A Niche genetic algorithm, together with a hybridized variant, are applied to the problem.
Computer Sciences | Operations Research, Systems Engineering and Industrial Engineering | Transportation
Intelligent Systems and Decision Analytics
Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), 25-29 July 2004, San Jose
City or Country
San Jose, CA
LAU, Hoong Chuin; NG, K. M.; and WU, Xintao.
Transport Logistics Planning with Service-Level Constraints. (2004). Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), 25-29 July 2004, San Jose. 519-524. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1126
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.