2019
DOI: 10.1016/j.matpr.2019.05.195
|View full text |Cite
|
Sign up to set email alerts
|

GREEDYALGORITHM FOR INVENTORY ROUTING PROBLEM IN A SUPPLY CHAIN-A Review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 23 publications
0
5
0
Order By: Relevance
“…Similarly, Refs. [18][19][20][21][22][23][24] are reviews of IRP models and classification of solutions; Refs. [21,22] both proposed the concept of sustainable logistics management.…”
Section: Previous Review Papersmentioning
confidence: 99%
See 2 more Smart Citations
“…Similarly, Refs. [18][19][20][21][22][23][24] are reviews of IRP models and classification of solutions; Refs. [21,22] both proposed the concept of sustainable logistics management.…”
Section: Previous Review Papersmentioning
confidence: 99%
“…Classified according to time horizon and structure. 1983-2013 41 [24] Summarized the comparison of three algorithms for solving a certain IRP. 1997-2014 26 [25] Reviewed the IRP for determining the demand rate of single-depot multi-retailer.…”
Section: Previous Review Papersmentioning
confidence: 99%
See 1 more Smart Citation
“…The advantage of this application is that the most time-consuming task to optimize is the search and location of points, then the application very quickly designs its own routes, which can operate the selected network. Essentially, this application works on the principle of the Greedy algorithm, which is described, for instance, in [39]. For route A, the application proposed the order of the points which is shown in the following Figure 4.…”
Section: Optimization Of Initial Routes Using the Routin Applicationmentioning
confidence: 99%
“…For route A, the application proposed the order of the points which is shown in the following Figure 4. It is now necessary to compare the route thus obtained with the initial route and to determine the order of points as shown in a previous study [39]. From the initial matrix, it is then necessary to find the length and operating time of the selected route [40].…”
Section: Optimization Of Initial Routes Using the Routin Applicationmentioning
confidence: 99%