A new multi-commodity flow model to optimize the robustness of the Gate Allocation Problem

2022 ◽  
Vol 136 ◽  
pp. 103491
Author(s):  
Ruixin Wang ◽  
Cyril Allignol ◽  
Nicolas Barnier ◽  
Alexandre Gondran ◽  
Jean-Baptiste Gotteland ◽  
...  
1975 ◽  
Vol 2 (3) ◽  
pp. 292-304
Author(s):  
B. G. Hutchinson ◽  
W. B. O'Brien ◽  
I. N. Dawson

This paper describes a pilot study of the development of a national commodity flow model for Canada. The aim is to develop a modelling capability that can estimate the commodity movement implications of probable changes in development and in the transport system. The model described in this paper concentrates on estimating the implications of alternative development patterns. The basic inputs to the model are spatially disaggregated allocations of population and of employment by industry sector. The principal outputs from the model are the annual tonnages of freight on each link of each modal transport network. Data inputs to the model and the model parameters are derived principally from information collected and published by Statistics Canada.The structure of the model is similar to the model structure used in urban transport planning studies. It proceeds from the estimation of commodity productions and consumptions, through the estimation of commodity distributions patterns and modal split by mode to network assignment.Preliminary results from the commodity flow model using a 1971 data base are described along with a very limited appraisal of the model outputs using independent information on Canadian commodity flows. Plausible results were obtained from the model and the assembly of an improved data base should lead to a well-developed national commodity flow model for Canada. Such a model may then be used to examine the freight movement implications of alternative patterns of urbanization in Canada and to evaluate alternative transport supply decisions for the various modes of transport.


Author(s):  
Hassine Moungla ◽  
Nora Touati ◽  
Ahmed Mehaoua

This work further investigates paradigm of radiation awareness three-dimentionnel models for WBAN network environments. The authors incorporate the effect of dynamic topology as well as the time domain and environment aspects. Even, if the impact of radiation to human health remains largely unexplored and controversial. They ask two fundamental issues, (a) deployment and (b) information routing taking into account radiation awarness. The authors first propose a multi objectives flow model which allows describing a new optimal deployment model for WBAN sensor devices with dynamic topology and the relevant possible trade-offs between coverage, connectivity, network life time while maintaining at low levels the radiation cumulated by wireless transmissions. They propose oblivious deployment heuristics that are radiation aware. The authors then combine them with dynamic spectrum management is proposed based multi-commodity flow model which allows to prevent sensor node saturation and take best action against reliability and the path loss, by imposing an equilibrium use of sensors during the routing process in order to “spread” radiation in a spatio-temporal way. Experimental results show that the proposed models and algorithms balances the energy consumption of nodes effectively, maximize the network lifetime . It will meet the enhanced WBANs requirements, including better delivery ratio, less reliable routing overhead. Their proposed radiation aware deployment and routing heuristics succeed to keep radiation levels low.


2009 ◽  
Vol 26 (0) ◽  
pp. 219-227
Author(s):  
Yoshio KAJITANI ◽  
Yuji MIZUKAMI ◽  
Masaru MIINAGAWA ◽  
Ikumasa YOSHIDA

1998 ◽  
Vol 32 (7) ◽  
pp. 467-483 ◽  
Author(s):  
Terry L. Friesz ◽  
Zhong-Gui Suo ◽  
David H. Bernstein
Keyword(s):  

2019 ◽  
Vol 32 (3) ◽  
pp. 693-723 ◽  
Author(s):  
Bayan Bevrani ◽  
Robert L. Burdett ◽  
Ashish Bhaskar ◽  
Prasad K. D. V. Yarlagadda

2011 ◽  
Vol 03 (04) ◽  
pp. 443-456 ◽  
Author(s):  
TOMOSHI OTSUKI ◽  
HIDEYUKI AISU ◽  
TOSHIAKI TANAKA

Experts working for railway operators still have to devote much time and effort to creating plans for rolling stock allocation. In this paper, we formulate the railway rolling stock allocation problem as a set partitioning multi-commodity flow (SPMCF) problem and propose a search-based heuristic approach for SPMCF. We show that our approach can obtain an approximate solution near the optimum in shorter time than CPLEX for real-life problems. Since our approach deals with a wide variety of constraint expressions, it would be applicable to automatic development of practical plans for many railway operators.


Sign in / Sign up

Export Citation Format

Share Document