Font Size: a A A

Research On Competitive Location Problems On A Network

Posted on:2007-05-07Degree:MasterType:Thesis
Country:ChinaCandidate:G W HuaFull Text:PDF
GTID:2178360185462651Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
Location problems mainly deal with the location of one or more facilities in a way that optimizes a certain objective subject to some conditions. They have been widely applied in many fields, such as productions, lives, logistics and military affairs and so on. Competitive location is a very important problem of location research, and it has obtained extensive concerns.This dissertation mainly studies competitive location problems on a network. Firstly, the basic knowledge of location problems and competitive location problems is given in detail, and a new model that reflects assembling effect for a class of competitive location problems and its algorithms are presented; secondly, two kinds of bi-objective competitive location models and their properties, relations and solutions are studied; thirdly, some properties and an algorithmic technique for the pre-emptive capture model are discussed; and finally, some suggestions are made for...
Keywords/Search Tags:competitive location, multi-objective programming, 0-1 programming, branch and bound method, exchange algorithm
PDF Full Text Request
Related items