An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem

Abstract : This paper presents a method for solving the convergence demand responsive transport problem, by using a stochastic approach based on a steady state genetic algorithm for enumerating a set of optimizing sprawling spanning trees, which constitute the best solutions to this problem. Specifically designed to speed up the convergence to optimal solutions, we introduce an oriented convergent mutation operator, allowing multi-objective considerations. So this solution lays the first stakes for considering real-time solving of such a problem. Led by computer science and geography laboratories, this study is provided with a set of experimental results evaluating the approach.
Type de document :
Communication dans un congrès
Service Systems and Service Management, 2006, Troyes, France. pp.959-964, 2006
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00372164
Contributeur : Rémy Chevrier <>
Soumis le : mardi 31 mars 2009 - 14:23:34
Dernière modification le : vendredi 14 octobre 2016 - 01:02:51
Document(s) archivé(s) le : jeudi 10 juin 2010 - 19:23:46

Fichier

sssm2006.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00372164, version 1

Citation

Rémy Chevrier, Philippe Canalda, Pascal Chatonnay, Didier Josselin. An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem. Service Systems and Service Management, 2006, Troyes, France. pp.959-964, 2006. <hal-00372164>

Partager

Métriques

Consultations de
la notice

276

Téléchargements du document

81