首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11篇
  免费   0篇
化学   1篇
数学   10篇
  2022年   2篇
  2018年   1篇
  2016年   2篇
  2011年   1篇
  2009年   1篇
  2008年   1篇
  2005年   1篇
  2003年   1篇
  2001年   1篇
排序方式: 共有11条查询结果,搜索用时 15 毫秒
1.
Central European Journal of Operations Research - Disaster management generally includes the post-disaster stage, which consists of the actions taken in response to the disaster damages. These...  相似文献   
2.
District heating plants are becoming more common in European cities. These systems make it possible to furnish users with warm water while locating the production plants in the outskirts having the double benefit of lowering the impact of pollution on the center of the city and achieving better conversion performances. In order to amortize the costs throughout the year, the system often includes a combined heat and power (CHP) plant, to exploit the energy during the summer as well, when the demand for warm water decreases. A linear programming model for the optimal resource management of such a plant is presented and some results for a real case are reported. A distribution network design problem is also addressed and solved by means of mixed integer linear programming.  相似文献   
3.
The 2-constraint bin packing problem consists in packing a given number of items, each one characterised by two different but not related dimensions, into the minimum number of bins in such a way to do not exceed the capacity of the bins in either dimension. The development of the heuristics for this problem is challenged by the need of a proper definition of the criterion for evaluating the feasibility of the two capacity constraints on the two different dimensions. In this paper, we propose a computational evaluation of several criteria, and two simple but effective algorithms—a greedy and neighbourhood search algorithms—for solving the 2-constraint bin packing problem. An extensive computational analysis supports our main claim.  相似文献   
4.
5.
Central European Journal of Operations Research - This articles provides a short summary of the research topics and latest research results of the European Working Group “Operations Research...  相似文献   
6.
This paper considers two problems that arise in the design of optical telecommunication networks when a ring-based topology is adopted, namely the SONET Ring Assignment Problem and the Intraring Synchronous Optical Network Design Problem. We show that these two network topology problems correspond to graph partitioning problems with capacity constraints: the first is a vertex partitioning problem, while the latter is an edge partitioning problem. We consider solution methods for both problems, based on metaheuristic algorithms. We first describe variable objective functions that depend on the transition from one solution to a neighboring one, then we apply several diversification and intensification techniques including Path Relinking, eXploring Tabu Search and Scatter Search. Finally we propose a diversification method based on the use of multiple neighborhoods. A set of extensive computational results is used to compare the behaviour of the proposed methods and objective functions.  相似文献   
7.
8.
The Maximum Diversity Problem (MDP) requires to extract a subset M of given cardinality from a set N, maximising the sum of the pair-wise diversities between the extracted elements. The MDP has recently been the subject of much research, and several sophisticated heuristics have been proposed to solve it. The present work compares four local search metaheuristics for the MDP, all based on the same Tabu Search procedure, with the aim to identify what additional elements provide the strongest improvement. The four metaheuristics are an Exploring Tabu Search, a Scatter Search, a Variable Neighbourhood Search and a simple Random Restart algorithm. All of them prove competitive with the best algorithms proposed in the literature. Quite surprisingly, the best ones are the simple Random Restart algorithm and a Variable Neighbourhood Search algorithm with an unusual parameter setting, which makes it quite close to random restart. Although this is probably related to the elementary structure of the MDP, it also suggests that, more often than expected, simpler algorithms might be better.  相似文献   
9.
An algorithm with a complexity linear in the number of vertices is proposed for the computation of the Hyper-Wiener index of chemical trees. This complexity is the best possible. Computational experience for alkanes is reported.  相似文献   
10.
An Emergency Medical Service (EMS) plays a fundamental role in providing good quality health care services to citizens, as it provides the first answer in distressing situations. Early response, one of the key factors in a successful treatment of an injury, is strongly influenced by the performance of ambulances, which are sent to rescue the patient. Here we report the research carried on by the authors on the ambulance location and management in the Milano area (Italy), as a part of a wider research project in collaboration with the EMS of Milano and funded by Regione Lombardia. The question posed by the EMS managers was clear and, at the same time, tricky: could decision making tools be applied, based on the currently available data, to provide suggestions for decision makers? To answer such a question, three different studies have been carried on: first the evaluation of the current EMS system performance through statistical analysis; then the study of operational policies which can improve the system performance through a simulation model; and finally the definition of an alternative set of posts through an optimization model. This paper describes the methodologies underlying such studies and reports on how their main findings were crucial to help the EMS in changing its organization model.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号