Transport Logistics Planning with Service-Level Constraints
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, call all the requests be met? A Niche genetic algorithm, together with a hybridized variant, are applied to the problem.
Cite
Text
Lau et al. "Transport Logistics Planning with Service-Level Constraints." AAAI Conference on Artificial Intelligence, 2004.Markdown
[Lau et al. "Transport Logistics Planning with Service-Level Constraints." AAAI Conference on Artificial Intelligence, 2004.](https://mlanthology.org/aaai/2004/lau2004aaai-transport/)BibTeX
@inproceedings{lau2004aaai-transport,
title = {{Transport Logistics Planning with Service-Level Constraints}},
author = {Lau, Hoong Chuin and Ng, Kien Ming and Wu, Xiaotao},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2004},
pages = {519-524},
url = {https://mlanthology.org/aaai/2004/lau2004aaai-transport/}
}