| Article ID: | iaor1996157 |
| Country: | Netherlands |
| Volume: | 76 |
| Issue: | 1 |
| Start Page Number: | 128 |
| End Page Number: | 142 |
| Publication Date: | Jul 1994 |
| Journal: | European Journal of Operational Research |
| Authors: | Calamai Paul H., Bowerman Robert L., Hall Brent G. |
| Keywords: | programming: dynamic, heuristics |
The paper introduces the Spacefilling Curve with Optimal Partitioning (SFC OP) heuristic strategy for producing solutions to the Vehicle Routing Problem (VRP). This heuristic has the property that it generates good routes extremely quickly and the time required increases nearly linearly with problem size. Additionally, the SFC OP heuristic can easily be modified to generate routes to VRP formulations with multiple objective functions.