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

Electronic Notes in Discrete Mathematics最新文献

筛选
英文 中文
Maintenance on the Railway Network: Disruptions and re-scheduling 铁路网的维修:中断和重新调度
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.015
Samuel Deleplanque
{"title":"Maintenance on the Railway Network: Disruptions and re-scheduling","authors":"Samuel Deleplanque","doi":"10.1016/j.endm.2018.07.015","DOIUrl":"10.1016/j.endm.2018.07.015","url":null,"abstract":"<div><p>Many studies had been made on optimization problems related to the maintenance operation works in the railway world. In this paper, we focus on lesser-known type of these problems. Here, the maintenance is already scheduled and the infrastructure manager can only change the train timetables and the routing. This problem is not well treated in the literature. In this work, we define the problem and we present a model. Since several days are available to solve the problem, the level of abstraction of the model and the size of the considered instances let us use an exact method. We propose a Mixed Integer Linear Program minimizing the primary delays. Results on real world instances are reported.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.015","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124979866","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 mixed-integer linear optimization model for a two-echelon agribusiness supply chain 双层农业企业供应链的混合整数线性优化模型
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.033
Víctor M. Albornoz, Cristian Urrutia-Gutiérrez
{"title":"A mixed-integer linear optimization model for a two-echelon agribusiness supply chain","authors":"Víctor M. Albornoz,&nbsp;Cristian Urrutia-Gutiérrez","doi":"10.1016/j.endm.2018.07.033","DOIUrl":"10.1016/j.endm.2018.07.033","url":null,"abstract":"<div><p>We formulate and solve a mixed-integer linear program to model an agribusiness two-echelon supply chain between an agro-industrial producer and a wholesaler. The presented model is an equivalent reformulation of a bilevel linear program, using the well known KKT conditions and a disjunction approach on the complementary constraints. It includes a hierarchical decision structure that contemplates an agro-industrial producer in the upper level, who maximizes its profit by delineating the field into management zones and assigning to each one a specific crop rotation plan. In turn, in the lower level is the wholesaler who minimizes the penalization cost of lost sales that could experiment in order to satisfy the demand requirement according to the units provided by the producer. We present a case study to show the relevance of the proposed methodology.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.033","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133219586","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
Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem 应用算法选择——广义分配问题的案例研究
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.027
Hans Degroote , José Luis González-Velarde , Patrick De Causmaecker
{"title":"Applying Algorithm Selection – a Case Study for the Generalised Assignment Problem","authors":"Hans Degroote ,&nbsp;José Luis González-Velarde ,&nbsp;Patrick De Causmaecker","doi":"10.1016/j.endm.2018.07.027","DOIUrl":"10.1016/j.endm.2018.07.027","url":null,"abstract":"<div><p>Many combinatorial optimisation problems are NP-Hard. Yet in practice high quality solutions are often obtained by (meta)heuristics. These work well in some cases, but not in others, indicating a potential for algorithm selection. In this extended abstract is discussed how to apply algorithm selection to a combinatorial optimisation problem and which challenges arise when doing so. The generalised assignment problem is used as case study.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117129515","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
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints 具有资源约束的时变初等最短路径问题的整数规划公式
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.008
Gonzalo Lera-Romero, Juan José Miranda-Bront
{"title":"Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints","authors":"Gonzalo Lera-Romero,&nbsp;Juan José Miranda-Bront","doi":"10.1016/j.endm.2018.07.008","DOIUrl":"10.1016/j.endm.2018.07.008","url":null,"abstract":"<div><p>The impact of congestion in transportation has become one of the main concerns regarding urban planing in large cities. Time-Dependent Vehicle Routing Problems (TDVRPs) is the name given to a broad family of VRPs that explicitly incorporate the congestion by considering variable travel times. In this paper we study the Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC), that appears as the pricing sub-problem in column generation-based approaches for TDVRPs. We consider two integer programming formulations which exploit the characteristics of the time-dependent travel time function and are evaluated on benchmark instances. On preliminary computational experiments, the approach is able to effectively solve instances with up to 25 vertices in reasonable times, showing its potential to be used within a Branch and Price algorithm.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.008","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117127880","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
The knapsack problem with scheduled items 计划项目的背包问题
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.038
Fabián Díaz-Núñez , Franco Quezada , Óscar C. Vásquez
{"title":"The knapsack problem with scheduled items","authors":"Fabián Díaz-Núñez ,&nbsp;Franco Quezada ,&nbsp;Óscar C. Vásquez","doi":"10.1016/j.endm.2018.07.038","DOIUrl":"10.1016/j.endm.2018.07.038","url":null,"abstract":"<div><p>We consider a new variant of the knapsack problem, where the contribution of each item on total profit is determined by its position in the knapsack via a specific function. While in the classic version this function could be considered a constant, we study two non-monotone convex functions motived by several real applications. We propose a binary linear programming (BLP) model and a polynomial time algorithm, called <em>Greedy</em>. Computational experiments are carried out, discussing practical and theoretical aspects of the problem resolution.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.038","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131150959","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
Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability 基于增量可满足性的外平面图3-着色建模
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.014
Guillermo De Ita Luna , Cristina López Ramírez , Meliza González Contreras
{"title":"Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability","authors":"Guillermo De Ita Luna ,&nbsp;Cristina López Ramírez ,&nbsp;Meliza González Contreras","doi":"10.1016/j.endm.2018.07.014","DOIUrl":"10.1016/j.endm.2018.07.014","url":null,"abstract":"<div><p>A novel method to model the problem of 3-coloring on outerplanar graphs is presented. The proposal is based on the specification of the logical constraints for the 3-coloring of an outerplanar graph in a dinaymic way, resulting in a polynomial-time instance of the incremental satisfiability problem. This proposal can be extended to consider other polynomial-time instances of the 3-coloring problem.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.014","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"54451561","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
Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution 多星星表的交叉识别:复杂性和分辨率
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.005
Daniel Severín
{"title":"Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution","authors":"Daniel Severín","doi":"10.1016/j.endm.2018.07.005","DOIUrl":"10.1016/j.endm.2018.07.005","url":null,"abstract":"<div><p>In this work, I present an optimization problem which consists of assigning entries of a stellar catalog to multiple entries of another stellar catalog such that the probability of such assignment is maximum. I show a way of modeling it as a Maximum Weighted Stable Set Problem which is further used to solve a real astronomical instance and I partially characterize the forbidden subgraphs of the resulting family of graphs given by that reduction. Finally, I prove that the problem is N P-Hard.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.005","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122823476","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
Ex post evaluation of an operating theatre 手术室的事后评估
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.021
Roberto Aringhieri, Davide Duma, Enrico Faccio
{"title":"Ex post evaluation of an operating theatre","authors":"Roberto Aringhieri,&nbsp;Davide Duma,&nbsp;Enrico Faccio","doi":"10.1016/j.endm.2018.07.021","DOIUrl":"10.1016/j.endm.2018.07.021","url":null,"abstract":"<div><p>In this paper we present a general framework for the ex post evaluation of an operating theatre driven by different performance criteria. We tested such a framework on a real case study proposing also a comparison with the actual situation.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.021","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122047534","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
The Dominance Flow Shop Scheduling Problem 优势流车间调度问题
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.004
Daniel A. Rossit , Óscar C. Vásquez , Fernando Tohmé , Mariano Frutos , Martín D. Safe
{"title":"The Dominance Flow Shop Scheduling Problem","authors":"Daniel A. Rossit ,&nbsp;Óscar C. Vásquez ,&nbsp;Fernando Tohmé ,&nbsp;Mariano Frutos ,&nbsp;Martín D. Safe","doi":"10.1016/j.endm.2018.07.004","DOIUrl":"10.1016/j.endm.2018.07.004","url":null,"abstract":"<div><p>We introduce a new line of analysis of Flow Shop scheduling problems, for the case of two jobs and assuming that processing times are unknown. The goal is to determine the domination relations between permutation and non-permutation schedules. We analyze the structural and dominance properties that ensue in this setting, based on the <em>critical paths</em> of schedules.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.004","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115086812","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}
引用次数: 7
Algorithms, pseudo-codes, implementations – some reflections on interdependencies and potential implications 算法、伪代码、实现——对相互依赖和潜在影响的一些反思
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.006
Martin Josef Geiger
{"title":"Algorithms, pseudo-codes, implementations – some reflections on interdependencies and potential implications","authors":"Martin Josef Geiger","doi":"10.1016/j.endm.2018.07.006","DOIUrl":"10.1016/j.endm.2018.07.006","url":null,"abstract":"<div><p>The article investigates different implementations of a Variable Neighborhood Search approach for the Capacitated Vehicle Routing Problem. An important goal of the work presented here is to obtain an understanding of the potential effects of implementation details on the observed performance of the algorithm.</p><p>Our work is motivated by our experiences in implementation competitions, in which best-possible algorithms to hard optimization problems must be devised and delivered. In those contexts, we may ask: what determines the success of an algorithm, (i) some key algorithmic ingredient, (ii) coding details, or (iii) other aspects? Here, we try analysing (ii) and (iii). Overall, we are able to identify some important details that are often neglected in scientific articles. Moreover, and in order to allow anyone to re-produce our findings, we make the source-code of our implementation available online with this article [Martin Josef Geiger. Different implementations of a metaheuristic for the capacitated vehicle routing problem. Mendeley Data, 2018. <span>https://dx.doi.org/10.17632/s4h89j4tgp.2</span><svg><path></path></svg>].</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.endm.2018.07.006","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133787962","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
首页 上一页 下一页 尾页
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学术官方微信