检索结果-内蒙古大学图书馆

Facility location problem for senior centers in an upcoming super-aging society

SCIENTIFIC REPORTS 2025年第1期15卷 1-12页

作者： Lee, Eun Hak Jeong, Jonghwa Texas A&M Transportat Inst Metropolitan & Statewide Planning Div Div 1111 Rellis Pkwy Bryan TX 77807 USA Sahmyook Univ Dept Social Welf 815 Hwarang Ro Seoul 01795 South Korea

As the global population ages rapidly, ensuring the accessibility of senior centers is crucial for supporting the well-being and quality of life of older adults. This study aims to address the facility location problem for senior centers in upcoming super-aging societies. An optimization model is developed using a genetic algorithm to determine the optimal locations of senior centers. The objective is to minimize travel distances for older adults while accounting for constraints such as mobility limitations and the existing distribution of senior centers. The elbow method is employed to identify the optimal number of new centers, balancing service accessibility and resource allocation. Open data sources, i.e., floating population and geographic information in Seoul, are used to estimate demand at various locations. The results show that adding up to 15 new centers in Seoul effectively reduced average travel distances for older adults by 24%, from 0.85 km to 0.64 km. The introduction of these new centers is prioritized based on their impact on the community, i.e., reducing travel distances and redistributing demand from overburdened facilities. These findings provide a data-driven framework for urban planners and policymakers to strategically enhance senior service networks in rapidly aging societies. By improving access to senior centers, this approach can help promote active aging, reduce social isolation, and ensure a better quality of life for older adults.

关键词： Facility location problem heuristics algorithms Network optimization Aging society Older adult

来源：评论

学校读者我要写书评

暂无评论

Heuristic methods for single link shared backup path protection

引用

JOURNAL OF heuristics 2014年第5期20卷 539-560页

作者： Haahr, Jorgen Thorlund Stidsen, Thomas Zachariasen, Martin Univ Copenhagen Dept Comp Sci DK-2100 Copenhagen Denmark Tech Univ Denmark DTU Management Engn DK-2800 Lyngby Denmark

Protecting communication networks against failures is becoming increasingly important as they have become an integrated part of our society. Cable failures are fairly common, but it is unacceptable for a single cable failure to disconnect communication for more than a few seconds-hence protection schemes are employed. In contrast to manual intervention, automatic protection schemes such as shared backup path protection (SBPP) can recover from failure quickly and efficiently. SBPP is a simple but efficient protection scheme that can be implemented in backbone networks with technology available today. In SBPP backup paths are planned in advance for every failure scenario in order to recover from failures quickly and efficiently. Planning SBPP is an NP-hard optimization problem, and previous work confirms that it is time-consuming to solve the problem in practice using exact methods. We present heuristic algorithms and lower bound methods for the SBPP planning problem. Experimental results show that the heuristic algorithms are able to find good quality solutions in minutes. A solution gap of less than was achieved for 5 of 7 benchmark instances (and a gap of less than for the remaining instances.).

关键词： Network survivability Shared backup path protection heuristics algorithms Upper and lower bounds methods Protection capacity minimization

来源：评论

学校读者我要写书评

暂无评论

Identifying the Worst Reliability Input Vectors and the Associated Critical Logic Gates

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第6期65卷 1748-1760页

作者： Ibrahim, Walid United Arab Emirates Univ POB 15551 Al Ain U Arab Emirates Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada

Scaling the CMOS devices deep into the nanorange reduces their reliability margins significantly. Consequently, accurately calculating the reliability of digital nanocircuits is becoming a necessity for investigating design alternatives to optimize the trade-offs between area-power-delay and reliability. However, accurate reliability calculation of large and highly connected circuits is complex and very time consuming. This paper proposes a progressive consensus-based algorithm for identifying the worst reliability input vectors and the associated critical logic gates. Improving the reliability of the critical gates helps circuit designers to effectively improve the circuit overall reliability while having a minimal impact on the traditional power-area-deal design parameters. The accuracy and efficiency of the algorithm can be tuned to fit a variety of applications. The algorithm scales well with circuit size, and is independent of the interconnect complexity and the logic depth. Extensive computational results show that the accuracy and the efficiency of the proposed algorithm are better than the most recent results reported in the literature.

关键词： Reliability logic circuits optimization heuristics algorithms worst-case analysis genetic algorithms simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Towards a new strategy for solving fuzzy optimization problems

引用

FUZZY OPTIMIZATION AND DECISION MAKING 2009年第3期8卷 231-244页

作者： Cadenas, J. M. Verdegay, J. L. Univ Murcia Dept Ingn Informac & Comunicac Murcia Spain Univ Granada Dept Ciencias Computac & Inteligencia Artificial Granada Spain

Fuzzy Optimization models and methods has been one of the most and well studied topics inside the broad area of Soft Computing. Particularly relevant is the field of fuzzy linear programming (FLP). Its applications as well as practical realizations can be found in all the real world areas. As FLP problems constitute the basis for solving fuzzy optimization problems, in this paper a basic introduction to the main models and methods in FLP is presented and, as a whole, Linear Programming problems with fuzzy costs, fuzzy constraints and fuzzy coefficients in the technological matrix are analyzed. But fuzzy sets and systems based optimization methods do not end with FLP, and hence in order to solve more complex optimization problems, fuzzy sets based Meta-heuristics are considered, and two main operative approaches described. Provided that these techniques obtain efficient and/or effective solutions, we present a fuzzy rule based methodology for coordinating Meta-heuristics and in addition, to provide intelligence, we propose a process of extraction of the knowledge to conduct the coordination of the system.

关键词： Fuzzy linear programming Fuzzy optimization heuristics algorithms Soft computing Data mining

来源：评论

学校读者我要写书评

暂无评论

Ordering and pricing decisions for perishable goods retailer with zero-inventory and capital constraints

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2022年第5期29卷 3107-3130页

作者： Yang, Honglin Gao, Mingyun Xiao, Qinzi Goh, Mark Hunan Univ Sch Business Adm Changsha 410082 Hunan Peoples R China Natl Univ Singapore NUS Business Sch & Logist Inst Asia Pacific Singapore 117592 Singapore Univ Manitoba Asper Sch Business Winnipeg MB R3T2N2 Canada

Considering the restriction of optimal profit realizing due to capital constraints in the perishable supply chain, this paper discusses two financing models, crowdfunding financing and bank credit financing from the small-medium enterprise (SME) bank, for the dynamic ordering and pricing system of perishable goods in zero-inventory under capital constraints. heuristics algorithms are designed to solve the model. In dynamic crowdfunding financing, retailers bear different demand for capital in different periods and the capital gap for the retailer will narrow over time. In the SME financing model, the requirement for capital depends on retail size. We characterize the conditions of the financing preference between crowdfunding and SME financing channel. Smaller retailers, relative to the bigger players, are more willing to assure higher financing returns to gain the investment.

关键词： perishable goods dynamic ordering and pricing crowdfunding heuristics algorithms

来源：评论

学校读者我要写书评

暂无评论

An efficient computational model for unequal-area dynamic facility layout problems considering input/output locations under algorithms case

引用

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 2024年第3期49卷 1-18页

作者： Seyedi, Seyed Bardia Attari, Mahdi Yousefi Nejad Ghadim, Vahid Abbasgholi Pour Ala, Ali Islamic Azad Univ Dept Ind Engn Bonab Branch Bonab Iran Saveetha Inst Med & Tech Sci SIMATS Saveetha Sch Engn Dept Math Chennai Tamil Nadu India Shanghai Jiao Tong Univ Dept Ind Engn & Management Shanghai Peoples R China

Recently, the adaptability of production systems is crucial for various facilities or departments, focusing on minimizing the cost associated with material flow in facility layout problems. To address these challenges, an examination of dynamic problems becomes imperative. This paper presents a mathematical model designed explicitly for dynamic facility layout problems (DFLP) characterized by fixed shapes and unequal areas. The model incorporates input and output points, allowing flexibility in their placement within facilities, and treats material handling system input/output (I/O) points as decision variables. The proposed approach utilizes an Improved Particle Swarm Optimization algorithm (IPSO) and an Improved Genetic Algorithm (IGA) to solve the resulting mixed integer nonlinear programming (MINLP) model. Both a theoretical problem and a real-world case are employed to assess the effectiveness of the suggested algorithms. The outcomes demonstrate that the proposed algorithm outperforms the compared algorithms in identifying optimal solutions.

关键词： Facility layout problems unequal-area dynamic input and output points heuristics algorithms mixed integer non-linear

来源：评论

学校读者我要写书评

暂无评论

A New Hybrid Steganalysis Based Approach for Embedding Image in Audio and Image Cover Media

引用

IFAC-PapersOnLine 2016年第12期49卷 1809-1814页

作者： Fatnassi, A. Gharsellaoui, H. Bouamama, S. National Engineering School of Manouba Manouba University Tunisia National Engineering School of Carthage Carthage University Tunisia

This paper work deals with the study of interest in the fields of Steganography and Steganalysis with the image, audio or video stego media against the corresponding cover media (without the hidden information) and understand the process of embedding the information and its detection. Indeed, steganography involves hiding information in a cover media to obtain the stego media, in such a way that the cover media is perceived not to have any embedded message for its unintended recipients. Steganalysis is the mechanism of detecting the presence of hidden information in the stego media and it can lead to the prevention of disastrous security incidents. In this paper, we provide a critical review of the steganalysis algorithms available to analyze the characteristics of audio and image stego media against the corresponding cover media and understand the process of embedding the information and its detection. We anticipate that this paper can also give a clear picture of the current trends in steganography so that we can develop and improvise appropriate steganalysis algorithms. © 2016

关键词： Steganography Embedded systems Heuristic algorithms Heuristic methods Image processing Optimization Critical review Embedded messages Heuristic approach Hidden information Hiding informations Low power consumption Meta heuristics algorithms Security incident

来源：评论

学校读者我要写书评

暂无评论

heuristics-based indoor positioning systems: a systematic literature review

引用

JOURNAL OF LOCATION BASED SERVICES 2016年第3期10卷 178-211页

作者： Lam, Luan D. M. Tang, Antony Grundy, John Swinburne Univ Technol Fac Sci Engn & Technol Sch Software & Elect Engn Melbourne Vic Australia

Context: Many heuristics-based indoor positioning approaches have been developed to enhance positioning estimation. However, there is no comprehensive survey of these heuristics information and methods. Objective: The main objective of this study is to provide a holistic view and an in-depth analysis of what heuristics information and methods have been used, their general achievements and limitations. This study aims to provide a comprehensive summary to facilitate further research on indoor positioning heuristics. Method: We conducted a systematic literature review (SLR) on indoor positioning heuristics. Results: Ninety-three (93) primary studies were selected. We found two general types of heuristics information and four primary heuristics methods, which we summarised in this paper. We also found that many of these positioning heuristics are tested in experimental settings only. Some heuristics claim practical applications but are not tested for the challenging and typical indoor environments. Conclusion: Most existing heuristics information and methods rely on the assumptions that may not be true in real life environment, hence limiting the usefulness of the positioning outcomes. Based on the analysis of this SLR, we propose two research directions to enhance positioning estimation.

关键词： Positioning systems systematic literature review heuristics algorithms indoor environments

来源：评论

学校读者我要写书评

暂无评论

An Estimation of Distribution Algorithm (EDA) Variant with QGA for Flowshop Scheduling Problem

An Estimation of Distribution Algorithm (EDA) Variant with Q...

引用

6th International Conference on Digital Image Processing (ICDIP)

作者： Latif, Muhammad Shahid Hong Zhou Ali, Amir Beihang Univ Sch Econ & Mannegment Beijing 100191 Peoples R China Beihang Univ Sch Comp Sci & Engn Beijing 100191 Peoples R China

ISBN: (纸本)9781628411867

In this research article, a hybrid approach is presented which based on well-known meta-heuristics algorithms. This study based on integration of Quantum Genetic Algorithm (QGA) and Estimation of Distribution Algorithm, EDA, (for simplicity we use Q-EDA) for flowshop scheduling, a well-known NP hard Problem, while focusing on the total flow time minimization criterion. A relatively new method has been adopted for the encoding of jobs sequence in flowshop known as angel rotations instead of random keys, so QGA become more efficient. Further, EDA has been integrated to update the population of QGA by making a probability model. This probabilistic model is built and used to generate new candidate solutions which comprised on best individuals, obtained after several repetitions of proposed (Q-EDA) approach. As both heuristics based on probabilistic characteristics, so exhibits excellent learning capability and have minimum chances of being trapped in local optima. The results obtained during this study are presented and compared with contemporary approaches in literature. The current hybrid Q-EDA has implemented on different benchmark problems. The experiments has showed better convergence and results. It is concluded that hybrid Q-EDA algorithm can generally produce better results while implemented for Flowshop Scheduling Problem (FSSP).

关键词： Quantum Genetic Algorithm (QGA) Flowshop Scheduling Problem (FSSP) heuristics algorithms Probability Model Estimation of Distribution of algorithms (EDA)

来源：评论

学校读者我要写书评

暂无评论

A network design algorithm for multicast communication architectures in smart transmission grids

引用

ELECTRIC POWER SYSTEMS RESEARCH 2020年 187卷 106484-106484页

作者： Adrah, Charles M. Palma, David Kure, Oivind Heegaard, Poul E. Norwegian Univ Sci & Technol Dept Informat Secur & Commun Technol NTNU Trondheim Norway Univ Oslo Dept Technol Syst UiO Oslo Norway

In future smart transmission grids, there are distributed applications that will benefit from the deployment of Internet Protocol (IP) multicast technology for communication. Sharing of Routable-Sample Values (R-SV) and Routable-GOOSE among the digital substations for wide-area monitoring, protection, and control (WAMPAC) applications will be needed. Using multicast for distribution of R-SVs is resource-efficient and offers a simpler configuration with only the interested substations needing reconfiguration. However, the demands for such concurrent delivery of R-SV data will put constraints on the underlying supporting networking infrastructure. For example, it must be ensured that the paths taken to route data traffic are within the bounds of delay to achieve the aims of the WAMPAC application. In this paper, we look at the problem of network topology augmentation through link additions. We present a heuristic algorithm that finds a set of links to be added to a network topology such that the multicast distribution tree for a multicast configuration is bounded by latency, which is set as the hop-count threshold. Our results show that by adding a few new links to the network topology, the delay incurred by the multicast traffic from sources to destinations can be reduced.

关键词： Smart transmission grids heuristics algorithms Communication networks Multicast Wide-area networks Substation automation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：