A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)

Cites Work

k-interchange procedures for local search in a precedence-constrained routing problem
Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
Pickup and Delivery of Partial Loads with “Soft” Time Windows
Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
An Asymptotic, Probabilistic Analysis of a Routing Problem

Cited In (42)

A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
Étude comparative de divers modèles pour le problème de transport à la demande
Routing by ranking: a link analysis method for the constrained dial-a-ride problem
Vehicle routing problems with alternative paths: an application to on-demand transportation
An effective and fast heuristic for the dial-a-ride problem
A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
Minimizing the maximal ergonomic burden in intra-hospital patient transportation
A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
Daily aircraft routing for amphibious ready groups
A dynamic tree algorithm for peer-to-peer ridesharing matching
Earliest deadline first is a 2-approximation for DARP with time windows
An insertion heuristic for scheduling mobility allowance shuttle transit (MAST) services
A comparison of column-generation approaches to the synchronized pickup and delivery problem
A two-stage model for a day-ahead paratransit planning problem
Heuristics for dynamic and stochastic routing in industrial shipping
Dynamic pickup and delivery problems
Measures of dynamism and urgency in logistics
An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies.
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
Dynamic transportation of patients in hospitals
Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering
A neural-tabu search heuristic for the real time vehicle routing problem
The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
The dial-a-ride problem: Models and algorithms
Management Policies in a Dynamic Multi Period Routing Problem
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
Local search heuristics for the probabilistic dial-a-ride problem
A tabu search heuristic for the dynamic transportation of patients between care units
Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones
A new insertion-based construction heuristic for solving the pickup and delivery problem with time windows
A multi-start local search heuristic for ship scheduling -- a computational study
A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
Title not available (Why is that?)

Recommendations

The dial-a-ride problem (DARP): variants, modeling issues and algorithms 👍 👎
A Matheuristic for the Dial-a-Ride Problem 👍 👎
Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints 👍 👎
A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows 👍 👎
Online Dial-A-Ride Problem with Time Windows: An Exact Algorithm Using Status Vectors 👍 👎

This page was built for publication: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908288)