scholarly journals Meta-heuristic algorithms for solving the sustainable agro-food grain supply chain network design problem

2020 ◽  
Vol 2 (3) ◽  
pp. 161-177 ◽  
Author(s):  
Ashish Dwivedi ◽  
Ajay Jha ◽  
Dhirendra Prajapati ◽  
Nenavath Sreenu ◽  
Saurabh Pratap

PurposeDue to unceasing declination in environment, sustainable agro-food supply chains have become a topic of concern to business, government organizations and customers. The purpose of this study is to examine a problem associated with sustainable network design in context of Indian agro-food grain supply chain.Design/methodology/approachA mixed integer nonlinear programming (MINLP) model is suggested to apprehend the major complications related with two-echelon food grain supply chain along with sustainability aspects (carbon emissions). Genetic algorithm (GA) and quantum-based genetic algorithm (Q-GA), two meta-heuristic algorithms and LINGO 18 (traditional approach) are employed to establish the vehicle allocation and selection of orders set.FindingsThe model minimizes the total transportation cost and carbon emission tax in gathering food grains from farmers to the hubs and later to the selected demand points (warehouses). The simulated data are adopted to test and validate the suggested model. The computational experiments concede that the performance of LINGO is superior than meta-heuristic algorithms (GA and Q-GA) in terms of solution obtained, but there is trade-off with respect to computational time.Research limitations/implicationsIn literature, inadequate study has been perceived on defining environmental sustainable issues connected with agro-food supply chain from farmer to final distribution centers. A MINLP model has been formulated as practical scenario for central part of India that captures all the major complexities to make the system more efficient. This study is regulated to agro-food Indian industries.Originality/valueThe suggested network design problem is an innovative approach to design distribution systems from farmers to the hubs and later to the selected warehouses. This study considerably assists the organizations to design their distribution network more efficiently.

2021 ◽  
Author(s):  
Ovidiu Cosma ◽  
Petrică C Pop ◽  
Cosmin Sabo

Abstract In this paper we investigate a particular two-stage supply chain network design problem with fixed costs. In order to solve this complex optimization problem, we propose an efficient hybrid algorithm, which was obtained by incorporating a linear programming optimization problem within the framework of a genetic algorithm. In addition, we integrated within our proposed algorithm a powerful local search procedure able to perform a fine tuning of the global search. We evaluate our proposed solution approach on a set of large size instances. The achieved computational results prove the efficiency of our hybrid genetic algorithm in providing high-quality solutions within reasonable running-times and its superiority against other existing methods from the literature.


Sign in / Sign up

Export Citation Format

Share Document