Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

The Modal-Shift Transportation Planning Problem (MSTPP) is the problem that finds a feasible schedule for carriers with the minimum total cost when sets of facilities, delivery orders, and carriers are given. In this paper, we propose a fast steepest descent algorithm to solve the MSTPP. Our solution generates a set of candidate routes for each delivery order as a preprocess. Then, it finds a schedule by iteratively updating selections of the candidate routes in descent directions, while computing a configuration of carrier movements at each iteration by a greedy algorithm. Intensive numerical study using artificial data modeled from the manufacturing industry in Japan is also presented.

REFERENCES

• 1: Crainic, T. G. and J. Roy. 1992. Design of regular intercity driver routes for the LTL motor carrier industry. Transportation Science, 26: 280--295.
• 2: Crawford, J. M., M. Dalal and J. P. Walser. 1998. Abstract Local Search. In Proceedings of the AIPS-98 Workshop on Planning as Combinatorial Search.
• 3: Hoppe, B., E. Z. Klampfl, C. McZeal and J. Rich. 1999. Strategic Load-Planning for Less-Than-Truckload Trucking. Technical Report CRPC-TR99812-S, Center for Research on Parallel Computation, Rice University.
• 4: Katayama, N. and S. Yurimoto. 2002. The Load Planning Problem for Less-than-Truckload Motor Carriers and a Solution Approach. In Proceedings of the 7th International Symposium on Logistics, 567--572.
• 5: Okano, H. and M. Koda. 2003. An optimization algorithm based on stochastic sensitivity analysis for noisy objective landscapes. Journal of Reliability Engineering and System Safety, 79: 245--252.
• 6: W. B. Powell , Y. Sheffi, Design and implementation of an interactive optimization system for network design in the motor carrier industry, Operations Research, v.37 n.1, p.12-29, Jan.-Feb. 1989 [doi>10.1287/opre.37.1.12]
• 7: Powell, W. B., T. Carvalho, G. Godfrey and H. Simao. 1995. Dynamic fleet management as a logistics queueing network. Annals of Operations Research, 6: 165--188.