The joint replenishment of inventory problem (JRP) requires independence of minor ordering costs. In this paper we propose an evolutionary algorithm (EA) for a modification of the JRP. The modified JRP allows for interdependence of minor ordering costs. Our proposed EA (EARP) is a nested EA that searches for a solution to minimize the total cost of inventory replenishment. It combines an EA whi...

In this paper we develop an inventory model, to determine the optimal ordering quantities, for a set of two substitutable deteriorating items. In this inventory model the inventory level of both items depleted due to demands and deterioration and when an item is out of stock, its demands are partially fulfilled by the other item and all unsatisfied demand is lost. Each substituted item incurs a...

 Non-cooperative joint replenishment under asymmetric information Evren Korpeoglu, Kemal Guler, Alper Sen HP Laboratories HPL-2013-9 inventory competition; Joint replenishment; Economic order quantity model; asymmetric information; We consider jointly replenishing n ex-ante identical firms that operate under an EOQ like setting using a non-cooperative game under asymmetric information. In this...

The replenishment staggering problem is the problem of offsetting inventory replenishment cycles of several items in order to minimize the maximum required storage space and/or other storage resources. In its simplest version, inventory consumption rates are constant over time and replenishment cycle lengths are known integer multiples of a given basic period. In this paper, a simple, efficient...

This work presents the definition and solution of an optimization model using techniques based on the Particle Swarm Optimization (PSO) algorithm or the Particle Swarm Optimization and Genetic Algorithms. The model corresponds to the Joint Replenishment Problem in a system operating with quantity discounts. Results are shown in problems, where their size makes it difficult or impossible to esta...