Using space-filling curve to generate the feasible routes for the set partitioning problem
Using space-filling curve to generate the feasible routes for the set partitioning problem
- New search for: Klesczewski, K.S.
- New search for: Klesczewski, K.S.
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.
Document information
Using space-filling curve to generate the feasible routes for the set partitioning problem
Anwendung der Raumerfuellungskurve zur Generierung moeglicher Wege fuer die Mengenunterteilung
1988
6 Seiten, 6 Quellen
Conference paper
English
Similar titles
Studies Claim Space Tourism Feasible
British Library Online Contents | 1997
PARTITIONING SENSOR BASED DATA TO GENERATE DRIVING PATTERN MAP
| European Patent Office | 2023
Partitioning sensor based data to generate driving pattern map
| European Patent Office | 2022
PARTITIONING SENSOR BASED DATA TO GENERATE DRIVING PATTERN MAP
| European Patent Office | 2018
Partitioning sensor based data to generate driving pattern map
| European Patent Office | 2023