Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Logic Programming Using ECL<sup><i>i</i></sup>PS<sup><i>e</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders decomposition, Lagrangean relaxation and metaheuristic design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Scheduling Problem and Monte Carlo Simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A real delivery problem dealt with Monte Carlo techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming 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: Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Industrial Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: What you should know about the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-guided evolution strategies for large-scale capacitated vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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 traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using constraint-based operators to solve the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003232 / 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: BoneRoute: An adaptive memory-based method for effective fleet management / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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: Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem / rank
 
Normal rank

Latest revision as of 07:11, 5 July 2024

scientific article
Language Label Description Also known as
English
Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem
scientific article

    Statements

    Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    hybrid algorithms
    0 references
    variable neighborhood search
    0 references
    vehicle routing problem
    0 references
    probabilistic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers