A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows

The authors propose a meta-heuristic algorithm for addressing a real case of vehicle routing problem with a heterogeneous fleet and time windows. The authors' proposal consists of generating an initial feasible solution using the solution of a travelling salesman problem and, subsequently, refining it through simulated annealing. In this work, the authors evaluate the suitability of their development to planning the distribution of a regional distribution centre of a food company to customers within the urban perimeter of Cali, Colombia. Following the company's customer satisfaction goals, the authors' primary aim is to route to reach a service level of 95% while reducing operational costs. The authors' results on their real case study show that their meta-heuristic algorithm finds better routes than current ones, in terms of costs and service levels, in a relatively short time.

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01767260
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Feb 10 2021 12:37PM