Yagiura, M., T. Ibaraki. 2001. On metaheuristic algorithms for combinatorial optimization problems. Sys. Comput. Jpn. Forthcoming. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
ACO applied to Group Shop Scheduling: A case study on.. - Blum (2002) (Correct)
....commonly used for the concentration of the search process on areas in the search space with good quality solutions, whereas diversi cation denotes the action of leaving already explored areas and moving the search process to unexplored areas. As several authors point out (see for example [1, 11, 23]) a ne tuned balance between intensi cation and diversi cation is needed for a metaheuristic to achieve good results. In this paper, we propose a MAX MIN EDAs are covering several algorithms emerging from the eld of Evolutionary Computation. Ant System based on the Hyper Cube Framework ....
M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. Systems and Computers in Japan, 32(3):33-55, 2001.
A Time-Sensitive System for Black-Box Combinatorial.. - Phan, Sumazin, Skiena (2001) (1 citation) (Correct)
....is vast, encompassing dozens of books and a great number of papers. Heuristics such as simulated annealing [8] genetic algorithms [5] and tabu search [4] are particularly popular. We refer the interested reader to reviews of search heuristics for combinatorial optimization problems, including [1, 2, 18]. Our view on search algorithms has been shaped by our own combinatorial dominance theory of search, developed in [12] A review of six black box optimization systems is given by Mongeau, Karsenty, Rouz, and Hiriart Urruty [11] They tested the engines on three types of problems: least median ....
M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. The Transactions of the Institute of Electronics, Information and Communication Engineers, J83-D-1(1):3-25, 200.
A Time-Sensitive System for Black-Box Combinatorial.. - Phan, Sumazin, Skiena (2002) (1 citation) (Correct)
....is vast, encompassing dozens of books and a great number of papers. Heuristics such as simulated annealing [10] genetic algorithms [5] and tabu search [4] are particularly popular. We refer the interested reader to reviews of search heuristics for combinatorial optimization problems, including [1, 2, 20]. Our view on search algorithms has been shaped by our own combinatorial dominance theory of search, developed in [14] Johnson, Aragon, McGeoch, and Schevon [8, 9] conducted experimental evaluations of simulated annealing on graph partitioning, graph coloring and number partitioning. They found ....
M. Yagiura and T. Ibaraki. On metaheuristic algorithms for combinatorial optimization problems. The Transactions of the Institute of Electronics, Information and Communication Engineers, J83-D-1(1):3-25, 200.
Advanced Multi-Stage Local Search Applications to - Vehicle Routing Problem (Correct)
No context found.
Yagiura, M., T. Ibaraki. 2001. On metaheuristic algorithms for combinatorial optimization problems. Sys. Comput. Jpn. Forthcoming.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC