scholarly journals GIS-Based Simulated Annealing Algorithm for the Optimum Location of Fire Stations in the Madrid Region, Spain: Monitoring the Collapse Index

2021 ◽  
Vol 11 (18) ◽  
pp. 8414
Author(s):  
Susana Martín-Fernández ◽  
Eugenio Martínez-Falero ◽  
José Ramón Peribáñez ◽  
Alejandra Ezquerra
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Emergency Services ◽  
Fire Departments ◽  
Optimum Location ◽  
Fire Stations ◽  
One Year ◽  
Emergency Systems ◽  
The Cost ◽  
Collapse Index

Recent increases in incidents make it unlikely for emergency systems to be able to meet incident requirements. In this paper, we formulate a new territorial measurement approach for the reliability of fire departments, the collapse index, to help decision makers determine their response capability. This new index expresses the maximum simultaneous workload in a pixel over one year, measured over time. Based on this index, we propose a new fire station (FS) optimum location model by applying the simulated annealing method in conjunction with a geographic information system. The formulation of the cost function as the minimum standard deviation of the FS workload, combined with the constraint that the maximum collapse index in any pixel must be less than a certain threshold, are two contributions of this work. Five optimisation processes are developed to locate between up to five FS and create collapse index maps in the Madrid Region. The maximum collapse index in a pixel with a new FS decreases from its initial value of 10,485 min to 2500 min when five new FS are built. The conclusion is that the proposed optimisation model meets the need for reliability in the emergency services and that the collapse index is a good measure to prevent overlapping in the system.

scholarly journals Comparison of a Fuzzy Genetic and Simulated Annealing Algorithm Approach for Project Time-Cost Tradeoff

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Nataša Glišović
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Project Planning ◽  
Time Cost ◽  
Scheduling Problems ◽  
Project Networks ◽  
Resource Leveling ◽  
Time Period ◽  
The Cost ◽  
Fuzzy Genetic

Project planning, defining the limitations and resources by leveling the resources available, have a great importance for the management projects. All these activities directly affect the duration and the cost of the project. To get a competitive value on the market, the project must be completed at the optimum time. In other to be competitive enough the optimum or near optimum solutions of time cost tradeoff and the resource leveling and resource constrained scheduling problems should be obtained in the planning phase of the project. One important aspect of the project management is activity crashing, that is, reducing activity time by adding more resources such as workers and overtime. It is important to decide the optimal crash plan to complete the project within the desired time period. The comparison of fuzzy simulated annealing and the genetic algorithm based on the crashing method is introduced in this paper to evaluate project networks and determine the optimum crashing configuration that minimizes the average project cost, caused by being late and crashing costs in the presence of vagueness and uncertainty. The evaluation results based on a real case study indicate that the method can be reliably applied to engineering projects.

Research on Optimal Deployment of HWSN Node Cost Based on Simulated Annealing Algorithm

2014 ◽  
Vol 651-653 ◽  
pp. 1921-1924
Author(s):  
Ji Tao Shen ◽  
Jun Yang Zhang
Keyword(s):  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Fault Tolerant ◽  
Monitoring Network ◽  
Optimization Method ◽  
Perception Model ◽  
Annealing Algorithm ◽  
Target Monitoring ◽  
The Cost ◽  
Network Fault Tolerance

An optimal heterogeneous sensor differentiated deployment schemes based on simulated annealing algorithm is proposed to solve the problems of the high density of distributing heterogeneity nodes in WSN and geographical irregularity of the sensed event. This method can not only apply to Boolean perception model of the node, but also apply to perception model. The algorithm uses the cost of sensors deployment as objective function in the context of assuring the coverage and fault tolerant of networks. The simulation results show that, the optimization method proposed in this paper can effectively convergence, under the premise to ensure network fault tolerance and robustness, reduces the cost of network deployment, improve the quality of target monitoring network.

scholarly journals An Effective Heuristic-Based Approach for Partitioning

2013 ◽  
Vol 2013 ◽  
pp. 1-8 ◽  
Author(s):  
Xibin Zhao ◽  
Hehua Zhang ◽  
Yu Jiang ◽  
Songzheng Song ◽  
Xun Jiao ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Embedded System ◽  
Simulated Annealing Algorithm ◽  
Optimal Solution ◽  
Local Optimal Solution ◽  
Annealing Algorithm ◽  
The Cost ◽  
Combined Algorithm ◽  
Search Capability

As being one of the most crucial steps in the design of embedded systems, hardware/software partitioning has received more concern than ever. The performance of a system design will strongly depend on the efficiency of the partitioning. In this paper, we construct a communication graph for embedded system and describe the delay-related constraints and the cost-related objective based on the graph structure. Then, we propose a heuristic based on genetic algorithm and simulated annealing to solve the problem near optimally. We note that the genetic algorithm has a strong global search capability, while the simulated annealing algorithm will fail in a local optimal solution easily. Hence, we can incorporate simulated annealing algorithm in genetic algorithm. The combined algorithm will provide more accurate near-optimal solution with faster speed. Experiment results show that the proposed algorithm produce more accurate partitions than the original genetic algorithm.

scholarly journals A Simulated Annealing Algorithm for Solving Two-Echelon Vehicle Routing Problem with Locker Facilities

Algorithms ◽  
2020 ◽  
Vol 13 (9) ◽  
pp. 218
Author(s):  
A. A. N. Perwira Redi ◽  
Parida Jewpanya ◽  
Adji Candra Kurniawan ◽  
Satria Fadil Persada ◽  
Reny Nadlifatin ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Two Phase ◽  
Routing Problem ◽  
Intermediate Facilities ◽  
Annealing Algorithm ◽  
Phase Optimization ◽  
The Cost

We consider the problem of utilizing the parcel locker network for the logistics solution in the metropolitan area. Two-echelon distribution systems are attractive from an economic standpoint, whereas the product from the depot can be distributed from or to intermediate facilities. In this case, the intermediate facilities are considered as locker facilities present in an accessible location in the vicinity of the final customers. In addition, the utilization of locker facilities can reduce the cost caused by the unattended deliveries. The problem is addressed as an optimization model that formulated into an integer linear programming model denoted as the two-echelon vehicle routing problem with locker facilities (2EVRP-LF). The objective is to minimize the cost of transportation with regards to the vehicle travelling cost, the intermediate facilities renting cost, and the additional cost to compensate the customer that needs to travel to access the intermediate facilities. Because of its complexity, a simulated annealing algorithm is proposed to solve the problem. On the other hand, the modelling approach can be conducted by generating two-phase optimization model approaches, which are the p-median problem and the capacitated vehicle routing problem. The results from both methods are compared in numerical experiments. The results show the effectiveness of 2EVRP-LF compared to the two-phase optimization. Furthermore, the simulated annealing algorithm showed an effective performance in solving 2EVRP-LF.

Curve Fitting and Deconvolution of Instrumental Broadening: A Simulated Annealing Approach

1995 ◽  
Vol 49 (3) ◽  
pp. 273-278 ◽  
Author(s):  
A. Ferry ◽  
P. Jacobsson
Keyword(s):  
Simulated Annealing ◽  
Curve Fitting ◽  
Simulated Annealing Algorithm ◽  
A Priori ◽  
Global Optimum ◽  
Fitting Procedure ◽  
Instrumental Resolution ◽  
Priori Information ◽  
Definition Of ◽  
The Cost

A curve-fitting procedure based on the simulated annealing algorithm has been developed for the analysis of spectral Raman data. By the inclusion of a priori information about the instrumental broadening in the definition of the cost function that is minimized, effects of the finite instrumental resolution are eliminated from the resulting fit. The ability of the method to reproduce original band shapes is tested on synthesized spectra and FT-Raman spectra of diamond recorded at different resolutions with different apodization functions. The procedure yields the global optimum of the fitted parameters and is easily implemented on a personal computer.

Sonographically guided, transcatheter foam sclerotherapy of the great saphenous vein

Phlebologie ◽  
2007 ◽  
Vol 36 (06) ◽  
pp. 309-312 ◽  
Author(s):  
T. Schulz ◽  
M. Jünger ◽  
M. Hahn
Keyword(s):  
Saphenous Vein ◽  
Great Saphenous Vein ◽  
Clinical Stage ◽  
Clinical Signs ◽  
Cost Effective ◽  
Duplex Sonography ◽  
Foam Sclerotherapy ◽  
Average Loss ◽  
One Year ◽  
The Cost

Summary Objective: The goal of the study was to assess the effectiveness and patient tolerability of single-session, sonographically guided, transcatheter foam sclerotherapy and to evaluate its economic impact. Patients, methods: We treated 20 patients with a total of 22 varicoses of the great saphenous vein (GSV) in Hach stage III-IV, clinical stage C2-C5 and a mean GSV diameter of 9 mm (range: 7 to 13 mm). We used 10 ml 3% Aethoxysklerol®. Additional varicoses of the auxiliary veins of the GSV were sclerosed immediately afterwards. Results: The occlusion rate in the treated GSVs was 100% one week after therapy as demonstrated with duplex sonography. The cost of the procedure was 207.91 E including follow-up visit, with an average loss of working time of 0.6 days. After one year one patient showed clinical signs of recurrent varicosis in the GSV; duplex sonography showed reflux in the region of the saphenofemoral junction in a total of seven patients (32% of the treated GSVs). Conclusion: Transcatheter foam sclerotherapy of the GSV is a cost-effective, safe method of treating varicoses of GSV and broadens the spectrum of therapeutic options. Relapses can be re-treated inexpensively with sclerotherapy.

Sign in / Sign up

Export Citation Format

Share Document