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

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

筛选
英文 中文
Three Dimensional Packing Algorithm with Consideration of Loading and Unloading Order 考虑装卸顺序的三维包装算法
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-08-16 DOI: 10.5220/0004277502640269
Naoki Kobatake, Hidenori Ohta, M. Nakamori
{"title":"Three Dimensional Packing Algorithm with Consideration of Loading and Unloading Order","authors":"Naoki Kobatake, Hidenori Ohta, M. Nakamori","doi":"10.5220/0004277502640269","DOIUrl":"https://doi.org/10.5220/0004277502640269","url":null,"abstract":"A novel packing problem for truck or containership transportation is considered. A truck or a ship visits several accumulation places in a delivery tour, and items are loaded or unloaded at each accumulation place. In order to carry items as many as possible at one delivery tour, we often have to unpack and repack some items even at nondestination places if they blockade loading other items. Such packing and repacking, however, will make the transportation cost increase. Thus, a packing that requirs smaller number of unpacking and repacking is desired. In this paper, we extend the slicing-tree which is a method of a representation of packing and propose an algorithm to pack items into the container with minimum the number of unpacking and re-packing.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130191782","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
Simulating the Repatriation of Canadian Forces Materiel from Afghanistan 模拟从阿富汗遣返加拿大部队物资
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-08-04 DOI: 10.5220/0004206900660075
Bohdan L. Kaluzny, R. Pall
{"title":"Simulating the Repatriation of Canadian Forces Materiel from Afghanistan","authors":"Bohdan L. Kaluzny, R. Pall","doi":"10.5220/0004206900660075","DOIUrl":"https://doi.org/10.5220/0004206900660075","url":null,"abstract":"The Canadian Forces ceased combat operations in the Kandahar province of Afghanistan in 2011 and were instructed by the Government of Canada to complete its redeployment out of Kandahar by the end of December 2011. Materiel and equipment were transported back to Canada over several lines of communications. Nearly 1500 sea containers full of materiel, 800 vehicles, and 200 air pallets of material were returned to Canada by combinations of air, sea, and ground transport. This paper describes a discrete-event simulation model developed to analyze the repatriation of Canadian equipment from Afghanistan to Canada via the applicable lines of communication. The objective was to develop a model that could be used to analyze the repatriation in order to enable and improve future mission planning. The discrete-event simulation model is shown to be representative of the actual repatriation effort and is subsequently used to determine the impacts of different potential courses of action, measured mainly through results on the total cost and duration of the returns.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129629170","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
Decision Support System with Mark-Giving Method 基于评分法的决策支持系统
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-07-31 DOI: 10.5220/0004287303380342
O. Sedlak, M. Cileg, T. Kis
{"title":"Decision Support System with Mark-Giving Method","authors":"O. Sedlak, M. Cileg, T. Kis","doi":"10.5220/0004287303380342","DOIUrl":"https://doi.org/10.5220/0004287303380342","url":null,"abstract":"Just as in many other areas, strategic management makes use of mathematical modelling in cases such as setting strategic goals, formulation of strategies, selection and realization of the chosen strategy, and strategic control. Criteria and restrictions of alternatives are also encompassed in the space of uncertainty and indeterminacy. They have multiple meanings, in addition to being incomplete and fuzzy. The ordering method is based on the assessment, i.e. mark-giving method used by teachers in education. Values of criteria are treated as fuzzy sets, given as marks. It can be easy programmed by fuzzy logic software.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128667182","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
An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic 基于静态移动描述符的局部搜索启发式算法的高效实现
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-06-01 DOI: 10.5220/0004284102770282
Onne Beek, B. Raa, W. Dullaert
{"title":"An Efficient Implementation of a Static Move Descriptor-based Local Search Heuristic","authors":"Onne Beek, B. Raa, W. Dullaert","doi":"10.5220/0004284102770282","DOIUrl":"https://doi.org/10.5220/0004284102770282","url":null,"abstract":"The Vehicle Routing Problem is a well-studied problem. Since its formulation in 1959, a great number of powerful solution methods have been designed. However, for large scale problems, few techniques are able to consistently find good solutions within an acceptable time limit. In this paper, the concept of Static Move Descriptors, a recently published technique for speeding up Local Search algorithms, is analyzed and an efficient implementation is suggested. We describe several changes that significantly improve the performance of an SMD-based Local Search algorithm. The result is an efficient and flexible technique that can easily be adapted to different metaheuristics and can be combined with other complexity reduction strategies.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117015995","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}
引用次数: 9
Packing Circles and Irregular Polygons using Separation Lines 使用分隔线包装圆和不规则多边形
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-04-03 DOI: 10.5220/0006602700710077
J. Peralta, M. Andretta, J. Oliveira
{"title":"Packing Circles and Irregular Polygons using Separation Lines","authors":"J. Peralta, M. Andretta, J. Oliveira","doi":"10.5220/0006602700710077","DOIUrl":"https://doi.org/10.5220/0006602700710077","url":null,"abstract":"In this paper we propose a nonlinear mathematical model for the problem of packing circles, convex and nonconvex irregular polygons, within a rectangular envelope to be produced, obeying containment constraints and non-overlapping constraints; the objective of the problem is to minimize the area of the rectangular envelope. We consider free rotations of the polygons and use separation lines to ensure non-overlapping. Computational tests were run using instances presented in the literature that deal with circles and polygons simultaneously; different solutions, in which the area of the rectangular envelope is smaller than or equal to the ones found in the literature were found in most cases, and the execution time is very low. This indicates that our model is computationally efficient.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131523018","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
Reengineering of the Emergency Service System under Generalized Disutility 广义负效用下的应急服务系统再造
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-04-03 DOI: 10.5220/0006621400850093
Marek Kvet, J. Janáček
{"title":"Reengineering of the Emergency Service System under Generalized Disutility","authors":"Marek Kvet, J. Janáček","doi":"10.5220/0006621400850093","DOIUrl":"https://doi.org/10.5220/0006621400850093","url":null,"abstract":"Emergency medical service system structure is defined by deployment of service providing centers, number of which is usually limited. The objective of the designer is to minimize the total discomfort of all system users. Thus, the problem often takes the form of a weighted p-median problem. Since population and demands for service change in time and space, current service center deployment may not meet the requirements of the users and service providers neither. In this paper, we introduce a mathematical model for system reengineering under the generalized disutility, which follows from the idea that the individual user’s disutility comes from more than one located service center. At the moment of current demand occurrence, the nearest service center may be unavailable due to satisfying another arisen demand. Presented approach constitutes an extension of previously developed methods, where only the nearest center was taken as a source of individual user’s demand satisfaction.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124406700","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
Dynamic Pricing Competition with Unobservable Inventory Levels: A Hidden Markov Model Approach 具有不可观测库存水平的动态定价竞争:一个隐马尔可夫模型方法
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-01-24 DOI: 10.1007/978-3-030-16035-7_2
R. Schlosser, Keven Richly
{"title":"Dynamic Pricing Competition with Unobservable Inventory Levels: A Hidden Markov Model Approach","authors":"R. Schlosser, Keven Richly","doi":"10.1007/978-3-030-16035-7_2","DOIUrl":"https://doi.org/10.1007/978-3-030-16035-7_2","url":null,"abstract":"","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126186386","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
Computational Study of Emergency Service System Reengineering Under Generalized Disutility 广义负效用下应急服务系统重构的计算研究
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-01-24 DOI: 10.1007/978-3-030-16035-7_11
Marek Kvet, J. Janáček, Michal Kvet
{"title":"Computational Study of Emergency Service System Reengineering Under Generalized Disutility","authors":"Marek Kvet, J. Janáček, Michal Kvet","doi":"10.1007/978-3-030-16035-7_11","DOIUrl":"https://doi.org/10.1007/978-3-030-16035-7_11","url":null,"abstract":"","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130634054","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
Constructive Heuristics for Periodic Electric Vehicle Routing Problem 周期性电动汽车路径问题的构造启发式算法
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-01-24 DOI: 10.5220/0006630502640271
Tayeb Oulad Kouider, Wahiba Ramdane-Chérif, A. Oulamara
{"title":"Constructive Heuristics for Periodic Electric Vehicle Routing Problem","authors":"Tayeb Oulad Kouider, Wahiba Ramdane-Chérif, A. Oulamara","doi":"10.5220/0006630502640271","DOIUrl":"https://doi.org/10.5220/0006630502640271","url":null,"abstract":"This paper introduces a new variant of the electric vehicle routing problem, named PEVRP for Periodic Electric Vehicles Routing Problem, in which the routing and charging are planned over a multi-period horizon, subject to frequency constraints, limited fleet of electric vehicles available at the depot, intermediate facilities for charging during the trips, and partial charging. The objective of the PEVRP is to minimize the total cost of routing and charging over the time horizon, such that each vehicle could be charged nightly at the deport, and during the day at charging stations if refuelling is necessary. We propose two constructive heuristics. The first one is based on clustering technique that aims at allocating customers per vehicle and per period, and then constructs tour for each vehicle visiting customers and charging stations for refuelling. The second one is based on best insertion strategy, in which each customer is allocated to its best position that minimizes charging and routing cost. Using several parameters setting, we compared and analysed the results of the two proposed approaches on 50 new instances derived from EVRP instances of the literature.","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114335879","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}
引用次数: 10
An Efficient Heuristic for Pooled Repair Shop Designs 集合修理厂设计的一种有效启发式算法
International Conference on Operations Research and Enterprise Systems Pub Date : 2018-01-24 DOI: 10.1007/978-3-030-16035-7_6
H. Turan, S. Pokharel, T. Elmekkawy, A. Sleptchenko, M. Al-Khatib
{"title":"An Efficient Heuristic for Pooled Repair Shop Designs","authors":"H. Turan, S. Pokharel, T. Elmekkawy, A. Sleptchenko, M. Al-Khatib","doi":"10.1007/978-3-030-16035-7_6","DOIUrl":"https://doi.org/10.1007/978-3-030-16035-7_6","url":null,"abstract":"","PeriodicalId":235376,"journal":{"name":"International Conference on Operations Research and Enterprise Systems","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131254876","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信