Coelho, Vitor NazárioGrasas, ÀlexRamalhinho-Lourenço, HelenaCoelho, Igor MachadoSouza, Marcone Jamilson FreitasCruz, R. C.2020-04-142020-04-142016Coelho VN, Grasas A, Ramalhinho H, Coelho IM, Souza MJF, Cruz RC. An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur J Oper Res. 2016 Apr 16;250(2):367–76. DOI: 10.1016/j.ejor.2015.09.0470377-2217http://hdl.handle.net/10230/44210Distribution planning is crucial for most companies since goods are rarely produced and consumed at the same place. Distribution costs, in addition, can be an important component of the final cost of the products. In this paper, we study a 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 are allowed to perform multiple trips. 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 cost per 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.application/pdfeng© Elsevier http://dx.doi.org/10.1016/j.ejor.2015.09.047info:eu-repo/semantics/articlehttp://dx.doi.org/10.1016/j.ejor.2015.09.047VRPHeterogeneous fleetMultiple tripsDocking constraintsIterated local searchinfo:eu-repo/semantics/openAccess