The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem

This 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 proble...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 1994-07, Vol.76 (1), p.128-142
Main Authors: Bowerman, Robert L., Calamai, Paul H., Brent Hall, G.
Format: Article
Language:English
Subjects:
Applied sciences
Distribution planning
Dynamic programming
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Heuristics
Operational research and scientific management
Operational research. Management science
Routing
Spacefilling curves
Studies
Vehicles
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/0377-2217(94)90011-6