1. Publications
  2. Conference paper
  3. RDF description An Asymmetric Multiple Traveling Salesman Problem with Backhauls to solve a Dial-a-Ride Problem

An Asymmetric Multiple Traveling Salesman Problem with Backhauls to solve a Dial-a-Ride Problem

Authors
  1. Eneko Osaba
  2. Enrique Onieva
  3. Fernando Díaz
  4. Roberto Carballedo
  5. Pedro López
  6. Asier Perallos

 ≈ 210.3 KB

Abstract

Nowadays, public transportation has become an essential area for the actual society, which directly affects the quality of life. There are different sort of public transportation systems. One type that receives much attention these days because of its great social interest is the transportation on-demand. Some of the most well-known on-demand transports systems are the Demand Responsive Transit, and the Dial-a-Ride. In this paper, a real-world Dial-a-Ride problem is presented and modeled as a Multi-Attribute Traveling Salesman Problem. In addition, in this work a benchmark of this problem is presented, and the first resolution of this benchmark is offered. For the resolution of the problem an Adaptive Multi-Crossover Population Algorithm has been implemented.