A parallel meta-heuristic for solving a multiple asymmetric traveling salesman problem with simulateneous pickup and delivery modeling demand responsive transport problems

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Transportation is an essential area in the nowadays society. Due to the rapid technological progress, it has gained a great importance, both for business sector and citizenry. Among the different types of transport, one that has gained notoriety recently is the transportation on-demand, because it can affect very positively the people quality of life. There are different kinds of on-demand transportation systems, being the Demand Responsive Transit (DRT) one of the most important one. In this work, a real-life DRT problem is proposed, and modeled as a Rich Traveling Salesman Problem. Specifically, the problem presented is a Multiple Asymmetric Traveling Salesman Problem with Simultaneous Pickup and Delivery. Furthermore, a benchmark for this new problem is also proposed, and its first resolution is offered. For the resolution of this benchmark the recently developed Golden Ball meta-heuristic has been implemented.

Cite

CITATION STYLE

APA

Osaba, E., Diaz, F., Onieva, E., López-García, P., Carballedo, R., & Perallos, A. (2015). A parallel meta-heuristic for solving a multiple asymmetric traveling salesman problem with simulateneous pickup and delivery modeling demand responsive transport problems. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 9121, pp. 557–567). Springer Verlag. https://doi.org/10.1007/978-3-319-19644-2_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free