Decision support system for solving the street routing problem

Servicing a large number of customers in a city zone is often a considerable part of many logistics chains. The capacity of one delivery vehicle is limited, but, at the same time, it usually serves plenty of customers. This problem is often called a Street Routing Problem (SRP). Key differences between Vehicle Routing Problem (VRP) and SRP are presented here. The main problem of SRP is that when the number of customers is huge, the number of delivery path combinations becomes enormous. As the experimental results show in the case of SRP the error on the length of delivery routes based on an expert's judgment when compared to the optimal solution is in the range of 10–25%. As presented in the paper, only using decision support systems such as Geographical Information Systems (GIS) makes possible to effectively manage SRP. Besides classical measurements used in VRP, such as total length of routes or time required for delivery in each route, other measurements, mostly qualitative ones, are presented. All of these are named as visual attractiveness. This paper discusses possible relationships between quantitative and qualitative measurements that give a promise for finding better solutions of SRP. Several new types of heuristics for solving SRP are evaluated and afterward compared using the real data. One of the key properties of GIS to use routing software is its flexible interactive and user‐friendly environment. Routing software can find a good solution and explore the possibilities while an expert later can change the calculated routes to explore other possibilities based on the expert's judgment. This paper presents a practical use of new heuristics with the ArcView and solution of address mail for several cities in Slovakia served by Slovak Post ltd. Other Decision Support Systems that solve SRP are presented as TRANSCAD developed by Caliper Corporation or GeoRoute promoted by Canadian Post and GIRO. First published online: 27 Oct 201

Optimizing the two-step floating catchment area method for measuring spatial accessibility to medical clinics in Montreal

<p>Abstract</p> <p>Background</p> <p>Reducing spatial access disparities to healthcare services is a growing priority for healthcare planners especially among developed countries with aging populations. There is thus a pressing need to determine which populations do not enjoy access to healthcare, yet efforts to quantify such disparities in spatial accessibility have been hampered by a lack of satisfactory measurements and methods. This study compares an optimised and the conventional version of the two-step floating catchment area (2SFCA) method to assess spatial accessibility to medical clinics in Montreal.</p> <p>Methods</p> <p>We first computed catchments around existing medical clinics of Montreal Island based on the shortest network distance. Population nested in dissemination areas were used to determine potential users of a given medical clinic. To optimize the method, medical clinics (supply) were weighted by the number of physicians working in each clinic, while the previous year's medical clinic users were computed by ten years age group was used as weighting coefficient for potential users of each medical clinic (demand).</p> <p>Results</p> <p>The spatial accessibility score (SA) increased considerably with the optimisation method. Within a distance of 1 Km, for instance, the maximum clinic accessible for 1,000 persons is 2.4 when the conventional method is used, compared with 27.7 for the optimized method. The t-test indicates a significant difference between the conventional and the optimized 2SFCA methods. Also, results of the differences between the two methods reveal a clustering of residuals when distance increases. In other words, a low threshold would be associated with a lack of precision.</p> <p>Conclusion</p> <p>Results of this study suggest that a greater effort must be made ameliorate spatial accessibility to medical clinics in Montreal. To ensure that health resources are allocated in the interest of the population, health planners and the government should consider a strategy in the sitting of future clinics which would provide spatial access to the greatest number of people.</p

Modeling location-allocation of military items to the depots without branch classification

Ankara : The Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 2002.Thesis (Master's) -- Bilkent University, 2002.Includes bibliographical references leaves 47-49.Işılak, Ali SezginM.S

An allocation based modeling and solution framework for location problems with dense demand /

In this thesis we present a unified framework for planar location-allocation problems with dense demand. Emergence of such information technologies as Geographical Information Systems (GIS) has enabled access to detailed demand information. This proliferation of demand data brings about serious computational challenges for traditional approaches which are based on discrete demand representation. Furthermore, traditional approaches model the problem in location variable space and decide on the allocation decisions optimally given the locations. This is equivalent to prioritizing location decisions. However, when allocation decisions are more decisive or choice of exact locations is a later stage decision, then we need to prioritize allocation decisions. Motivated by these trends and challenges, we herein adopt a modeling and solution approach in the allocation variable space.Our approach has two fundamental characteristics: Demand representation in the form of continuous density functions and allocation decisions in the form of service regions. Accordingly, our framework is based on continuous optimization models and solution methods. On a plane, service regions (allocation decisions) assume different shapes depending on the metric chosen. Hence, this thesis presents separate approaches for two-dimensional Euclidean-metric and Manhattan-metric based distance measures. Further, we can classify the solution approaches of this thesis as constructive and improvement-based procedures. We show that constructive solution approach, namely the shooting algorithm, is an efficient procedure for solving both the single dimensional n-facility and planar 2-facility problems. While constructive solution approach is analogous for both metric cases, improvement approach differs due to the shapes of the service regions. In the Euclidean-metric case, a pair of service regions is separated by a straight line, however, in the Manhattan metric, separation takes place in the shape of three (at most) line segments. For planar 2-facility Euclidean-metric problems, we show that shape preserving transformations (rotation and translation) of a line allows us to design improvement-based solution approaches. Furthermore, we extend this shape preserving transformation concept to n-facility case via vertex-iteration based improvement approach and design first-order and second-order solution methods. In the case of planar 2-facility Manhattan-metric problems, we adopt translation as the shape-preserving transformation for each line segment and develop an improvement-based solution approach. For n-facility case, we provide a hybrid algorithm. Lastly, we provide results of a computational study and complexity results of our vertex-based algorithm