Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17117
Title: A Heuristic for the continuous location-routing problem
Authors: Rath, Ananya
Shrikhande, Harshad D.
Keywords: Production;Quantitative methods
Issue Date: 2015
Publisher: Indian Institute of Management, Ahmedabad
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.
URI: http://hdl.handle.net/11718/17117
Appears in Collections:Student Projects

Files in This Item:
File Description SizeFormat 
SP_1910
  Restricted Access
268.73 kBAdobe PDFView/Open Request a copy


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.