Design a Supply Chain Network based on Lean, agile and pivotal values and solving by multi objective metaheuristic algorithms
(ندگان)پدیدآور
Hassan pour, Hossein Alijabale, mortezaنوع مدرک
TextResearch Paper
زبان مدرک
Englishچکیده
In this research, a three objective (lean, agile, pivotal values) nonlinear integer programming mathematical model is proposed to optimize general commodities supply chain in this model, all parameters for objective functions and restrictions are assumed to have fixed and known values. Proposed model have three objective functions including: minimizing transportation costs, delivery tardiness and making contracts. Maximizing agility and pivotal values. Intended model designs a lean, agile and value supply chain network. This network consists of Producers, Distributers and Customers that which indexes and criteria values and agility is assumed for producers and distributers. To solve the model, first suitable weights for agility and observance the value for producers and distributers are examined using multi-criteria decision making. These weights and other problem parameters are input data for proposed mathematical model. Proposed mathematical model is solved in a case-study form using GAMS program. Then two multi objective meta heuristic algorithms including genetic algorithm and Frog leaping algorithm using non dominated sorting is proposed and Meta heuristic algorithms and GAMS`s results are Compared to Validate proposed algorithms. Results of two algorithms NSGA-II and NSMOSFLA for comparing criteria`s of multi objective algorithms are Analyzed.
کلید واژگان
Lean Supply Chain- Agile- ValueNonlinear integer mathematical model
NSGA-II
NSMOSFLA
Logistics and Supply Chain and Inventory Control
شماره نشریه
3تاریخ نشر
2018-10-011397-07-09
ناشر
University of Tehranسازمان پدید آورنده
Department of Industrial Engineering and Logistics, Faculty of Engineering, Imam Hossein Comprehensive University, Tehran, IranIndustrial Engineering Group, Imam Hossein University, Tehran, Iran
شاپا
2423-68962423-6888




