An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines (Q342360): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: The dial-a-ride problem: Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of recent research on green road freight transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi-objective pollution-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cargo Capacity Management with Allotments and Spot Market Demand / 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 general heuristic for vehicle routing problems / rank
 
Normal rank

Latest revision as of 00:00, 13 July 2024

scientific article
Language Label Description Also known as
English
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines
scientific article

    Statements

    Identifiers