An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints.

• Autor(a) principal: Coelho, Vitor Nazário
• Data de Publicação: 2016
• Outros Autores: Grasas, A., Ramalinho, H., Coelho, Igor Machado, Souza, Marcone Jamilson Freitas, Cruz, Raphael Carlos
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UFOP
• Texto Completo: http://www.repositorio.ufop.br/handle/123456789/7012; https://doi.org/10.1016/j.ejor.2015.09.047
• topic: Heterogeneous fleet; Multiple trips; Dockingcons traints; Iterated local search

Distribution planning is crucial for most companies since goods are rarely produced and consumed at the same place. Distribution costs, inaddition, can be an important component of the final cost of the products. In this paper, westudya VRP variant inspired on a real case of a large distribution company. In particular, we consider a VRP with a heterogeneous fleet of vehicles that a real lowed to perform multipletrips. The problem also includes docking constraints in which some vehicles are unable to serve some particular customers, and a realistic objective function with vehicles’ fixed and distance- based costs and a costper customer visited. We design a trajectory search heuristic called GILS-VND that combines Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) procedures. This method obtains competitive solutions and improves the company solutions leading to significant savings in transportation costs.