2013
DOI: 10.5267/j.ijiec.2013.09.008
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic algorithm for a multi-product four-layer capacitated location-routing problem

Abstract: The purpose of this study is to solve a complex multi-product four-layer capacitated locationrouting problem (LRP) in which two specific constraints are taken into account: 1) plants have limited production capacity, and 2) central depots have limited capacity for storing and transshipping products. The LRP represents a multi-product four-layer distribution network that consists of plants, central depots, regional depots, and customers. A heuristic algorithm is developed to solve the four-layer LRP. The heuris… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…The heuristic algorithm has been applied for this LRP uses the same structure of the heuristic that developed for the LRP in Hamidi et al (2014). The heuristic structure and more detailed information can be found in [4].…”
Section: The Heuristic Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The heuristic algorithm has been applied for this LRP uses the same structure of the heuristic that developed for the LRP in Hamidi et al (2014). The heuristic structure and more detailed information can be found in [4].…”
Section: The Heuristic Algorithmmentioning
confidence: 99%
“…The heuristic structure and more detailed information can be found in [4]. Figure 1 showed the hierarchical structure of the decision model consisting of alternatives.…”
Section: The Heuristic Algorithmmentioning
confidence: 99%
“…According to the depth of research, LRP can be divided into deterministic LRP and uncertain LRP according to the degree of certainty of the problem, static LRP, dynamic LRP and periodic LRP according to the planning time span, and LRP without time window and LRP with time window according to the service time limit, etc. Hamidi proposed a heuristic algorithm using the Greedy Randomized Adaptive Search Procedure (GRASP) and two probabilistic tabu search strategies, intensification and diversification, to solve a complex multiproduct four-layer facility location routing problem with capacity constraints [27]. Prodhon proposed a hybrid evolutionary algorithm for solving large-scale periodic LRP instances with vehicle and warehouse capabilities which combines evolutionary local search (ELS) and a heuristic algorithm based on the randomized extended Clarke and Wright algorithm (RECWA) to generate feasible solutions [28].…”
Section: Location Routing Problem (Lrp)mentioning
confidence: 99%
“…A large body of literature also considers the multiechelon LRP (e.g., Govindan et al, 2014;Boccia et al, 2018;Hu et al, 2018;Dai et al, 2019;Darvish et al, 2019), and one of them (Mirhedayatian et al, 2019) has considered the issue of time synchronization mentioned by Drexl and Schneider (2015). A total of 13.51% works modeled the possibility of transshipment (interfacility transport) between facilities (e.g., Hamidi et al, 2014;Gianessi et al, 2016;Rahmani et al, 2016;Dukkanci and Kara, 2017;Veenstra et al, 2018;Luan et al, 2019). Overall, they all serve as positive indications that the LRP research community is considering a more holistic view, for optimizing the whole supply chain network, as well as the realistic physical characteristics which concur within the network.…”
Section: Physical Characteristicsmentioning
confidence: 99%