Bi-objective optimization of three echelon supply chain involving truck selection and loading using NSGA-II with heuristics algorithm

Chan, Felix T. S.; Jha, Aditya; Tiwari, Manoj Kumar

doi:10.1016/j.asoc.2015.10.067

Cited by 39 publications

(18 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…They present a two-stage biobjective mixed integer stochastic programming model for providing strategic and tactical decisions, respectively, in the first and second stages to minimize costs and also the negative impact.Özceylan et al [20] develop a mixed integer nonlinear programming (MINLP) model, which optimizes the tactical decisions on balancing the decomposition lines in the reverse supply chain and the strategic decisions related to the quantity of Mathematical Problems in Engineering 3 (Table 1). However, recently other researchers have investigated this problem meticulously (e.g., [22,23]). Table 1 summarizes similar works and highlights our contribution in this study.…”

Section: Literature Reviewmentioning

confidence: 99%

A Modified Priority-Based Encoding for Design of a Closed-Loop Supply Chain Network Using a Discrete League Championship Algorithm

Ghahremani-Nahr

Kian

Rezazadeh

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In a closed-loop supply chain network, the aim is to ensure a smooth flow of materials and attaining the maximum value from returning and end-of-life goods. This paper presents a single-objective deterministic mixed integer linear programming (MILP) model for the closed-loop supply chain (CLSC) network design problem consisting of plants, collection centers, disposal centers, and customer zones. Our model minimizes the total costs comprising fixed opening cost of plants, collection, disposal centers, and transportation costs of products among the nodes. As supply chain network design problems belong to the class of NP-hard problems, a novel league championship algorithm (LCA) with a modified priority-based encoding is applied to find a near-optimal solution. New operators are defined for the LCA to search the discrete space. Numerical comparison of our proposed encoding with the existing approaches in the literature is indicative of the high quality performance of the proposed encoding.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Modified Priority-Based Encoding for Design of a Closed-Loop Supply Chain Network Using a Discrete League Championship Algorithm

Ghahremani-Nahr

Kian

Rezazadeh

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Since supply chain optimization issues include NP-hard problems, many researchers have used metaheuristic algorithms to solve large-scale problems [2,[12][13][14]. Setak et al (2016) used SA and GA algorithms to overcome an issue of concurrent pickup and distribution with semi-soft time windows [12][13][14]. Wang et al (2016) proposed an advanced cross-entropy algorithm for solving a closed-loop supply chain planning and compared the results of the problem-solving in the three algorithms of cross-entropy, GA, and advanced cross-entropy [15].…”

Section: Metaheuristic Algorithms In a Supply Chain Optimization Problemmentioning

confidence: 99%

Multi Stage Investment Planning and Customer Selection in A Two Echelon Multi-Period Supply Chain

2018

View full text Add to dashboard Cite

In the supply chain of Fast-Moving Consumer Goods (FMCG), logistics costs represent a major part of total expenses. At these low-level chains, one usually faces a Vehicle Routing Problem (VRP). In practice, however, due to the high cost of service in many cases, some customers are not selected to serve. Investment-related restrictions in many cases make it impossible to serve some of the potential customers. In such conditions, designing a supply chain network, including a location-allocation problem in the warehouse, Multiple Depot Vehicle Routing Problem (MDVRP) at the distribution level, and customer selection at the retail level in several periods of time, is considered. In this respect, in addition to certain methods that can be used in small sizes, metaheuristic algorithms have been used to solve large-scale models. With the aim of improving the performance, if not improving a few diversi cations, algorithms are temporarily enhanced; eventually, by using statistical approaches, it has been demonstrated that this method could have a signi cant impact on the quality of responses. Genetic Algorithm (GA) and Simulated Annealing (SA) algorithm have been used for this purpose.

show abstract

“…NSGA-II, düşük hesaplama karmaşıklığına sahip, hızlı ve seçkinliği dikkate alan bir algoritma olduğu için, literatürde pek çok alanda uygulaması bulunmaktadır. İşçi atama problemi [37], proje yönetimi alanında karar alternatiflerinin elde edilmesi [38], tedarik zinciri dağıtım problemi [39], çok dönemli stok kontrol problemi [40], kablosuz algılayıcı ağlarda uygun yerleşimin belirlenmesi [41] gibi pek çok problemde Pareto etkin kümenin bulunmasında NSGA-II algoritmasından yararlanılmış, algoritma sonucunda elde edilen Pareto etkin küme üzerindeki domine edilemeyen noktalar, karar vericilere çözüm alternatifleri olarak sunulmuştur. Ancak, TDP'lerinde, NSGA-II algoritmasının kullanıldığı herhangi bir çalışmaya rastlanılmamıştır.…”

Section: Nsga-ii Algori̇tmasi (Nsga-ii Algorithm)unclassified

Çok Amaçli Tek Sira Tesi̇s Düzenleme Problemi̇ni̇n Çözümü İçi̇n Nsga-Ii Ve Hedef Programlama Yaklaşimi

Durmaz¹,

Şahin²

2017

Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

Single row facility layout problem is the problem of arranging departments on a straight line. The main objective of the single row facility layout problem is to minimize the total material handling cost. However, it is not explanatory to use one objective. Hence, researchers pay more attention to model facility layout problems with qualitative and quantitative objectives. In this study, a weighted goal programming approach and a NSGA-II algorithm are proposed to solve multi-objective single row facility layout problem with the objectives of minimizing total flow distance and maximizing closeness rating scores. These objectives are taken into account for single row facility layout problem, for the first time, in this paper.

show abstract

Bi-objective optimization of three echelon supply chain involving truck selection and loading using NSGA-II with heuristics algorithm

Cited by 39 publications

References 25 publications

A Modified Priority-Based Encoding for Design of a Closed-Loop Supply Chain Network Using a Discrete League Championship Algorithm

A Modified Priority-Based Encoding for Design of a Closed-Loop Supply Chain Network Using a Discrete League Championship Algorithm

Multi Stage Investment Planning and Customer Selection in A Two Echelon Multi-Period Supply Chain

Çok Amaçli Tek Sira Tesi̇s Düzenleme Problemi̇ni̇n Çözümü İçi̇n Nsga-Ii Ve Hedef Programlama Yaklaşimi

Contact Info

Product

Resources

About