Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problems
Resumo
Este é um resumo expandido da tese de doutorado do autor orientada por Luiz Satoru Ochi e Eduardo Uchoa e defendida em 05 de março de 2012 na Universidade Federal Fluminense, Brasil. A tese está escrita em inglês e encontra-se disponível em http://www2.ic.uff.br/PosGraduacao/Teses/532.pdf.
Referências
Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., and Semet, F. (2002). A guide to vehicle routing problem. Journal of the Operational Research Society, 53:512–522.
Cordeau, J.-F., Laporte, G., and Mercier, A. (2011). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52:928–936.
Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., and Werneck, R. F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming, 106:491–511.
Golden, B. L., Assad, A. A., and Wasil, E. A. (2002). The Vehicle Routing Problem, chapter Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy and newspaper industries, pages 245–286. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
Laporte, G. and Semet, F. (2002). The Vehicle Routing Problem, chapter Classical heuristics for the Capacitated VRP, pages 109–128. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
Martinelli, R., Poggi, M., and Subramanian, A. (2013). Improved bounds for large scale capacitated arc routing problem. Computers & Operations Research. To appear,.
Pisinger, D. and Røpke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8):2403–2435.
Røpke, S. and Pisinger, D. (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171(3):750–775.
Silva, M. M., Subramanian, A., and Ochi, L. S. (2013). An iterated local search heuristic for the split-delivery vehicle routing problem. Submitted for publication.
Silva, M. M., Subramanian, A., Vidal, T., and Ochi, L. S. (2012). A simple and effective metaheuristic for the minimum latency problem. European Journal of Operational Research, 221(3):513–520.
Subramanian, A. and Battarra, M. (2013). An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. Journal of Operational Research Society, 64:402–409.
Vidal, T., Crainic, T., Gendreau, M., and Prins, C. (2013). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research. To appear.
Cordeau, J.-F., Laporte, G., and Mercier, A. (2011). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52:928–936.
Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., and Werneck, R. F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming, 106:491–511.
Golden, B. L., Assad, A. A., and Wasil, E. A. (2002). The Vehicle Routing Problem, chapter Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy and newspaper industries, pages 245–286. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
Laporte, G. and Semet, F. (2002). The Vehicle Routing Problem, chapter Classical heuristics for the Capacitated VRP, pages 109–128. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia.
Martinelli, R., Poggi, M., and Subramanian, A. (2013). Improved bounds for large scale capacitated arc routing problem. Computers & Operations Research. To appear,.
Pisinger, D. and Røpke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8):2403–2435.
Røpke, S. and Pisinger, D. (2006). A unified heuristic for a large class of vehicle routing problems with backhauls. European Journal of Operational Research, 171(3):750–775.
Silva, M. M., Subramanian, A., and Ochi, L. S. (2013). An iterated local search heuristic for the split-delivery vehicle routing problem. Submitted for publication.
Silva, M. M., Subramanian, A., Vidal, T., and Ochi, L. S. (2012). A simple and effective metaheuristic for the minimum latency problem. European Journal of Operational Research, 221(3):513–520.
Subramanian, A. and Battarra, M. (2013). An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. Journal of Operational Research Society, 64:402–409.
Vidal, T., Crainic, T., Gendreau, M., and Prins, C. (2013). Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research. To appear.
Publicado
23/07/2013
Como Citar
SUBRAMANIAN, Anand; OCHI, Luiz Satoru; UCHOA, Eduardo.
Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problems. In: CONCURSO DE TESES E DISSERTAÇÕES (CTD), 26. , 2013, Maceió/AL.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2013
.
p. 83-88.
ISSN 2763-8820.
