Search - facility location

Search - facility location - List

[Other resource] matlog DL : 0: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Update : 2008-10-13 Size : 4.63mb Publisher : 陈宝文
[matlab] matlog DL : 0: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Update : 2025-04-04 Size : 4.63mb Publisher : 陈宝文
[Algorithm] main DL : 0: Concert c++ example of facility location problem. C++ concert technology is a registered trademark of ILOG CPLEX
Update : 2025-04-04 Size : 1kb Publisher : Murali
[Mathimatics-Numerical algorithms] FuzzyFacilityLocationProblem2 DL : 0: Fuzzy Facility Location Problem
Update : 2025-04-04 Size : 4kb Publisher : m2579
[AI-NN-PR] RandomFacilityLocationProblem DL : 0: Random Facility Location Problem
Update : 2025-04-04 Size : 4kb Publisher : m2579
[Embeded Linux] System_Settings_Configuration_Menu DL : 0: The System Settings Configuration Menu is to provide the user with a facility to configure their platform specific settings into the PetaLinux build framework. By using the Kernel Configuration Menu, it allows the user s platform specific settings to be collated into one single location, prevents errors resulting from misconfiguration and enables storage of the configuration settings.
Update : 2025-04-04 Size : 66kb Publisher : 打狗队
[ERP-EIP-OA-Portal] Facility-Location DL : 0: 企业规划中的设施规划，利用重心法的启发式算法进行迭代，得到单设施多客户点的坐标的C算法-Facility planning in business planning, which employ Gravity heuristic algorithm to obtain a satisfying solution to the single facility problem.
Update : 2025-04-04 Size : 218kb Publisher : Ben
[Special Effects] Message-Passing-Algorithms DL : 0: 一本将基于AP传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助-The Uncapacitated Facility Location Prob- lem (UFLP) is one of the most widely stud- ied discrete location problems, whose appli- cations arise in a variety of settings. We tackle the UFLP using probabilistic infer- ence in a graphical model- an approach that has received little attention in the past. We show that the ﬁ xed points of max-product linear programming (MPLP), a convexiﬁ ed version of the max-product algorithm, can be used to construct a solution with a 3- approximation guarantee for metric UFLP instances. In addition, we characterize some scenarios under which the MPLP solution is guaranteed to be globally optimal. We eval- uate the performance of both max-sum and MPLP empirically on metric and non-metric problems, demonstrating the advantages of the 3-approximation construction and algo- rithm applicability to non-metric instances.
Update : 2025-04-04 Size : 245kb Publisher : fanhaixiong
[Other] FA1-main DL : 0: 一种遗传算法和萤火虫算法相结合的新型元启发式算法，经过测试，算法具有良好的性能。-Capacitated facility location problem (CFLP) is a well-known combinatorial optimization problem with applications in distribution and production planning that is classified as an NP-Hard problem. The aim is to determine where to locate facilities and how to move commodities such that the customers’ demands are satisfied and the total cost minimized. In this paper, a new hybrid optimization method called Hybrid Evolutionary Firefly-Genetic Algorithm is proposed, which is inspired by social behavior of fireflies and the phenomenon of bioluminescent communication. The method combines the discrete Firefly Algorithm (FA) with the standard Genetic Algorithm (GA). It is devoted to the detailed description of the problem, and an adaption of the algorithm. Computational results on random generated problems consisting of 2000 locations and 2000 customers are reported.
Update : 2025-04-04 Size : 198kb Publisher : 孙雪
[Algorithm] facility-location-problem DL : 0: 解决闭环供应链环境下基于拉格朗日松弛算法的逆向物流设施选址问题-Closed-loop supply chain environment to solve problems based on Lagrangian relaxation algorithm siting of reverse logistics facilities
Update : 2025-04-04 Size : 979kb Publisher : lily
[hospital software system] Hospital_Management DL : 0: Hospital Management system, The system provides a facility to the patience to find the availability of doctors in different hospitals based on the location
Update : 2025-04-04 Size : 546kb Publisher : Arun P R
[Other] IIET-Snyder-floc_uncertainty_review-2007-(1) DL : 0: Facility location under uncertainty: a review
Update : 2025-04-04 Size : 162kb Publisher : Aminoo dZ
[CSharp] bzd DL : 0: 单个应急服务设施点的选址问题，并将其推广到多个应急服务设施点选址的模型．先假定应急服务设施点都选在网络图的顶点处，然后根据应急属性建立具有约束条件的数学模型-Emergency service location problem of single point and extend it to multiple emergency services facility location model. Presuppose emergency service points are selected at the apex of a network diagram, and then a mathematical model based on the constraints of emergency properties
Update : 2025-04-04 Size : 1kb Publisher : myb
[Algorithm] Facility-Layout-Design-and-Location-Allocation-in DL : 0: Facility Layout Design and Location Allocation in MATLAB
Update : 2025-04-04 Size : 11kb Publisher : Mustafa