A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56523930 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560329358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic pickup and delivery problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem / 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: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data mining and knowledge discovery with evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Dial-a-Ride problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care / 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: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints / 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: Hybrid column generation and large neighborhood search for the dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exchange Heuristic for Routeing Problems with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective evolutionary algorithm for the vehicle 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: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350083 / 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 Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints / rank
 
Normal rank

Latest revision as of 02:09, 16 July 2024

scientific article
Language Label Description Also known as
English
A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
scientific article

    Statements

    A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    heterogeneous dial-a-ride problem (H-DARP)
    0 references
    genetic algorithm (GA)
    0 references
    construction heuristics
    0 references
    local search (LS)
    0 references
    hybrid algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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