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

Optimizing the spatial accessibility of outdoor sports facilities: a greedy heuristic algorithm based on remote sensing images

引用

INTERNATIONAL JOURNAL OF DIGITAL EARTH 2024年第1期17卷

作者： Liu, Liyuan Xu, Zhicheng Yao, Shenjun Lv, Muhan Liu, Chang East China Normal Univ Key Lab Geog Informat Sci Minist Educ Shanghai Peoples R China East China Normal Univ Sch Geog Sci 500 Dongchuan Rd Shanghai 200241 Peoples R China Minist Nat Resources Key Lab Spatial Temporal Big Data Anal & Applicat Shanghai Peoples R China

Recent studies on the accessibility of sports facilities have rarely considered the specific attributes of the facilities, limiting their ability to define service potential, and have often neglected the critical aspect of equitable access. This study proposed a novel approach based on remote sensing images to optimize the spatial accessibility of outdoor sports facilities. Using Shanghai, China, as the study area, the study identified four types of sports facilities using a deep learning object detection method, which allowed their service capacities (areas) to be measured more precisely. A greedy heuristic algorithm was then developed based on a "trade-off" strategy that seeks to optimize facility access by reconciling the objectives of enhancing access and ensuring equality and by weighing the benefits of utilizing existing resources (school facilities) against the necessity of developing new ones. The object detection method achieved precision and recall rates of 88% and 96%, respectively, and the optimization efforts resulted in a 73% increase in accessibility while also significantly reducing the Gini coefficient from 0.58 to 0.34. The proposed algorithm outperformed the random selection and all-school-opening strategies. The results indicated that the methodology can effectively create refined datasets for outdoor sports facilities and enhance their accessibility.

关键词： Sports accessibility urban planning greedy heuristic algorithm deep learning GIS

来源：评论

学校读者我要写书评

暂无评论

A maximal-reward preliminary planning for multi-debris active removal mission in LEO with a greedy heuristic method

引用

ACTA ASTRONAUTICA 2018年第Aug.期149卷 123-142页

作者： Yang, Jianan Hu, Yu Hen Liu, Yong Pan, Quan Northwestern Polytech Univ Sch Automat Xian 710072 Shaanxi Peoples R China Univ Wisconsin Dept Elect & Comp Engn 1415 Johnson Dr Madison WI 53706 USA

An active multi-debris removal mission planning algorithm for low Earth orbit (LEO) debris removal is presented. We assume that a space platform carrying multiple debris-deorbiting nano-satellites will be launched to carry out the debris removal mission. This platform travels from one debris object to the next using a drift-orbit-transfer strategy. Each debris is assigned a reward value reflecting potential collision risk reductions if the debris is deorbited. The objective of mission planning is to determine an ordering of debris to be deorbited that maximizes the total reward due to debris removal subject to the constraints of (a) the total amount of velocity change for orbit transfer, (b) the total duration of the debris removal mission, and (c) the number of deorbiting nano-satellites carried on board the platform. In this work, a new approach is taken to approximate the response curve of drift-orbit transfers between each debris pair using a numerically interpolated continuous curve. An optimal orbit transfer strategy then is adopted to minimizes the sum of relative Av consumption and relative transfer duration. The task of multi-debris removal mission planning is formulated as a combinatorial tree search discrete optimization problem using this optimal orbit transfer cost estimate. A greedy heuristic with polynomial time complexity is proposed to select the next debris to deorbit that maximizes the reward-to-cost ratio. The effectiveness of this novel approach is demonstrated using real-world Iridium 33 debris cloud data. It is observed that this algorithm delivers superior performance while consuming a small fraction of computing time compared to state of the art mission planning algorithms.

关键词： Multi-debris active removal Low earth orbit Maximal-reward optimization model greedy heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of ATC based greedy heuristic algorithms in Scheduling Diffusion Furnace in Wafer Fabrication

引用

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES 2016年第5期37卷 717-762页

作者： Rani, M. Vimala Mathirajan, M. Indian Inst Sci Dept Management Studies Bangalore 560012 Karnataka India

This study addresses the scheduling of a Batch Processing Machine (BPM) with incompatible job-families, dynamic job-arrivals, and non-agreeable release times & due dates with the objective of minimizing total weighted tardiness (TWT). First we propose a mixed integer linear programming model (MILP) for the research problem. Due to the computational intractability in getting optimal solution for large scale real-life sized problems, we propose nine variants of Apparent Tardiness Cost (ATC) based greedy heuristic algorithms (GHA). From the series of computational experiments carried out it is observed that out of nine ATC based GHA, two proposed variants of ATC based GHA consistently performing better than other variants of ATC based GHA in comparison with an estimated optimal solution.

关键词： Batch Processing Machine Incompatible Job-Families Apparent Tardiness Cost Total Weighted Tardiness MILP Model greedy heuristic algorithm Estimated Optimal Solution

来源：评论

学校读者我要写书评

暂无评论

Creating contiguous service areas around points of dispensing for resource distribution during bio-emergencies

引用

GEOINFORMATICA 2023年第3期27卷 461-490页

作者： Gwalani, Harsha Tiwari, Chetan O'Neill, Marty, II Mikler, Armin R. Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA Georgia State Univ Dept Comp Sci Dept Geosci Atlanta GA 30303 USA Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

Response plans in preparation for public health emergencies often involve the setup of facilities like shelters, ad-hoc clinics, etc. to serve the affected population. While public health authorities frequently have prospective facility locations, balancing the demand or population at these facilities can be challenging. Assigning populations to their closest facilities may lead to uneven distribution of demand. This research proposes a novel greedy heuristic algorithm to create service areas around given facilities such that the population to be served by each facility is uniform or proportional to available resources. This algorithm has been implemented in the context of response plans for bio-emergencies in Denton County, Texas, USA. Given the location of Points of Dispensing (PODs), the objective is to create contiguous catchment areas, each served by one POD such that demand distribution constraints are satisfied. While the demand distribution constraints are hard constraints, it is also preferred that populations are mapped to PODs as close to them as possible. A response plan defines a mapping of populations to facilities and presents a combinatorial optimization problem in which the average distance between population locations and PODs is the cost function value, and demand equity and contiguity of catchment areas are hard constraints. We present a decision support system for planners to select solutions based on the compactness of catchment areas, the average distance between populations and PODs, and execution time, given that all solutions have contiguous catchment areas and balanced demand.

关键词： Decision support systems Emergency response planning Location-allocation Fixed facility service districting greedy heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

A comprehensive modeling framework for hazmat network design, hazmat response team location, and equity of risk

引用

COMPUTERS & OPERATIONS RESEARCH 2017年第Mar.期79卷 119-130页

作者： Taslimi, Masoumeh Batta, Rajan Kwon, Changhyun CSX Transportat Jacksonville FL USA Univ Buffalo Dept Ind & Syst Engn Buffalo NY USA Univ S Florida Dept Ind & Management Syst Engn Tampa FL 33620 USA

This paper considers a bi-level hazmat transportation network design problem in which hazmat shipments have to be transported over a road network between specified origin-destination points. The bi-level framework involves a regulatory authority and hazmat carriers. The control variables for the regulatory authority are locations of hazmat response teams and which additional links to include for hazmat travel. The regulatory authority (upper level) aims to minimize the maximum transport risk incurred by a transportation zone, which is related to risk equity. Our measure of risk incorporates the average response time to the hazmat incidents. Hazmat carriers (lower level) seek to minimize their travel cost. Using optimality conditions, we reformulate the non-linear bi-level model as a single-level mixed integer linear program, which is computationally tractable for medium size problems using a commercial solver. For large size problems, we propose a greedy heuristic approach, which we empirically demonstrate to find good solutions with reasonable computational effort. We also seek a robust solution to capture stochastic characteristics of the model. Experimental results are based on popular test networks from the Sioux Falls and Albany areas.

关键词： Hazmat emergency response team Bi-level network design greedy heuristic algorithm Equity of risk Robust solution

来源：评论

学校读者我要写书评

暂无评论

An efficient memetic algorithm for the multi-stage supply chain network problem

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2006年第7-8期29卷 803-813页

作者： Yeh, Wei-Chang Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu 300 Taiwan

A supply chain is dynamic and involves the constant flow of information, production, services, and funds from suppliers to customers between different stages. In this paper, a memetic algorithm (MA, a hybrid genetic algorithm) is developed to find the strategy that can give the lowest cost of the physical distribution flow. The proposed MA is combined with the genetic algorithm (GA), a multi-greedy heuristic method (GH), three local search methods (LSMs): the pairwise exchange procedure (XP), the insert procedure (IP), and the remove procedure (RP), the Fibonacci number procedure, and the linear programming technique (LP) to improve the tradition genetic algorithm (GA). Preliminary computational experiments demonstrate the efficiency and performance of the proposed MA.

关键词： Fibonacci number genetic algorithm greedy heuristic algorithm linear programming technique local search methods memetic algorithm network supply chain

来源：评论

学校读者我要写书评

暂无评论

A Node Aggregation Approach for WDM Ring Networks

A Node Aggregation Approach for WDM Ring Networks

引用

IEEE Region 10 Conference on TENCON 2010

作者： Funabiki, Nobuo Nakanishi, Toru Isogai, Megumi Okayama Univ Dept Commun Network Engn Okayama 7008530 Japan

ISBN: (纸本)9781424468904

For a high-speed metropolitan area network (MAN), a ring network based on the wavelength-division multiplexing (WDM) technology has been deployed to solve global information explosions in the Internet. To enhance the network performance, we have studied the node configuration problem, particularly for the one with the double-ring architecture where each node is equipped with fast-tunable transmitters and wavelength-fixed receivers (TT-FR) as fiber interfaces. In our studies, by adopting additional transmitters/receivers, nodes can afford far larger traffics than conventional ones. This fact indicates that plural nodes should be aggregated into one so that the transmitters/receivers can be utilized more efficiently. This paper presents a definition of the node aggregation problem for the WDM ring network and its simple greedy heuristic algorithm. The simulation results using the network simulator show the effectiveness of our approach.

关键词： Internet MAN WDM ring networks double-ring architecture fast-tunable transmitters fiber interfaces greedy heuristic algorithm high-speed metropolitan area network network simulator node aggregation approach node configuration problem optical fibre network

来源：评论

学校读者我要写书评

暂无评论

Researches on Optimal Scheduling Model for Aircraft Landing Problem

Researches on Optimal Scheduling Model for Aircraft Landing ...

引用

WASE International Conference on Information Engineering (ICIE 2009)

作者： Chen Shuang Xia Xuezhi Wuhan Digital Engn Inst Wuhan Peoples R China

ISBN: (纸本)9780769536798

In order to solve the aircraft landing optimal scheduling problem, a scheduling model based on single machine scheduling is proposed. Considering the influence on scheduling, multifactor decision-making is used to solve weight of the scheduling model. In order to work out the model, a scheduling algorithm based on greedy heuristic algorithm is proposed. Lastly, the algorithm is tested on some simulation cases. The results show that the algorithm has preferable scheduling performance and can solve the aircraft landing problem.

关键词： scheduling model single machine scheduling multifactor decision-making First-Coine First-Served (FCFS) greedy heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

On Wireless Video Sensor Network Deployment for 3D Indoor Space Coverage

On Wireless Video Sensor Network Deployment for 3D Indoor Sp...

引用

SoutheastCon

作者： Brown, Tisha Wang, Zhonghui Shan, Tong Wang, Feng Xue, Jianxia Univ Mississippi Dept Comp Sci Sch Engn University MS 38677 USA Google Inc Mountain View CA 94035 USA

ISBN: (纸本)9781509022465

Nowadays, wireless video sensor networks (WVSNs) play a prominent role in a wide range of security, industrial, medical and environmental applications. Unlike traditional sensors such as heat or light sensors often considered with omnidirectional sensing range, the sensing range of a video sensor can be deemed as a fan-shape in 2D and pyramid-shape in 3D, rendering the deployment solutions for traditional sensors and 2D sensing fields inapplicable and incapable of solving the WVSN deployment problem for 3D indoor space coverage. In this paper, we take the first attempt to address this by modeling the general problem in a continuous space and strive to minimize the number of required video sensors to cover the given 3D regions. We then convert it into a discrete version by incorporating 3D grids for our discrete model, which can achieve arbitrary approximation precision by adjusting the grid granularity. We propose a greedy heuristic and an enhanced Depth First Search (DFS) algorithm to solve the discrete version problem where the latter, if given enough time can return the optimal solution. We evaluate our solutions with a customized simulator that can emulate the actual WVSN deployment and 3D indoor space coverage. Our preliminary results demonstrate that our greedy heuristic can reduce the required video sensors by up to 50% over a baseline algorithm, and our enhanced DFS can achieve an additional reduction of video sensors by up to 20%.

关键词： Wireless video sensor network 3D indoor space coverage depth first search greedy heuristic algorithm sensor deployment

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace

引用

OPSEARCH 2020年第2期57卷 462-512页

作者： Rani, M. Vimala Mathirajan, M. Indian Inst Technol Kharagpur Vinod Gupta Sch Management Kharagpur W Bengal India Indian Inst Sci Dept Management Studies Bangalore Karnataka India

There has been extensive scheduling research relating to use of existing dispatching rules along with/without new dispatching rules and compared their performance behavior in job-shop, flow-shop, open-shop, flexible manufacturing system, and single machine with unit capacity environments using various scheduling objectives. However, it appears that there is no comparative study on analysis of dispatching rules for scheduling bottleneck batch processing machine in discrete parts manufacturing, particularly the diffusion furnace (DF) in semiconductor manufacturing (SM). This study addresses this research issue. For that, this study first, proposes the mathematical models for dynamic scheduling (DS) of DF to optimize the due-date based scheduling objectives: Total weighted tardiness, on-time delivery rate, total earliness/lateness, and maximum lateness. Due to the computational intractability of each the proposed mathematical models for large-scale problem, this study proposes greedy heuristic algorithm (GHA) based on due-date based dispatching rules (DDR). Because, dispatching rules are widely used in the SM industry. Accordingly, in this study twenty variants of GHA-DDR are proposed by considering various due-date based dispatching rules to compare the effects of due-date based dispatching rules in DS of DF. From the series of computational analysis carried out in this study, it is observed empirically that the proposed variants of GHA based on apparent tardiness cost (ATC) and batch ATC (BATC) dispatching rules yield consistently better solution for most of the scheduling objectives considered in this study. This observation is further verified by statistical analysis: Friedman test and Nemenyi multiple comparison test.

关键词： Batch processing machine greedy heuristic algorithm Dynamic scheduling Due-date based dispatching rule Due-date based scheduling objectives

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：