Multi-commodity rebalancing plays a critical role before and during the attack of large-scale disasters. In practice, some relief centers can be out reach from ground for vehicles due to road disruption. Accordingly, alternative transportation systems are essential maximize fairness minimize total time, simultaneously. However, little study has reported on this issue humanitarian logistics. To ...

While multi-commodity flow is a classical combinatorial optimization problem, it also directly addresses a number of practically important issues of congestion and bandwidth management in connection-oriented network architectures. We consider solutions for distributed multi-commodity flow problems, which are solved by multiple agents operating in a cooperative but uncoordinated manner. We provi...

The present paper surveys important results in the theory of network flows which are not included in the book "Flows in Networks" by Ford and Fulkerson. The survey is divided into three areas: 1. Shortest paths and minimal cost flows, 2. Multi-terminal flows, 3. Multi-commodity flows.

A real-time traffic management policy that integrates signal control and multi-commodity routing of connected vehicles in networks with multiple destinations is developed. The proposed based on a formulation the store-and-forward model assumes all are able to exchange information infrastructure. Vehicles share about their current location final destination. Based this information, strategy dete...

This paper examines the relationship between spot and futures prices in Indian commodity market from 2015-2019, considering copper as one of base metals. In this study, closing future price data obtained Multi exchange India are used to investigate discovery. Various econometric tools explore long short-run prices. ADF, Johansen’s Juliesus cointegration test, Vector Error Correction Model Test,...

We address the one-to-one multi-commodity pickup and delivery traveling salesman problem (m-PDTSP) which is a generalization of the TSP and arises in several transportation and logistics applications. The objective is to find a minimum-cost directed Hamiltonian path which starts and ends at given depot nodes and such that the demand of each given commodity is transported from the associated sou...