Article ID: | iaor20116153 |
Volume: | 62 |
Issue: | 8 |
Start Page Number: | 1524 |
End Page Number: | 1532 |
Publication Date: | Aug 2011 |
Journal: | Journal of the Operational Research Society |
Authors: | Miori V M |
Keywords: | programming: goal, programming: multiple criteria, heuristics: tabu search |
Truckload (TL) routing has always been a challenge. The TL routing problem (TRP) itself is hard, but the complexity of solving the problem increases due to the stochastic nature of TL demand. It is traditionally approached using single objective solution methodologies that range from linear programming to dynamic programming techniques. This paper presents a deterministic multiple objective formulation of the TRP. A ‘route algebra’ is developed to facilitate the solution procedure, paving the way for the use of goal programming and tabu search techniques.