Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (Q1652698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem |
scientific article; zbMATH DE number 6901633
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem |
scientific article; zbMATH DE number 6901633 |
Statements
Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem (English)
0 references
11 July 2018
0 references
travelling salesman
0 references
vehicle routing problem
0 references
split demand
0 references
heuristics
0 references
0 references
0 references
0 references
0 references
0 references
