ACM Home Page
Please provide us with feedback. Feedback
Freight simulation: the modal-shift transportation planning problem and its fast steepest descent algorithm
Full text PdfPdf (268 KB)
Source Winter Simulation Conference archive
Proceedings of the 35th conference on Winter simulation: driving innovation table of contents
New Orleans, Louisiana
SESSION: Applications in logistics, transportation, and distribution table of contents
Pages: 1720 - 1728  
Year of Publication: 2003
ISBN:0-7803-8132-7
Authors
Masami Amano  IBM Research, Tokyo Research Laboratory, Yamato, Kanagawa, Japan
Takayuki Yoshizumi  IBM Research, Tokyo Research Laboratory, Yamato, Kanagawa, Japan
Hiroyuki Okano  IBM Research, Tokyo Research Laboratory, Yamato, Kanagawa, Japan
Sponsors
INFORMS/CS : Institute for Operations Research and the Management Sciences/College on Simulation
NIST : National Institute of Standards and Technology
IEEE/SMCS : Institute of Electrical and Electronics Engineers/Systems, Man, and Cybernetics Society
ACM: Association for Computing Machinery
(SCS) : The Society for Modeling and Simulation International
SIGSIM: ACM Special Interest Group on Simulation and Modeling
IIE : Institute of Industrial Engineers
IEEE/CS : Institute of Electrical and Electronics Engineers/Computer Society
ASA : American Statistical Association
Publisher
Winter Simulation Conference 
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 15,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

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

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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
 
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.

Collaborative Colleagues:
Masami Amano: colleagues
Takayuki Yoshizumi: colleagues
Hiroyuki Okano: colleagues