Pirlot et al., 1996 - Google Patents

Simulated annealing: A tutorial

Pirlot et al., 1996

View PDF
Document ID
7638681813456199213
Author
Pirlot M
Vidal R
Publication year
Publication venue
Control and Cybernetics

External Links

Snippet

The main purpose of this paper is to provide an overview of the ideas behind simulated annealing algorithms and to outline guidelines for the construction of these algorithms. For the sake of concreteness a simple example will be discussed to illustrate both the process of …
Continue reading at www.control.ibspan.waw.pl:3000 (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5068—Physical circuit design, e.g. layout for integrated circuits or printed circuit boards
    • G06F17/5072—Floorplanning, e.g. partitioning, placement
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5045—Circuit design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models

Similar Documents

Publication Publication Date Title
Miyata et al. The blocking flow shop scheduling problem: A comprehensive and conceptual review
Siddique et al. Simulated annealing, its variants and engineering applications
Sioud et al. Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
Vidal Applied simulated annealing
Elmi et al. Cyclic job shop robotic cell scheduling problem: Ant colony optimization
Singh et al. A hybrid algorithm using particle swarm optimization for solving transportation problem
Zhao et al. A differential-based harmony search algorithm with variable neighborhood search for job shop scheduling problem and its runtime analysis
Behnamian Particle swarm optimization-based algorithm for fuzzy parallel machine scheduling
Möbius et al. Combinatorial optimization by iterative partial transcription
Tavakkoli-Moghaddam et al. Solving a dynamic cell formation problem with machine cost and alternative process plan by memetic algorithms
Jiang et al. PhyGNNet: solving spatiotemporal PDEs with physics-informed graph neural network
Liu et al. Data-driven evolutionary computation for service constrained inventory optimization in multi-echelon supply chains
Nouri et al. Controlling a single transport robot in a flexible job shop environment by hybrid metaheuristics
Chowdhury et al. Avoiding premature convergence in a mixed-discrete particle swarm optimization (MDPSO) algorithm
Pirlot et al. Simulated annealing: A tutorial
Shahookar et al. Gasp-a genetic algorithm for standard cell placement
Laskar et al. A survey on VLSI floorplanning: its representation and modern approaches of optimization
Azimi et al. AN EFFICIENT HYBRID ALGORITHM FOR DYNAMIC FACILITY LAYOUT PROBLEM USING SIMULATION TECHNIQUE AND PSO.
Ghasemishabankareh et al. A hybrid imperialist competitive algorithm for the flexible job shop problem
Kommadath et al. Scheduling of jobs on dissimilar parallel machine using computational intelligence algorithms
Malavika et al. On Token Swapping in Labeled Tree
Nikjo et al. A non-permutation flow shop manufacturing cell scheduling problem with part's sequence dependent family setup times
Kucar et al. Hypergraph partitioning techniques
Middendorf et al. An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer
Chandrasekharam et al. Genetic algorithm for embedding a complete graph in a hypercube with a VLSI application