Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2262246802 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1508.02759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic Monge property and path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP\(\times \)ELS approach for the capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient frameworks for greedy split and new depth first search split procedures for 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: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource extension functions: properties, inversion, and generalization to segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential search and its application to vehicle-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge assembly-based memetic algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective evolutionary algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified solution framework for multi-attribute vehicle routing problems / rank
 
Normal rank

Latest revision as of 22:59, 12 July 2024

scientific article
Language Label Description Also known as
English
Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
scientific article

    Statements

    Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (English)
    0 references
    0 references
    17 November 2016
    0 references
    vehicle routing problem
    0 references
    large neighborhood search
    0 references
    split algorithm
    0 references
    cluster-first route-second heuristic
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references