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

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

筛选
英文 中文
Efficient Large-scale Road Inspection Routing 高效的大规模道路检测路径
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-09 DOI: 10.5220/0005749203040312
Yujie Chen, P. Cowling, Stephen Remde, F. Polack
{"title":"Efficient Large-scale Road Inspection Routing","authors":"Yujie Chen, P. Cowling, Stephen Remde, F. Polack","doi":"10.5220/0005749203040312","DOIUrl":"https://doi.org/10.5220/0005749203040312","url":null,"abstract":"Gaist Solutions Ltd. carries out large scale surveys for UK road inspection. To estimate the total distance that vehicles travel, we model routing as a Chinese Postman Problem. We propose a novel graph reduction approach that dramatically speeds up the calculation of the Chinese Postman Tour for large-scale road networks. Because the analysis of large road-network graphs is now possible, planners can explore the effects of changes to traditional inspection techniques and scheduling. Case studies of road networks from six UK cities and the county of Norfolk are tested. The graph reduction process is also analysed on ten randomly generated road networks with different characteristics, to show its ability and give advice for suitable use.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131072280","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
Large Scale Petrol Station Replenishment Problem with Time Windows: A Real Case Study 具有时间窗的大型加油站补给问题:一个真实案例研究
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-07 DOI: 10.5220/0005823604080415
Pablo A. Villegas, V. M. Albornoz
{"title":"Large Scale Petrol Station Replenishment Problem with Time Windows: A Real Case Study","authors":"Pablo A. Villegas, V. M. Albornoz","doi":"10.5220/0005823604080415","DOIUrl":"https://doi.org/10.5220/0005823604080415","url":null,"abstract":"In this study we deal with a real case of the problem known as Petrol Station Replenishment Problem with Time Windows arising in Chile. The company involved is one of the biggest actors in the country, and every day must schedule a series of trips from their depots to their clients, delivering different kinds of fuel. This specific case has some differences from prior formulations of this problem (e.g. trucks works in shifts with hard time windows). Also, another challenge is the high number of orders and trucks involved in everyday planning. To solve this problem in reasonable computing times we propose a sequential insertion heuristic. Finally, we present results over a month of data.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124407529","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
Single and Multiple Objective Optimization Models for Opportunistic Preventive Maintenance 机会性预防性维修的单目标和多目标优化模型
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-06 DOI: 10.5220/0005661601070114
C. H. Antunes, M. J. Alves, Joana Dias, Teresa Gomes, B. Cardoso, José Freitas
{"title":"Single and Multiple Objective Optimization Models for Opportunistic Preventive Maintenance","authors":"C. H. Antunes, M. J. Alves, Joana Dias, Teresa Gomes, B. Cardoso, José Freitas","doi":"10.5220/0005661601070114","DOIUrl":"https://doi.org/10.5220/0005661601070114","url":null,"abstract":"This paper presents single and multiple objective deterministic optimization models for opportunistic preventive maintenance of multi-component systems. The single objective model develops an aggregate cost objective function encompassing costs of replacement, fixed costs associated with maintenance interventions and costs of component dismounting whenever the replacement of a given component implies disassembling others. Two multiple objective models are proposed, which enable to explore the trade-offs between minimizing costs vs. the number of maintenance interventions and minimizing costs vs. maximizing the remaining lifetime of components at the end of the planning period. Constraints refer to the requirement of replacing each component before the end of its lifetime and consistency restrictions to allow opportunistic maintenance and dismounting requirements.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128729636","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
Urban Crime Mitigation - A Model to Derive Criminal Patterns and Determine Defender Placement to Reduce Opportunistic Crime 城市犯罪缓解——一个推导犯罪模式和确定辩护人安置以减少机会主义犯罪的模型
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-05 DOI: 10.5220/0005827302180224
S. Sonya, Luke Brantley, M. Whitaker
{"title":"Urban Crime Mitigation - A Model to Derive Criminal Patterns and Determine Defender Placement to Reduce Opportunistic Crime","authors":"S. Sonya, Luke Brantley, M. Whitaker","doi":"10.5220/0005827302180224","DOIUrl":"https://doi.org/10.5220/0005827302180224","url":null,"abstract":"Urban opportunistic crime is a problem throughout the world causing financial, physical, and emotional damages to innocent citizens and organizations. Opportunistic crimes require minimal reconnaissance and preparation in order to conduct an attack (e.g., burglary, robbery, vandalism, and assault). Opportunistic criminals are more spontaneous in nature making their actions difficult to anticipate and create an approach to reduce these crimes. Statistical analysis of crimes may reveal distinct patterns from which a strategy can be created to better mitigate future crimes. This paper describes analysis performed on real-world campus crime data in which distinct correlations were discovered to determine the significant factors that motivate opportunistic crime. This research concludes by developing a dynamic defender placement strategy that adapts over time to reduce the utility of opportunistic crimes. The research contribution allows for the determination of significant factors motivating opportunistic crime and releases a program that maps crime occurrences over time, determines the minimum defender allocation for a given area, and dynamically specifies defender placement strategy to mitigate future crime. The novelty of this approach allows for application to other campuses, shopping complexes, and living districts to form conclusions about opportunistic criminal activity and formulate an approach to abate such crimes.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132488816","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 Interbank Market Network Model based on Bank Credit Lending Preference 基于银行信贷偏好的银行间市场网络模型
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-04 DOI: 10.5220/0005734201570162
Tao Xu, J. He, Shouwei Li
{"title":"An Interbank Market Network Model based on Bank Credit Lending Preference","authors":"Tao Xu, J. He, Shouwei Li","doi":"10.5220/0005734201570162","DOIUrl":"https://doi.org/10.5220/0005734201570162","url":null,"abstract":"An interbank market network model based on bank credit lending preference is built in this paper to explain the formation mechanism of interbank market network structure. As well, we analyze the impact of credit lending risk preference on network topology structure, which includes degree distribution, network clustering coefficient, average shortest path length and network efficiency. Simulation results demonstrate that the accumulation degree follows dual power law distribution with credit lending risk preference parameter value equal or greater than 1, while the accumulation degree follows power law distribution with credit lending risk preference parameter value smaller than 1. The interbank market network shows small world topology property. With the increasing of bank credit lending risk preference, the average shortest path length decreases but network efficiency improves, which enhances the stability of the network.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132001727","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
Transport Planning in Processing Plants for the Fruit Industry 水果工业加工厂运输规划
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-03 DOI: 10.5220/0005646100710078
Wladimir E. Soto-Silva, M. González-Araya, L. M. Plà-Aragonés, E. Nadal-Roig
{"title":"Transport Planning in Processing Plants for the Fruit Industry","authors":"Wladimir E. Soto-Silva, M. González-Araya, L. M. Plà-Aragonés, E. Nadal-Roig","doi":"10.5220/0005646100710078","DOIUrl":"https://doi.org/10.5220/0005646100710078","url":null,"abstract":"Processing plants are central for the operation of fruit supply chains. One of the main aspects to consider is fruit transportation to the processing plant. Hence, this work proposes a mixed integer linear programming model to support the fruit transport planning from the storage facilities to the processing plant. The aim of the model is to minimize the daily transportation costs and associated costs of different storage facilities from where fruits are supplied to the plant in order to meet the demand. The model considers plant processing capacity, fruit demand, number and type of trucks available and the inventory of fruit in each type of storage facilities. The model was applied to a real case study of a processing plant located in the O'Higgins Region (Chile), where reported savings only in transport costs reached about 23 percent.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125718188","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
A Cuckoo Search Clustering Algorithm for Design Structure Matrix 设计结构矩阵的布谷鸟搜索聚类算法
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-02 DOI: 10.5220/0005693000360043
Hayam G. Wahdan, S. Kassem, H. Abdelsalam
{"title":"A Cuckoo Search Clustering Algorithm for Design Structure Matrix","authors":"Hayam G. Wahdan, S. Kassem, H. Abdelsalam","doi":"10.5220/0005693000360043","DOIUrl":"https://doi.org/10.5220/0005693000360043","url":null,"abstract":"Modularity is a concept that is applied to manage complex systems by breaking them down into a set of modules that are interdependent within and independent across the modules. Benefits of modularity are often achieved from module independence that allows for independent development to reduce overall lead time and to reach economies of scale due to sharing similar modules across products in a product family. The main objective of this paper is to support design products under modularity, cluster products into a set of modules or clusters, with maximum internal relationships within a given module and minimum external relationships with other modules. The product to be designed is represented in the form of a Design Structure Matrix (DSM) that contains a list of all product components and the corresponding information exchange and dependency patterns among these components. In this research Cuckoo Search (CS) optimization algorithm is used to find the optimal number of clusters and the optimal assignment of each component to specific cluster in order to minimize the total coordination cost. Results obtained showed an improved performance compared to published studies.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127836776","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
An Industry-focused Advertising Model 以行业为中心的广告模式
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-02 DOI: 10.5220/0005653300870091
A. Murray
{"title":"An Industry-focused Advertising Model","authors":"A. Murray","doi":"10.5220/0005653300870091","DOIUrl":"https://doi.org/10.5220/0005653300870091","url":null,"abstract":"In this paper a model is created that may be effectively used to determine the optimal spending trajectory for an advertising campaign. Given a sufficient data set, all parameters present in the model should be easily determinable, or at least accurately approximated, and justifications are given for the form of all parts of the model. Finally, the solution to both the deterministic and stochastic versions of the model are given.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116368343","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
Double Ant Colony System to Improve Accessibility after a Disaster 双蚁群系统改善灾后可达性
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-12-01 DOI: 10.5220/0005651900790086
V. Sacristán, A. Jiménez-Martín, A. Mateos
{"title":"Double Ant Colony System to Improve Accessibility after a Disaster","authors":"V. Sacristán, A. Jiménez-Martín, A. Mateos","doi":"10.5220/0005651900790086","DOIUrl":"https://doi.org/10.5220/0005651900790086","url":null,"abstract":"We propose a novel double ant colony system to deal with accessibility issues after a natural or man-made disaster. The aim is to maximize the number of survivors that reach the nearest regional center (center of economic and social activity in the region) in a minimum time by planning which rural roads damaged by the disaster should be repaired given the available financial and human resources. The proposed algorithm is illustrated by means of a large instance based on the Haiti natural disasters in August-September 2008.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131129374","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
A Multi-period Vertex Cover Problem and Application to Fuel Management 多周期顶点覆盖问题及其在燃料管理中的应用
International Conference on Operations Research and Enterprise Systems Pub Date : 2016-11-30 DOI: 10.5220/0005708900510057
M. Demange, C. Tanasescu
{"title":"A Multi-period Vertex Cover Problem and Application to Fuel Management","authors":"M. Demange, C. Tanasescu","doi":"10.5220/0005708900510057","DOIUrl":"https://doi.org/10.5220/0005708900510057","url":null,"abstract":"We consider a generalisation of M IN WEIGHTED VERTEX COVER motivated by a problem in wildfire prevention. The problem is defined for a fixed number of time periods and we have to choose, at each period, some vertices to be deleted such that we never have two adjacent remaining vertices. The specificity is that whenever a vertex is deleted it reappears after a given number of periods. Consequently we may need to delete a single vertex several times. The objective is to minimise the total weight (cost) of deleted vertices. The considered application motivates the case of planar graphs. While similar problems have been mainly solved using mixed integer linear models (MIP) we investigate a graph approach that allows to take into account the structure of the underlying graph. We use a reduction to the usual M IN WEIGHTEDVERTEX COVER to devise efficient approximation algorithms and to raise some polynomial classes.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"15 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":"126024307","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
首页 上一页 下一页 尾页
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学术官方微信