2016
DOI: 10.1007/s40819-016-0155-x
|View full text |Cite
|
Sign up to set email alerts
|

Fuzzy Efficient Interactive Goal Programming Approach for Multi-objective Transportation Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(7 citation statements)
references
References 37 publications
0
7
0
Order By: Relevance
“…Overachievement of the DM goals subject to constraints is attained if d + t > 0, while underachievement means d − t > 0. When the deviations are driven to zero, the goals of the model are achieved [7,19]. A typical GP model for a min-type cost function is formulated as follows:…”
Section: The Goal Programming Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Overachievement of the DM goals subject to constraints is attained if d + t > 0, while underachievement means d − t > 0. When the deviations are driven to zero, the goals of the model are achieved [7,19]. A typical GP model for a min-type cost function is formulated as follows:…”
Section: The Goal Programming Methodsmentioning
confidence: 99%
“…The light robustness approach is structured in two stages to ensure a less conservative robust solution. The first stage considers a solution for the nominal problems (7) and (8). Subsequently, the constraints are relaxed for local violations that are absorbed by slack variables γ i , acting as measures of infeasibility for each constraint i ∈ M of the nominal problem.…”
Section: Light Robustnessmentioning
confidence: 99%
See 1 more Smart Citation
“…The basic approach for GP is to set up a specific numeric goal, under-achievement and over-achievement, respectively, wherein achievement implies that the goal has been achieved. 50 A pre-emptive GP model of the PFGP problem (3) is formulated as follows:…”
Section: The Pre-emptive Goal Programming Approach To the Pfgp-moscn mentioning
confidence: 99%
“…Therefore, a multiobjective transportation problem (MOTP) became an important optimization technique. And several researches have been carried out on MOTP such as [ 12 , 22 27 ]. An IFS is expressed by a membership function and a non-membership function, and therefore, it a better tool than FS to deal the problem involving hesitation and uncertainty both.…”
Section: Introductionmentioning
confidence: 99%