A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit <a rel="external noopener" href="https://www.econstor.eu/bitstream/10419/188838/1/v10-i04-p646_2159-9926-1-PB.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Omnia Publisher SL">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7axsoqjevbazbdhrrtkybtniyi" style="color: black;">Journal of Industrial Engineering and Management</a>
Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes.Design/methodology/approach: We propose a two-phase heuristic algorithm. In<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3926/jiem.2159">doi:10.3926/jiem.2159</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/epr37m5iynhxnjfocrts2e3adi">fatcat:epr37m5iynhxnjfocrts2e3adi</a> </span>
more »... he proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement.Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes.Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426195827/https://www.econstor.eu/bitstream/10419/188838/1/v10-i04-p646_2159-9926-1-PB.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/39/bd39a7b6871ebcb41fe9293922c74835372501d2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3926/jiem.2159"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>