A penalty-based scaling algorithm for the multi-period multi-product distribution planning problem
Hosseini, Seyed Ahmad and Şahin, Güvenç and Ünlüyurt, Tonguç (2017) A penalty-based scaling algorithm for the multi-period multi-product distribution planning problem. Engineering Optimization, 49 (4). pp. 583-596. ISSN 0305-215X (Print) 1029-0273 (Online)
This is the latest version of this item.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1080/0305215X.2016.1206474
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.
Available Versions of this Item
Repository Staff Only: item control page