Transport logistics planning with service-level constraints

Authors:
Hoong Chuin Lau;Kien Ming Ng;Xiaotao Wu
Affiliations:
The Logistics Institute, Asia Pacific and National University of Singapore;The Logistics Institute, Asia Pacific and National University of Singapore;The Logistics Institute, Asia Pacific and National University of Singapore
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 10
Cited 0

Scheduling jobs with fixed start and end times

Discrete Applied Mathematics
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Genetic algorithms with sharing for multimodal function optimization

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows

Management Science
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs

Information Processing Letters
On-line scheduling of jobs with fixed start and end times

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Niching methods for genetic algorithms

Niching methods for genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984

Quantified Score

Hi-index	0.00

Visualization

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.