A penalty-based scaling algorithm for the multi-period multi-product distribution planning problem. Issue 4 (3rd April 2017)

• Record Type: Journal Article
• Authors: Ahmad Hosseini, S.; Şahin, Güvenç; Ünlüyurt, Tonguç
• Is Part Of: Engineering optimization. Volume 49:Issue 4(2017)
• Page Start: 583
• Page End: 596
• Publication Date: 2017-04-03
• Subjects: Network flows -- distribution planning -- nonlinear programming -- scaling algorithm -- ε-optimality; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1206474
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: Multi-period multi-product distribution planning problems are depicted as multi-commodity network flow problems where parameters may change over time. The corresponding mathematical formulation is presented for a discrete time setting, and it can also be used as an approximation for a continuous time setting. A penalty-based method which employs a cost-scaling approach is developed to solve some auxiliary penalty problems aiming to obtain an optimal solution for the original problem. The experiments on both random instances and case study problems show that the algorithm finds good-quality solutions with reasonable computational effort.