A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q57185891, #quickstatements; #temporary_batch_1719269348057
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.ejor.2004.09.060 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031102078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving vehicle routing problems using constraint programming and metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532231 / 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: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem / 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 Heuristic Algorithm for the Vehicle-Dispatch Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new extension of local search applied to the Dial-A-Ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / 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: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-interchange procedures for local search in a precedence-constrained routing 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: 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
Property / cites work
 
Property / cites work: Comparing descent heuristics and metaheuristics for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751577 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57185891 / rank
 
Normal rank

Latest revision as of 23:49, 24 June 2024

scientific article
Language Label Description Also known as
English
A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
scientific article

    Statements

    A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2006
    0 references
    transportation
    0 references
    vehicle routing problem
    0 references
    dial-a-ride problem
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers