Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects

DOI10.1007/s11590-020-01698-6zbMath1484.90106OpenAlexW3121080552MaRDI QIDQ2070134

Marcella Bernardo, Jürgen Pannek, Puca Huachi Vaz Penna, Marcone Jamilson Freitas Souza, André L. S. Souza

Publication date: 21 January 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01698-6

zbMATH Keywords

vehicle routingdial-a-ride problemdynamic DARPgeneral variable neighborhood search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed

Cites Work

• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• Variable neighborhood search
• Variable neighborhood search: basics and variants
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Dynamic transportation of patients in hospitals
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A variable neighborhood search for flying sidekick traveling salesman problem

This page was built for publication: Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects