Electronic Notes in Discrete Mathematics最新文献_第3页

Computational evaluation of ranking models in an automatic decomposition framework 自动分解框架中排序模型的计算评价

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.032

Saverio Basso , Alberto Ceselli

引用次数: 4

Green Vehicle Routing and Scheduling Problem with Split Delivery 分次交付的绿色车辆路线与调度问题

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.003

Marcos Raylan Sousa Matos, Yuri Frota, Luiz Satoru Ochi

引用次数: 17

A MILP formulation for a tire curing scheduling problem 针对轮胎养护调度问题的一种MILP公式

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.009

Héctor Cancela , Pedro Piñeyro, Joaquín Velázquez

引用次数: 2

On the complexity of a Virtual Network Function Placement and Routing problem 虚拟网络功能的复杂性与路由问题

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.026

Bernardetta Addis, Meihui Gao, Giuliana Carello

引用次数: 10

Models and cutting-plane strategies for the tree-star problem 树形问题的模型与切面策略

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.034

Rafael Andrade, Jefferson Gurguri

{"title":"Models and cutting-plane strategies for the tree-star problem","authors":"Rafael Andrade, Jefferson Gurguri","doi":"10.1016/j.endm.2018.07.034","DOIUrl":"10.1016/j.endm.2018.07.034","url":null,"abstract":"<div>Let G = (V, E) be a connected graph of set of nodes V and set of edges E. Let T = (VT, ET), with VT = V and ET ⊆ E, be a spanning tree of G. With each edge e ∈ E there is associated a routing cost <math><msubsup><mrow><mi>c</mi></mrow><mrow><mi>e</mi></mrow><mrow><mi>R</mi></mrow></msubsup></math> if e connects two internal nodes of T; or an access cost <math><msubsup><mrow><mi>c</mi></mrow><mrow><mi>e</mi></mrow><mrow><mi>A</mi></mrow></msubsup></math>, otherwise. The problem is to determine a spanning tree (tree-star) considering access and routing edge costs of minimum cost. We present two new formulations and a cutting-plane algorithm. One is based on a classical spanning tree model. The novelty relies on the way we capture access and routing edges depending on the internal nodes of the tree. The second model is completely new and is based on the concept of dicycle to represent routing edges as quadratic variables that are linearized accordingly to obtain a tree-star equivalent structure. Computational experiments performed on benchmark instances for models PFlow and PHR from the literature and for the new ones (PST and PDC) indicate that this problem is very difficult to deal with. Only a very small number of instances was solved to optimality in a given time limit. Models PDC and PHR, improved with cutting-plane strategies, although they do not solve optimally almost instances, performed better for this problem, with the dicycle-based model presenting the smallest gaps for instances for which some feasible solution was found.</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.034","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133446938","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

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 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, Daniel Cuellar, David Álvarez-Martínez","doi":"10.1016/j.endm.2018.07.042","DOIUrl":"10.1016/j.endm.2018.07.042","url":null,"abstract":"<div>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.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.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.</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.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 DOI: 10.1016/j.endm.2018.07.028

Jianguo Qi , Valentina Cacchiani, Lixing Yang

引用次数: 19

A Price-and-Branch algorithm for a drayage problem with heterogeneous trucks 异构卡车运输问题的价格-分支算法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.031

Ali Ghezelsoflu, Massimo Di Francesco, Paola Zuddas, Antonio Frangioni

引用次数: 1

Towards Robust Admission Control in Delay-Constrained Routing Problems 延迟约束路由问题的鲁棒接纳控制

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.007

Antonio Frangioni , Laura Galli , Giovanni Stea

引用次数: 0

Heuristics for the Minimum Broadcast Time 最小广播时间的启发式算法

Electronic Notes in Discrete Mathematics Pub Date : 2018-08-01 DOI: 10.1016/j.endm.2018.07.022

Amaro de Sousa, Gabriela Gallo, Santiago Gutierrez, Franco Robledo, Pablo Rodríguez-Bocca, Pablo Romero

引用次数: 7