Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows and occasional drivers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependent vehicle routing problem with a multi ant colony system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Home health care routing and scheduling: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for the time-dependent vehicle routing problem with time windows on a road network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienteering problem: a survey of recent variants, solution approaches and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic vehicle routing problem with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle dispatching with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-A-ride problem with transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid algorithm for time-dependent vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-trip time-dependent vehicle routing problem with time windows / 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: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective optimization models for patient allocation during a pandemic influenza outbreak / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent capacitated profitable tour problem with time windows and precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An assign-and-route matheuristic for the time-dependent inventory routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast solution method for the time-dependent orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the stochastic time-dependent orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost VRP with time-dependent speed data and congestion charge / rank
 
Normal rank

Latest revision as of 06:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
scientific article

    Statements

    Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 September 2022
    0 references
    0 references
    routing
    0 references
    time-dependent travel time
    0 references
    dial-a-ride problem
    0 references
    meta-heuristics
    0 references
    mixed integer programming
    0 references
    0 references