Log in

Relevant bibliographies by topics / Multi-commodity flows / Journal articles

To see the other types of publications on this topic, follow the link: Multi-commodity flows.

Journal articles on the topic 'Multi-commodity flows'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Multi-commodity flows.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Boland, N., and A. I. Mees. "New methods for multi-commodity flows." Computers & Mathematics with Applications 20, no. 1 (1990): 29–38. http://dx.doi.org/10.1016/0898-1221(90)90066-s.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Awerbuch, Baruch, and Rohit Khandekar. "Greedy distributed optimization of multi-commodity flows." Distributed Computing 21, no. 5 (2008): 317–29. http://dx.doi.org/10.1007/s00446-008-0074-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Nace, Dritan, Linh Nhat Doan, Olivier Klopfenstein, and Alfred Bashllari. "Max–min fairness in multi-commodity flows." Computers & Operations Research 35, no. 2 (2008): 557–73. http://dx.doi.org/10.1016/j.cor.2006.03.020.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Kajendirakumar,, Ch, and V. Soundararajan,. "Reverse Logistics Networking for Multi-commodity Flows With Multi-level Servicing." Journal for Manufacturing Science and Production 8, no. 2-4 (2007): 145–58. http://dx.doi.org/10.1515/ijmsp.2007.8.2-4.145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Ford, L. R., and D. R. Fulkerson. "A Suggested Computation for Maximal Multi-Commodity Network Flows." Management Science 50, no. 12_supplement (2004): 1778–80. http://dx.doi.org/10.1287/mnsc.1040.0269.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Lin, Zhiyuan, and Raymond S. K. Kwan. "Avoiding unnecessary demerging and remerging of multi‐commodity integer flows." Networks 76, no. 2 (2020): 206–31. http://dx.doi.org/10.1002/net.21969.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Brandt, Sebastian, Klaus-Tycho Foerster, and Roger Wattenhofer. "Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs." Pervasive and Mobile Computing 36 (April 2017): 134–50. http://dx.doi.org/10.1016/j.pmcj.2016.09.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kennington, Jeff. "Comments on “A Suggested Computation for Maximal Multi-Commodity Network Flows”." Management Science 50, no. 12_supplement (2004): 1781. http://dx.doi.org/10.1287/mnsc.1040.0304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Avis, David, and Antoine Deza. "On the solitaire cone and its relationship to multi-commodity flows." Mathematical Programming 90, no. 1 (2001): 27–57. http://dx.doi.org/10.1007/pl00011419.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Groß, Martin, and Martin Skutella. "A tight bound on the speed-up through storage for quickest multi-commodity flows." Operations Research Letters 43, no. 1 (2015): 93–95. http://dx.doi.org/10.1016/j.orl.2014.12.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mollah, Md Atiqul, Xin Yuan, Scott Pakin, and Michael Lang. "Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks." IEEE Transactions on Parallel and Distributed Systems 29, no. 1 (2018): 156–68. http://dx.doi.org/10.1109/tpds.2017.2746078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Dupas, Rémy, Eiichi Taniguchi, Jean-Christophe Deschamps, and Ali G. Qureshi. "A Multi-commodity Network Flow Model for Sustainable Performance Evaluation in City Logistics: Application to the Distribution of Multi-tenant Buildings in Tokyo." Sustainability 12, no. 6 (2020): 2180. http://dx.doi.org/10.3390/su12062180.

Full text

Abstract:

The distribution of goods in crowded city centers is a major challenge. In this paper, we propose a methodology for evaluating the performance of a parcel distribution network in city logistics. This methodology encompasses the main entities of a two-tier distribution system made up of carriers, huge shopping centers (multi-tenant buildings) and intermediate depots (urban consolidation centers), as well as the parcel flows between them. This methodology aims to optimize the transport flows (distance traveled) of a given distribution network while also quantifying the impact in terms of sustain

APA, Harvard, Vancouver, ISO, and other styles

13

Deaconu, Adrian Marius, and Delia Spridon. "Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms." Mathematics 9, no. 15 (2021): 1716. http://dx.doi.org/10.3390/math9151716.

Full text

Abstract:

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the pro

APA, Harvard, Vancouver, ISO, and other styles

14

Osorio-Mora, Alan, Francisco Núñez-Cerda, Gustavo Gatica, and Rodrigo Linfati. "Multimodal Capacitated Hub Location Problems with Multi-Commodities: An Application in Freight Transport." Journal of Advanced Transportation 2020 (January 20, 2020): 1–9. http://dx.doi.org/10.1155/2020/2431763.

Full text

Abstract:

Hub location problems (HLPs) support decision making on multimodal transport strategic planning. It is related to the location of hubs and the allocation of origin/destination (O/D) flow in a system. Classical formulations assume that these flows are predefined paths and direct delivery is not available. This applied research presents a mixed integer linear programming (MILP) model for a capacitated multimodal, multi-commodity HLP. Furthermore, an application on the export process in a Latin American country is detailed. The new proposed model, unlike the traditional HLP, allows direct shipmen

APA, Harvard, Vancouver, ISO, and other styles

15

Oley, Jimmy Daniel Berlianto, and Yerikho Setyo Adi. "Vulnerabilities of Indonesia’s Extractive Industry to Illicit Financial Flows." INTEGRITAS 4, no. 2 (2018): 24. http://dx.doi.org/10.32697/integritas.v4i2.301.

Full text

Abstract:

This article aims to explain the vulnerabilities of Indonesia’s extractive industry governance to the illicit financial flows. Earlier studies figured out that the company in extractive industry has been found to be one of the prominent actors of illicit financial flows. In the case of Indonesia during the period of 2004-2013, the data of Global Financial Integrity (GFI) illustrated that Indonesia is among the top 10 developing countries – which have the highest value of illicit financial flows. This article seeks to explain the nature of illicit financial flows on extractive industry, the cau

APA, Harvard, Vancouver, ISO, and other styles

16

Mazhar, H., T. Heyn, A. Pazouki, et al. "CHRONO: a parallel multi-physics library for rigid-body, flexible-body, and fluid dynamics." Mechanical Sciences 4, no. 1 (2013): 49–64. http://dx.doi.org/10.5194/ms-4-49-2013.

Full text

Abstract:

Abstract. The last decade witnessed a manifest shift in the microprocessor industry towards chip designs that promote parallel computing. Until recently the privilege of a select group of large research centers, Teraflop computing is becoming a commodity owing to inexpensive GPU cards and multi to many-core x86 processors. This paradigm shift towards large scale parallel computing has been leveraged in CHRONO, a freely available C++ multi-physics simulation package. CHRONO is made up of a collection of loosely coupled components that facilitate different aspects of multi-physics modeling, simu

APA, Harvard, Vancouver, ISO, and other styles

17

Kabát, Milan, Vojtěch David, Petr Holub, and Martin Pulec. "High-performance forward error correction: Enabling multi-gigabit flows and beyond on commodity GPU and CPU hardware in presence of packet loss." Future Generation Computer Systems 54 (January 2016): 326–35. http://dx.doi.org/10.1016/j.future.2015.04.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

D’Ambrosio, Donato, Giuseppe Filippone, Rocco Rongo, William Spataro, and Giuseppe A. Trunfio. "Cellular Automata and GPGPU." International Journal of Grid and High Performance Computing 4, no. 3 (2012): 30–47. http://dx.doi.org/10.4018/jghpc.2012070102.

Full text

Abstract:

This paper presents an efficient implementation of the SCIARA Cellular Automata computational model for simulating lava flows using the Compute Unified Device Architecture (CUDA) interface developed by NVIDIA and carried out on Graphical Processing Units (GPU). GPUs are specifically designated for efficiently processing graphic data sets. However, they are also recently being exploited for achieving excellent computational results for applications non-directly connected with Computer Graphics. The authors show an implementation of SCIARA and present results referred to a Tesla GPU computing pr

APA, Harvard, Vancouver, ISO, and other styles

19

Ryzhkova, S. M., and V. M. Kruchinina. "Trade-an infrastructure element for delivering fish to consumers in Russia." Proceedings of the Voronezh State University of Engineering Technologies 82, no. 3 (2020): 253–60. http://dx.doi.org/10.20914/2310-1202-2020-3-253-260.

Full text

Abstract:

In Russia, for the successful development of fishing and fish farming, there is a natural base: access to the seas and oceans, a significant area of internal reservoirs: rivers and lakes. However, the distribution of fish resources is very uneven: in some areas, resources far exceed the needs of the local population, while others may not have direct access to fish stocks. Therefore, trade plays an important role in achieving a more even distribution of fish throughout the country and is an important element of the market economy, market exchange, and one of the indicators of the well-being of

APA, Harvard, Vancouver, ISO, and other styles

20

Gupta, Shiva Prakash, Durga Prasad Khanal, Urmila Pyakurel, and Tanka Nath Dhamala. "Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem." Nepali Mathematical Sciences Report 37, no. 1-2 (2020): 30–46. http://dx.doi.org/10.3126/nmsr.v37i1-2.34068.

Full text

Abstract:

Multi-commodity flow problem appears when several distinct commodities are shipped from supply nodes to the demand nodes through a network without violating the capacity constraints. The quickest multi-commodity flow problem deals with the minimization of time satisfying given demand. Ingeneral, the quickest multi-commodity flow problems are computationally hard. The outbound lane capacities can be increased through reverting the orientation of lanes towards the demand nodes. We present two approximation algorithms by introducing partial contraow technique in the continuous-time quick estmulti

APA, Harvard, Vancouver, ISO, and other styles

21

Gupta, Shiva Prakash, Durga Prasad Khanal, Urmila Pyakurel, and Tanka Nath Dhamala. "Approximate Algorithms for Continuous-Time Quickest Multi-Commodity Contraflow Problem." Nepali Mathematical Sciences Report 37, no. 1-2 (2020): 30–46. http://dx.doi.org/10.3126/nmsr.v37i1-2.34068.

Full text

Abstract:

Multi-commodity flow problem appears when several distinct commodities are shipped from supply nodes to the demand nodes through a network without violating the capacity constraints. The quickest multi-commodity flow problem deals with the minimization of time satisfying given demand. Ingeneral, the quickest multi-commodity flow problems are computationally hard. The outbound lane capacities can be increased through reverting the orientation of lanes towards the demand nodes. We present two approximation algorithms by introducing partial contraow technique in the continuous-time quick estmulti

APA, Harvard, Vancouver, ISO, and other styles

22

Wu, Yuan Li, Guang Ya Si, Yan Zheng Wang, and Pi Luo. "Modeling Internet Backbone Traffic Based on Multi-Commodity Flow." Applied Mechanics and Materials 713-715 (January 2015): 2261–68. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.2261.

Full text

Abstract:

Network traffic is the key factor to describe the adaptive business of Internet. As Internet becomes key battlefield of cyber warfare, how to model the Internet traffic at the macro level has become a hot research topic in war simulation and cyber warfare. Focusing on the global undersea cable system which serves as the backbone of the Internet, this paper proposes an Internet traffic modeling method based on multi-commodity flow. This method can estimate the traffic demand between each pair of regions, generate traffic flow distribution in global undersea cable system, and support adaptive ad

APA, Harvard, Vancouver, ISO, and other styles

23

CHOI, YOONSEO, and TAEWHAN KIM. "BINDING ALGORITHM FOR POWER OPTIMIZATION BASED ON NETWORK FLOW METHOD." Journal of Circuits, Systems and Computers 11, no. 03 (2002): 259–71. http://dx.doi.org/10.1142/s0218126602000422.

Full text

Abstract:

We propose an efficient binding algorithm for power optimization in behavioral synthesis. In prior work, it has been shown that several binding problems for low-power can be formulated as multi-commodity flow problems (due to an iterative execution of data flow graph) and be solved optimally. However, since the multi-commodity flow problem is NP-hard, the application is limited to a class of small sized problems. To overcome the limitation, we address the problem of how we can effectively make use of the property of efficient flow computations in a network so that it is extensively applicable

APA, Harvard, Vancouver, ISO, and other styles

24

Jung, Jihye, and In-Chan Choi. "A multi-commodity network model for optimal quantum reversible circuit synthesis." PLOS ONE 16, no. 6 (2021): e0253140. http://dx.doi.org/10.1371/journal.pone.0253140.

Full text

Abstract:

Quantum computing is a newly emerging computing environment that has recently attracted intense research interest in improving the output fidelity, fully utilizing its high computing power from both hardware and software perspectives. In particular, several attempts have been made to reduce the errors in quantum computing algorithms through the efficient synthesis of quantum circuits. In this study, we present an application of an optimization model for synthesizing quantum circuits with minimum implementation costs to lower the error rates by forming a simpler circuit. Our model has a unique

APA, Harvard, Vancouver, ISO, and other styles

25

Kumar Mahalik, Mantu, Debashis Acharya, and M. Suresh Babu. "Price discovery and volatility spillovers in futures and spot commodity markets." Journal of Advances in Management Research 11, no. 2 (2014): 211–26. http://dx.doi.org/10.1108/jamr-09-2012-0039.

Full text

Abstract:

Purpose – The purpose of this paper is to investigate empirically the price discovery and volatility spillovers in Indian spot-futures commodity markets. Design/methodology/approach – The study has used four futures and spot indices of Multi-Commodity Exchange, Mumbai. The study also employs vector error correction model (VECM) and bivariate exponential Garch model (EGARCH) to analyze the price discovery and volatility spillovers in Indian spot-futures commodity market. Findings – The VECM shows that agriculture future price index (LAGRIFP), energy future price index (LENERGYFP) and aggregate

APA, Harvard, Vancouver, ISO, and other styles

26

Kawashima, Makswell Seyiti, Socorro Rangel, Igor Litvinchev, and Luis Infante. "A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem." DYNA 82, no. 191 (2015): 42–50. http://dx.doi.org/10.15446/dyna.v82n191.51144.

Full text

Abstract:

<p class="ADYNAAbstrac"><span lang="EN-US">In this paper we explore the multi-commodity flow formulation for the Asymmetric Traveling Salesman Problem (ATSP) to obtain dual bounds. The procedure employed is a variant of a relax and cut procedure proposed in the literature that computes the Lagrangean multipliers associated to the subtour elimination constraints preserving the optimality of the multipliers associated to the assignment constraints. The results obtained by the computational study are encouraging and show that the proposed algorithm generated good dual bounds for the A

APA, Harvard, Vancouver, ISO, and other styles

27

ZEISER, THOMAS, GEORG HAGER, and GERHARD WELLEIN. "BENCHMARK ANALYSIS AND APPLICATION RESULTS FOR LATTICE BOLTZMANN SIMULATIONS ON NEC SX VECTOR AND INTEL NEHALEM SYSTEMS." Parallel Processing Letters 19, no. 04 (2009): 491–511. http://dx.doi.org/10.1142/s0129626409000389.

Full text

Abstract:

Classic vector systems have all but vanished from recent TOP500 lists. Looking at the recently introduced NEC SX-9 series, we benchmark its memory subsystem using the low level vector triad and employ the kernel of an advanced lattice Boltzmann flow solver to demonstrate that classic vectors still combine excellent performance with a well-established optimization approach. To investigate the multi-node performance, the flow field in a real porous medium is simulated using the hybrid MPI/OpenMP parallel ILBDC lattice Boltzmann application code. Results for a commodity Intel Nehalem-based cluste

APA, Harvard, Vancouver, ISO, and other styles

28

De, Ramen Kanti, and Aritra Ganguly. "Energy, Exergy and Economic Analysis of a Solar Hybrid Power System Integrated Double-Effect Vapor Absorption System-Based Cold Storage." International Journal of Air-Conditioning and Refrigeration 27, no. 02 (2019): 1950018. http://dx.doi.org/10.1142/s2010132519500184.

Full text

Abstract:

In this paper, an attempt has been made to propose a multi-commodity cold storage to store a variety of high value perishable commodities round the year. To maintain the favorable micro-climate inside the cold storage space for the selected commodities, a cooling system based on double-effect vapor absorption cycle has been developed. To meet the year-round thermal and electrical load of the proposed cold storage, a solar thermal-PV-based hybrid power system has been designed. A computer program in MATLAB-R2017a has been developed to predict the year-round performance of the proposed system fo

APA, Harvard, Vancouver, ISO, and other styles

29

OTSUKI, TOMOSHI, HIDEYUKI AISU, and TOSHIAKI TANAKA. "A SEARCH-BASED APPROACH TO RAILWAY ROLLING STOCK ALLOCATION PROBLEMS." Discrete Mathematics, Algorithms and Applications 03, no. 04 (2011): 443–56. http://dx.doi.org/10.1142/s1793830911001334.

Full text

Abstract:

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 railwa

APA, Harvard, Vancouver, ISO, and other styles

30

Chen, Ying Xin. "The Study of Vehicle Routing Model in Emergency Situations." Advanced Materials Research 433-440 (January 2012): 4807–12. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.4807.

Full text

Abstract:

A Vehicle routing model for logistics planning is developed in this paper. The model addresses the dynamic time-dependent transportation problem that needs to be solved repetitively at given time intervals during ongoing aid delivery. The model generates plans incorporating new requests for aid materials, new supplies and transportation means that become available during the current planning time horizon. The plan indicates the optimal mixed pick up and delivery schedules for vehicles within the considered planning time horizon as well as the optimal quantities and types of loads picked up and

APA, Harvard, Vancouver, ISO, and other styles

31

Moungla, Hassine, Nora Touati, and Ahmed Mehaoua. "Radiation Aware Efficient Sensor Deployment and Optimal Routing in Dynamic Three-Dimensional WBAN Topology." International Journal of E-Health and Medical Communications 5, no. 4 (2014): 67–89. http://dx.doi.org/10.4018/ijehmc.2014100105.

Full text

Abstract:

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 t

APA, Harvard, Vancouver, ISO, and other styles

32

Hrydziushka, Darya, Urooj Pasha, and Arild Hoff. "An Extended Model for Disaster Relief Operations Used on the Hagibis Typhoon Case in Japan." Logistics 5, no. 2 (2021): 39. http://dx.doi.org/10.3390/logistics5020039.

Full text

Abstract:

This paper presents a generalization of a previously defined lexicographical dynamic flow model based on multi-objective optimization for solving the multi-commodity aid distribution problem in the aftermath of a catastrophe. The model considers distribution of the two major commodities of food and medicine, and seven different objectives, and the model can easily be changed to include more commodities in addition to other and different priorities between the objectives. The first level in the model is to maximize the amount of aid distributed under the given constraints. Keeping the optimal r

APA, Harvard, Vancouver, ISO, and other styles

33

KOLAR, VINAY, and NAEL B. ABU-GHAZALEH. "GLOBALLY AWARE ROUTING IN MULTI-HOP WIRELESS NETWORKS: A FORMULATION AND ANALYSIS." Journal of Interconnection Networks 09, no. 03 (2008): 205–30. http://dx.doi.org/10.1142/s0219265908002242.

Full text

Abstract:

Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path with the smallest number of hops. However, interference plays a major role in limiting the capacity of such networks. While recent protocols have attempted to account for interference, they do so reactively and without coordination. Approaches that coordinate routing to account for mutual interference achieve better performance than traditional approaches. Modeling routing with interference constraints is a complex non-linear optimization problem. We approach the problem using a Mul

APA, Harvard, Vancouver, ISO, and other styles

34

Abdelmaguid, Tamer. "An Efficient Mixed Integer Linear Programming Model for the Minimum Spanning Tree Problem." Mathematics 6, no. 10 (2018): 183. http://dx.doi.org/10.3390/math6100183.

Full text

Abstract:

Finding a minimum spanning tree in a given network is a famous combinatorial optimization problem that appears in different engineering applications. Even though this problem is solvable in polynomial time, having efficient mathematical programming models is important as they can provide insights for formulating larger models that integrate other decisions in more complex applications. In the literature, there are ten different integer and mixed integer linear programming (MILP) models for this problem. They are variants of set packing, cuts, network flow and node level formulations. In additi

APA, Harvard, Vancouver, ISO, and other styles

35

Vudathala, Daljit, Jakub Klobut, Margie Cummings, et al. "Multilaboratory Evaluation of a Lateral Flow Method for Aflatoxin B1 Analysis in Dry Dog Food." Journal of AOAC INTERNATIONAL 103, no. 2 (2020): 480–88. http://dx.doi.org/10.5740/jaoacint.19-0020.

Full text

Abstract:

Abstract Background: Aflatoxins are one of the most heavily regulated mycotoxins in agriculture throughout the world. A variety of tests are used for detection, including rapid methods that are preferred when a large number of samples need to be quickly screened to implement an immediate action. However, a method developed for screening a specific commodity for the presence of mycotoxins requires further validation to demonstrate its suitability for additional matrices. Objective: In this study, a study was undertaken to evaluate a rapid screening method for aflatoxin B1 (AFB1) in dry dog food

APA, Harvard, Vancouver, ISO, and other styles

36

Stojkovic, Mirela, and François Soumis. "The operational flight and multi-crew scheduling problem." Yugoslav Journal of Operations Research 15, no. 1 (2005): 25–48. http://dx.doi.org/10.2298/yjor0501025s.

Full text

Abstract:

This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties) for the set of crew members, while respecting predefined aircraft itineraries. The splitting of a planned crew is allowed during a day of operations, where it is more important to cover a flight than to keep planned crew members together. The objective is to cover a maximum number of flights from a day of operations while minimizing changes in both the flight schedule and the next-da

APA, Harvard, Vancouver, ISO, and other styles

37

Jogunola, Olamide, Bamidele Adebisi, Kelvin Anoh, et al. "Distributed Adaptive Primal Algorithm for P2P-ETS over Unreliable Communication Links." Energies 11, no. 9 (2018): 2331. http://dx.doi.org/10.3390/en11092331.

Full text

Abstract:

Algorithms for distributed coordination and control are increasingly being used in smart grid applications including peer-to-peer energy trading and sharing to improve reliability and efficiency of the power system. However, for realistic deployment of these algorithms, their designs should take into account the suboptimal conditions of the communication network, in particular the communication links that connect the energy trading entities in the energy network. This study proposes a distributed adaptive primal (DAP) routing algorithm to facilitate communication and coordination among proacti

APA, Harvard, Vancouver, ISO, and other styles

38

Moungla, Hassine, Nora Touati, and Ahmed Mehaoua. "Cost Efficient Deployment and Reliable Routing Modeling Based Multi-Objective Optimization for Dynamic Wireless Body Sensor Networks Topology." International Journal of E-Health and Medical Communications 4, no. 4 (2013): 16–33. http://dx.doi.org/10.4018/ijehmc.2013100102.

Full text

Abstract:

Wireless Body Sensor Networks (WBSNs), like any other sensor networks, suffer from limited energy and are highly distributed network, where its nodes organize by themselves and each of them has the flexibility of collecting and transmitting patient biomedical information to a sink. When a knowledge was sent to a sink from a path that doesn't have a definite basis, the routing is a crucial challenge in Wireless Body Area Sensor Networks. Furthermore, reliability and routing delay are the considerable factors in these types of networks. More attention should be given to the energy routing issue

APA, Harvard, Vancouver, ISO, and other styles

39

Campaña, Miguel, Esteban Inga, and Jorge Cárdenas. "Optimal Sizing of Electric Vehicle Charging Stations Considering Urban Traffic Flow for Smart Cities." Energies 14, no. 16 (2021): 4933. http://dx.doi.org/10.3390/en14164933.

Full text

Abstract:

Achieving high penetration of electric vehicles (EVs) is one of the objectives proposed by the scientific community to mitigate the negative environmental impact caused by conventional mobility. The limited autonomy and the excessive time to recharge the battery discourage the final consumer from opting for new environmentally friendly mobility alternatives. Consequently, it is essential to provide the urban road network with charging infrastructure (CI) to ensure that the demand generated by EV users is met. The types of terminals to be considered in charging stations (CS) are fast and ultra-

APA, Harvard, Vancouver, ISO, and other styles

40

Graham, Chris, and Andrew McManus. "Lower oil and gas prices and the changing LNG landscape." APPEA Journal 56, no. 2 (2016): 586. http://dx.doi.org/10.1071/aj15092.

Full text

Abstract:

The recent uptick in oil prices from multi-year lows reflects growing anticipation of a tightening of supply and demand fundamentals in global oil markets. Price recovery is expected to come through most notably in the second half of 2016, as the extended period of low oil prices takes its toll on global oil supply growth, and oil demand growth holds up as prices recover. Rising oil prices will eventually flow through to higher realised LNG revenues in Australasia's long-term oil-linked term contracts. This would provide welcome respite to project economics, many of which have been hit hard by

APA, Harvard, Vancouver, ISO, and other styles

41

BEHERA, U. K., C. M. YATES, E. KEBREAB, and J. FRANCE. "Farming systems methodology for efficient resource management at the farm level: a review from an Indian perspective." Journal of Agricultural Science 146, no. 5 (2008): 493–505. http://dx.doi.org/10.1017/s0021859608007995.

Full text

Abstract:

SUMMARYFarming systems research is a multi-disciplinary holistic approach to solve the problems of small farms. Small and marginal farmers are the core of the Indian rural economy constituting 0·80 of the total farming community but possessing only 0·36 of the total operational land. The declining trend of per capita land availability poses a serious challenge to the sustainability and profitability of farming. Under such conditions, it is appropriate to integrate land-based enterprises such as dairy, fishery, poultry, duckery, apiary, field and horticultural cropping within the farm, with the

APA, Harvard, Vancouver, ISO, and other styles

42

Vernet, Lucas. "Equilibrium Flows: Bipartite Contracts in Large Multi-Commodity Markets." SSRN Electronic Journal, 2017. http://dx.doi.org/10.2139/ssrn.2924608.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Klimm, Max, and Philipp Warode. "Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs." Mathematics of Operations Research, September 14, 2021. http://dx.doi.org/10.1287/moor.2021.1151.

Full text

Abstract:

We develop algorithms solving parametric flow problems with separable, continuous, piecewise quadratic, and strictly convex cost functions. The parameter to be considered is a common multiplier on the demand of all nodes. Our algorithms compute a family of flows that are each feasible for the respective demand and minimize the costs among the feasible flows for that demand. For single commodity networks with homogenous cost functions, our algorithm requires one matrix multiplication for the initialization, a rank 1 update for each nondegenerate step and the solution of a convex quadratic progr

APA, Harvard, Vancouver, ISO, and other styles

44

Abhyankar, A. R., S. A. Soman, and S. A. Khaparde. "Real Power Tracing: An Optimization Approach." International Journal of Emerging Electric Power Systems 3, no. 2 (2005). http://dx.doi.org/10.2202/1553-779x.1088.

Full text

Abstract:

Most tracing algorithms have used variants of proportionality based tracing algorithm. However, proportional sharing is not an inherent characteristic of the system. It is a rule enforced to arrive at a solution in a simple and fair manner. We propose a multi-commodity network flow optimization approach for optimal tracing of power flows. The resulting optimization formulation is shown to be sparse linear programming (LP) problem. The paper is devoted to the constraint modeling of this optimization approach. A unified formulation that models lossy MW flow network and provides consistent result

APA, Harvard, Vancouver, ISO, and other styles

45

Voitovych, Sergii. "ESSENCE AND FEATURES OF LOGISTICS APPLICATION IN THE FIELD OF SERVICES." Scientific Journal of Yuriy Fedkovich Chernivtsi National University. Economics, no. 809 (November 27, 2019). http://dx.doi.org/10.31861/ecovis/2019-809-7.

Full text

Abstract:

The article deals with the theoretical aspects of the use of logistics in the service sector. In particular, with the use of general scientific methods of analysis and generalization, the substantiation of the possibility and the need for the use of logistics in the service sector is presented. The use of comparison techniques allowed us to find out the main differences between the logistics of service flows and the logistics of commodity flows. Based on theoretical generalization own definition of the concept «logistics of the service sector» taking into account its specificity in the service

APA, Harvard, Vancouver, ISO, and other styles

46

Ho, Ho Van Hung, Tran Quoc Chien. "Maximal concurrent minimal cost flow problems on extended multi-cost multi-commodity networks." Journal of Science and Technology Issue on Information and Communications Technology, June 30, 2021, 29–35. http://dx.doi.org/10.31130/jst-ud2021-442.

Full text

Abstract:

The graph is a great mathematical tool, which has been effectively applied to many fields such as economy, informatics, communication, transportation, etc. It can be seen that in an ordinary graph the weights of edges and vertexes are taken into account independently where the length of a path is the sum of weights of the edges and the vertexes on this path. Nevertheless, in many practical problems, weights at vertexes are not equal for all paths going through these vertexes, but are depending on coming and leaving edges. Moreover, on a network, the capacities of edges and vertexes are shared

APA, Harvard, Vancouver, ISO, and other styles

47

DeBerry, William T., Richard Dill, Kenneth Hopkinson, Douglas D. Hodson, and Michael Grimaila. "The wargame commodity course of action automated analysis method." Journal of Defense Modeling and Simulation: Applications, Methodology, Technology, July 19, 2021, 154851292110283. http://dx.doi.org/10.1177/15485129211028318.

Full text

Abstract:

This research presents the wargaming commodity course of action automated analysis method (WCCAAM) – a novel approach to assist wargame commanders in developing and analyzing courses of action (COAs) through semi-automation of the military decision making process (MDMP). MDMP is a seven-step iterative method that commanders and mission partners follow to build an operational course of action to achieve strategic objectives. MDMP requires time, resources, and coordination – all competing items the commander weighs to make the optimal decision. WCCAAM receives the MDMP’s Mission Analysis phase a

APA, Harvard, Vancouver, ISO, and other styles

48

Rossiter, Ned. "Creative Industries and the Limits of Critique from." M/C Journal 6, no. 3 (2003). http://dx.doi.org/10.5204/mcj.2208.

Full text

Abstract:

‘Every space has become ad space’. Steve Hayden, Wired Magazine, May 2003. Marshall McLuhan’s (1964) dictum that media technologies constitute a sensory extension of the body shares a conceptual affinity with Ernst Jünger’s notion of ‘“organic construction” [which] indicates [a] synergy between man and machine’ and Walter Benjamin’s exploration of the mimetic correspondence between the organic and the inorganic, between human and non-human forms (Bolz, 2002: 19). The logo or brand is co-extensive with various media of communication – billboards, TV advertisements, fashion labels, book spines,

APA, Harvard, Vancouver, ISO, and other styles

49

Harley, Ross. "Light-Air-Portals: Visual Notes on Differential Mobility." M/C Journal 12, no. 1 (2009). http://dx.doi.org/10.5204/mcj.132.

Full text

Abstract:

0. IntroductionIf we follow the line of much literature surrounding airports and urban mobility, the emphasis often falls on the fact that these spaces are designed to handle the mega-scale and super-human pace of mass transit. Airports have rightly been associated with velocity, as zones of rapid movement managed by enormous processing systems that guide bodies and things in transit (Pascoe; Pearman; Koolhaas; Gordon; Fuller & Harley). Yet this emphasis tends to ignore the spectrum of tempos and flows that are at play in airport terminals — from stillness to the much exalted hyper-rapidit

APA, Harvard, Vancouver, ISO, and other styles

50

Cocker, Emma. "From Passivity to Potentiality: The Communitas of Stillness." M/C Journal 12, no. 1 (2009). http://dx.doi.org/10.5204/mcj.119.

Full text

Abstract:

Drawing on my recent experience of working in collaboration with the artist-led project, Open City, I want to explore the potential of an active and resistant - rather than passive and acquiescent – form of stillness that can be activated strategically within a performance-based practice. The article examines how stillness and other forms of non-productive or non-teleological activity might contribute towards the production of a radically dissenting – yet affirmative – model of contemporary subjectivity. It will investigate how the performance of stillness within an artistic practice could off

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!