Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122): 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: 90B06 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5916297 / rank
 
Normal rank
Property / zbMATH Keywords
 
transportation
Property / zbMATH Keywords: transportation / rank
 
Normal rank
Property / zbMATH Keywords
 
dial-a-ride problem
Property / zbMATH Keywords: dial-a-ride problem / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic problem
Property / zbMATH Keywords: dynamic problem / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic information
Property / zbMATH Keywords: stochastic information / rank
 
Normal rank
Property / zbMATH Keywords
 
metaheuristic
Property / zbMATH Keywords: metaheuristic / rank
 
Normal rank
Property / zbMATH Keywords
 
variable neighborhood search
Property / zbMATH Keywords: variable neighborhood search / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple plan approach
Property / zbMATH Keywords: multiple plan approach / rank
 
Normal rank
Property / zbMATH Keywords
 
multiple scenario approach
Property / zbMATH Keywords: multiple scenario approach / rank
 
Normal rank
Property / zbMATH Keywords
 
stochastic variable neighborhood search
Property / zbMATH Keywords: stochastic variable neighborhood search / rank
 
Normal rank

Revision as of 11:41, 1 July 2023

scientific article
Language Label Description Also known as
English
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
scientific article

    Statements

    Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    transportation
    0 references
    dial-a-ride problem
    0 references
    dynamic problem
    0 references
    stochastic information
    0 references
    metaheuristic
    0 references
    variable neighborhood search
    0 references
    multiple plan approach
    0 references
    multiple scenario approach
    0 references
    stochastic variable neighborhood search
    0 references

    Identifiers