1. bookVolumen 20 (2019): Edición 4 (December 2019)
Detalles de la revista
License
Formato
Revista
eISSN
1407-6179
Primera edición
20 Mar 2000
Calendario de la edición
4 veces al año
Idiomas
Inglés
Acceso abierto

Two - Echelon Vehicle Routing Problem with Recharge Stations

Publicado en línea: 21 Nov 2019
Volumen & Edición: Volumen 20 (2019) - Edición 4 (December 2019)
Páginas: 305 - 317
Detalles de la revista
License
Formato
Revista
eISSN
1407-6179
Primera edición
20 Mar 2000
Calendario de la edición
4 veces al año
Idiomas
Inglés

1. Braun, H. (1990) On solving travelling salesman problems by genetic algorithms. International Conference on Parallel Problem Solving from Nature, 129-133.Search in Google Scholar

2. Cordeau, J. F., Gendreau, M., and Laporte, G. (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks: an International Journal, 30(2), 105-119. DOI:10.1002/(SICI)1097-0037(199709)30:23.3.CO;2-N.10.1002/(SICI)1097-0037(199709)30:23.3.CO;2-NAbierto DOISearch in Google Scholar

3. Crainic, T. G., Perboli, G., Mancini, S., and Tadei, R. (2010) Two-echelon vehicle routing problem: a satellite location analysis. Procedia-Social and Behavioral Sciences, 2(3), 5944-5955. DOI:10.1016/j.sbspro.2010.04.009.10.1016/j.sbspro.2010.04.009Abierto DOISearch in Google Scholar

4. Dantzig, G.B., and Ramser, J.H. (1959) The Truck Dispatching Problem. Management Science, 6(1), 80–91. DOI:10.1287/mnsc.6.1.8.10.1287/mnsc.6.1.8Abierto DOISearch in Google Scholar

5. Desrochers, M., Desrosiers, J., and Solomon, M. (1992) A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2), 342-354. DOI:10.1287/opre.40.2.342.10.1287/opre.40.2.342Abierto DOISearch in Google Scholar

6. Figliozzi, M. (2010) Vehicle routing problem for emissions minimization. Transportation Research Record: Journal of the Transportation Research Board, (2197), 1-7. DOI:10.3141/2197-01.10.3141/2197-01Abierto DOISearch in Google Scholar

7. Gendreau, M., Laporte, G., and Séguin, R. (1996) Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3-12. DOI:10.1016/0377-2217(95)00050-X.10.1016/0377-2217(95)00050-XAbierto DOISearch in Google Scholar

8. Katayama, K., Sakamoto, H., and Narihisa, H. (2000) The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Mathematical and Computer Modelling, 31(10-12), 197-203. DOI:10.1016/S0895-7177(00)00088-1.10.1016/S0895-7177(00)00088-1Search in Google Scholar

9. Li, C. L., Simchi-Levi, D., and Desrochers, M. (1992) On the distance constrained vehicle routing problem. Operations Research, 40(4), 790-799. DOI:10.1287/opre.40.4.790.10.1287/opre.40.4.790Abierto DOISearch in Google Scholar

10. Li, F., Golden, B., and Wasil, E. (2007) The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research, 34(10), 2918-2930. DOI:10.1016/j.cor.2005.11.018.10.1016/j.cor.2005.11.018Search in Google Scholar

11. Maulik, U., and Bandyopadhyay, S. (2000) Genetic algorithm-based clustering technique. Pattern Recognition, 33(9), 1455-1465. DOI:10.1016/S0031-3203(99)00137-5.10.1016/S0031-3203(99)00137-5Abierto DOISearch in Google Scholar

12. Min, H. (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General, 23(5), 377-386. DOI:10.1016/0191-2607(89)90085-X.10.1016/0191-2607(89)90085-XAbierto DOISearch in Google Scholar

13. Nagy, G., and Salhi, S. (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126-141. DOI:10.1016/j.ejor.2002.11.003.10.1016/j.ejor.2002.11.003Abierto DOISearch in Google Scholar

14. Perboli, G., Tadei, R., and Vigo, D. (2011) The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Transportation Science, 45(3), 364-380. DOI:10.1287/trsc.1110.0368.10.1287/trsc.1110.0368Abierto DOISearch in Google Scholar

15. Ralphs, T. K., Kopman, L., Pulleyblank, W. R., and Trotter, L. E. (2003) On the capacitated vehicle routing problem. Mathematical programming, 94(2-3), 343-359. DOI:10.1007/s10107-002-0323-0.10.1007/s10107-002-0323-0Abierto DOISearch in Google Scholar

16. Renaud, J., Laporte, G., and Boctor, F. F. (1996) A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research, 23(3), 229-235. DOI:10.1016/0305-0548(95)O0026-P.10.1016/0305-0548(95)O0026-Abierto DOISearch in Google Scholar

17. Rosenkrantz, D. J., Stearns, R. E., and Lewis, II, P. M. (1977) An analysis of several heuristics for the traveling salesman problem. SIAM journal on computing, 6(3), 563-581. DOI:10.1137/0206041.10.1137/0206041Abierto DOISearch in Google Scholar

18. Starkweather, T., McDaniel, S., Mathias, K. E., Whitley, L. D., Whitley, C. (1991) A Comparison of Genetic Sequencing Operators. ICGA 69-76.Search in Google Scholar

19. Tamás, P. (2017) Decision Support Simulation Method for Process Improvement of Intermittent Production Systems. Sustainability, 7(9), 950, DOI:10.3390/app7090950.10.3390/app7090950Abierto DOISearch in Google Scholar

Artículos recomendados de Trend MD

Planifique su conferencia remota con Sciendo