masterThesis
Optimización de la programación de rutas de distribución secundaria en una empresa de consumo masivo en Colombia
Fecha
2019-01-11Registro en:
Batista, B. M., & Glover, F. (2006). Introducci´on a la Búsqueda Tabú. Colorado: Universidad de
La Laguna
Ben Ticha, H., Absi, N., Feillet, D., & Quilliot, A. (2017). Empirical analysis for the VRPTW with
a multigraph representation for the road network. Computers and Operational Research,
103 - 116
Braekers, K., Ramaekers, K., & Nieuwenhuyse, I. V. (2016). The vehicle routing problem: State of
the art classification and review. Computers & Industrial Engineering, 300 - 313.
Caceres-Cruz, J., Riera, D., & Angel, J. (2014). Rich Vehicle Routing Problem: Survey. ACM
Computing Surveys, 32
Çagrı, K., & Gilbert, L. (2018). Vehicle routing with backhauls: Review and research perspectives.
Computers and Operations Research, 79 - 91.
Cobb, B. R. (2016). Inventory control for returnable transport items in a closed-loop supply chain.
Transportation Research Part E: Logistics and Transportation Review, 53-68.
Colorni, A., Dorigo, M., & Maniezzo, V. (1991). Distributed optimization by ant colonies. In
proceedings of the first European conference on artificial life, 134-142.
Cordeau, J. F., Desaulniers, G., Desrosiers, J., Solomon, M., & Soumis, F. (1999). The VRP with
Time Windows. Montreal: Gerad.
Daniel, H., & Johansson, O. (2010). The impact of control strategies on the management of
returnable transport items. Transportation Research Part E, 1128-1139.
Daniel, H., & Ola, J. (2010). The impact of control strategies on the management of returnable.
Transportation Research Part E, 1128 -1139
Dinesh, K., Nachiappan, S., ManojK.Tiwari, Muhammad, A., & Chang, L. (2017). Closed loop
supply chain networks: Designs for energy and time. Int. J.ProductionEconomics, 382-393.
Elia, V., & Gnoni, M. G. (2015). Designing an effective closed loop system for pallet management.
Int. J. Production Economics, 730 - 740.
Ezcurra, J. B. (2017). COOPERACIÓN HORIZONTAL EN PROBLEMAS DE RUTAS DE
VEHÍCULOS CON RETORNOS. Pamplona, Iruña.
Faisal, A., & Sarah S, L. (2016). Supply chain optimization under risk and uncertainty: A case study
for high-end server manufacturing. Computers & Industrial Engineering, 78 - 87.
Faulin, J. A., Ferrer, J., H.R., A. L., & Barros, B. (2013). MIRHA: Multi-start biased randomization
of heuristics with adaptive local search for solving non-smooth routing problem. TOP, 109
- 132.
Feo, T. A., & Resende, M. G. (1995). Greedy ramdomized adaptative search procedures. Journal of
GLobal Optimization, 109-133.
Galina, I., Limbourg, S., & Fouad, R. (2017). The inventory-routing problem of returnable transport
items with time windows and simultaneous pickup and delivery in closed-loop supply
chains. Int. J.ProductionEconomics, 570-582
Galina, I., Sabine, L., & Fouad, R. (2017). The inventory-routing problem of returnable transport
items with time windows and simultaneous pickup and delivery in closed-loop supply
chains. International Journal of Production Economics, 570-582
Glover, F. (1986). Future paths for integer programming and links to artificial intelligence.
Computers & Operations Research, 533-549.
Grasas, A., Angel, J., Faulin, J., de Armas, J., & Ramalhinho, H. (2017). Biased randomization of
heuristics using skewed probability distributions: A sourvey and some applications.
Computers & Industrial Engineering, 2016-228
Grasas, A., Juan, A., Faulin, J., De Armas, J., & Ramalhinho, H. (30 de Mayo de 2017). Biased
Randomization of Heuristics using Skewed Probability Distributions: a survey and some
applications. Computers and Industrial Engineering, 216–228.
Hideki, H., Mutsunori, Y., & Toshihide, I. (2008). An iterated local search algorithm for the timedependent vehicle routing problem with time windows. ELSEVIER, 434 - 456.
Holland, J. H. (1975). Adaptation in natural and artificail systems: an introductory analysis with
applications to biology, control, and artificial intelligence. Michigan: U Michigan Press
Jacek, M., & Adam, Ż. (2016). A memetic approach to vehicle routing problem with dynamic
requests. Applied Soft Computing, 522-534.
Kirkpatrick, S., Gelatt, C., & and Vecchi, M. (1983). Optimization by simulated annealing. Science,
671-680.
Lenstra, J. K., & Kan, A. H. (1981). Complexity of Vehicle Routing and Scheduling Problems.
Networks, 221 - 227.
Lourenço, H. R., & Martin, O. a. (2010). Iterated local search: Framework and applications. En
Handbook of Methaeuristics (págs. 363-397). New York: Springer.
Mestera, D., & Braysyb, O. (2005). Active guided evolution strategies for large-scale vehicle
routing problems with time windows. ELSEVIER, 1593 - 1614.
Miranda, D. M., & Vieira Conceicao, S. (2016). The vehicle routing problem with hard time
windows and stochastic travel and service time. Elsevier, 104-116
Mohammeda, M. A., Ghani, M. K., Hamedc, R. I., Mostafa, S. A., Ibrahime, D. A., Jameel, H. K.,
& Alallah, A. H. (2017). Solving vehicle routing problem by using improved K-nearest
neighbor algorithm for best solution. Journal of Computational Science, 232 - 240.
Mole, R. H., & Jameson, S. R. (1976). A Sequential Route-building Algorithm Employing a
Generalised Savings Criterion. Palgrave Macmillan Journals, 503 - 511
Morais, V. W., Mateus, G. R., & Noronha, T. F. (2014). Iterated local search heuristics for the
Vehicle Routing Problem with Cross-Docking. Expert Systems with Applications, 7495 -
7506.
Motwani, R., & Raghavan, P. (1996). Randomized algorithms. ACM Comput. Surv, 33-37.
Nagataa, Y., Braysy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic algorithm
for the vehicle routing problem with time windows. Computers & Operations Research,
724-737.
Olivera, A. (2004). Heuristica para Problemas de Ruteo de Vehiculos. Montevideo, Uruguay:
Universidad de La Republica
Olivera, A. (2004). Heurísticas para Problemas de Ruteo de Vehículos. Universidad de la
República.
Özceylan, E. (2016). Simultaneous optimization of closed- and open-loop supply chain networks
with common components. Journal of Manufacturing Systems, 143-156.
problem, T. v. (1999). Cordeau, J.-F; Desaulniers,Guy; Desrosiers, Jacques; Solomon, Marius M;
Soumis, Francois. Philadelfia: Gerad
Quintero Araújo, C. L. (29 de Septiembre de 2017). Applications of simheuristics and horizontal
cooperation concept in rich vehicle routing problems. Barcelona, Cataluña, España
Resende, M. G., & Ribeiro, C. C. (2003). GRASP: Greedy ramdomized adaptative search
procedures. Boston: Springer.
Salvatore, C., Manfredi, B., & Jose M., F. (2016). Closed-loop supply chains: What reverse
logistics factors influence performance? International Journal of Production Economics,
35-49.
Samrat, H., Aditya, C., & Anup, D. (2018). Improving variable neighborhood search to solve the
traveling salesman problem. Applied Soft Computing, 83 - 91.
Schneider, M., Schwahn, F., & Daniele, V. (2017). Designing granular slution methods for routing
problems with time windows. European Journal of operation Research, 16.
Sun, P., Veelenturf, L., Dabia, S., & Woensel, T. (2018). The time-dependent capacited profitable
tour problem with time windows and precedence constraints. European Journl of
Operational Research, 15
Talbi, E.-G. (2009). Methaeuristics: From Design to Implementation. Wiley Publishing.
Taş, D., Jabali, O., & Woensel, T. V. (2014). A Vehicle Routing Problem with Flexible Time
Windows. Computers & Operations Research, 39 - 54
Ticha, B. H., Absi, N., Feillet, D., & Quilliot, A. (2017). Empirical analysis for the VRPTW with a
multigraph representation for the road network. Computers and Operations Research, 103-
116.
Toffolo, T. A., Christiaens, J., Malderen, S. V., Wauters, T., & Berghe, G. V. (2018). Stochastic
local search with learning automaton for the swap-body vehicle routing problem.
Computers and Operations Research, 68 - 81.
Vidal, T., Crainic, T., Gendreau, M., & and Prins, C. (2013). Heuristics for multi-atribute vehicle
routing problems: A sourvey and synthesis. European of operational Research, 1-21.
Yun, J., & Dong, Y. (2013). Maximizing profit for vehicle routing under time and weight
constraints. Int. J. Production Economics, 573 - 583.
Zanakis, S. H., & Evans, J. R. (1981). Heuristic "Optimization": Why, When, and How to Use It.
Interfaces, 84-91.
260224
TE07173
Autor
Quintero Araujo, Carlos Leonardo
Rincón, Oscar Emir
Institución
Resumen
Los sistemas logísticos de las organizaciones requieren operaciones eficientes, orientadas no sólo al uso adecuado de los recursos, sino al cumplimiento de los requisitos organizacionales, legales y por supuesto del cliente. Para Alpina S.A, multinacional líder, en la fabricación, distribución y comercialización de productos de origen lácteo, es de gran importancia, en su operación logística, garantizar el cumplimiento de las actividades de distribución, que permitan el adecuado uso de los recursos disponibles, buscando cumplir con los acuerdos de servicio con clientes. De allí, la necesidad de mejorar los procesos de planeación y control de la red de distribución secundaria, con el propósito no sólo de alcanzar mayor eficiencia en la utilización de los mismos sino del costo operativo de la empresa.