We consider a two-stage supply chain, in which multi-items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item-dependent variable ship...

Joint replenishment problem (JRP) is a common real problem which aims to minimize order cost and inventory holding cost. In this paper, classical, centralized and decentralized JRP models are discussed. An innovative heuristic to minimize the total cost is implemented for each model. This heuristic seeks to balance the order cost and the inventory holding costs. The results show that the innova...

In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...

in this paper, matlab code for a recently developed meta-heuristic methodology, the vibrating particles system (vps) algorithm, is presented. the vps is a population-based algorithm which simulates a free vibration of single degree of freedom systems with viscous damping. the particles gradually approach to their equilibrium positions that are achieved from current population and historically b...

Purpose of study: Main aim this study is to deals with the problem inventories. Their holding cost, set-up and many more related that. All problems are flexible having fuzzy nature.
 Methodology: The model takes form a Geometric Programming problem. Hence geometric programming algorithm used here.
 Finding: developed models may be for single item constraint limitation on storage area ...

it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...

The ability to discover equilibrium prices efficiently makes auctions an effective way to trade goods. One of the recent trends in the development of auctions is combinatorial auctions. Combinatorial auctions allow the simultaneous sale of more than one item. In the existing literature, the factor of transportation cost has not been considered in combinatorial auctions. In this paper, we formul...

We consider a class of knapsack problems that include setup costs for families of items. An individual item can be loaded into the knapsack only if a setup cost is incurred for the family to which it belongs. A mixed integer programming formulation for the problem is provided along with exact and heuristic solution methods. The exact algorithm uses cross decomposition. The proposed heuristic gi...

wireless sensor networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as wireless. the main goal of these networks is collecting data from neighboring environment of network sensors. since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...