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

Electronic Notes in Discrete Mathematics最新文献

筛选
英文 中文
An integer linear programming model for the constrained shortest path tour problem 约束最短路径漫游问题的整数线性规划模型
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.019
Rafael Castro de Andrade, Rommel Dias Saraiva
{"title":"An integer linear programming model for the constrained shortest path tour problem","authors":"Rafael Castro de Andrade,&nbsp;Rommel Dias Saraiva","doi":"10.1016/j.endm.2018.07.019","DOIUrl":"10.1016/j.endm.2018.07.019","url":null,"abstract":"<div><p>Let <em>D</em> = (<em>V</em>, <em>A</em>) be a directed graph with set of vertices <em>V</em> and set of arcs <em>A</em>, and let each arc (<em>i</em>, <em>j</em>) ∈ <em>A</em>, with <em>i</em>, <em>j</em> ∈ <em>V</em>, be associated with a non-negative cost. The constrained shortest path tour problem (CSPTP) is NP-Hard and consists in finding a shortest path between two distinct vertices <em>s</em> ∈ <em>V</em> and <em>t</em> ∈ <em>V</em> such that the path does not include repeated arcs and must visit a sequence of vertex disjoint subsets <em>T</em><sub>1</sub>, …, <em>T</em><sub><em>N</em></sub> in this order. In this work, we formulate the CSPTP as an integer linear programming (ILP) model and present valid inequalities for the problem. Computational experiments performed on benchmark data sets from the literature show that our ILP model consistently outperforms existing exact algorithms for the CSPTP and finds optimal solutions for most instances.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 141-148"},"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.019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122716140","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}
引用次数: 17
Computational evaluation of ranking models in an automatic decomposition framework 自动分解框架中排序模型的计算评价
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.032
Saverio Basso , Alberto Ceselli
{"title":"Computational evaluation of ranking models in an automatic decomposition framework","authors":"Saverio Basso ,&nbsp;Alberto Ceselli","doi":"10.1016/j.endm.2018.07.032","DOIUrl":"10.1016/j.endm.2018.07.032","url":null,"abstract":"<div><p>Motivated by the perspective use in decomposition-based generic Mixed Integer Programming (MIP) solvers, we consider the problem of scoring Dantzig-Wolfe decomposition patterns. In particular, assuming to receive in input a MIP instance, we tackle the issue of estimating the tightness of the dual bound yielded by a particular decomposition of that MIP instance, and the computing time required to obtain such a dual bound, looking only at static features of the corresponding data matrices. We propose decomposition ranking methods. We also sketch and evaluate an architecture for an automatic data-driven detector of good decompositions.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 245-252"},"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.032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122970366","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}
引用次数: 4
On the complexity of a Virtual Network Function Placement and Routing problem 虚拟网络功能的复杂性与路由问题
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.026
Bernardetta Addis, Meihui Gao, Giuliana Carello
{"title":"On the complexity of a Virtual Network Function Placement and Routing problem","authors":"Bernardetta Addis,&nbsp;Meihui Gao,&nbsp;Giuliana Carello","doi":"10.1016/j.endm.2018.07.026","DOIUrl":"10.1016/j.endm.2018.07.026","url":null,"abstract":"<div><p>The demand for network services, such as proxy or firewall, is ever increasing due to the massive diffusion of applications, both on computers and mobile devices. Virtual Network Functions allow to instantiate network services on clouds in a software based manner, thus allowing to dynamically provide services at a reasonable cost. In this work we consider the problem of placing Virtual Network Function instances (services) and routing the demands so as to guarantee that demands can reach the requested services. We discuss the complexity of a particular version of the Virtual Network Function placement and routing problem and the impact of the network topology on the problem complexity.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 197-204"},"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.026","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114685759","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
Green Vehicle Routing and Scheduling Problem with Split Delivery 分次交付的绿色车辆路线与调度问题
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.003
Marcos Raylan Sousa Matos, Yuri Frota, Luiz Satoru Ochi
{"title":"Green Vehicle Routing and Scheduling Problem with Split Delivery","authors":"Marcos Raylan Sousa Matos,&nbsp;Yuri Frota,&nbsp;Luiz Satoru Ochi","doi":"10.1016/j.endm.2018.07.003","DOIUrl":"10.1016/j.endm.2018.07.003","url":null,"abstract":"<div><p>The Green Vehicle Routing and Scheduling Problem (GVRSP) aims to minimize carbon Dioxide Emissions (<em>CO</em><sub>2</sub>) in logistics systems through better planning of deliveries made by a fleet of vehicles. In this paper, the GVRSP considers heterogeneous vehicles, time-varying traffic congestion, capacity constraints and the delivery can be fractionated. The GVRSP also allows vehicles to stop on arcs, so vehicle is allowed to travel an arc in multiple time periods. We present a mathematical formulation to describe the problem and a hybrid algorithm that combines the metaheuristic Iterated Local Search (ILS), the Random Variable Neighborhood Descent (RVND) procedure and an exact Set Covering model. The results obtained are compared with the state of the art and we show that the proposed approach has a strong performance.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 13-20"},"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.003","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130642050","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}
引用次数: 17
A hybrid heuristic for the multi-activity tour scheduling problem 多活动旅行调度问题的混合启发式算法
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.043
Stefania Pan , Mahuna Akplogan, Nora Touati, Lucas Létocart, Roberto Wolfler Calvo, Louis-Martin Rousseau
{"title":"A hybrid heuristic for the multi-activity tour scheduling problem","authors":"Stefania Pan ,&nbsp;Mahuna Akplogan,&nbsp;Nora Touati,&nbsp;Lucas Létocart,&nbsp;Roberto Wolfler Calvo,&nbsp;Louis-Martin Rousseau","doi":"10.1016/j.endm.2018.07.043","DOIUrl":"10.1016/j.endm.2018.07.043","url":null,"abstract":"<div><p>This work investigates the tour scheduling problem with a multi-activity context, a challenging problem that often arises in personnel scheduling. We propose a hybrid heuristic, which combines tabu search and large neighborhood search techniques. We present computational experiments on weekly time horizon problems dealing with up to five work activities. The results show that the proposed approach is able to find good quality solutions.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 333-340"},"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.043","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126655321","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
Review of Dynamic Stability Metrics and a Mechanical Model Integrated with Open Source Tools for the Container Loading Problem 集装箱装载问题的动态稳定性度量和与开源工具集成的力学模型综述
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.042
Juan Camilo Martínez, Daniel Cuellar, David Álvarez-Martínez
{"title":"Review of Dynamic Stability Metrics and a Mechanical Model Integrated with Open Source Tools for the Container Loading Problem","authors":"Juan Camilo Martínez,&nbsp;Daniel Cuellar,&nbsp;David Álvarez-Martínez","doi":"10.1016/j.endm.2018.07.042","DOIUrl":"10.1016/j.endm.2018.07.042","url":null,"abstract":"<div><p>Traditional considerations related to dynamic stability constraint in the Container Loading Problem (CLP), such as boxes with insufficient lateral support, have proven to be inaccurate when compared with the results of dynamic simulations where the boxes are subjected to real world conditions. In response to this, two indicators for dynamic stability were introduced; the number of fallen boxes and the number of boxes likely to be damaged in case of acceleration. These indicators, however, have not yet been estimated using a mechanical approach.</p><p>An open source application (PackageCargo) was developed to calculate, visualize, and save efficient packing patterns to instances of the CLP, including a dynamic simulation environment to obtain performance indicators related the dynamic stability of such patterns. The physics engine used in the application is capable of trading accuracy for simulation speed, and is in most cases non-deterministic. Through PackageCargo we evaluated the accuracy of new dynamic stability metrics.</p><p>Additionally, a mechanical model that measures dynamic stability without the need to subject the packing pattern to a physics simulation was developed, based on a dynamic analysis of the forces and accelerations acting upon the boxes and using the kinetic parameters of the load such as mass distribution, coefficient of friction, and rigidity.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 325-332"},"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.042","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132333984","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
Robust Train Timetabling and Stop Planning with Uncertain Passenger Demand 不确定旅客需求下的稳健列车调度与停站规划
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.028
Jianguo Qi , Valentina Cacchiani, Lixing Yang
{"title":"Robust Train Timetabling and Stop Planning with Uncertain Passenger Demand","authors":"Jianguo Qi ,&nbsp;Valentina Cacchiani,&nbsp;Lixing Yang","doi":"10.1016/j.endm.2018.07.028","DOIUrl":"10.1016/j.endm.2018.07.028","url":null,"abstract":"<div><p>The integrated Train Timetabling and Stop Planning (TTSP) problem calls for determining the optimal timetables for a given set of trains, while choosing, for each train, the subset of stations where it will stop. Both the timetable and the stop plan are determined based on the passenger demand, i.e. on the number of passengers travelling between an origin and a destination stations. In this work, we study the Robust TTSP (RTTSP), where passenger demand is considered to be uncertain, as it is often the case in real practice. We propose an Integer Linear Programming (ILP) model for RTTSP based on Light Robustness, an effective technique introduced in [Fischetti, M., and M. Monaci, <em>Light robustness</em> In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Lecture Notes in Computer Science <strong>5868</strong> (2009), 61–84. Springer, Berlin Heidelberg]. We test the proposed ILP model on real-world data of the Wuhan-Guangzhou high-speed railway corridor under different demand scenarios.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 213-220"},"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.028","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121920898","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}
引用次数: 19
Heuristics for the Minimum Broadcast Time 最小广播时间的启发式算法
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.022
Amaro de Sousa, Gabriela Gallo, Santiago Gutierrez, Franco Robledo, Pablo Rodríguez-Bocca, Pablo Romero
{"title":"Heuristics for the Minimum Broadcast Time","authors":"Amaro de Sousa,&nbsp;Gabriela Gallo,&nbsp;Santiago Gutierrez,&nbsp;Franco Robledo,&nbsp;Pablo Rodríguez-Bocca,&nbsp;Pablo Romero","doi":"10.1016/j.endm.2018.07.022","DOIUrl":"10.1016/j.endm.2018.07.022","url":null,"abstract":"<div><p>The problem under study is the Minimum Broadcast Time (MBT). We are given a simple graph and a singleton that owns a message. The goal is to disseminate the message as soon as possible, where the communication takes place between neighboring-nodes in a selective fashion and each forwarding takes one time-slot. The MBT serves as an inspirational problem for the design of delay-sensitive forwarding schemes. Since the problem belongs to the <span><math><mi>NP</mi></math></span>-Hard class, the literature offers heuristics, approximation algorithms and exact exponential-time solutions.</p><p>The contributions of this paper are two-fold. First, an ILP formulation for the problem is provided. Second, a competitive heuristic is developed. A fair comparison between TreeBlock and previous heuristics highlights the effectiveness of our proposal.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 165-172"},"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.022","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130258073","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
A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks 异构卡车运输问题的价格-分支算法
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 DOI: 10.1016/j.endm.2018.07.031
Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni
{"title":"A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks","authors":"Ali Ghezelsoflu,&nbsp;Massimo Di Francesco,&nbsp;Paola Zuddas,&nbsp;Antonio Frangioni","doi":"10.1016/j.endm.2018.07.031","DOIUrl":"10.1016/j.endm.2018.07.031","url":null,"abstract":"<div><p>This paper investigates a drayage problem, which is motivated by a carrier providing <em>door-to-door</em> freight transportation services by trucks and containers. The trucks carry one or two containers to ship container loads from a port to importers and from exporters to the same port. The problem is modeled by a set covering formulation with integer variables. We propose a Price-and-Branch algorithm for this problem, in which the pricing problem is a pair of shortest path problems, one for each truck type, in a suitable graph. The algorithm can determine near-optimal solutions in a short time.</p></div>","PeriodicalId":35408,"journal":{"name":"Electronic Notes in Discrete Mathematics","volume":"69 ","pages":"Pages 237-244"},"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.031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128548877","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
A mixed-integer linear optimization model for a two-echelon agribusiness supply chain 双层农业企业供应链的混合整数线性优化模型
Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 Epub Date: 2018-08-08 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":"69 ","pages":"Pages 253-260"},"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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书