Probability model to solve the school bus routing problem with stops selection
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
International Journal of Combinatorial Optimization Problems and Informatics
2016
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876470899236929536 |
|---|---|
| author | Ricardo Pérez - Rodríguez |
| author_facet | Ricardo Pérez - Rodríguez |
| contents | Probability model to solve the school bus routing problem with stops selection Ricardo Pérez - Rodríguez Arturo Hernández - Aguirre Computación vehicle routing probability model genetic algorithm school bus routing estimation of distribution algorithm This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the feasible solution space distribution and thus to get the best solution. An estimationof distribution algorithm is used to address the combinatorial complexity of the problem statement. Different and better results are obtained with the proposed algorithm againsta genetic algorithm. The contribution of this paper is to propose an alternative to solve permutation-based representation problems with logistics application. 2016 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265245553005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.7 |
| format | Artículo científico |
| id | redalyc_265245553005 |
| institution | Redalyc |
| language | en |
| publishDate | 2016 |
| publisher | International Journal of Combinatorial Optimization Problems and Informatics |
| spellingShingle | Probability model to solve the school bus routing problem with stops selection Ricardo Pérez - Rodríguez Computación vehicle routing probability model genetic algorithm school bus routing estimation of distribution algorithm Probability model to solve the school bus routing problem with stops selection Ricardo Pérez - Rodríguez Arturo Hernández - Aguirre Computación vehicle routing probability model genetic algorithm school bus routing estimation of distribution algorithm This paper describes the use of a new algorithm that solves the school bus routing problem with stops selection. The aim is to reduce the travel time of a set of buses that transport students to a school. The fundamental contribution of the authors is the use of a probability model to describe the feasible solution space distribution and thus to get the best solution. An estimationof distribution algorithm is used to address the combinatorial complexity of the problem statement. Different and better results are obtained with the proposed algorithm againsta genetic algorithm. The contribution of this paper is to propose an alternative to solve permutation-based representation problems with logistics application. 2016 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265245553005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.7 |
| title | Probability model to solve the school bus routing problem with stops selection |
| topic | Computación vehicle routing probability model genetic algorithm school bus routing estimation of distribution algorithm |
| url | https://www.redalyc.org/articulo.oa?id=265245553005 |