A simplified algorithm for the depot location problem

Gizelis, AG; Samouilidis, J-E

dc.contributor.author	Gizelis, AG	en
dc.contributor.author	Samouilidis, J-E	en
dc.date.accessioned	2014-03-01T01:05:48Z
dc.date.available	2014-03-01T01:05:48Z
dc.date.issued	1980	en
dc.identifier.issn	0305-0483	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/9001
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0019187509&partnerID=40&md5=eb1a412e240f6c82d380e412aefe1528	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	algorithm	en
dc.subject.other	depot location	en
dc.subject.other	Greek Manufacturing Company	en
dc.title	A simplified algorithm for the depot location problem	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	1980	en
heal.abstract	This paper describes a simplified optimization algorithm used for the solution of a classical depot location problem as presented in a Greek Manufacturing Company. Algorithms in the literature for this type of problem are based on the assumption of predetermined fixed costs which are independent of the final size of the depots. This assumption is usually far from reality; the size of each depot does not remain constant during the optimization process and so does the associated fixed cost which is variable with the size of the depot. This assumption is relaxed in the proposed algorithm; the associated fixed cost is modified each time a new customer is allocated to a depot thus changing the required depot size. © 1980.	en
heal.publisher	PERGAMON-ELSEVIER SCIENCE LTD	en
heal.journalName	Omega	en
dc.identifier.isi	ISI:A1980KB83200008	en
dc.identifier.volume	8	en
dc.identifier.issue	4	en
dc.identifier.spage	465	en
dc.identifier.epage	472	en