Encontrado 1 documento, a visualizar página 1 de 1

The dial-a-ride problem with split requests and profits

In this paper we introduce the dial-a-ride problem with split requests and profits (DARPSRP). Users place transportation requests, specifying a pickup location, a delivery location, and a time window for either of the two. Based on maximum user ride time considerations the second time window is generated. A given fleet of vehicles, each with a certain capacity, is available to serve these requests and maximum r...