A study on genetic algorithms for the DARP problem

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

This work presents the results on applying a genetic approach for solving the Dial-A-Ride Problem (DARP). The problem consists of assigning and scheduling a set of user transport requests to a fleet of available vehicles in the most efficient way according to a given objective function. The literature offers different heuristics for solving DARP, a well known NP-hard problem, which range from traditional insertion and clustering algorithms to soft computing techniques. On the other hand, the approach through Genetic Algorithms (GA) has been experienced in problems of combinatorial optimization. We present our experience and results of a study to develop and test different GAs in the aim of finding an appropriate encoding and configuration, specifically for the DARP problem with time windows.

Original languageEnglish
Title of host publicationBio-inspired Modeling of Cognitive Tasks - Second International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2007, Proceedings
Pages498-507
Number of pages10
EditionPART 1
StatePublished - 1 Dec 2007
Event2nd International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2007 - La Manga del Mar Menor, Spain
Duration: 18 Jun 200721 Jun 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume4527 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2007
CountrySpain
CityLa Manga del Mar Menor
Period18/06/0721/06/07

Fingerprint Dive into the research topics of 'A study on genetic algorithms for the DARP problem'. Together they form a unique fingerprint.

Cite this