Abstract
A study of the vehicle transportation system for a manufacturer is presented. An algorithm based on a dynamic programming model is developed so as to find the optimal transportation arrangements referring to the composition of the vehicles as well as the routing of these vehicles. The algorithm is run under the current condition as well as under a number of different scenarios. It is shown the algorithm can solve the problem with reduced computational complexity. The findings and suggestions resulting from the study can help the department manager in reviewing current operations arrangement and determining future operations arrangements.
| Original language | English |
|---|---|
| Pages (from-to) | 33-41 |
| Number of pages | 9 |
| Journal | Production Planning and Control |
| Volume | 14 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2003 |
Keywords
- Dynamic programming model
- Quantitative sensitivity criterion
- Transportation system
- Two-stage transportation network
Fingerprint
Dive into the research topics of 'Designing optimal routing strategies for a manufacturer: A case study'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver