Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Location-allocation problems"”.
-
Algorithmic Approaches for Solving the Euclidean Distance Location and Location-Allocation Problems
… algorithmic approaches for solving the minisum location and location-allocation problems in which the Euclidean metric is used to measure distances. To overcome the nondifferentiability difficulty associated with the Euclidean norm function, specialized solution procedures are developed for both …
-
Balanced, capacitated, location-allocation problems on networks with a continuum of demand
Location-allocation problems can be described generically as follows: Given the location or distribution (perhaps, probabilistic) of a set of customers and their associated demands for a given product or service, determine the optimum location of a number of service facilities and the allocation of …
-
Static and sequential location-allocation problems on networks and areas with probabilistic demands
Location-allocation problems arise in many practical settings and may be generically stated as follows: Given the location or distribution of a set of customers and their associated demands, simultaneously determine an optimal location of a number of supply facilities and their allocation of …
-
Generation and optimisation of real-world static and dynamic location-allocation problems with application to the telecommunications industry.
The location-allocation (LA) problem concerns the location of facilities and the allocation of demand, to minimise or maximise a particular function such as cost, profit or a measure of distance. Many formulations of LA problems have been presented in the literature to capture and study the unique …
-
ΕΠΙΛΥΣΗ ΠΡΟΒΛΗΜΑΤΩΝ ΧΩΡΟΘΕΤΗΣΗΣ ΚΕΝΤΡΩΝ ΠΑΡΟΧΗΣ ΥΠΗΡΕΣΙΩΝ ΣΕ ΔΙΚΤΥΟ
… OF THIS THESIS IS THE SOLUTION OF THE FACILITY LOCATION PROBLEM (FLP) IN SUCH WAY THAT ANY DEMAND POINT CAN BE SERVICED BY A FLP IN A TIME-DISTANCE LESS THAN A GIVEN T (PROBLEM (F)). PROBLEM (F) BELONGS TO THE WELL KNOWN CATEGORY OF NP-HARD PROBLEMS AND UNTIL NOW IT IS TACKLED UNDER THE …
-
Polynomial and indefinite quadratic programming problems: algorithms and applications
… global optimization of polynomial programming problems, and a detailed treatment of its particular special case, the indefinite quadratic programming problem. Polynomial programming problems are generally nonconvex, involving the optimization of a polynomial objective function over a compact …
-
Optimization Models and Analysis of Routing, Location, Distribution, and Design Problems on Networks
A variety of practical network optimization problems arising in the context of public supply and commercial transportation, emergency response and risk management, engineering design, and industrial planning are addressed in this study. The decisions to be made in these problems include the …