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

Optimal design of vaccination policies: A case study for Newfoundland and Labrador

OPERATIONS RESEARCH LETTERS 2024年 55卷

作者： Khoshbakhtian, Faraz Validi, Hamidreza Ventresca, Mario Aleman, Dionne Univ Toronto Dept Mech & Ind Engn Toronto ON Canada Texas Tech Univ Dept Ind Mfg & Syst Engn Lubbock TX 79409 USA Purdue Univ Sch Ind Engn W Lafayette IN USA Univ Toronto Inst Pandem Toronto ON Canada

This paper proposes pandemic mitigation vaccination policies for Newfoundland and Labrador (NL) based on two compact mixed integer programming (MIP) models of the distance-based critical node detection problem (DCNDP). Our main focus is on two variants of the DCNDP that seek to minimize the number of connections with lengths of at most one (1-DCNDP) and two (2-DCNDP). A polyhedral study for the 1-DCNDP is conducted, and new aggregated inequalities are provided for the 2-DCNDP. The computational experiments show that the 2-DCNDP with aggregated inequalities outperforms the one with disaggregated inequalities for graphs with a density of at least 0.5%. We also study the strategic vaccine allocation problem as a real-world application of the DCNDP and conduct a set of computational experiments on a simulated contact network of NL. Our computational results demonstrate that the DCNDP-based strategies can have a better performance in comparison with the real-world strategies implemented during COVID-19. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： The distance-based critical node detection problem Vaccination policies mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

On Integrating Theories of International Economics in the Strategic Planning of Global Supply Chains and Dynamic Supply Chain Reconfiguration with Capacity Expansion and Contraction

On Integrating Theories of International Economics in the St...

引用

作者： Lee, Chaehwa Texas A&M University

This dissertation discusses two independent topics. The first part of the dissertation relates three theories of international economics (comparative advantage, competitive advantage, and competitiveness), and formulates the thesis that incorporating them in the form of readily available individual competitiveness indicators in OR/MS models offers promise to enhance decision-support for the strategic planning of global supply chains in general, and for locating facilities in particular. The objectives of this research were to relate each of these theories and to describe their interrelationships; to describe measures provided by two well-known annual competitiveness reports; and to illustrate application of the theories as a means of supporting the thesis of the research, and justifying the research questions we pose for future research. While this research discusses topics relative to the broader background of global supply chain design, it illustrates applications associated with facility location, a component of the global supply chain design. In the last chapter of the first part of the dissertation, we provide a vision to foster future research that will enhance the profitability of international enterprises under NAFTA. The second part of the dissertation deals with the DSCR model with capacity expansion and contraction. The strategic dynamic supply chain reconfiguration (DSCR) problem is to prescribe the location and capacity of each facility, select links used for transportation, and plan material flows through the supply chain, including production, inventory, backorder, and outsourcing levels. The objective is to minimize total cost. The configuration must be dynamically redesigned over time to accommodate changing trends in demand and/or costs by opening facilities, expanding and/or contracting their capacities, and closing facilities. The problem involves a multi-period, multi-product, multi-echelon supply chain. Research objectives are alternative

关键词： international economics North American Free Trade Agreement global supply chains dynamic supply chain reconfiguration mixed integer programming Branch and Price Thesis

来源：评论

学校读者我要写书评

暂无评论

Problemas de programação de produção em indústrias de embalagens de papelão ondulado.

Problemas de programação de produção em indústrias de e...

引用

作者： Ferreira, Marcelo Universidade Estadual Paulista

Nessa tese abordamos dois problemas reais identiﬁcados no processo produtivo de indústrias de embalagens de papelão ondulado, que denotaremos por Problema de Minimização de Trocas de Gramaturas e Rolos Corrugadores (PMTGRC) e Problema da Alocação de Bobinas no Corrugador (PABC). Ambos os problemas ocorrem no corrugador, máquina multiestágio que produz as chapas de papelão ondulado. O PMTGRC surge da necessidade de minimizar trocas de gramaturas e rolos corrugadores durante o processo de produção dos boletins, uma vez que cada boletim traz as gramaturas especíﬁcas das camadas da chapa, além do tipo de onda empregada no(s) miolos(s). O sequenciamento dos boletins impacta na quantidade de mudanças de gramaturas nos porta-bobinas e se haverátrocaderoloscorrugadoresparadoisboletinssubsequentes. Astrocasdegramaturas impactam em custos de transporte de bobinas e as trocas de rolos corrugadores impactam em perda de produtividade. Para o PMTGRC propomos quatro modelos inéditos de programação inteira capazes de integrar essas duas considerações. O PABC integra várias considerações relacionadas à alocação das bobinas no corrugador, como por exemplo, a minimização das sobras não aproveitáveis e das quantidades de consumos parciais, fatores que inﬂuenciam diretamente nos custos de produção. Um modelo linear inteiro misto inédito é proposto, determinando quais bobinas serão utilizadas em cada porta-bobinas. Além disso, propomos uma estratégia de sequenciamento das bobinas em cada porta-bobina, evitando paragens no corrugador. Uma série de testes computacionais utilizando instâncias geradas com base em dados reais foram realizados. Os resultados indicam que os modelos foram eﬁcientes em tratar os problemas *** this thesis we approached two real problems identiﬁed over the productive process of corrugated cardboard industries, which we will denote as the Minimization of Converting Weights and Corrugators Problem (MCWCP) and the Corrugators Coil Allocation Problem (CCAP). B

关键词： Programação inteira mista Modelagem matemática Indústria de embalagens de papelão Corrugador mixed integer programming Mathematical modeling Corrugated cardboard industries Corrugator Tese de doutorado

来源：评论

学校读者我要写书评

暂无评论

Planning Ground Water Supply Systems for Urban Growth: A Multilevel Perspective

引用

IFAC Proceedings Volumes 1980年第3期13卷 295-305页

作者： J.W. Delleur S.A. Dendrou G.V. Loganathan School of Civil Engineering Purdue University West Lafayette Indiana 47907 USA Water Resources Engineers CDM Springfield Virginia 22151 USA

A methodology has been developed to include effectively water supply from groundwater in urban planning. The model LANDUSE for prediction of urban development and water demand is linked to the model WATSUP, an optimization oriented finite element based water supply model for prediction and optimization of future water supply configurations. The nonlinearity of the objective function due to nonlinear head losses has been circumvented by means of empirical relationships for head losses and design criteria for pump and pipe sizes. The requirement that some decision variables such as the number of wells, equalizing reservoirs, etc. be integer variables leads to a mixed integer programming formulation. A two level coordination scheme is used in locating an optimal number of facilities such that cost is minimized and a safe exploitation of aquifer in the future is guaranteed. The methodology is applied to an actual situation in West Lafayette, Indiana.

关键词： Finite elements large scale systems mixed integer programming optimization urban systems water resources

来源：评论

学校读者我要写书评

暂无评论

CProS: A web-based application for chemical production scheduling

引用

COMPUTERS & CHEMICAL ENGINEERING 2022年 164卷

作者： Misra, Shamik Buttazoni, Lucas Ryan Avadiappan, Venkatachalam Lee, Ho Jae Yang, Martin Maravelias, Christos T. Indian Inst Technol Tirupati Dept Chem Engn Tirupati Andhra Pradesh India Univ Wisconsin Dept Chem & Biol Engn Madison WI USA Hongik Univ Dept Chem Engn Seoul South Korea Princeton Univ Dept Chem & Biol Engn Princeton NJ 08544 USA Princeton Univ Andlinger Ctr Energy & Environm Princeton NJ 08544 USA

While a large range of models and methods have been proposed in the literature for chemical production scheduling, very limited tools are available for researchers to test these methods. This communication describes a web-based application (CProS) that was recently developed to facilitate the generation and solution of chemical production scheduling instances. The application offers an interface through which a user can define an instance using the state-task network (STN) representation. Given an instance, the application then automatically generates a discrete-time STN-based mixed-integer linear programming (MIP) model. In addition, the user has the option to use three different solution methods: (1) tightening constraints;(2) a reformulation;and (3) a three-stage discrete-continuous algorithm. We showcase the functionality of the application through a case study. (c) 2022 Elsevier Ltd. All rights reserved.

关键词： Batch scheduling mixed integer programming Solution methods

来源：评论

学校读者我要写书评

暂无评论

Exploiting Erraticism in Search

引用

OPERATIONS RESEARCH 2014年第1期62卷 114-122页

作者： Fischetti, Matteo Monaci, Michele Univ Padua Dept Informat Engn I-35131 Padua Italy

High sensitivity to initial conditions is generally viewed as a drawback of tree search methods because it leads to erratic behavior to be mitigated somehow. In this paper we investigate the opposite viewpoint and consider this behavior as an opportunity to exploit. Our working hypothesis is that erraticism is in fact just a consequence of the exponential nature of tree search that acts as a chaotic amplifier, so it is largely unavoidable. We propose a bet-and-run approach to actually turn erraticism to one's advantage. The idea is to make a number of short sample runs with randomized initial conditions, to bet on the "most promising" run selected according to certain simple criteria, and to bring it to completion. Computational results on a large testbed of mixed integer linear programs from the literature are presented, showing the potential of this approach even when embedded in a proof-of-concept implementation.

关键词： enumerative algorithms mixed integer programming restart

来源：评论

学校读者我要写书评

暂无评论

Using hybrid algorithm to reduce non-working distance in intra- and inter-field logistics simultaneously for heterogeneous harvesters

引用

COMPUTERS AND ELECTRONICS IN AGRICULTURE 2019年 167卷 105065-000页

作者： He, Pengfei Li, Jing Qin, Hailong He, Yanping Cao, Guangqiao Nanjing Agr Univ Fac Engn Nanjing 210031 Jiangsu Peoples R China Sino German Plant Prod & Agrotechnol Pk Xiangshui 224600 Peoples R China Jiangsu Prov Agr Reclamat & Dev Corp Huanghai Branch Xiangshui 224600 Peoples R China Minist Agr Nanjing Res Inst Agr Mechanizat Nanjing 210014 Jiangsu Peoples R China

Reducing the non-working distance for agricultural vehicles is beneficial for reducing the total operational costs for farmers. In this study, we optimize the non-working distance in intra- and inter-fields simultaneously for harvesters while harvesting rice. A mixed integer programming is presented for optimizing the rice harvesting problem, where a similar working time for all harvesters are considered based on a real case. Besides, in this model, two kinds of fields, namely moist and non-moist fields are considered, where the first can only be harvested by crawler harvesters while the second can be harvested by any type of harvester. This model aims to find an optimal schedule for the harvesters. A hybrid algorithm using both adaptive large neighborhood search and tabu search techniques is implemented to optimize the problem. A case study is considered to verify the performance of the hybrid algorithm. The results indicate that the hybrid algorithm is an effective method for solving the rice harvesting problem because the total non-working distance could be improved significantly by 15.3%. The proportion of moist fields is analyzed because it influences the schedule significantly. When compared to the traditional method for optimizing the non-working distance for harvesters, the total non-working distance in this method could be reduced by 6.2%. This paper provides farmers with a general framework for reducing the non-working distance in intra- and inter-field logistics, which results in a more efficient performance of the harvesters in the fields.

关键词： Rice mixed integer programming Adaptive large neighborhood search Moist

来源：评论

学校读者我要写书评

暂无评论

Modeling Geographical Anycasting Routing in Vehicular Networks

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2020年第4期14卷 1624-1647页

作者： Amirshahi, Alireza Romoozi, Morteza Raayatpanah, Mohammad Ali Asghari, Seyyed Amir Islamic Azad Univ Dept Comp Engn Qom Branch Qom Iran Islamic Azad Univ Dept Comp Engn Kashan Branch Kashan Iran Kharazmi Univ Fac Math Sci & Comp Tehran Iran Kharazmi Univ Tehran Comp & Elect Engn Dept Tehran Iran

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications;they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

关键词： Anycast routing Vehicular networks Time-expanded networks Branch and Bound algorithm mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem

引用

COMPUTERS & OPERATIONS RESEARCH 2023年第1期153卷

作者： Zheng, Shuang He, Zhengwen Yang, Zhen Chu, Chengbin Wang, Nengmin Xi An Jiao Tong Univ Sch Management 28 Xianning West Rd Xian 710049 Shaanxi Peoples R China Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn 28 Xianning West Rd Xian 710049 Shaanxi Peoples R China Univ Paris Est ESIEE Paris F-93162 Noisy Le Grand France

Flow shop scheduling is important in modern industrial manufacturing to improve production efficiency. This paper studies a realistic two-stage reentrant flexible flow shop scheduling problem (TSRFFS) with broad applications in aircraft scheduling, manufacturing, and the medical industry, etc. Given a flow shop with a single machine in Stage 1, a set of parallel machines in Stage 2, and a set of jobs to be processed, the TSRFFS aims to determine the completion time of jobs in Stage 1 and then that in Stage 2, and finally returns to Stage 1, as well as determine the job-to-machine assignment in Stage 2 such that all jobs are served and the total processing time of jobs (makespan) is minimized. The optimal solution properties are investigated, based on which a mixed integer programming mathematical model and a greedy random constructive heuristic for near optimal solutions are proposed. By solving series of a revised parallel machine scheduling problem (Pm||Cmax), a lower bound method is developed. Extensive numerical experiments on 1560 random instances with up to 1000 jobs and 50 realistic airport simulation instances were conducted to demonstrate the effectiveness of the proposed algorithms. The average gap between the proposed upper bound and the best lower bounds is approximately 1.78%, and the average gap between the proposed lower bound and the best upper bounds is 0.91%, which far outperforms state-of-the-art approaches in terms of solution quality and computational time.

关键词： Scheduling Reentrant flow shop mixed integer programming Heuristic

来源：评论

学校读者我要写书评

暂无评论

COMPLETE AND APPROXIMATE METHODS FOR OFF-LINE PLACEMENT OF HARDWARE TASKS ON RECONFIGURABLE DEVICES

引用

JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS 2013年第2期22卷 1-1页

作者： Belaid, Ikbel Ouni, Bassem Muller, Fabrice Benjemaa, Maher Univ Nice Sophia Antipolis Elect Antennas & Telecommun Lab F-06560 Valbonne France Natl Sch Engn Sfax Res Unit ReDCAD Sfax Tunisia

With the advent of run-time partial reconfiguration, the most recent reconfigurable devices support reconfiguring hardware tasks individually, without interrupting the remaining tasks running on the same device. While the concept of run-time partial reconfiguration increases performance and resource utilization, it also leads to resource wastage, high configuration overhead and complex allocation situations of hardware tasks on reconfigurable devices. Many on-line and off-line methods for hardware task placement have been proposed for such reconfigurable devices to enhance placement quality expressed by fragmentation rate, the amount of task rejection and a few of them also estimate configuration overhead. However, these works treat each criterion individually and therefore do not reflect the overall metrics of placement quality. Hardware task placement is a multi-objective combinatory optimization problem. In this paper, we investigate the problem of off-line placement of hardware tasks in partially reconfigurable devices and we present a new three-level resource management that is based on two methods, i.e., a complete analytic method: the formulation into mixed integer programming, and an approximate iterative method: the Bees algorithm. For both methods, the placement quality is measured by the rate of resource efficiency and by the amount of configuration overhead. Experiments demonstrate that the analytic method provides better resource efficiency than the Bees Algorithm by 33% and attains 15% of gain in configuration overhead.

关键词： Hardware task placement heterogeneous FPGA mixed integer programming Bees algorithm partial run-time reconfiguration resource efficiency configuration overhead

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：