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
Created claim: Wikidata QID (P12): Q58117181, #quickstatements; #temporary_batch_1706897434465 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| Property / cites work | |||
| Property / cites work: Q4039765 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:48, 22 May 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
