Transport Logistics Planning with Service-Level Constraints

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.

[1]  Barbara B. Simons,et al.  Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines , 1983, SIAM J. Comput..

[2]  Esther M. Arkin,et al.  Scheduling jobs with fixed start and end times , 1987, Discret. Appl. Math..

[3]  Chuan Yi Tang,et al.  An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs , 1992, Inf. Process. Lett..

[4]  J. Desrosiers,et al.  Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows , 1988 .

[5]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[6]  Helman Stern,et al.  Minimal Resources for Fixed and Variable Job Schedules , 1978, Oper. Res..

[7]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[8]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[10]  Alain Pétrowski,et al.  A clearing procedure as a niching method for genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[11]  Gerhard J. Woeginger,et al.  On-Line Scheduling of Jobs with Fixed Start and End Times , 1994, Theor. Comput. Sci..

[12]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .

[13]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[14]  Sheng-Tun Li,et al.  TGA: a new integrated approach to evolutionary algorithms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[15]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[16]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[17]  Marshall L. Fisher,et al.  Vehicle Routing with Time Windows: Two Optimization Algorithms , 1997, Oper. Res..