2010
DOI: 10.1016/j.advengsoft.2009.07.001
|View full text |Cite
|
Sign up to set email alerts
|

A parameter-tuned genetic algorithm for multi-product economic production quantity model with space constraint, discrete delivery orders and shortages

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0
1

Year Published

2010
2010
2023
2023

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 44 publications
(12 citation statements)
references
References 19 publications
0
11
0
1
Order By: Relevance
“…In order to deal with infeasibility, the penalty policy is applied, which is the transformation of a constrained optimization problem into an unconstrained one. It can be attained by adding or multiplying a specific amount to/by the objective function value according to the amount of obtained constraints' violations in a solution [25].…”
Section: Discussionmentioning
confidence: 99%
“…In order to deal with infeasibility, the penalty policy is applied, which is the transformation of a constrained optimization problem into an unconstrained one. It can be attained by adding or multiplying a specific amount to/by the objective function value according to the amount of obtained constraints' violations in a solution [25].…”
Section: Discussionmentioning
confidence: 99%
“…Here, it is assumed that the vendor pays the ordering and holding costs on behalf of the buyer as a part of the mentioned agreement; the buyer paying no cost. This assumption has also been taken into considerations in prior studies such as [22,26,27,35] where supply chain integration in VMI has been discussed.…”
Section: The Problem and The Assumptionsmentioning
confidence: 91%
“…Many researchers have successfully used meta-heuristic methods to solve complicated optimization problems in different fields of scientific and engineering disciplines. Some of these meta-heuristic algorithms are: simulating annealing [39,40], threshold accepting [41], Tabu search [42], genetic algorithm [35,43,44], particle swarm optimization [45][46][47][48][49][50], neural networks [51], ant colony optimization [28,52], evolutionary algorithm [53,54], harmony search [55,56] and gravitational search algorithm [57]. Among these algorithms, the population-based ones are usually preferred to others and in some cases show better performances.…”
Section: The Hybrid Solution Algorithmmentioning
confidence: 99%
“…The involved processes in central design have wide variety from manufacturing processes, to quality control or even parameter tuning in meta-heuristic algorithms (see for example Tsapatsaris and Kotzekidou 2004;Najafi et al 2009;Pasnadideh et al 2010). The CCD is the most popular and efficient class of designs used for fitting a second order model.…”
Section: Numerical Examplesmentioning
confidence: 99%