An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B06 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6654168 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
freight transportation | |||
| Property / zbMATH Keywords: freight transportation / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
pickup and delivery problem | |||
| Property / zbMATH Keywords: pickup and delivery problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
heuristic algorithm | |||
| Property / zbMATH Keywords: heuristic algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduled lines | |||
| Property / zbMATH Keywords: scheduled lines / rank | |||
Normal rank | |||
Revision as of 07:28, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines |
scientific article |
Statements
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (English)
0 references
17 November 2016
0 references
freight transportation
0 references
pickup and delivery problem
0 references
heuristic algorithm
0 references
scheduled lines
0 references
