Interest has increased recently in water recycling and reuse. The possible economic feasibility of reuse and recycling dramatically increases th}complexity of designing a optimal water delivery s stem. In this •a•c•: wc p;csc:.;., ii6,ii•;i,• ..... ud,•i -,ich takes into account both flow requirements and water quality. Because of the model's transshipment formulation the solution technique see...

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin–destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hu...

The transshipment problem is one of the central problems in network optimization. There exist several polynomial and strongly polynomial algorithms for solving this problem (see the surveys [7, 1]). Nevertheless, the method of choice in practice still seems to be the network simplex method. In this paper we shall consider the dual network simplex method. We show that some excess scaling algorit...

Klinz and Woeginger (1995) prove that the minimum cost quickest flow problem is NP-hard. On other hand, can be solved efficiently via a straightforward reduction to without costs. More generally, we show how transshipment reduced solvable problem, thus adding another mosaic tile rich complexity landscape of flows over time.

During its development, a train should be connected to different transportation modes so consumers have further transshipment nodes, such as airports and bus terminals. Accordingly, the pattern has shifted from single mode multimodal, network connectivity is needed gain an on-time reliable process. Practically, Solo Balapan Train Station, located in Central Java (Indonesia), one of central stat...