1997
DOI: 10.1038/sj.jors.2600781
|View full text |Cite
|
Sign up to set email alerts
|

Meta-Heuristics Theory and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
67
0
6

Year Published

1998
1998
2016
2016

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 51 publications
(73 citation statements)
references
References 0 publications
0
67
0
6
Order By: Relevance
“…Heuristics, such as Bgreedy adding,^together with sophisticated Bmetaheuristics,^such as simulated annealing, tabu search, genetic algorithms (see [88]), and heuristic concentration [89], are typically used for large problem instances or for problems that contain nonlinear expressions. Heuristics and metaheuristics, as the names imply, can guarantee only approximate solutions and may not find a global optimum.…”
Section: Solution Methodsmentioning
confidence: 99%
“…Heuristics, such as Bgreedy adding,^together with sophisticated Bmetaheuristics,^such as simulated annealing, tabu search, genetic algorithms (see [88]), and heuristic concentration [89], are typically used for large problem instances or for problems that contain nonlinear expressions. Heuristics and metaheuristics, as the names imply, can guarantee only approximate solutions and may not find a global optimum.…”
Section: Solution Methodsmentioning
confidence: 99%
“…Fourth decade (1985)(1986)(1987)(1988)(1989)(1990)(1991)(1992)(1993)(1994) This decade saw the emergence of hybrid flowshops where each stage of the flowshop could contain multiple parallel machines and the development of metaheuritics like Tabu Search, Genetic Algorithms, and Simulated Annealing (see Aarts and Lenstra (1997), Osman and Kelly (1996) and Rayward-Smith et al (1996) for illustrations of such approaches). As a result of the consideration of several objective functions and various heuristic approaches, we witnessed the expansion of efforts to solve flowshop problems with separable setups which could be either sequence independent or sequence dependent (see the reviews by Allahverdi et al (1999) and Cheng et al (2000)).…”
Section: Third Decadementioning
confidence: 99%
“…2, a non-closed form formulation, which requires metaheuristic techniques to search for near-optimal solutions. Accordingly, we use a Nondominated Sorting Genetic Algorithm-II (NSGA-II) [12] to search for the Pareto Frontier; NSGA-II have been successfully applied to search for near-optimal solutions of similar network problems [27,32,34]. We couple the NSGA-II with Monte Carlo Simulation (MCS) to account for uncertainties in the optimization process in the subsequent case study.…”
Section: Formulation Of Optimal Risk Mitigation Strategiesmentioning
confidence: 99%