EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (Q3580197): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>m</i>-Traveling Salesman Problem with Minmax Objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / 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: A new extension of local search applied to the Dial-A-Ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the traveling salesman problem with pickup and delivery customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization of the Probabilistic Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation heuristics for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the pickup and delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem: Faces and branch-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of local search algorithms for constrained routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem / rank
 
Normal rank

Latest revision as of 02:34, 3 July 2024

scientific article
Language Label Description Also known as
English
EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
scientific article

    Statements

    EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 August 2010
    0 references
    0 references
    stochastic vehicle routing
    0 references
    minmax objective function
    0 references
    local search
    0 references