A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. (Q1417560): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60059906, #quickstatements; #temporary_batch_1712111774907
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-trip vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routeing with Multiple Use of Vehicles / rank
 
Normal rank

Revision as of 12:33, 6 June 2024

scientific article
Language Label Description Also known as
English
A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
scientific article

    Statements

    Identifiers