The multi-transshipment problem is NP-hard already for two commodities over bipartite networks. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the polynomial time solvability of the problem in two broad situations. First, for any fixed number of commodities and number of suppliers, we solve the problem over bipartite ...

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...

In order to be competitive companies need to take advantage of synergetic interactions between different decision areas. Two of these are related to the distribution and inventory management processes. Inventory-Routing Problems (IRPs) arise when inventory and routing decisions must be taken simultaneously, which yields a difficult combinatorial optimization problem. In this paper, we propose a...

Firms with omni-channel multi-echelon distribution networks (OMDC) integrate all of their sale channels and echelons to achieve an effective matching multi-type orders a shared inventory. However, the high operational cost caused by insufficient use inventory resources unreasonable order allocation restricts sustainable development firms. To this end, joint decisions optimization (IO) (OA) are ...

In the retail industry, stockouts have a significant effect on a firm's profitability. When a stockout takes place, retailers often apply one of two strategies to resolve the issue – placing an emergency order with their supplier or arranging a lateral transshipment with a nearby partner store. Choosing the optimal response to a stockout is complicated by customers' spontaneous reactions. Custo...

Solving transshipment problems to optimality is difficult, unless several simplifying hypotheses are assumed (such as unit-sized customer demands and replenishments, negligible replenishment lead time, etc.). For this reason, some heuristics have been recently proposed in order to provide rules, which incorporate relevant factors of the problem, to find conditions under which it makes sense to ...

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...