Search
for Topics
All Reviews
Browse All Reviews
>
Computing Methodologies (I)
>
Artificial Intelligence (I.2)
>
Problem Solving, Control Methods, And Search (I.2.8)
> Heuristic Methods (I.2.8...)
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
110 of 69 Reviews about "
Heuristic Methods (I.2.8...)
":
Date Reviewed
Mapping the global structure of TSP fitness landscapes
Ochoa G., Veerapen N. Journal of Heuristics 24(3): 265294, 2018. Type: Article
All paths through a weighted graph have a number representing the total distance traveled, called the “fitness” of the path. Suppose that each path’s fitness is “plotted” somehow such t...
Sep 27 2018
Metaheuristic approaches to the placement of suicide bomber detectors
Cotta C., Gallardo J. Journal of Heuristics 24(3): 483513, 2018. Type: Article
This paper considers the problem of placing suicide bomber detectors. The model takes into account the probability that a given detector may fail to detect bombers. In brief, the model assumes a layout of squares, some of which are blo...
Aug 6 2018
Recent developments in metaheuristics
Amodeo L., Talbi E., Yalaoui F., Springer International Publishing, New York, NY, 2017. 496 pp. Type: Book (9783319582528)
A metaheuristic is a procedure or heuristic used to discover, yield, or choose a heuristic that may furnish a decent solution to an optimization problem....
Apr 26 2018
Optimum transistor sizing of CMOS logic circuits using logical effort theory and evolutionary algorithms
Singh K., Jain A., Mittal A., Yadav V., Singh A., Jain A., Gupta M. Integration, the VLSI Journal 60 2538, 2018. Type: Article
This paper proposes a methodology for optimizing and evaluating chip designs by coupling the wellknown logical effort (LE) theory with heuristic algorithms. Complementary metal–oxide–semiconductor (CMOS)level optimization can dramati...
Mar 1 2018
Scatter search for minimizing weighted tardiness in a single machine scheduling with setups
González M., Palacios J., Vela C., HernándezArauzo A. Journal of Heuristics 23(23): 81110, 2017. Type: Article
Scatter search is a heuristic method of generating nonrandom solutions. It systematically explores the solution space by constructing new trial solutions from reference solutions using context knowledge. A standard template of the proc...
Nov 1 2017
Theory and principled methods for the design of metaheuristics
Borenstein Y., Moraglio A., Springer Publishing Company, Incorporated, Berlin, Germany, 2014. 284 pp. Type: Book (9783642332050)
In choosing to place the word “principled” in the title of this book, the editors signal their intention to address the issue of how one can devise heuristics given the “no free lunch” theorem (N...
Jul 10 2014
Exploration and exploitation in evolutionary algorithms: a survey
Črepinšek M., Liu S., Mernik M. ACM Computing Surveys 45(3): 133, 2013. Type: Article
In this survey paper, the authors tackle an important issue concerning the solution of an optimization problem using search. The paper revisits almost 100 papers in connection with exploration and exploitation in evolutionary algorithm...
Aug 21 2013
GRASP algorithms for the robust railway network design problem
GarcíaArchilla B., Lozano A., Mesa J., Perea F. Journal of Heuristics 19(2): 399422, 2013. Type: Article
In this paper, the authors address a railway network design problem (RNDP) and its robust version. The RNDP under consideration is characterized by the existence of a competing mode, and the goal is to design a network covering as many...
Jun 13 2013
A hybrid genetic algorithm for the bottleneck traveling salesman problem
Ahmed Z. ACM Transactions on Embedded Computing Systems 12(1): 110, 2013. Type: Article
The bottleneck traveling salesman problem (BTSP) refers to the challenge of finding a Hamiltonian circuit that minimizes the largest cost of any of the arcs in the circuit. This paper describes a hybrid genetic algorithm (HGA) that eff...
May 10 2013
A fast heuristic approach for largescale celltransmissionbased evacuation route planning
Kimms A., Maassen K. Networks 60(3): 179193, 2012. Type: Article
This paper follows on the work of Daganzo [1,2], who used a cell transmission model for traffic to create evacuation plans. In this model, a cell corresponds to a segment of a street and the street cells are connected into a network. A...
Jan 24 2013
Display
5
10
15
25
50
100
per page
Reproduction in whole or in part without permission is prohibited. Copyright 19992024 ThinkLoud
^{®}
Terms of Use

Privacy Policy