Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650412 / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic vehicle routing
Property / zbMATH Keywords: stochastic vehicle routing / rank
 
Normal rank
Property / zbMATH Keywords
 
Monte Carlo sampling
Property / zbMATH Keywords: Monte Carlo sampling / rank
 
Normal rank
Property / zbMATH Keywords
 
local search
Property / zbMATH Keywords: local search / rank
 
Normal rank
Property / zbMATH Keywords
 
random restart local search
Property / zbMATH Keywords: random restart local search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039492305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation-based metaheuristics for the probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on the probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the probabilistic TSP with ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation for the probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the vehicle routing problem with stochastic demands using the cross-entropy method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated vehicle routing problem with stochastic demands and time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stochastic Vehicle Routing Problem for Minimum Unmet Demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:37, 12 July 2024

scientific article
Language Label Description Also known as
English
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling
scientific article

    Statements

    Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    stochastic vehicle routing
    0 references
    Monte Carlo sampling
    0 references
    local search
    0 references
    random restart local search
    0 references
    0 references

    Identifiers