Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (Q443822): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59389628, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Dynamic transportation of patients in hospitals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic pickup and delivery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / 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: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Path Problem with Time Windows and Linear Waiting Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource extension functions: properties, inversion, and generalization to segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dial-a-ride problem for client transportation in a health-care organization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / 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: Drive: Dynamic Routing of Independent Vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem / rank
 
Normal rank

Revision as of 12:54, 5 July 2024

scientific article
Language Label Description Also known as
English
Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
scientific article

    Statements

    Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2012
    0 references
    passenger transportation
    0 references
    dial-a-ride-problem
    0 references
    column generation
    0 references
    variable neighborhood search
    0 references

    Identifiers