An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00291-021-00656-7 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00291-021-00656-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212175929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem / 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: Large neighborhood search for multi-trip vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient feasibility testing for dial-a-ride problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Dial-a-Ride problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic two-phase solution approach for the multi-objective 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: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming based metaheuristics for the dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified heuristic for a large class of vehicle routing problems with backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports / rank
 
Normal rank
Property / cites work
 
Property / cites work: The balanced maximally diverse grouping problem with block constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Efficient feasibility testing for dial-a-ride problems'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699387 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00291-021-00656-7 / rank
 
Normal rank

Latest revision as of 03:53, 17 December 2024

scientific article
Language Label Description Also known as
English
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
scientific article

    Statements

    An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (English)
    0 references
    0 references
    0 references
    0 references
    14 April 2022
    0 references
    demand responsive transport
    0 references
    dial-a-ride
    0 references
    adaptive large neighbourhood search
    0 references
    dynamic programming
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references