排序方式: 共有16条查询结果,搜索用时 0 毫秒
11.
Yugang Yu Zhaofu Hong Linda L. Zhang Liang Liang Chengbin Chu 《European Journal of Operational Research》2013
A Vendor Managed Inventory (VMI) system consists of a manufacturing vendor and a number of retailers. In such a system, it is essential for the vendor to optimally determine retailer selection and other related decisions, such as the product’s replenishment cycle time and the wholesale price, in order to maximize his profit. Meanwhile, each retailer’s decisions on her willingness to enter the system and retail price are simultaneously considered in the retailer selection process. However, the above interactive decision making is complex and the available studies on interactive retailer selection are scarce. In this study, we formulate the retailer selection problem as a Stackelberg game model to help the manufacturer, as a vendor, optimally select his retailers to form a VMI system. This model is non-linear, mixed-integer, game-theoretic, and analytically intractable. Therefore, we further develop a hybrid algorithm for effectively and efficiently solving the developed model. The hybrid algorithm combines dynamic programming (DP), genetic algorithm (GA) and analytical methods. As demonstrated by our numerical studies, the optimal retailer selection can increase the manufacturer’s profit by up to 90% and the selected retailers’ profits significantly compared to non-selection strategy. The proposed hybrid algorithm can solve the model within a minute for a problem with 100 candidate retailers, whereas a pure GA has to take more than 1 h to solve a small sized problem of 20 candidate retailers achieving an objective value no worse than that obtained by the hybrid algorithm. 相似文献
12.
Shiwei He Sohail S. Chaudhry Zhonglin Lei Wang Baohua 《Annals of Operations Research》2009,168(1):169-179
We study a vendor selection problem in which the buyer allocates an order quantity for an item among a set of suppliers such
that the required aggregate quality, service, and lead time requirements are achieved at minimum cost. Some or all of these
characteristics can be stochastic and hence, we treat the aggregate quality and service as uncertain. We develop a class of
special chance-constrained programming models and a genetic algorithm is designed for the vendor selection problem. The solution
procedure is tested on randomly generated problems and our computational experience is reported. The results demonstrate that
the suggested approach could provide managers a promising way for studying the stochastic vendor selection problem.
The authors would like to thank the referees for providing constructive comments that led to an improved version of the paper.
Also, this research was partially supported by grants from National Natural Science Foundation (60776825)—China, 863 Programs
(2007AA11Z208)—China, Doctorate Foundation (20040004012)—China, Villanova University Research Sabbatical Fall 2006, and the
National Science Foundation (0332490)—USA. 相似文献
13.
This paper discusses how a manufacturer and its retailers interact with each other to optimize their product marketing strategies, platform product configuration and inventory policies in a VMI (Vendor Managed Inventory) supply chain. The manufacturer procures raw materials from multiple suppliers to produce a family of products sold to multiple retailers. Multiple types of products are substitutable each other to end customers. The manufacturer makes its decision on raw materials’ procurement, platform product configuration, product replenishment policies to retailers with VMI, price discount rate, and advertising investment to maximize its profit. Retailers in turn consider the optimal local advertising investments and retail prices to maximize their profits. This problem is modeled as a dual simultaneous non-cooperative game (as a dual Nash game) model with two sub-games. One is between the retailers serving in competing retail markets and the other is between the manufacturer and the retailers. This paper combines analytical, iterative and GA (genetic algorithm) methods to develop a game solution algorithm to find the Nash equilibrium. A numerical example is conducted to test the proposed model and algorithm, and gain managerial implications. 相似文献
14.
Nishant Kumar Verma Abhishek Chakraborty Ashis K. Chatterjee 《European Journal of Operational Research》2014
In the recent article, Darwish and Odah (2010) develop a scheme that allows for identical replenishment cycles for all the retailers, in the context of a single vendor supplying a group of retailers under VMI partnership. This paper proposes an alternative replenishment scheme allowing for different replenishment cycles for each retailer. An example has been shown to illustrate the cost savings under the proposed model. 相似文献
15.
An Approach for Strategic Supply Chain Planning under Uncertainty based on Stochastic 0-1 Programming 总被引:8,自引:0,他引:8
A. Alonso-Ayuso L.F. Escudero A. Garín M.T. Ortuño G. Pérez 《Journal of Global Optimization》2003,26(1):97-124
We present a two-stage stochastic 0-1 modeling and a related algorithmic approach for Supply Chain Management under uncertainty, whose goal consists of determining the production topology, plant sizing, product selection, product allocation among plants and vendor selection for raw materials. The objective is the maximization of the expected benefit given by the product net profit over the time horizon minus the investment depreciation and operations costs. The main uncertain parameters are the product net price and demand, the raw material supply cost and the production cost. The first stage is included by the strategic decisions. The second stage is included by the tactical decisions. A tight 0-1 model for the deterministic version is presented. A splitting variable mathematical representation via scenario is presented for the stochastic version of the model. A two-stage version of a Branch and Fix Coordination (BFC) algorithmic approach is proposed for stochastic 0-1 program solving, and some computational experience is reported for cases with dozens of thousands of constraints and continuous variables and hundreds of 0-1 variables. 相似文献
16.
Birger Raa 《4OR: A Quarterly Journal of Operations Research》2008,6(1):97-100
This is a summary of the author’s PhD thesis supervised by El-Houssaine Aghezzaf and defended on 4 December 2006 at the Universiteit
Gent. The thesis is written in English and is electronically available from http://ir18.ugent.be/birger.raa/. This work studies
the problem of finding optimal three-way cost trade-offs between vehicle fleet costs, distribution costs and holding costs
in the cyclic replenishment of a set of customers with constant demand rates from a single depot.
相似文献