Le Digabel, Sébastien
|Title:||Exact and heuristic solutions of the global supply chain problem with transfer pricing||Journal:||European Journal of Operational Research||Volume:||202||Issue:||3||First page:||864||Last page:||879||Issue Date:||1-May-2010||Rank:||M21a||ISSN:||0377-2217||DOI:||10.1016/j.ejor.2009.06.018||Abstract:||
We examine the example of a multinational corporation that attempts to maximize its global after tax profits by determining the flow of goods, the transfer prices, and the transportation cost allocation between each of its subsidiaries. Vidal and Goetschalckx [Vidal, C.J., Goetschalckx, M., 2001. A global supply chain model with transfer pricing and transportation cost allocation. European Journal of Operational Research 129 (1), 134-158] proposed a bilinear model of this problem and solved it by an Alternate heuristic. We propose a reformulation of this model reducing the number of bilinear terms and accelerating considerably the exact solution. We also present three other solution methods: an implementation of Variable Neighborhood Search (VNS) designed for any bilinear model, an implementation of VNS specifically designed for the problem considered here and an exact method based on a branch and cut algorithm. The solution methods are tested on artificial instances. These results show that our implementation of VNS outperforms the two other heuristics. The exact method found the optimal solution of all small instances and of 26% of medium instances.
|Keywords:||Alternate heuristic | Bilinear programming | Branch and cut | Metaheuristics | Supply chain management | Transfer pricing||Publisher:||Elsevier||Project:||Natural Sciences and Engineering Research Council of Canada, Grant nos. 327435-06 and 105574-02
Serbian Ministry of Sciences, Project No. 144007
Show full item record
checked on Dec 2, 2021
checked on Dec 3, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.