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
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 05:13, 28 June 2023

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

    Identifiers