Search

Damacana su pazarı Türkiye’de hızlı bir büyüme potansiyeline sahiptir. Coca Cola İçecek A.Ş. Mahmudiye su tesislerini satın alarak doğal kaynak suyu üretimine başlamıştır. Şirket Ankara’da Damla markası adı altında damacana suyu satmaya karar vermiştir. Bu çalışmada Damla damacana suyu için bir dağıtım ağı tasarımı yapılmıştır. Bunun için Ankara’daki damacana su satış potansiyeli saptanmış, açılacak olan bayilerin yerleri, hizmet alanları, kapasiteleri, gerekli işçi ve araç sayıları belirlenmiştir. The HOD-Demijohn water market has a large potential of growth in Turkey. Coca Cola Company has recently bought the facilities at Mahmudiye and has started the production of HOD-Demijohn water. The company decided to sell its product under the brand Damla in Ankara. In this study, a distribution system is designed for the sales of Damla HOD-Demijohn water in Ankara. With this aim, the sales potential of HODDemijohn water is forecasted and the location of vendors as well as their service areas, capacities, number of workers and vehicles needed are determined.

The paper discusses the location problem of production plants exemplified by concrete mix production plants (Ist model), taking into consideration the demand variability in time (IInd model), and the analytical method of the localization of industrial plant with a considerable amount of transportation costs of concrete mix and concrete aggregate (IIIrd model). Changes in demand for concrete mix in time t lead to changes in plants’ location. Assuming that there exist concrete mix production plants, one should make a simulation of demand for concrete mix which occurs at the time t The presented models are the essential generalisation of the problem discussed in the earlier papers. The matrix of construction costs must be always defined as a fourâ€dimensions vector (the set of four values): the production plant construction cost, the cost of plant's modernisation (which is the result of changing demand for concrete mix), the cost of liquidation (dismantling) of a production plant or the cost of moving of an existing production plant. Three new generalised notions concerning the classical linear programming (mixed programming, mixed programming with time and twoâ€optimised conjugate linear system) have been introduced. The algorithms describing the aboveâ€mentioned models of location changes were suggested, and programmes solving the location problems were prepared in PASCAL. IÅ¡plÄ—stinis betono gamyklų iÅ¡dÄ—stymo tiesinio programavimo modelis Santrauka Aptariama gamyklų iÅ¡dÄ—stymo problema iliustruota betono gamyklų pavyzdžiu. I modelyje nagrinÄ—jamas betono gamyklos iÅ¡dÄ—stymas nepriklausomai nuo betono poreikio kitimo laikui bÄ—gant. II modelyje įvertinamas betono poreikio kitimas laikui bÄ—gant. III analiziniame pramonÄ—s gamyklų iÅ¡dÄ—stymo modelyje įvertintos betono miÅ¡inio bei užpildo transportavimo iÅ¡laidos. Kintant betono poreikiui laikui bÄ—gant, kinta ir gamyklų iÅ¡dÄ—stymas. Esamoms betono gamykloms turi bÅ«ti atliktas betono miÅ¡inio poreikio kitimo laikui bÄ—gant modeliavimas. Pateikti modeliai apibendrina ankstesniuose straipsniuose suformuluotas esmines problemas. Statybos iÅ¡laidų matrica turi bÅ«ti sudaryta kaip keturių dimensijų vektorius (keturių reikÅ¡mių aibÄ—): gamyklos statybos iÅ¡laidos, gamyklų modernizavimo iÅ¡laidos, kurias lemia betono poreikio kitimas, gamyklos likvidavimo iÅ¡laidos arba esamos gamyklos perkÄ—limo iÅ¡laidos. Pateiktos trys naujos apibendrintos metodikos, susijusios su klasikiniu tiesiniu programavimu (miÅ¡rusis programavimas, miÅ¡rusis programavimas laikui bÄ—gant ir pagal du požymius optimizuota jungtinÄ— tiesinÄ— sistema). PasiÅ«lyti iÅ¡dÄ—stymo modelių apraÅ¡ymo algoritmai, kurių sprendimams parengtos kompiuterinÄ—s programos PASCAL programavimo kalba. ReikÅ¡miniai žodžiai: proceso modeliavimas, iÅ¡dÄ—stymo problema, transportavimo metodas, betono miÅ¡inys, tiesinis programavimas, miÅ¡rusis programavimas, jungtinis programavimas. First Published Online: 14 Oct 2010

This research work was partially supported by the National Science Council of the Republic of China under grant No. NSC86-2416-h-019-001, The Weber problem is to find a supply point in a plane such that total weighted distance between supply point and a set of demand points is minimized. No known algorithm finds the exact solution. In this paper, we consider a restricted case of Weber problem. The solution domain considered here is confined to grid points (that is, points with integer coordinates). Given m demand points in a plane and a convex polygon P with n vertices, we propose an algorithm to find a supply point with integer coordinates in convex polygon P such that total weighted distance from the point to these m points is minimized. If P is contained in U × U lattice, the worst case running time of the algorithm is O((n + m) log U + log2 U ). Our method works as follows. Fist, the searching domain polygon P is transformed so that either a number of horizontal grid lines can cover P or a central grid point in P can be found. If the first case holds, the supply point with integer coordinates can be found easily by scanning the grid points on those covering grid lines. Otherwise, we can prune a way a fixed fraction of the polygon by drawing a tangent line through the central grid point so that a smaller searching domain P can be obtained and do the searching recursively., AMS subject classification: 90B80.

We consider Bayes procedures for a location parameter $\theta$ that are robust with respect to the shape of the distribution $F$ of the data. The case where $F$ is fixed (nonrandom) and the case where $F$ has a Dirichlet distribution are both treated. The procedures are based on the posterior distributions of the location parameter given the partial information contained in a robust estimate of location. We show consistency and asymptotic normality of the procedures and give instances where the Bayes procedure based on the full sample diverges while the Bayes procedures based on partial information converges and is asymptotically normal. Finally, we show that robust confidence procedures can be given a Bayesian interpretation.

Recent events in the rivers of the Amazon region show the distinct need for concern in this region and the vulnerability of the Amazonian people in regards to these events. Organizations for humanitarian aid developed procedures in the Amazon region. But to what extent are these actions effective if little is done prior to disasters? This work seeks to develop a frame of reference for classifying alertness in cities likely to suffer from flooding and ebbing of the hydrographic network in the Amazon Basin. The objective is to serve warning to the riverside communities in the state of Amazonas, establish future provisions of supplies and to form a solid database of information concerning the needs and impacts of these events, hence creating a historical record.

In this paper, we consider the 1-median problem in R d with the Chebyshev-norm. We give an optimality criterion for this problem which enables us to solve the following inverse location problem by a combinatorial algorithm in polynomial time: Given n points P 1 , … , P n ∈ R d with non-negative weights w i and a point P 0 the task is to find new non-negative weights w i such that P 0 is a 1-median with respect to the new weights and ‖ w − w ‖ 1 is minimized. In fact, this problem reduces to a 2-balanced flow problem for which an optimal solution can be obtained by solving a fractional b -matching problem.

The paper presents the first stage of the MCDM/A-based two-stage procedure resulting in the selection of the most desirable location of the logistics centre. In the first stage, the macro-analysis of the regions is carried out and multiple criteria evaluation of their technological, infrastructural, economic, social and environmental potential is performed. The decision problem is formulated as a multiple criteria ranking problem. The considered variants – regions are ranked from the best to the worst – in terms of their suitability for locating the logistics centre within their boundaries – with the application of the MCDM/A method, called Electre III/IV. The variants and a consistent family of criteria are defined, the decision maker's preferences are modelled and the results of computational experiments are demonstrated.

The inverse p-median problem consists in changing the weights of the customers of a p-median location problem at minimum cost such that a set of p prespecified suppliers becomes the p-median. The cost is proportional to the increase or decrease of the corresponding weight. We show that the discrete version of an inverse p-median problem can be formulated as a linear program. Therefore, it is polynomially solvable for fixed p even in the case of mixed positive and negative customer weights. In the case of trees with nonnegative vertex weights, the inverse 1-median problem is solvable in a greedy-like fashion. In the plane, the inverse 1-median problem can be solved in O(nlogn) time, provided the distances are measured in l1- or l∞-norm, but this is not any more true in R3 endowed with the Manhattan metric.

We discuss frequency properties of Bayes rules, paying special attention to consistency. Some new and fairly natural counterexamples are given, involving nonparametric estimates of location. Even the Dirichlet prior can lead to inconsistent estimates if used too aggressively. Finally, we discuss reasons for Bayesians to be interested in frequency properties of Bayes rules. As a part of the discussion we give a subjective equivalent to consistency and compute the derivative of the map taking priors to posteriors.