A Heuristic for the continuous location-routing problem
Abstract
The problem of continuous location-routing has been solved earlier using the end-point algorithm. This paper brings out the limitations of the end-point algorithm and also points out cases where the end- point algorithm gives the most optimal results. A11 attempt has been made to use a more comprehensive cost function for vehicle-routing while solving the continuous location problem. A heuristic has been developed that accounts for the limitations of the end-point] algorithm and gives more optimal results than the end-point algorithm.
Collections
- Student Projects [3208]