Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

An MINLP model to support the movement and storage decisions of the Indian food grain supply chain

Mogale, D.G., Kumar, Sri Krishna and Tiwari, Manoj Kumar 2018. An MINLP model to support the movement and storage decisions of the Indian food grain supply chain. Control Engineering Practice 70 , pp. 98-113. 10.1016/j.conengprac.2017.09.017

[img]
Preview
PDF - Accepted Post-Print Version
Download (878kB) | Preview

Abstract

This paper addresses the novel three stage food grain distribution problem of Public Distribution System (PDS) in India which comprises of farmers, procurement centers, base silos and field silos. The Indian food grain supply chain consists of various activities such as procurement, storage, transportation and distribution of food grain. In order to curb transportation and storage losses of food grain, the Food Corporation of India (FCI) is moving towards the modernized bulk food grain supply chain system. This paper develops a Mixed Integer Non-Linear Programming (MINLP) model for planning the movement and storage of food grain from surplus states to deficit states considering the seasonal procurement, silo capacity, demand satisfaction and vehicle capacity constraints. The objective function of the model seeks to minimize the bulk food grain transportation, inventory holding, and operational cost. Therein, shipment cost contains the fixed and variable cost, inventory holding and operational cost considered at the procurement centers and base silos. The developed mathematical model is computationally complex in nature due to nonlinearity, the presence of numerous binary and integer variables along with a huge number of constraints, thus, it is very difficult to solve it using exact methods. Therefore, recently developed, Hybrid Particle-Chemical Reaction Optimization (HP-CRO) algorithm has been employed to solve the MINLP model. Different problem instances with growing complexities are solved using HP-CRO and the results are compared with basic Chemical Reaction Optimization (CRO) and Particle Swarm Optimization (PSO) algorithms. The results of computational experiments illustrate that the HP-CRO algorithm is competent enough to obtain the better quality solutions within reasonable computational time.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Business (Including Economics)
Publisher: Elsevier / International Federation of Automatic Control (IFAC)
ISSN: 0967-0661
Date of First Compliant Deposit: 21 February 2020
Date of Acceptance: 25 September 2017
Last Modified: 10 Mar 2020 17:20
URI: http://orca.cf.ac.uk/id/eprint/129290

Citation Data

Cited 17 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item

Downloads

Downloads per month over past year

View more statistics