Recurrent Neural Network and Genetic Algorithm Approaches for a Dual Route Optimization Problem: A Real Case Study
This paper describes a real case study has been considered. It presents a dual optimization problem that consists in finding the optimal routes in the called principal and capillary routes. The problem has been considered as a travel salesman problem with time windows (TSPTW). The restrictions of Mi...
| Autores: | , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Universidad de Castilla-La Mancha |
| Repositorio: | RUIdeRA. Repositorio Institucional de la UCLM |
| OAI Identifier: | oai:ruidera.uclm.es:10578/14991 |
| Acceso en línea: | http://hdl.handle.net/10578/14991 |
| Access Level: | acceso abierto |
| Palabra clave: | Logistics Recurrent neural network Genetic algorithm Travelling salesman problem |
| Sumario: | This paper describes a real case study has been considered. It presents a dual optimization problem that consists in finding the optimal routes in the called principal and capillary routes. The problem has been considered as a travel salesman problem with time windows (TSPTW). The restrictions of Miller et al. have been used in order to reduce the computational cost [56]. A recurrent neural network approach is employed, which involves not just unsupervised learning to train neurons, but an integrated approach where Genetic Algorithm is utilized for training neurons so as to obtain a model with the least error. |
|---|