A Heuristic for the continuous location-routing problem

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/17117

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Venkateshan, Prahalad	-
dc.contributor.author	Rath, Ananya	-
dc.contributor.author	Shrikhande, Harshad D.	-
dc.date.accessioned	2015-12-31T11:57:25Z	-
dc.date.available	2015-12-31T11:57:25Z	-
dc.date.copyright	2013	-
dc.date.issued	2015	-
dc.identifier.uri	http://hdl.handle.net/11718/17117	-
dc.description.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.	en_US
dc.language.iso	en	en_US
dc.publisher	Indian Institute of Management, Ahmedabad	en_US
dc.subject	Production	en_US
dc.subject	Quantitative methods	en_US
dc.title	A Heuristic for the continuous location-routing problem	en_US
dc.type	Student Project	en_US
Appears in Collections:	Student Projects

Files in This Item:

File	Description	Size	Format
SP_1910 Restricted Access		268.73 kB	Adobe PDF	View/Open Request a copy