Name
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. |
Year | Venue | Keywords |
|---|---|---|
2004 | AAAI | hybridized variant,military organization,start time,fixed start,service-level constraint,large fleet,military transport planning,transport logistics,logistics problem,constant duration,niche genetic algorithm,end time,service level,exact solution,hybrid algorithm,branch and bound,genetic algorithm,transportation planning |
Field | DocType | ISBN |
Mathematical optimization,Service level,Computer science,Simulation,Operations research,Niche genetic algorithm,Transportation planning | Conference | 0-262-51183-5 |
Citations | PageRank | References |
1 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hoong Chuin Lau | 1 | 739 | 91.69 |
| Kien Ming Ng | 2 | 126 | 12.14 |
| Xiaotao Wu | 3 | 6 | 1.45 |