Eduardo Fagundes Costa, Lídia Ângulo Meza, Marcos Costa Roboredo
This study aims to evaluate the main Brazilian port terminals specialized in the operation of containers between the years 2010 and 2014. Therefore, it was applied Data Envelopment Analysis (DEA) and some of its complementary models, represented by the Cross Evaluation, in order to implement a peer-evaluation and improve the discrimination of the 100% efficient terminal; and a current model known as DEA-Game Cross Efficiency that combines DEA and Game Theory. This article proposes an adaptation to the original model, since it considers a radial output orientation, regarded as more compatible with the problem under analysis. DEA-Game was applied for the first time in port performance measurement and it was shown more suitable than the others, since the Decision Making Units (DMU) are seen from the perspective of a non-cooperative game and the results proved to be a Nash equilibrium.
本研究的目的是评估主要的巴西港口码头专门在2010年和2014年之间的集装箱操作。为此，采用数据包络分析(DEA)及其互补模型，以交叉评价为代表，实现同行评价，提高对100%高效终端的辨别能力;以及结合DEA和博弈论的DEA-博弈交叉效率模型。本文提出了一种对原模型的改进，因为它考虑了径向输出方向，被认为更符合所分析的问题。DEA-Game首次应用于港口绩效测量，由于决策单元(Decision Making Units, DMU)是从一个非合作博弈的角度来看待的，结果证明了DEA-Game是一个纳什均衡，因此比其他方法更适合于港口绩效测量。
{"title":"A DEA model to evaluate Brazilian container terminals","authors":"Eduardo Fagundes Costa, Lídia Ângulo Meza, Marcos Costa Roboredo","doi":"10.1051/ro/2017001","DOIUrl":"https://doi.org/10.1051/ro/2017001","url":null,"abstract":"This study aims to evaluate the main Brazilian port terminals specialized in the operation of containers between the years 2010 and 2014. Therefore, it was applied Data Envelopment Analysis (DEA) and some of its complementary models, represented by the Cross Evaluation, in order to implement a peer-evaluation and improve the discrimination of the 100% efficient terminal; and a current model known as DEA-Game Cross Efficiency that combines DEA and Game Theory. This article proposes an adaptation to the original model, since it considers a radial output orientation, regarded as more compatible with the problem under analysis. DEA-Game was applied for the first time in port performance measurement and it was shown more suitable than the others, since the Decision Making Units (DMU) are seen from the perspective of a non-cooperative game and the results proved to be a Nash equilibrium.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"90 1","pages":""},"PeriodicalIF":1.8,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76638545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Editorial. A case of plagiarism: retraction of a paper by Sreenivas and Srinivas, Vol. 43, n°4, pp. 331–337","authors":"P. Mahey","doi":"10.1051/RO/2010001","DOIUrl":"https://doi.org/10.1051/RO/2010001","url":null,"abstract":"","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"41 1","pages":"1-3"},"PeriodicalIF":1.8,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85880483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
N. Maculan, Marcos de Mendonça Passini, Jose Brito, I. Loiseau
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem.
{"title":"COLUMN-GENERATION IN INTEGER LINEAR PROGRAMMING","authors":"N. Maculan, Marcos de Mendonça Passini, Jose Brito, I. Loiseau","doi":"10.1051/RO:2003014","DOIUrl":"https://doi.org/10.1051/RO:2003014","url":null,"abstract":"We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach to a telecommunications network planning problem.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"441 1","pages":"67-83"},"PeriodicalIF":1.8,"publicationDate":"2003-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73596119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320403991
D. Bhatia, P. Garg
Le concept de (V, ρ)-invexite est introduit pour les fonctions vectorielles non lisses et est utilise pour etablir des resultats de dualite pour les programmes a plusieurs objectifs.
在非光滑向量函数中引入了(V， ρ)-invexite的概念，并用于建立多目标程序的对偶性结果。
{"title":"$(V, rho )$ invexity and non-smooth multiobjective programming","authors":"D. Bhatia, P. Garg","doi":"10.1051/RO/1998320403991","DOIUrl":"https://doi.org/10.1051/RO/1998320403991","url":null,"abstract":"Le concept de (V, ρ)-invexite est introduit pour les fonctions vectorielles non lisses et est utilise pour etablir des resultats de dualite pour les programmes a plusieurs objectifs.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"113 1","pages":"399-414"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91358031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320302111
G. Hébuterne
Performance analysis of ATM networks relies on discrete-time queueing models. We discuss various aspects of this theory related to synchronization effects, which may be already present in the system or may be introduced by the modeling approach. This survey paper intends to emphasize the specificity of discrete-time queueing theory and to bring attention to misleading conclusions it could lead to.
{"title":"Systèmes à temps discret et réseaux ATM","authors":"G. Hébuterne","doi":"10.1051/RO/1998320302111","DOIUrl":"https://doi.org/10.1051/RO/1998320302111","url":null,"abstract":"Performance analysis of ATM networks relies on discrete-time queueing models. We discuss various aspects of this theory related to synchronization effects, which may be already present in the system or may be introduced by the modeling approach. This survey paper intends to emphasize the specificity of discrete-time queueing theory and to bring attention to misleading conclusions it could lead to.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"4 1","pages":"211-225"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80076992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320302271
Hichem Kaddeche, André-Luc Beylot, Monique Becker
Future multimedia applications requiring servers able to provide video sequences on-demand to simultaneous geographically distributed users are numerous and varied. Clustered multi-disk architectures seem suitable for designing such servers. They consist in a set of storage nodes and a set of delivery nodes interconnected by a switch. Each storage node is composed of one or several disks. Video files are shared into blocks and distributed over the disks. This paper presents an analytical model for the performance study of clustered multi-disk multimedia servers. The modeling of the different component of the system is detailed and the final simplified model derived. The model allows a quick dimensioning of the operating parameters. It allows to save expensive simulations, to avoid rare event problems and then to explore values of operation parameters for which performance is not easily evaluated by simulations. The performance evaluation study focuses on the quality of transmission characterized by the probability of occurrence of break in the delivery of blocks. A block that is not loaded in time in the delivery node that manages its transmission on the external network, will not be transmitted. This will result in a short break at the user end. The performance criterion considered is then the probability of a block to be late. This probability depends on the distribution of the loading time of block; response time of the disk plus response time of the switch. In the final simplified model, the disks are modeled by M/D/I queues and the switch is modeled by a deterministic delay. The proposed model is validated through extensive simulations of an accurrate queuing network model. The dimensioning of the system is then derived.
{"title":"Approche analytique pour l'étude des performances de serveurs multimédias multidisques","authors":"Hichem Kaddeche, André-Luc Beylot, Monique Becker","doi":"10.1051/RO/1998320302271","DOIUrl":"https://doi.org/10.1051/RO/1998320302271","url":null,"abstract":"Future multimedia applications requiring servers able to provide video sequences on-demand to simultaneous geographically distributed users are numerous and varied. Clustered multi-disk architectures seem suitable for designing such servers. They consist in a set of storage nodes and a set of delivery nodes interconnected by a switch. Each storage node is composed of one or several disks. Video files are shared into blocks and distributed over the disks. This paper presents an analytical model for the performance study of clustered multi-disk multimedia servers. The modeling of the different component of the system is detailed and the final simplified model derived. The model allows a quick dimensioning of the operating parameters. It allows to save expensive simulations, to avoid rare event problems and then to explore values of operation parameters for which performance is not easily evaluated by simulations. The performance evaluation study focuses on the quality of transmission characterized by the probability of occurrence of break in the delivery of blocks. A block that is not loaded in time in the delivery node that manages its transmission on the external network, will not be transmitted. This will result in a short break at the user end. The performance criterion considered is then the probability of a block to be late. This probability depends on the distribution of the loading time of block; response time of the disk plus response time of the switch. In the final simplified model, the disks are modeled by M/D/I queues and the switch is modeled by a deterministic delay. The proposed model is validated through extensive simulations of an accurrate queuing network model. The dimensioning of the system is then derived.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"66 1","pages":"227-251"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76287641","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320302891
S. Haddad, Patrice Moreaux, Giovanni Chiola
We study the introduction of transitions with Coxian or Phase-type distribution firing time in Generalized Stochastic Petri nets (GSPNs). Such transitions produce large increases of both space and time complexity for the computation of the steady state probabilities of the underlying Markov chain. We propose a new approach to limit this phenomenon while keeping full stochastic semantics of previous works. The method is based on a structural decomposition of the net. We establish conditions under which this decomposition leads to a tensor expression of the generator of the chain. The tensor expression is used to solve the chain with an iterative method.
{"title":"Distributions de Cox et Phase-type dans les réseaux de Petri stochastiques : une méthode efficace de résolution","authors":"S. Haddad, Patrice Moreaux, Giovanni Chiola","doi":"10.1051/RO/1998320302891","DOIUrl":"https://doi.org/10.1051/RO/1998320302891","url":null,"abstract":"We study the introduction of transitions with Coxian or Phase-type distribution firing time in Generalized Stochastic Petri nets (GSPNs). Such transitions produce large increases of both space and time complexity for the computation of the steady state probabilities of the underlying Markov chain. We propose a new approach to limit this phenomenon while keeping full stochastic semantics of previous works. The method is based on a structural decomposition of the net. We establish conditions under which this decomposition leads to a tensor expression of the generator of the chain. The tensor expression is used to solve the chain with an iterative method.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"80 4 1","pages":"289-323"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89277835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320403731
Said Labreche, Hervé Poulard
Dans la premiere partie de cet article, une presentation factorielle du probleme de classification par le critere d'inertie inter-classes sera faite pour tout choix de metrique dans l'espace des individus. On en deduit que cette inertie possede une borne superieure dependant du nombre de classes et des resultats d'une Analyse en Composantes Principales. Dans la deuxieme partie, on montre un ordre strict jusqu'a un certain rang sur tout ensemble de partitions optimales. Un coefficient controlant la qualite de toute approximation d'une partition optimale sera propose ainsi qu'une procedure heuristique pour resoudre le probleme, ouvert, du choix du nombre de classes.
{"title":"Caractéristiques des partitions optimales","authors":"Said Labreche, Hervé Poulard","doi":"10.1051/RO/1998320403731","DOIUrl":"https://doi.org/10.1051/RO/1998320403731","url":null,"abstract":"Dans la premiere partie de cet article, une presentation factorielle du probleme de classification par le critere d'inertie inter-classes sera faite pour tout choix de metrique dans l'espace des individus. On en deduit que cette inertie possede une borne superieure dependant du nombre de classes et des resultats d'une Analyse en Composantes Principales. Dans la deuxieme partie, on montre un ordre strict jusqu'a un certain rang sur tout ensemble de partitions optimales. Un coefficient controlant la qualite de toute approximation d'une partition optimale sera propose ainsi qu'une procedure heuristique pour resoudre le probleme, ouvert, du choix du nombre de classes.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"75 1","pages":"373-387"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86413471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320100011
James C. Moore, William B. Richmond, Andrew Whinston
In many instances, when people search a database, they are searching for a best record instead of record with a particular set of characteristics. Using boolean queries to develop a search strategy to find a best record has proven too difficult, especially for novice users. We construct an optimal decision strategy for finding the best available alternative that takes into account both the expected value of continued search and the cost of search. The optimal strategy is intuitively appealing, and can be used as the basis for heuristics in more complex environments.
{"title":"An optimal search strategy based on user preferences for choice oriented databases","authors":"James C. Moore, William B. Richmond, Andrew Whinston","doi":"10.1051/RO/1998320100011","DOIUrl":"https://doi.org/10.1051/RO/1998320100011","url":null,"abstract":"In many instances, when people search a database, they are searching for a best record instead of record with a particular set of characteristics. Using boolean queries to develop a search strategy to find a best record has proven too difficult, especially for novice users. We construct an optimal decision strategy for finding the best available alternative that takes into account both the expected value of continued search and the cost of search. The optimal strategy is intuitively appealing, and can be used as the basis for heuristics in more complex environments.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"70 6 1","pages":"1-32"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83342200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-01-01DOI: 10.1051/RO/1998320404151
F. C. Ghelli
Dans cet article le mouvement de plusieurs objets, qui se deplacent parmi les nœuds d'un reseau, est traite comme une chaine de Markov. De cette facon la distribution des voyages (matrice Origin-Destination) peut etre derivee a partir des flots de deplacement estimes. Une telle methode est preferable aux methodes habituelles, qui consistent a utiliser des donnees de recensement (necessairement imprecises) ou bien a maximiser des fonctions globales d'utilite, dont la signification n'est pas toujours tres claire. Le modele propose, avec un choix approprie des etats, permet de representer le cas ou la probabilite de transition d'un nœud a l'autre depend des nœuds atteints aux deux instants precedents. On obtient notamment plusieurs quantites interessantes, comme les flots, la distribution stationnaire des objets parmi les nœuds et la vitesse de convergence vers cette distribution.
{"title":"Application of Markov chains to the analysis of interzonal flows in a network","authors":"F. C. Ghelli","doi":"10.1051/RO/1998320404151","DOIUrl":"https://doi.org/10.1051/RO/1998320404151","url":null,"abstract":"Dans cet article le mouvement de plusieurs objets, qui se deplacent parmi les nœuds d'un reseau, est traite comme une chaine de Markov. De cette facon la distribution des voyages (matrice Origin-Destination) peut etre derivee a partir des flots de deplacement estimes. Une telle methode est preferable aux methodes habituelles, qui consistent a utiliser des donnees de recensement (necessairement imprecises) ou bien a maximiser des fonctions globales d'utilite, dont la signification n'est pas toujours tres claire. Le modele propose, avec un choix approprie des etats, permet de representer le cas ou la probabilite de transition d'un nœud a l'autre depend des nœuds atteints aux deux instants precedents. On obtient notamment plusieurs quantites interessantes, comme les flots, la distribution stationnaire des objets parmi les nœuds et la vitesse de convergence vers cette distribution.","PeriodicalId":54509,"journal":{"name":"Rairo-Operations Research","volume":"1 1","pages":"415-424"},"PeriodicalIF":1.8,"publicationDate":"1998-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81314665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：