Dynamic Programming Strategy for Dynamic Multiple Zone Expedition With Minimal Imbalance Scenario

In a conventional multiple zone expedition problem, traveling to support random over the road freight between adjacent areas leads to different levels of total cost or load-imbalance. The objectives of this research are to examine configurations of zone expedition alternatives for use in truckload trucking operations and to eliminate empty repositioning movements between loads to maintain the high level of equipment utilization. The conventional multiple zone expedition problems can be modeled as a Dynamic Multiple Zone Expedition problem (DMZE). In this problem, the rearrangement penalty will be added to the conventional model if there is a different of the area arrangement in each zone. An optimal procedure, Dynamic Programing Strategy (DPS), will be applied to this system. The combination of expedition alternatives with penalty over a series of discrete with the total minimal imbalance is chosen. DPS is practical merely for small problems. The results illustrate that minimising imbalance whilst controlling (minimising) runtime rely up-on the problem parameters, number of zone, are and consecutive time period, used.

Keywords:  Dynamic Programming, Dynamic Multiple Zone Expedition and Imbalance

Corresponding author: E-mail: Ipongch@engr.tu.ac.th