In this paper we present the application of the PLATFORM simulation tool to the evaluation of alternative management strategies of intermodal terminals. First, the Platform simulation tool is briefly introduced, then it is used in the context of Cost benefit Analysis and Multi Criteria Analysis to assess the impact of alternative investements in terminal management: adoption of computer based m...

In this paper, we develop a mixed-integer programming model for integrated partner selection and scheduling in an Internet-enabled dynamic manufacturing network environment. We assume that all stakeholders in the supply chain (SC) share information on their capacities, schedules, and cost structures. Based on this information, the model addresses the issue of partner selection and SC synchroniz...

We consider an inventory fulfillment-allocation and transshipment problem in an e-tailing environment. For a typical e-tailer, each customer demand is fulfilled from the closest fulfillment center if there are enough inventories. Otherwise, the e-tailer would transship stock from a nearby facility or transfer the customer order so it is fulfilled from another facility, depending on the economic...

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

There is a growing attention towards the application of Radio Frequency Identification (RFId) technology in the Fashion & Apparel supply chain. This paper describes a Lateral Trans-shipment replenishment policy enabled by item-level RFId tagging. In fact, in order to adopt a Lateral Transshipment policy, a firm should have an accurate visibility of both the inventory level in its warehouses and...

Scatter search is a population-based method that has been shown to yield high-quality outcomes for combinatorial optimization problems. It uses strategies for combining solution vectors that have proved effective in a variety of problem settings. In this paper, we present a scatter search implementation for an NP-hard variant of the classic p-hub median problem. Specifically, we tackle the unca...

We extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains special cases of the generalized transshipment problem. The result is facilitated by exploiting some special properties associated with Leontief substitution systems and observing that a feasible solution to the system, Ax = b, x > 0, in which no v...

We apply the concept of multimodularity in three stochastic dynamic inventory problems in which state and decision variables are economic substitutes. The first is clearance sales of perishable goods. The second is sourcing from multiple suppliers with different leadtimes. The third is transshipment under capacity constraints. In all three problems, we establish monotone optimal polices with bo...

As one of the most common types networks, transshipment networks face certain risks in their daily operations. This risk either stems from a deliberate intervention process or an unpredictable natural effect. The owner network normally aims to minimize total cost transportation, while rival opponent might attempt intervene and cause increase costs. Unpredictable setbacks, on other hand, can als...