scholarly journals Modelo para formação de composições ferroviárias

TRANSPORTES ◽  
1999 ◽  
Vol 7 (1) ◽  
Author(s):  
Liége M. S. Firmino Murgel ◽  
Nicolau D. Fares Gualda

<p>Este trabalho apresenta um modelo analítico para resolver o problema da formação de trens, o qual consiste na definição de seus itinerários, freqüências, tamanhos e perfis de carregamentos e tração, a fim de atender à demanda no período estipulado e sujeito às restrições físicas e operacionais da empresa ferroviária. A heurística desenvolvida leva em conta aspectos fundamentais, como frota heterogênea e limitada de locomotivas e vagões, variação de bitola na malha e cargas com diferentes prioridades. Inicialmente é obtida uma solução de trens diretos, a qual é em seguida objeto de refinamento, para combinar trens e minimizar a movimentação de vagões vazios. A heurística incorpora um algoritmo de caminho mínimo e uma estratégia baseada no problema da mochila binário (knapsack Problem). O modelo foi aplicado com sucesso para um caso real de formação de trens da FEPASA.</p><p>ABSTRACT</p><p>This work presents an analytical model to solve the train formation problem, which consists of the definition of itineraries, frequencies, sizes, and profiles of shipments and traction of the trains, in order to meet the demand in the specified period, subject to the physical and operational constraints of the rail company. The heuristic presented takes into account fundamental aspects such as heterogeneous and limited fleets of locomotives and wagons, gauge variation in the rail network, and cargoes with different priorities. A solution related to direct trains formation is obtained at first, which is then submitted to a refinement procedure, to combine trains and minimize the movement of empty wagons. The heuristic incorporates a shortest path algorithm and a strategy based on the Knapsack Problem. The model was successfully applied to a real case with data from FEPASA.</p>

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Douglas Guilbeault ◽  
Damon Centola

AbstractThe standard measure of distance in social networks – average shortest path length – assumes a model of “simple” contagion, in which people only need exposure to influence from one peer to adopt the contagion. However, many social phenomena are “complex” contagions, for which people need exposure to multiple peers before they adopt. Here, we show that the classical measure of path length fails to define network connectedness and node centrality for complex contagions. Centrality measures and seeding strategies based on the classical definition of path length frequently misidentify the network features that are most effective for spreading complex contagions. To address these issues, we derive measures of complex path length and complex centrality, which significantly improve the capacity to identify the network structures and central individuals best suited for spreading complex contagions. We validate our theory using empirical data on the spread of a microfinance program in 43 rural Indian villages.


2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.


2016 ◽  
Vol 49 (12) ◽  
pp. 532-537
Author(s):  
A. Cano-Acosta ◽  
John Fontecha ◽  
Nubia Velasco ◽  
Felipe Muñoz-Giraldo

Sign in / Sign up

Export Citation Format

Share Document