Please use this identifier to cite or link to this item:
|Title:||Facility location with rectilinear tour distances|
Wesolowsky, George O.
McMaster University, Faculty of Business
|Series/Report no.:||Research and working paper series (McMaster University. Faculty of Business)|
|Abstract:||<p>This problem concerns the location of a facility among n points where the points are serviced by "tours" take n from the facility. Tours include m points at a time and each group of m points ma y become active (may need a tour) with some known probability. Distances are assumed to be rectilinear. An exact solution procedure is provided for m < 3 and a bounded heuristic algorithm is suggested when some tours have 4 or more points. It is shown that in the latter case the objective function becomes multimodal.</p>|
|Description:||<p>20, 7 leaves ; ; Cover title.;Includes bibliographical references (leaf 20).</p>|
|Appears in Collections:||DeGroote School of Business Working Paper Series|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.