A Hyperheuristic for the Dial-a-Ride Problem with Time Windows
The dial-a-ride problem with time windows (DARPTW) is a combinatorial optimization problem related to transportation, in which a set of customers must be picked up from an origin location and they have to be delivered to a destination location. A transportation schedule must be constructed for a set...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/707056 |
id |
doaj-80d5c1041dac4b1fb053c5bb15e6a3f3 |
---|---|
record_format |
Article |
spelling |
doaj-80d5c1041dac4b1fb053c5bb15e6a3f32020-11-24T23:06:23ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/707056707056A Hyperheuristic for the Dial-a-Ride Problem with Time WindowsEnrique Urra0Claudio Cubillos1Daniel Cabrera-Paniagua2Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2950, 2340025 Valparaíso, ChileEscuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2950, 2340025 Valparaíso, ChileEscuela de Ingeniería Comercial, Universidad de Valparaíso, Pasaje La Paz 1301, 2531075 Viña del Mar, ChileThe dial-a-ride problem with time windows (DARPTW) is a combinatorial optimization problem related to transportation, in which a set of customers must be picked up from an origin location and they have to be delivered to a destination location. A transportation schedule must be constructed for a set of available vehicles, and several constraints have to be considered, particularly time windows, which define an upper and lower time bound for each customer request in which a vehicle must arrive to perform the service. Because of the complexity of DARPTW, a number of algorithms have been proposed for solving the problem, mainly based on metaheuristics such as Genetic Algorithms and Simulated Annealing. In this work, a different approach for solving DARPTW is proposed, designed, and evaluated: hyperheuristics, which are alternative heuristic methods that operate at a higher abstraction level than metaheuristics, because rather than searching in the problem space directly, they search in a space of low-level heuristics to find the best strategy through which good solutions can be found. Although the proposed hyperheuristic uses simple and easy-to-implement operators, the experimental results demonstrate efficient and competitive performance on DARPTW when compared to other metaheuristics from the literature.http://dx.doi.org/10.1155/2015/707056 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Enrique Urra Claudio Cubillos Daniel Cabrera-Paniagua |
spellingShingle |
Enrique Urra Claudio Cubillos Daniel Cabrera-Paniagua A Hyperheuristic for the Dial-a-Ride Problem with Time Windows Mathematical Problems in Engineering |
author_facet |
Enrique Urra Claudio Cubillos Daniel Cabrera-Paniagua |
author_sort |
Enrique Urra |
title |
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows |
title_short |
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows |
title_full |
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows |
title_fullStr |
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows |
title_full_unstemmed |
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows |
title_sort |
hyperheuristic for the dial-a-ride problem with time windows |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
The dial-a-ride problem with time windows (DARPTW) is a combinatorial optimization problem related to transportation, in which a set of customers must be picked up from an origin location and they have to be delivered to a destination location. A transportation schedule must be constructed for a set of available vehicles, and several constraints have to be considered, particularly time windows, which define an upper and lower time bound for each customer request in which a vehicle must arrive to perform the service. Because of the complexity of DARPTW, a number of algorithms have been proposed for solving the problem, mainly based on metaheuristics such as Genetic Algorithms and Simulated Annealing. In this work, a different approach for solving DARPTW is proposed, designed, and evaluated: hyperheuristics, which are alternative heuristic methods that operate at a higher abstraction level than metaheuristics, because rather than searching in the problem space directly, they search in a space of low-level heuristics to find the best strategy through which good solutions can be found. Although the proposed hyperheuristic uses simple and easy-to-implement operators, the experimental results demonstrate efficient and competitive performance on DARPTW when compared to other metaheuristics from the literature. |
url |
http://dx.doi.org/10.1155/2015/707056 |
work_keys_str_mv |
AT enriqueurra ahyperheuristicforthedialarideproblemwithtimewindows AT claudiocubillos ahyperheuristicforthedialarideproblemwithtimewindows AT danielcabrerapaniagua ahyperheuristicforthedialarideproblemwithtimewindows AT enriqueurra hyperheuristicforthedialarideproblemwithtimewindows AT claudiocubillos hyperheuristicforthedialarideproblemwithtimewindows AT danielcabrerapaniagua hyperheuristicforthedialarideproblemwithtimewindows |
_version_ |
1725623349806104576 |