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: | Enrique Urra, Claudio Cubillos, Daniel Cabrera-Paniagua |
---|---|
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 |
Similar Items
-
Application of Threshold Accepting Method to the Dial-A-Ride Problem with Time Windows
by: Ching-Ming Kao, et al.
Published: (2012) -
Uncertainty analysis on Dial-a-Ride Problem
by: Po-Hsueh Chiu, et al.
Published: (2014) -
Uma nova abordagem para o problema dial-a-ride A new approach for the dial-a-ride problem
by: Geraldo Regis Mauri, et al.
Published: (2009-04-01) -
Dial-a-ride Problem with Consideration of Service Reliability
by: Chueh-HengLi, et al.
Published: (2019) -
Waiting Strategies for the Dynamic Dial-A-Ride Problem
by: Chi-Wai Yuen, et al.
Published: (2007)