[PDF] Top 20 Experiment Design for the Location Allocation Problem

... The allocation of facilities and customers is a key problem in the design of supply chains of com- ...partitioning problem is NP hard, it is necessary to use heuristic methods to obtain ... See full document

... network design problem, in which the retailers’ demand and the quantity of returned products were considered to be uncertain and the DC and CC were ...same location as the potential new product buyer ... See full document

... facility location and vehicle routing has been recognized among the practitioners and ...network design problem. This paper considers a location-routing problem, which integrates the ... See full document

... new location problem models with disruption ...facility location at risk of disruption ...optimize location of facility services in condition of facilities competition and facility disruption ... See full document

... Chang and Wei (1999) proposed a strategic plan for allocating recycling drop- off stations of appropriate sizes and also designed the efficient collection route for the collection of the recycle bins for Taiwan. They ... See full document

... hub location allocation problem for an urban logistic system is investigated which contains two kinds of paths between hubs that differ in terms of travel time and expense, such that routes with a ... See full document

... network design is placed as strategic choice that have an influence either in the commercial issue as the tactical action or in operational management of the supply ...facility location allocation ... See full document

... heuristic algorithms based on simulated annealing (S A), particle swarm optimization (PSO) and genetic algorithms (GA) have been proposed to solve this type of hard problem. To ensure that each algorithm is ... See full document

... median problem that took the variation in trans-shipment costs according to the number of trans-shipped containers into account ...single allocation p-hub center problem based on an ant colony ... See full document

... hub location models have been studied during the last ...hub location problems are ...hub location problem on a network, which seems to be the first hub location model considering ... See full document

... planar location problems are categorized in three catego- ...the location problems with forbidden regions is ...urban design for rivers, border lines, highways, mountain ranges, or, on a smaller ... See full document

... in location-allocation problems, ranging from the single product multi location problem to uncapacitated facility location problem and capacitated facility location ... See full document

... network design as a strategic decision has long-term effect on tactical and operational supply chain ...chain design problem based on a two level capacity location allocation ... See full document

... In order to solve the problem faster with less auxiliary space, many scholars have tried using different meta- heuristics. Some scholars have experimented with fuzzy systems [8] and fruit fly optimization ... See full document

... Clustering is an efficient way to reach the information from raw data and K-means is a basic method for it. Although it is easy to implement and understand, K- means has serious drawbacks. Over the past 30 years, many ... See full document

... Data from a sample survey using a double sampling technique were collected from northeastern Colorado in 1979. The cost to obtain one direct and one indirect sample were estimated at $5.00 and $0.50, respectively. The ... See full document

... Chapter 2 surveyed a range of problems in tracking data regarding the accuracy of location estimates and the representation of track data. Uncertainties in loca- tion are compounded by inconsistencies with track ... See full document

... Due to their flexibility, Taguchi methods of experiment design have recently been increasingly used. They make it possible to combine a large number of significant f[r] ... See full document

... The results for each test problem are summarised in Table 1. Columns 1–3 give the number of custom- ers, the number of facilities and the lower bound (LB) respectively. The rest four double columns rep- resent the ... See full document

... This algorithm is used to determine a location X of a new facility in order to minimize the transportation cost and the zone-dependent fixed cost. The area is divided into zones which are all rectangular in shape. ... See full document