2003
DOI: 10.1007/978-3-540-24580-3_9
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Logistic Processes in Supply-Chains Using Meta-heuristics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2005
2005
2015
2015

Publication Types

Select...
3
3

Relationship

2
4

Authors

Journals

citations
Cited by 18 publications
(17 citation statements)
references
References 8 publications
0
17
0
Order By: Relevance
“…This problem is NP-Hard (Silva et al, 2003), therefore we use meta-heuristics, like GA and ACO, to optimize it. In principle, GA will perform well, since the optimization concerns the selection of a best set of items.…”
Section: The Scheduling Problem Consists Of Optimizing Daily the Costmentioning
confidence: 99%
See 1 more Smart Citation
“…This problem is NP-Hard (Silva et al, 2003), therefore we use meta-heuristics, like GA and ACO, to optimize it. In principle, GA will perform well, since the optimization concerns the selection of a best set of items.…”
Section: The Scheduling Problem Consists Of Optimizing Daily the Costmentioning
confidence: 99%
“…However, to analyze the performance of the logistic system, it is necessary to consider a larger time window (weeks/months). In this case, we consider a sequence of 30 days in order to compare both methodologies, as described in (Silva et al, 2003). Table 2 presents the results in terms of best result, mean result and standard deviation.…”
Section: Comparison For the Logistic Problemmentioning
confidence: 99%
“…To solve such hard problems, a new kind of algorithm has emerged which aimed at efficiently and effectively exploring a search space. In recent years, metaheuristic algorithms such as, Evolutionary Computation, Simulated Annealing, Tabu Search, Particle Swarm Optimization (PSO), and others, have been applied to various logistics optimization problem as a successful alternative to classical approaches (Silva et al, 2003) (Altiparmak et al, 2006). All metaheuristics share the elements of selecting candidate solution(s) from a neighbourhood of the current solution(s) and move at each iteration towards 'good solutions' in the search space (Olaffson, 2006).…”
Section: Introductionmentioning
confidence: 99%
“…A fitness function is used to evaluate individuals, and reproductive success varies with fitness. Here, we used the algorithm and parameters presented in [7], 5 Model of the logistic process Fig. 2 presents a schematic view of the analyzed logistic process, that can be described in probabilistic terms.…”
Section: Other Optimization Algorithms Used In Schedulingmentioning
confidence: 99%
“…In order to avoid large volumes of stocks and to minimize the number of delayed orders, the scheduling program assigns components to orders every day, not considering their order of arrival but their volumes, requirements and dates of delivery. The objective function used is presented in [7], We impose as the most important objective that the highest number of orders is delivered at the correct date, although we consider also important to have a small tardiness variance (TJT) of the remaining orders. Thus, the objective function is given by 1…”
Section: (4)mentioning
confidence: 99%