Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case (Q4305483): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/01966324.1993.10737359 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065063922 / rank | |||
Normal rank | |||
Revision as of 19:51, 19 March 2024
scientific article; zbMATH DE number 638582
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case |
scientific article; zbMATH DE number 638582 |
Statements
Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case (English)
0 references
13 September 1994
0 references
exchange heuristics
0 references
vehicle routing
0 references
time window constraints
0 references
