A hybrid genetic algorithm for the heterogeneous dial-a-ride problem

DOI10.1016/j.cor.2016.12.008zbMath1391.90661OpenAlexW2560329358WikidataQ56523930 ScholiaQ56523930MaRDI QIDQ1652211

Abdelaziz Dammak, Kris Braekers, Mohamed Amine Masmoudi, Malek Masmoudi

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/22929

zbMATH Keywords

hybrid algorithmconstruction heuristicsgenetic algorithm (GA)heterogeneous dial-a-ride problem (H-DARP)local search (LS)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (12)

Comparison of anticipatory algorithms for a dial-a-ride problem ⋮ Event-based MILP models for ridepooling applications ⋮ A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem ⋮ Daily aircraft routing for amphibious ready groups ⋮ A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem ⋮ A data-driven matching algorithm for ride pooling problem ⋮ The dial-a-ride problem with private fleet and common carrier ⋮ A deterministic annealing local search for the electric autonomous dial-a-ride problem ⋮ Typology and literature review for dial-a-ride problems ⋮ Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm ⋮ Research on the vehicle routing problem with interval demands ⋮ Optimal charging and repositioning of electric vehicles in a free-floating carsharing system

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
• Hybrid column generation and large neighborhood search for the dial-a-ride problem
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
• Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms
• Dynamic pickup and delivery problems
• Data mining and knowledge discovery with evolutionary algorithms
• A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
• The dial-a-ride problem: Models and algorithms
• A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
• Variable neighborhood search for the dial-a-ride problem
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solving the Dial-a-Ride problem using genetic algorithms
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• An Exchange Heuristic for Routeing Problems with Time Windows
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem