2019
DOI: 10.1007/s10100-019-00610-7
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic approaches for solid transportation-p-facility location problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 47 publications
(24 citation statements)
references
References 32 publications
0
24
0
Order By: Relevance
“…Many researchers have worked on optimization problems and applications of computers in order to find the best solution methods . In various kinds of research, it has been shown that closed‐loop SCND belongs to NP‐hard problems.…”
Section: Solution Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Many researchers have worked on optimization problems and applications of computers in order to find the best solution methods . In various kinds of research, it has been shown that closed‐loop SCND belongs to NP‐hard problems.…”
Section: Solution Methodsmentioning
confidence: 99%
“…In addition, the amounts of pledged the period t', which is saved to release in period t (t' < t), is added to the released earnings. Equation (35) denotes the amount of pledged money in period t, which cannot exceed the total income in this period. Equation (36) shows the debt balance of purchasing raw materials.…”
Section: Financial Flow Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…The authors have proposed to solve multi-choice multi-objective transportation problem by employing the conic scalarization approach with less number of variables and with minimum computational burden (Roy et al 2017b). Whereas Das et al (2019) they studied the solid transportation-p-facility location problem (ST-p-FLP). They presented a generalization of the classical STP in which location facility sites are sought so that the total transportation cost by means of conveyances from existing facility sites to potential facility sites will be minimized.…”
Section: A Literature Reviewmentioning
confidence: 99%
“…Also, Reference applied genetic algorithm to derive a series of optimal solutions to a rough matrix game. Das et al developed two heuristic approaches to solve optimum places for the facilities and optimum transportation from.…”
Section: Introductionmentioning
confidence: 99%