Dial-a-Ride Problem with time windows, transshipments, and dynamic transfer points

摘要

Dial-a-ride problems deal with on demand transportation. Today, this type of shared transport is used for elderly and disabled people for short distances. People provide a request for transport from an origin to a destination, both specific for a particular demand. Time constraints deal with maximum user ride time, time windows, maximum route duration limits and precedence. In this paper we try to solve these dial-a-ride problems, including the possibility of one transshipment from a dynamic transfer point by request. We propose an algorithm based on insertion techniques and constraints propagation.