Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/cor/SchildeDH11, #quickstatements; #temporary_batch_1731505720702
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Michael Schilde / rank
Normal rank
 
Property / author
 
Property / author: Michael Schilde / 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.2011.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998816621 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q39401914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-a-ride problem: Models and algorithms / 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: Variable neighborhood search for the dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization / 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: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Stochastic Inventory Routing Problem with Direct Deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient feasibility testing for dial-a-ride problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/SchildeDH11 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:49, 13 November 2024

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