发布求助
文献互助 智能选刊 最新文献

International Conference on Operations Research and Enterprise Systems最新文献

筛选
英文 中文
Numerical Experiments with a Primal-Dual Algorithm for Solving Quadratic Problems 求解二次问题的原对偶算法的数值实验
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-30 DOI: 10.5220/0005813802040209
Derkaoui Orkia, A. Lehireche
{"title":"Numerical Experiments with a Primal-Dual Algorithm for Solving Quadratic Problems","authors":"Derkaoui Orkia, A. Lehireche","doi":"10.5220/0005813802040209","DOIUrl":"https://doi.org/10.5220/0005813802040209","url":null,"abstract":"This paper provides a new variant of primal-dual interior-point method for solving a SemiDefinite Program (SDP). We use the PDIPA (primal-dual interior-point algorithm) solver entitled SDPA (SemiDefinite Programming Algorithm). This last uses a classical Newton descent method to compute the predictorcorrector search direction. The difficulty is in the computation of this line-search, it induces high computational costs. Here, instead we adopt a new procedure to implement another way to determine the step-size along the direction which is more efficient than classical line searches. This procedure consists in the computation of the step size in order to give a significant decrease along the descent line direction with a minimum cost. With this procedure we obtain à new variant of SDPA. The comparison of the results obtained with the classic SDPA and our new variant is promising.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Risk Driven Analysis of Maintenance for a Large-scale Drainage System 大型排水系统维护的风险驱动分析
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-29 DOI: 10.5220/0005749102960303
Yujie Chen, F. Polack, P. Cowling, Philip Mourdjis, Stephen Remde
{"title":"Risk Driven Analysis of Maintenance for a Large-scale Drainage System","authors":"Yujie Chen, F. Polack, P. Cowling, Philip Mourdjis, Stephen Remde","doi":"10.5220/0005749102960303","DOIUrl":"https://doi.org/10.5220/0005749102960303","url":null,"abstract":"Gully pots or storm drains are located at the side of roads to provide drainage for surface water. We consider gully pot maintenance as a risk-driven maintenance problem. Our simulation considers the risk impact of gully pot failure and its failure behaviour. In this paper, we focus on two factors, the issue of parked cars and up-to-date gully pots status information, that may affect the scheduling of maintenance actions. The aim is to discover potential investment directions and management policies that will improve the efficiency of maintenance. We find that the “untimely system status information” is a dominant factor that weakens the current maintenance. Low-cost sensor technique could be a good development.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115598289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A New Modelling Approach Is Required to Help Mobile Network Operators Handle the Growing Demand for Data Traffic 需要一种新的建模方法来帮助移动网络运营商处理日益增长的数据流量需求
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-29 DOI: 10.5220/0005814904020407
Leonardo Lamorgese, T. Nordlander, C. Mannino
{"title":"A New Modelling Approach Is Required to Help Mobile Network Operators Handle the Growing Demand for Data Traffic","authors":"Leonardo Lamorgese, T. Nordlander, C. Mannino","doi":"10.5220/0005814904020407","DOIUrl":"https://doi.org/10.5220/0005814904020407","url":null,"abstract":"Last year, global mobile data traffic grew by 69%, and similar growth rates are expected in the coming years. This growth affects the quality of service, and mobile network operators are finding it increasingly difficult to manage mobile data traffic. To this end, they are drastically increasing the number of sites and antennae, as well as modernising existing networks. This requires selecting the best antenna locations in terms of service area coverage, spectrum availability, installation costs, demographics, etc. In addition, when extending the wireless network with new antennae, the radio-electrical parameter settings of new and neighbouring antennae require (re)calibration to minimise interference—a process that in principle may affect the entire network. Moreover, the antennae must connect to the core network and influence it. This complex optimisation planning problem does not lend itself well to a manual solution approach. Still, these plans are developed “manually”, with the support of IT tools, through a time-consuming and inefficient trial-and-error process. Applied optimisation is needed to tackle this problem effectively, but this requires advancing the state-of-the-art: Most papers focus on solving the different sub-problems independently. However, these affect each other heavily and they must be considered simultaneously to maximise the offered service: optimising the location and configuration of new antennae and the configuration of wireless network radio-electrical parameters, while taking into account access to the core network.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114933882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Iterated Greedy Heuristic for the 1/N Portfolio Tracking Problem 1/N投资组合跟踪问题的迭代贪婪启发式算法
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-29 DOI: 10.5220/0005827704240431
O. Strub, N. Trautmann
{"title":"An Iterated Greedy Heuristic for the 1/N Portfolio Tracking Problem","authors":"O. Strub, N. Trautmann","doi":"10.5220/0005827704240431","DOIUrl":"https://doi.org/10.5220/0005827704240431","url":null,"abstract":"The 1/N portfolio represents a simple strategy to invest money in the stock market. Investors who follow this strategy invest an equal proportion of their investment budget in each stock from a given investment universe. Empirical results indicate that this strategy leads to competitive results in terms of risk and return compared to more sophisticated strategies. However, in practice, investing in all N stocks from a given investment universe can cause substantial transaction costs if N s large or if the market is illiquid. The optimization problem considered in this paper consists of optimally replicating the returns of the 1/ N portfolio by selecting a small subset of theN stocks, and determining the respective weight for each selected stock. For the first time, we apply the concept of iterated greedy heuristics to this novel portfolio-optimization problem. For analyzing the performance of our heuristic approach, we also formulate the problem as a mixed-integer quadratic program (MIQP). Our computational results indicate that, within a limited CPU time, our heuristic approach outperforms the MIQP, in particular when the number of stocks N grows large.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129653956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Verifying Geostatistical Travel Time Properties on Routing Networks 验证路由网络的地质统计走时特性
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-27 DOI: 10.5220/0005794403960401
R. D. Landtsheer, C. Ponsard
{"title":"Verifying Geostatistical Travel Time Properties on Routing Networks","authors":"R. D. Landtsheer, C. Ponsard","doi":"10.5220/0005794403960401","DOIUrl":"https://doi.org/10.5220/0005794403960401","url":null,"abstract":"Nowadays, many systems are increasingly relying on interconnected, geolocated, and mobile devices. In order to cope with this, geographical information system (GIS) have evolved to precisely capture not only the spatial characteristics of real world transportation networks but also temporal dimension, including the variability of travel duration related to traffic jams. This paper explores the verification of a number of interesting spatiotemporal properties identified from a set of real world cases and expressed on enriched GIS data structures. It details our progress on developing efficient algorithmic modules to verifying such properties. We have applied our algorithms on the medical emergency infrastructures deployed in Belgium.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132098195","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
On Duality with Support Functions for a Multiobjective Fractional Programming Problem 多目标分式规划问题的支持函数对偶性
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-27 DOI: 10.5220/0005666001150121
I. P. Debnath, Shivajee Gupta
{"title":"On Duality with Support Functions for a Multiobjective Fractional Programming Problem","authors":"I. P. Debnath, Shivajee Gupta","doi":"10.5220/0005666001150121","DOIUrl":"https://doi.org/10.5220/0005666001150121","url":null,"abstract":"In this article, a different class of function called (K ×Q)-F-type I has been introduced. Further, we have formulated a problem over cones and appropriate duality results have been established taking the concerned functions to be(K×Q)F-type I. The results which we have put forward in the paper generalizes some of the known results appeared in the literature.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"28 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114126933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sheduling Mobil Medical Units for Home-healthcare Service 安排流动医疗单位提供家庭保健服务
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-26 DOI: 10.5220/0005661301000106
C. Amaya, John Espitia
{"title":"Sheduling Mobil Medical Units for Home-healthcare Service","authors":"C. Amaya, John Espitia","doi":"10.5220/0005661301000106","DOIUrl":"https://doi.org/10.5220/0005661301000106","url":null,"abstract":"This paper addresses a shift-scheduling and localization problem of medical staff for home-healthcare services. In this problem a private company has to decide where to locate its mobile units and its operational times. Locations and schedules define the system capacity to attend patients, capacity produces acceptable service level but operational costs, in contrast, a capacity overestimation requires subcontracting services and consequently a decrease in expected profit. In this talk we present the situation studied and a mathematical approach to deal with. The method was used in a real situation improving net profit and increased the expected","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116464350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-Objective Vehicle Routing Problem with Time Windows and Fuel Consumption Minimizing 具有时间窗和油耗最小的多目标车辆路径问题
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-25 DOI: 10.5220/0005657900920099
S. F. Ghannadpour, Mohsen Hooshfar
{"title":"Multi-Objective Vehicle Routing Problem with Time Windows and Fuel Consumption Minimizing","authors":"S. F. Ghannadpour, Mohsen Hooshfar","doi":"10.5220/0005657900920099","DOIUrl":"https://doi.org/10.5220/0005657900920099","url":null,"abstract":"","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114711750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
ACO and CP Working Together to Build a Flexible Tool for the VRP ACO和CP共同为VRP构建灵活的工具
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-23 DOI: 10.5220/0005668101220129
N. ZakeriNejad, D. Riera, Daniel Guimarans
{"title":"ACO and CP Working Together to Build a Flexible Tool for the VRP","authors":"N. ZakeriNejad, D. Riera, Daniel Guimarans","doi":"10.5220/0005668101220129","DOIUrl":"https://doi.org/10.5220/0005668101220129","url":null,"abstract":"In this paper a flexible hybrid methodology, combining Ant Colony Optimisation (ACO) and Constraint Programming (CP), is presented for solving Vehicle Routing Problems (VRP). The stress of this methodology is on the word ‘flexible’: It gives reasonably good results to changing problems without high solution redesign efforts. Thus a different problem with a new set of constraints and objectives requires no changes to the search algorithm. The search part (driven by ACO) and the model of the problem (included in the CP part) are separated to take advantage of their best attributes. This separation makes the application of the framework to different problems much simpler. To assess the feasibility of our approach, we have used it to solve different instances of the VRP family. These instances are built by combining different sets of constraints. The results obtained are promising but show that the methodology needs deeper communication between ACO and CP to improve its performance.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114234254","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Optimization of Routes for Road Surface Inspection - An Application to the Portuguese National Road Network 道路表面检查路线的优化——在葡萄牙国家公路网中的应用
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-23 DOI: 10.5220/0005711803620365
F. F. Gomes, M. Gomes, A. Gonçalves
{"title":"Optimization of Routes for Road Surface Inspection - An Application to the Portuguese National Road Network","authors":"F. F. Gomes, M. Gomes, A. Gonçalves","doi":"10.5220/0005711803620365","DOIUrl":"https://doi.org/10.5220/0005711803620365","url":null,"abstract":"Infraestruturas de Portugal S.A. (IP) is responsible for managing the Portuguese rail network infrastructure and a significant part of the road network. An annual inspection must be performed on every road segment for which IP is responsible, which sums up around 14,000 km. This is a costly operation regarding time, human and monetary resources. An optimization model that incorporates the problem technical constraints was developed and a cost analysis performed to compare the distinct scenarios that IP may face in the general layout of the inspection programme.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129674802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信