Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Vehicle Routing 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: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routeing with Multiple Use of Vehicles / rank
 
Normal rank
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: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BoneRoute: An adaptive memory-based method for effective fleet management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the vehicle routing problem with adaptive memory programming methodology / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the heterogeneous fleet vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-depot vehicle routing problem with inter-depot routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory search for Boolean optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic and adaptive memory procedure for political districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A TABU search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy random adaptive memory programming search for the capacitated clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory programming: a unified view of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the Vehicle-Dispatch Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / 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 Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank

Latest revision as of 21:56, 24 June 2024

scientific article
Language Label Description Also known as
English
Adaptive memory programming for the vehicle routing problem with multiple trips
scientific article

    Statements

    Adaptive memory programming for the vehicle routing problem with multiple trips (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    vehicle routing
    0 references
    multiple trips
    0 references
    adaptive memory procedure
    0 references
    0 references
    0 references
    0 references

    Identifiers