Determining the minimum number of units is an important step in heat exchanger network synthesis (HENS). The MILP transshipment model (Papoulias and Grossmann, 1983) and transportation model (Cerda and Westerberg, 1983b) were developed for this purpose. However, they are computationally expensive when solving for large-scale problems. Several approaches are studied in this paper to enable the f...

The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has been to coordinate transshipment activities across the chain aimed at reducing costs and increasing service levels in the face of a range of factors, including demand fluctuations, short lead times, warehouse limitations and trans...

Corresponding Author: Naragain Phumchusri Department of Industrial Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, Thailand Email: [email protected] Abstract: Transshipments and stopovers are considered to be an effective method to reduce traveling distance where a transportation job can be served by two vehicles: One picks up a load and drops it at a transshipment ...

A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of th...

In this paper we present the essential features of an approach for the design of a parallel algorithm for the layout compaction problem. We begin with a formulation of the problem presented by Yoshimura in [4]. This formulation is in terms of the dual transshipment problem. Our approach t o the solution of the dual transshipment problem involves repeated applications of three basic steps, namel...

We consider the stochastic capacitated transshipment problem for freight transportation where an optimal location of the transshipment facilities, which minimizes the total cost, must be found. The total cost is given by the sum of the total fixed cost plus the expected minimum total flow cost, when the throughput costs of the facilities are random variables with unknown probability distributio...

We study a newsvendor game with transshipments, in which n retailers face a stochastic demand for an identical product. Before the demand is realized, each retailer independently orders her initial inventory. After the demand is realized, the retailers select an optimal transshipment pattern and ship residual inventories in order to meet residual demands. Unsold inventories are salvaged at the ...

Unlike the Newsvendor model, a system based on lateral transshipments allows the unsold inventories to be moved from locations with surplus inventory to fulfill more unmet demands at stocked out locations. Both models were thoroughly studied and researches were usually confined to cost minimization or profit maximization. In this paper, we proposed a more realistic multiobjective study of both ...