An effective and fast heuristic for the dial-a-ride problem (Q2644373): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10288-006-0018-0 / rank
Normal rank
 
Property / author
 
Property / author: Roberto Wolfler Calvo / rank
 
Normal rank
Property / author
 
Property / author: Alberto Colorni / 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.1007/s10288-006-0018-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088322639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pickup and delivery problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The General Pickup and Delivery Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pickup and Delivery of Partial Loads with “Soft” Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10288-006-0018-0 / rank
 
Normal rank

Latest revision as of 12:18, 19 December 2024

scientific article
Language Label Description Also known as
English
An effective and fast heuristic for the dial-a-ride problem
scientific article

    Statements

    An effective and fast heuristic for the dial-a-ride problem (English)
    0 references
    0 references
    31 August 2007
    0 references
    dial-a-ride
    0 references
    routing
    0 references
    scheduling
    0 references
    heuristic
    0 references
    vehicle routing
    0 references
    0 references
    0 references

    Identifiers

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