An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem

E. Osaba; E. Onieva; F. Diaz; R. Carballedo; P. Lopez; A. Perallos

doi:10.1109/SAMI.2015.7061865

An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem

E. Osaba
, E. Onieva
, F. Diaz
, R. Carballedo
, P. Lopez
, A. Perallos

University of Deusto

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Citations (Scopus)

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.

Original language	English
Title of host publication	SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	151-156
Number of pages	6
ISBN (Electronic)	9781479982219
DOIs	https://doi.org/10.1109/SAMI.2015.7061865
Publication status	Published - 16 Mar 2015
Externally published	Yes
Event	13th IEEE International Symposium on Applied Machine Intelligence and Informatics, SAMI 2015 - Herl'any, Slovakia Duration: 22 Jan 2015 → 24 Jan 2015

Publication series

Name	SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings

Conference

Conference	13th IEEE International Symposium on Applied Machine Intelligence and Informatics, SAMI 2015
Country/Territory	Slovakia
City	Herl'any
Period	22/01/15 → 24/01/15

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure
SDG 11 Sustainable Cities and Communities

Keywords

Combinatorial optimization
Genetic Algorithm
Metaheuristic
On demand transportation
Traveling Salesman Problem

Access to Document

10.1109/SAMI.2015.7061865

Cite this

Osaba, E., Onieva, E., Diaz, F., Carballedo, R., Lopez, P., & Perallos, A. (2015). An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. In SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings (pp. 151-156). Article 7061865 (SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SAMI.2015.7061865

Osaba, E. ; Onieva, E. ; Diaz, F. et al. / An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 151-156 (SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings).

@inproceedings{d27feaaa84e8478685081fbf614fdf66,

title = "An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem",

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.",

keywords = "Combinatorial optimization, Genetic Algorithm, Metaheuristic, On demand transportation, Traveling Salesman Problem",

author = "E. Osaba and E. Onieva and F. Diaz and R. Carballedo and P. Lopez and A. Perallos",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 13th IEEE International Symposium on Applied Machine Intelligence and Informatics, SAMI 2015 ; Conference date: 22-01-2015 Through 24-01-2015",

year = "2015",

month = mar,

day = "16",

doi = "10.1109/SAMI.2015.7061865",

language = "English",

series = "SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "151--156",

booktitle = "SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings",

address = "United States",

}

Osaba, E, Onieva, E, Diaz, F, Carballedo, R, Lopez, P & Perallos, A 2015, An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. in SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings., 7061865, SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 151-156, 13th IEEE International Symposium on Applied Machine Intelligence and Informatics, SAMI 2015, Herl'any, Slovakia, 22/01/15. https://doi.org/10.1109/SAMI.2015.7061865

An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. / Osaba, E.; Onieva, E.; Diaz, F. et al.
SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2015. p. 151-156 7061865 (SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem

AU - Osaba, E.

AU - Onieva, E.

AU - Diaz, F.

AU - Carballedo, R.

AU - Lopez, P.

AU - Perallos, A.

PY - 2015/3/16

Y1 - 2015/3/16

N2 - 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.

AB - 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.

KW - Combinatorial optimization

KW - Genetic Algorithm

KW - Metaheuristic

KW - On demand transportation

KW - Traveling Salesman Problem

UR - https://www.scopus.com/pages/publications/84926429664

U2 - 10.1109/SAMI.2015.7061865

DO - 10.1109/SAMI.2015.7061865

M3 - Conference contribution

AN - SCOPUS:84926429664

T3 - SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings

SP - 151

EP - 156

BT - SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 13th IEEE International Symposium on Applied Machine Intelligence and Informatics, SAMI 2015

Y2 - 22 January 2015 through 24 January 2015

ER -

Osaba E, Onieva E, Diaz F, Carballedo R, Lopez P, Perallos A. An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem. In SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings. Institute of Electrical and Electronics Engineers Inc. 2015. p. 151-156. 7061865. (SAMI 2015 - IEEE 13th International Symposium on Applied Machine Intelligence and Informatics, Proceedings). doi: 10.1109/SAMI.2015.7061865

An asymmetric multiple traveling salesman problem with backhauls to solve a dial-a-ride problem

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this