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

A maximal covering facility location model for emergency services within an M (t)/M/m/m queuing system

JOURNAL OF MODELLING IN MANAGEMENT 2021年第3期16卷 963-986页

作者： Bahrami, Iman Ahari, Roya M. Asadpour, Milad Islamic Azad Univ Najafabad Branch Dept Ind Engn Najafabad Iran Univ Auckland Business Sch Dept Informat Syst & Operat Management Auckland New Zealand Islamic Azad Univ Najafabad Branch Young Researchers & Elite Club Najafabad Iran

Purpose In emergency services, maximizing population coverage with the lowest cost at the peak of the demand is important. In addition, due to the nature of services in emergency centers, including hospitals, the number of servers and beds is actually considered as the capacity of the system. Hence, the purpose of this paper is to propose a multi-objective maximal covering facility location model for emergency service centers within an M ((t))/M/m/m queuing system considering different levels of service and periodic demand rate. Design/methodology/approach The process of serving patients is modeled according to queuing theory and mathematical programming. To cope with multi-objectiveness of the proposed model, an augmented epsilon-constraint method has been used within GAMS software. Since the computational time ascends exponentially as the problem size increases, the GAMS software is not able to solve large-scale problems. Thus, a NSGA-II algorithm has been proposed to solve this category of problems and results have been compared with GAMS through random generated sample problems. In addition, the applicability of the proposed model in real situations has been examined within a case study in Iran. Findings Results obtained from the random generated sample problems illustrated while both the GAMS software and NSGA-II almost share the same quality of solution, the CPU execution time of the proposed NSGA-II algorithm is lower than GAMS significantly. Furthermore, the results of solving the model for case study approve that the model is able to determine the location of the required facilities and allocate demand areas to them appropriately. Originality/value In the most of previous works on emergency services, maximal coverage with the minimum cost were the main objectives. Hereby, it seems that minimizing the number of waiting patients for receiving services have been neglected. To the best of the authors' knowledge, it is the first time that a maximal covering prob

关键词： Optimization Allocation mathematical programming Queuing theory

来源：评论

学校读者我要写书评

暂无评论

A Genetic Algorithm for Scheduling Splittable Tasks with Precedence Constraints

A Genetic Algorithm for Scheduling Splittable Tasks with Pre...

引用

IEEE Congress on Evolutionary Computation (IEEE CEC)

作者： Gao, Yuanliang Poon, Sheung-Hung Univ Nottingham Sch Comp Sci Ningbo Peoples R China

ISBN: (纸本)9781728183923

In many applications, the logic of the program can be described using a task graph, where the data dependencies and execution time of each task are described. These dependencies create precedence constraints among tasks, which are requirements that some tasks must be finished before some other tasks. Many efforts have been put into scheduling parallelizable tasks that synchronically use multiple cores. In some cases, the task can be chunked into smaller pieces and scheduled independently, allowing further flexible schedules. However, it is usually either assumed that such splitting has no overhead, or that precedence constraints are not present, or that the user has to provide the way of splitting. This paper addresses the problem where these factors are considered together, that is scheduling splittable tasks with precedence constraints, where splitting introduces an overhead and the splitting of tasks are determined by the algorithm. The objective is to minimize the makespan of the schedule. We first present a mixed-integer quadratic program (MIQP) formulation of the problem. Then, a genetic algorithm (GA) is devised and its performance is compared with the MIQP solutions. We show that the genetic algorithm can produce reasonably good schedules compared with MIQP output within a significantly shorter time, and it has the potential to handle large task graphs.

关键词： Processor scheduling scheduling algorithms genetic algorithms optimization mathematical programming quadratic programming

来源：评论

学校读者我要写书评

暂无评论

A bibliometric analysis of computational and mathematical techniques in the cocoa sustainable food value chain

引用

Heliyon 2025年第6期11卷

作者： Talero-Sarmiento, Leonardo H. Parra-Sanchez, Diana T. Lamos-Diaz, Henry Programa de Ingenieria Industrial Universidad Autonoma de Bucaramanga Bucaramanga Colombia Programa de Ingenieria de Sistemas Universidad Autonoma de Bucaramanga Bucaramanga Colombia Programa de Ingenieria Industrial Universidad Industrial de Santander Bucaramanga Colombia

This study thoroughly examines the evolving research landscape of computational and mathematical techniques applied to cocoa farming from 2000 to 2020. Through a structured two-stage methodology, it conducts a bibliometric analysis of 1886 peer-reviewed documents, followed by a concept-centric review of 734 investigations explicitly focusing on cocoa and its derivatives. The findings highlight significant contributions spanning diverse scientific disciplines, including Chemistry, Biology, Social Sciences, Econometrics, Health, and Computer Science. The research introduces the Cocoa Sustainable Food Value Chain framework, showcasing its relevance in advancing genetic improvement, machinery optimization, health-focused food composition studies, and strategies for enhancing crop yields. Additionally, the study uncovers a growing interest in machine learning applications to address critical challenges in cocoa farming. These include innovations in post-production processes, assessing cocoa ripeness, pod counting, crop yield estimation, optimizing bean fermentation, organoleptic profiling, and the industrialization of cocoa-related machinery. Four key research gaps emerge concerning the integration of computational and mathematical techniques that can benefit smallholder cocoa farmers: (i) optimizing cocoa aggregation and distribution management, (ii) designing user-friendly high-tech solutions, (iii) facilitating agricultural technology adoption, and (iv) assessing the impact of agricultural policies. This research makes three pivotal contributions to the academic field. First, it broadens the conceptualization of agri-food supply chains by integrating sustainability and presenting a theoretical framework tailored to the extended cocoa value chain. Second, it highlights the lack of development in ICT and IoT solutions that support computational techniques for managing cocoa production. Third, it emphasizes the importance of creating and transferring high-tech tools to s

关键词： Cocoa Literature review Machine learning mathematical programming Simulation Statistics

来源：评论

学校读者我要写书评

暂无评论

MILP model to decrease the number of workers in assembly lines with human-robot collaboration 17th

MILP model to decrease the number of workers in assembly lin...

引用

17th IFAC Symposium on Information Control Problems in Manufacturing (INCOM)

作者： Dimeny, Imre Koltai, Tamas Sepe, Chiara Murino, Teresa Gallina, Viola Komenda, Titanilla Budapest Univ Technol & Econ Fac Econ & Social Sci Dept Management & Business Econ POB 91 H-1521 Budapest Hungary Univ Naples Federico II Dept Chem Mat & Ind Engn Ple Tecchio I-80125 Naples Italy Fraunhofer Austria Res GmbH Theresianumgasse 27 A-1040 Vienna Austria

The benefits of automatization in human-operated assembly lines are well known. When complete automatization is not possible, a combined production system, with both manual and automated parts, could be the best configuration. Adding robots to an only human-operated assembly line may decrease the number of stations and consequently the number of workers in the line. Even if, the number of stations cannot be decreased, the number of workers could be reduced in case of proper reallocation of tasks. In this paper, three mixed-integer linear programming (MILP) models are suggested to minimize in three steps the number of workers, the number of robots, and the cycle time in an assembly line with a predefined number of stations and partial automatization The results for the optimization problems are shown based on the data of an assembly line producing power inverters. The proposed MILP model is implemented in the AIMMS modeling environment. Copyright (C) 2021 The Authors.

关键词： assembly line balancing operations management human-robot collaboration automation mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Risk-constrained expansion planning of wind integrated networks using innovative MPEC primal-dual formulation for directly involving price-based demand response in MILP problem

引用

JOURNAL OF ENGINEERING-JOE 2023年第10期2023卷

作者： Baharvandi, Saman Maghouli, Pouria Shahed Univ Elect Engn Dept Tehran Iran

Price-based demand response (PBDR) programs can push consumers to reconsider their electricity demand regarding the electricity price in the market. The load profile of the whole network can be reshaped in response, which can directly affect the network investment decisions. The decision-maker had to consider this effect in order to reach an optimal plan for the network. Here, a mixed-integer linear programming (MILP) model considering a price-based demand response (PBDR) program is developed for transmission expansion planning (TEP) of wind-integrated networks and the problem is constrained by the conditional value at risk (CVaR) measure to model the risk of planning and investments for both sides. The proposed model is an originally bi-level problem with different objective functions in both layers. These objectives are as follows, minimizing the total cost of TEP, consumer payments, and wind curtailment in the first layer, and minimizing the network operational costs in the second layer. Then, using an innovative formulation to overcome the non-linearities, and using KKT conditions of the second layer problem, the problem recast into a single-layer mixed integer non-linear program (MINLP) problem which is called a mathematical program with equilibrium constraints (MPEC) with primal-dual formulation. The proposed model had been applied to IEEE standard 24-bus RTS and IEEE standard 118-bus test systems to show its efficiency. This paper developed a MILP model for the TEP problem considering PBDR programs, which aim to satisfy all stakeholders in a deregulated market. A bi-level formulation was proposed with multiple objective functions in its levels and then formed into a MILP model. image

关键词： demand side management mathematical programming power system planning wind power

来源：评论

学校读者我要写书评

暂无评论

Dynamic Multiple Depots Vehicle Routing in the Physical Internet context 17th

Dynamic Multiple Depots Vehicle Routing in the Physical Inte...

引用

17th IFAC Symposium on Information Control Problems in Manufacturing (INCOM)

作者： Kantasa-ard, Anirut Chargui, Tarik Bekrar, Abdelghani El Cadi, Abdessamad Ait Sallez, Yves Polytech Univ Hauts de France UPHF UMR CNRS 8201 LAMIH F-59313 Valenciennes France

This paper proposes Dynamic Multiple Depots Vehicle Routing (DMDVR) to explore the feasible solution of routing transportation between PI -hubs and retailers in the same cluster. The routing solution in this research is constructed by the daily forecasting demand of a commodity crop, Pineapple, from Thailand's northern region. Each route is composed of a starting hub, the number of retailers, and an ending hub. The authors propose Mixed Integer Linear programming (MILP) to construct the routes considering inventory and truck capacity constraints. Besides, another solution method is proposed by using a heuristic method named "Iterated Random Heuristic". The empirical results are evaluated by using the total distribution cost and computational time. The routing transportation of this research is based on the daily delivery transportation from PI -hubs to retailers. The results show that Iterated Random Heuristic with Nearest Neighbor Search generates near-optimal solutions within a short computational time. Copyright (C) 2021 The Authors.

关键词： Physical Internet Multiple depots Forecasting demand Distribution Heuristic mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Criteria weight determination within Interval Rough CODAS approach for Water Resources management

Criteria weight determination within Interval Rough CODAS ap...

引用

International Conference on Decision Aid Sciences and Application (DASA)

作者： Cherif, Mouna Regaieg Frikha, Hela Moalla Univ Sfax Fac Econ Sci & Management Sfax Res Lab Modeling & Optimizat Decis Ind & Logist S Sfax Tunisia Univ Sfax Higher Inst Ind Management Sfax Res Lab Optimisat Logist & Informat Decis OLID Sfax Tunisia

ISBN: (纸本)9781665416344

Water Resources Management is a major problem nowadays, especially in Tunisia. Since criteria weights play a very significant role in the ranking Multicriteria Decision Making (MCDM) methods, the current work is applied to find criteria weight through Interval Rough CODAS method (IRCODAS) which should rank the alternatives using two measures: the Euclidean and the Taxicab distance, to overcome the subjectivity of the group decision-makers. For that, we aim to develop a mathematical programming model eliciting objective weight parameters of the IR-CODAS method given consideration to the MCDM problems with lack of criteria's relative importance coefficients (weights) under interval rough sets. Thereupon, the applicability of the proposed model is illustrated in a case study to evaluate and select the best water resources management projects in Sfax (Tunisia).

关键词： Water Resources Management criteria weight elicitation mathematical programming Interval Rough CODAS

来源：评论

学校读者我要写书评

暂无评论

ON THE PROBLEM OF ENTITY MATCHING AND ITS APPLICATION IN AUTOMATED SETTLEMENT OF RECEIVABLES 35

ON THE PROBLEM OF ENTITY MATCHING AND ITS APPLICATION IN AUT...

引用

35th Annual European Simulation and Modelling Conference (ESM)

作者： Czekaj, Lukasz Biegus, Tomasz Kitlowski, Robert Raczynski, Stanislaw Olszewski, Mateusz Dziedzic, Jakub Tomasik, Pawel Kozera, Ryszard Prokopenya, Alexander Olszewski, Robert Szybkie Skladki Sp Zoo Innowacyjna 1 Suwalki Poland PICTEC Al Zwyciestwa 96-98Bud 4Lok B3-06 PL-81451 Gdynia Poland Warsaw Univ Life Sci SGGW Nowoursynowska Str 166 PL-02787 Warsaw Poland Warsaw Univ Technol Pl Politech 1 PL-00661 Warsaw Poland

ISBN: (纸本)9789492859181

This paper covers automated settlement of receivables in non-governmental organizations. We tackle the problem with entity matching techniques. We consider setup, where base algorithm is used for preliminary ranking of matches, then we apply several novel methods to increase matching quality of base algorithm: score post processing, cascade model and chain model. The methods presented here contribute to automated settlement of receivables, entity matching and multilabel classification in open-world scenario. We evaluate our approach on real world operational data which come from company providing settlement of receivables as a service: proposed methods boost recall from 78% (base model) to > 90% at precision 99%.

关键词： Marketing decision support systems statistical analysis optimization mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Simulation and mathematical programming decision-making support for smallholder farming

引用

Environment Systems and Decisions 2013年第3期33卷 427-439页

作者： Collins, Andrew J. Vegesana, Kasi Bharath Seiler, Michael J. Hettiarachchi, Prasanna McKenzie, Frederic Old Dominion University Norfolk VA 23529 United States The College of William and Mary Williamsburg VA 23187 United States Appalachian State University Boone NC 28608 United States Saaraketha Colombo Sri Lanka

Many mathematical programs have been developed over the past 50 years to aid agricultural experts and other farming decision-makers. The application of these mathematical programs has seen limited success because their development has focused on mathematical theory as opposed to the requirements needed for application. This paper describes the development of two mathematical programs that were designed to integrate with a visualization simulation that aids a nontraditional group of agricultural decision-makers: illiterate Sri Lankan subsistence farmers. The simulation was designed to help these illiterate farmers make business decisions about their crop selection choices which, in turn, will help them develop their business plans required for obtaining bank micro-loans. This paper's focus is on the use of linear programming as a potential tool to demonstrate the benefits of crop diversification and rotation to the farmer based on various available crop types. It also highlights the issues using such an approach. © 2013 Springer Science+Business Media New York.

关键词： Agriculture Farming mathematical programming Modeling and simulation Visualization

来源：评论

学校读者我要写书评

暂无评论

Hybrid Meta-heuristics for the Traveling Car Renter Salesman Problem 15th

Hybrid Meta-heuristics for the Traveling Car Renter Salesman...

引用

15th International Conference on Learning and Intelligent Optimization (LION)

作者： Ojeda Rios, Brenner Humberto Cupe Casquina, Junior Nasco, Hossmell Hernan Velasco A. Paz-Valderrama, Alfredo Univ Nacl San Agustin Arequipa Escuela Profes Ingn Sistemas Arequipa Peru

ISBN: (纸本)9783030921217;9783030921200

The Traveling Car Renter Problem (CaRS) is a generalization of the classic Traveling Salesman Problem (TSP), where the tour of visits can be broken down into contiguous paths that can be traveled with different rental cars. The objective is to determine the Hamiltonian circuit that has a final minimum cost, considering the penalty paid for each vehicle change on tour. The penalty is the cost of returning the car to the city where it was rented. CaRS is classified as an NP-hard problem. The research focuses on hybrid procedures that combine meta-heuristics and methods based on Linear programming to deal with CaRS. The hybridized algorithms are scientific algorithms (ScA), variable neighborhood descent (VND), adaptive local search procedure (ALSP), and a new ALSP variant called iterative adaptive local search procedure (IALSP). The following techniques are proposed to deal with the CaRS: ScA+ALSP, ScA+IALSP, and ScA+VND+IALSP. A mixed integer programming model is proposed for the CaRS, which is used in ALSP and IALSP. Nonparametric tests are used to compare the algorithms in a set of instances in the literature.

关键词： Traveling car renter problem mathematical programming Metaheuristics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：