共 58 条
A multi-period inventory transportation model for tactical planning of food grain supply chain
被引:69
作者:
Mogale, D. G.
[1
]
Dolgui, Alexandre
[2
]
Kandhway, Rishabh
[1
]
Kumar, Krishna
[1
]
Tiwari, Manoj Kumar
[1
]
机构:
[1] Indian Inst Technol Kharagpur, Dept Ind & Syst Engn, Kharagpur 721302, W Bengal, India
[2] CNRS, IS2N, IMT Atlantique, UMR 6004, BP 20722, F-44307 Nantes 3, France
关键词:
Distribution system;
Supply chain management;
Inventory;
Transportation;
Mixed integer non-linear programming;
Ant colony optimization;
ANT COLONY OPTIMIZATION;
GENETIC ALGORITHM;
BEAM SEARCH;
SYSTEM;
MANAGEMENT;
ALLOCATION;
LOGISTICS;
STORAGE;
DESIGN;
ACO;
D O I:
10.1016/j.cie.2017.06.008
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
The food grain supply chain problem of the Public Distribution System (PDS) of India is addressed in this paper to satisfy the demand of the deficit Indian states. The problem involves the transportation of bulk food grain by capacitated vehicles from surplus states to deficit states through silo storage. A mixed integer non-linear programming (MINLP) model is formulated which seeks to minimize the overall cost including bulk food grain shipment, storage, and operational cost. The model incorporates the novel vehicle preference constraints along with the seasonal procurement, silo storage, vehicle capacity and demand satisfaction restrictions. The management of Indian food grain supply chain network is more intricate and difficult issue due to many uncertain interventions and its chaotic nature. To tackle the aforementioned problem an effective meta-heuristic which based on the strategy of sorting elite ants and pheromone trail updating called Improved Max-Min Ant System (IMMAS) is proposed. The solutions obtained through IMMAS is validated by implementing the Max-Min Ant System (MMAS). A sensitivity analysis has been performed to visualize the effect of model parameters on the solution quality. Finally, the statistical analysis is carried out for confirming the superiority of the proposed algorithm over the other. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:379 / 394
页数:16
相关论文