Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/74246
Title: Modeling a multiperiod global supply chain network design problem with transfer pricing
Authors: Meng, Q. 
Huang, Y.
Keywords: Global supply chain
Multiperiod
Nondifferentiable
Random demand
Transfer price
Issue Date: 2006
Citation: Meng, Q.,Huang, Y. (2006). Modeling a multiperiod global supply chain network design problem with transfer pricing. 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 : 179-190. ScholarBank@NUS Repository.
Abstract: This paper addresses a novel multiperiod global supply chain network design problem that aims to maximize the after-tax profit for a multinational corporation owning plants and distribution centers located at different nations or territories. Taking into account time-dependent discounts offered by raw material suppliers, currency exchange rates, transfer prices and random demands faced by distribution centers, the multiperiod global supply chain network design problem is first formulated as a continuously but nondifferentiable optimization model that can determine the optimal solution including shipment of raw materials, distribution strategies and transfer prices. After introducing two kinds of dummy slackness variables, the model is equivalently converted to a typical continuously differentiable optimization model. Consequently, a simulated annealing method that incorporates with a local search technique is designed for solving the multiperiod global supply chain network design problem. Finally, a numerical example is carried out to evaluate the models and the solution algorithm proposed in this paper.
Source Title: 36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
URI: http://scholarbank.nus.edu.sg/handle/10635/74246
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.