Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Jhon Jairo Santa"'
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 10, Iss 2, Pp 295-308 (2018)
The separate delivery and collection services of goods through different routes is an issue of current interest for some transportation companies by the need to avoid the reorganization of the loads inside the vehicles, to reduce the return of the ve
Externí odkaz:
https://doaj.org/article/f539a539086b4632ad52b939e59417c8
Autor:
Jhon Jairo Santa Chávez, John Willmer Escobar, Mauricio Granada Echeverri, César Augusto Peñuela Meneses
Publikováno v:
Decision Science Letters, Vol 7, Iss 2, Pp 171-180 (2017)
In this paper, a heuristic algorithm based on Tabu Search Approach for solving the Vehicle Routing Problem with Backhauls (VRPB) is proposed. The problem considers a set of customers divided in two subsets: Linehaul and Backhaul customers. Each Lineh
Externí odkaz:
https://doaj.org/article/80acbf702741459895866c0e2b2c14bd
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 7, Iss 1, Pp 35-48 (2016)
This paper presents a multiobjective ant colony algorithm for the Multi-Depot Vehicle Routing Problem with Backhauls (MDVRPB) where three objectives of traveled distance, traveling times and total consumption of energy are minimized. An ant colony al
Externí odkaz:
https://doaj.org/article/6e6b2f68e4174f5ab1601bc380ed1a4a
Autor:
Orlando Antonio Sabogal Cardona, Juan David Hincapié Zea, Jhon Jairo Santa Chávez, John Willmer Escobar
Publikováno v:
Ciencia e Ingeniería Neogranadina, Vol 25, Iss 1, Pp 77-89 (2015)
Uno de los aspectos más importantes en una implementación de Sistemas de Prioridad (TSP)para el transporte masivo es conocer el tiempo de llegada y de viaje de los buses solicitandoprioridad. El presente artículo estima los tiempos de llegada de l
Externí odkaz:
https://doaj.org/article/77992dedba8244ae86ffcfa3e865e196
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 10, Iss 2, Pp 295-308 (2018)
The separate delivery and collection services of goods through different routes is an issue of current interest for some transportation companies by the need to avoid the reorganization of the loads inside the vehicles, to reduce the return of the ve
Autor:
Mauricio Granada Echeverri, John Willmer Escobar, César Augusto Peñuela Meneses, Jhon Jairo Santa Chávez
Publikováno v:
Decision Science Letters, Vol 7, Iss 2, Pp 171-180 (2017)
In this paper, a heuristic algorithm based on Tabu Search Approach for solving the Vehicle Routing Problem with Backhauls (VRPB) is proposed. The problem considers a set of customers divided in two subsets: Linehaul and Backhaul customers. Each Lineh
Publikováno v:
Avances Investigación en Ingeniería. 11:9-17
In this paper a detailed description of the simulated annealing algorithm is presented. This strategy was employed to solve a well know flow-shop problem, which behavior is featured by the combinatorial explosion and non linear modeling. Therefore, t
Publikováno v:
Cultura del cuidado. 10:63-72
Objetivo Presentar la forma como la mineria de datos es aplicable en la medicina como una tecnica de clasificacion que se puede utilizar para diagnosticar la existencia o no de enfermedades, con base la exploracion sistematica de la informacion histo
Autor:
Juan David Hincapie Zea, Jhon Jairo Santa Chávez, John Willmer Escobar, Orlando Antonio Sabogal Cardona
Publikováno v:
Ciencia e Ingeniería Neogranadina, Vol 25, Iss 1, Pp 77-89 (2015)
Ciencia e Ingeniería Neogranadina, Vol 25, Iss 1 (2015)
Ciencia e Ingeniería Neogranadina, Vol 25, Iss 1 (2015)
Uno de los aspectos más importantes en una implementación de Sistemas de Prioridad (TSP) para el transporte masivo es conocer el tiempo de llegada y de viaje de los buses solicitando prioridad. El presente artículo estima los tiempos de llegada de