Solving fuzzy capacitated location routing problem using hybrid variable neighborhood search and evolutionary local search

Pekel, Engin; Kara, Selin Soner

doi:10.1016/j.asoc.2019.105665

Cited by 29 publications

(16 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, SLRP (e.g., Bertazzi and Maggioni, 2017;Chang et al, 2017;Saragih et al, 2019) and FLRP (e.g. Ghezavati and Morakabatchian, 2015;Zhalechian et al, 2016;Pekel and Kara, 2019) have started to receive more recognition with the presence of 5.86% and 15.32% from the total publications. This is an improvement compared to the results from Lopes et al (2013), which found only two works (1.34% from the total 149) in FLRP (Zarandi et al, 2011(Zarandi et al, , 2013 and seven (4.69% from total 149) in SLRP (Drezner et al, 1985;Liu and Lee, 2003;Liu and Lin, 2005;Albareda-Sambola et al, 2007;Shen and Qi, 2007;Ahmadi-Javid and Azad, 2010).…”

Section: Scenario Characteristicsmentioning

confidence: 99%

Location‐routing problem: a classification of recent research

Mara

Kuo

Asih

2021

Int Trans Operational Res

View full text Add to dashboard Cite

The location-routing problem (LRP) and its variants have been studied extensively over the past few years. The number of articles has grown more than ever, since the last surveys. Therefore, this study aims to perform a review of recent LRP research from 222 academic literature published from 2014 to 2019. The analysis of publication intensity, problem characteristics, solution methods, and application areas was executed to draw the state-of-the-art of LRP research. As the main contributions to this study, a new taxonomy was proposed to capture some recently emerging issues in LRP and some suggestions for future research were listed and discussed.

show abstract

Section: Scenario Characteristicsmentioning

confidence: 99%

Location‐routing problem: a classification of recent research

Mara

Kuo

Asih

2021

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…This method is the first hybrid approach combining the variable neighborhood search and integer-linear programming technique for solving the CLRP. In addition, a VNS combined with an evolutionary local search (ELS) method (VNS× ELS) was developed by [14]. This approach based on seven different neighborhood structures to improve the solution.…”

Section: Related Workmentioning

confidence: 99%

“…A new meta-heuristic algorithm based on two phases is proposed to solve the CLRP [9]. In addition, a Greedy Randomized Adaptive Search Procedure (GRASP) with a randomized version of the Clarke and Wright (CW) algorithm proposed in [14]. The same authors developed a new meta-heuristic called the Lagrangean Relaxation Granular Tabu Search (LRGTS) [7].…”

Section: Introductionmentioning

confidence: 99%

An approach based on Clustering AH and VND for Supply Chain Management

Oudouar¹,

Zaoui²

2021

IJIES

View full text Add to dashboard Cite

In this work, we present a new approach to solve the Capacitated Location-Routing Problem (CLRP). The aim of this method is to determine the depot locations, to assign customers to facilities and to define routes for each depot to serve the associated clients. The proposed approach contains two phases, which are the constructive phase and the improvement phase. In the first phase, we select the depots to be opened, allocate the customers to open depots using a Hierarchical Ascendant (HA) method and we solve the vehicle routing problem for each depot using Sweep algorithm. In the second phase, we apply a Variable Neighborhood Descent (VND) with three structures in order to optimize the cost obtained by the first phase. Two sets of well-known instances from the literature are used to evaluate the performance of this method, and the numerical results obtained are compared with the experimental results of other methods. Results show that our method is competitive with respect to the best-known solutions (BKSs) and demonstrate its efficiency in comparison with other approaches.

show abstract

“…Fuzzy numbers were used to approximate the realization of customer's demand. Pekel et al [11] formulated a chance-constrained programming model for the capacitated location-routing problem with uncertain demands being represented as triangular fuzzy numbers. Nadizadeh and Kafash [12] further discussed the fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands.…”

Section: A Background and Related Workmentioning

confidence: 99%

A Note on Two-Stage Fuzzy Location Problems Under VaR Criterion With Irregular Fuzzy Variables

Wang

Yan

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Recently, Yang et al. (Computers & Industrial Engineering, 131: 157-171, 2019) proposed a solution approach to the two-stage fuzzy location problem under the Value-at-Risk (VaR) criterion, which significantly reduced the computational complexity compared with the other approximation treatments. However, in their work, the approach was developed for cases with regular fuzzy variables, which renders it useless when dealing with other types of fuzzy parameters such as discrete fuzzy variables and trapezoidal fuzzy numbers. In this note, for the general case involving arbitrary types of fuzzy parameters, we show that the VaR of a location decision can be determined exactly by solving a corresponding deterministic linear programming. Consequently, a similar approach is developed for the generalized case. Utilizing the extended approach, we show that the discrete case presented by Yang et al. can be solved directly rather than by enumerating all possible scenarios. Furthermore, a numerical example with regular fuzzy variables studied in their work is extended to the continuous but irregular case to illustrate our extension.

show abstract

Solving fuzzy capacitated location routing problem using hybrid variable neighborhood search and evolutionary local search

Cited by 29 publications

References 26 publications

Location‐routing problem: a classification of recent research

Location‐routing problem: a classification of recent research

An approach based on Clustering AH and VND for Supply Chain Management

A Note on Two-Stage Fuzzy Location Problems Under VaR Criterion With Irregular Fuzzy Variables

Contact Info

Product

Resources

About