| 摘要 |
The methods disclosed comprise the linehaul optimization algorithm which is a hybrid algorithm incorporating the basic structure of the Hungarian Assignment algorithm or equivalent and an improvement heuristic. However, in this particular case there is not a direct application of the existing, well-known Hungarian Assignment algorithm or equivalent in conjunction with a heuristic. The structure of the assignment model being used here is based on the Hungarian Assignment algorithm or equivalent but has been revised and enhanced to identify systematically (by using grouping) a number of equivalent optimal solutions (that give the same optimal, minimum cost for a particular iteration). A heuristic is then used to identify the ‘best’ optimal solution, of the many identified, that would contribute the most incremental cost reduction in future iterations of the heuristic.
|
