Shipping Multiple Items by Capacitated Vehicles: An Optimal Dynamic Programming Approach

This paper considers shipments between two facilities when the transportation cost of dispatching a vehicle consists of a fixed cost plus variable item dependent transportation cost. The objective is to find a shipment schedule that minimizes the total cost while satisfying demand on time. The paper introduces a dynamic programming algorithm with polynomial complexity for a fixed number of items but exponential otherwise. The dynamic programming formulation proposed can be used to solve optimality problems with a small number of items, due to the high complexity when the number of items increases.

• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/oclc/1767714
• Authors:
  • Anily, Shoshana
  • Tzur, Michal
• Publication Date: 2005-5

Language

• English

Media Info

• Media Type: Print
• Features: Appendices; Figures; References;
• Pagination: pp 233-248
• Serial:
  • Transportation Science
  • Volume: 39
  • Issue Number: 2
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Cost control; Dynamic programming; Freight service; Inventory; Logistics; Production; Shipping
• Uncontrolled Terms: Optimal transport strategy
• Subject Areas: Freight Transportation; Highways; Marine Transportation; Planning and Forecasting; I72: Traffic and Transport Planning;

Filing Info

• Accession Number: 01001023
• Record Type: Publication
• Files: TRIS
• Created Date: Jun 9 2005 4:44PM