Using space-filling curve to generate the feasible routes for the set partitioning problem

摘要

The author demonstrates that a heuristic which uses the space-filling curve introduces the possibility of using set partitioning in the general case of the vehicle routing problem. Up to now, set partitioning was used when the feasible routes were obtainable in well-defined applications. These routes either came predefined or were easily discernible. With this heuristic, a random field of nodes can be visited, with the feasible routes being generated in a reasonable amount of time.