[go: up one dir, main page]

Lodi et al., 1999 - Google Patents

An evolutionary heuristic for quadratic 0–1 programming

Lodi et al., 1999

Document ID
11554924591881834967
Author
Lodi A
Allemand K
Liebling T
Publication year
Publication venue
European Journal of Operational Research

External Links

Snippet

In this paper we present a heuristic algorithm for the well-known Unconstrained Quadratic 0– 1 Programming Problem. The approach is based on combining solutions in a genetic paradigm and incorporates intensification algorithms used to improve solutions and speed …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • 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/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • 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
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • 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
    • 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/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/58—Random or pseudo-random number generators
    • 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
    • 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
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering

Similar Documents

Publication Publication Date Title
Lodi et al. An evolutionary heuristic for quadratic 0–1 programming
Kadioglu et al. ISAC-Instance-Specific Algorithm Configuration.
Staudt et al. Engineering high-performance community detection heuristics for massive graphs
Boston et al. Combining tabu search and genetic algorithm heuristic techniques to solve spatial harvest scheduling problems
Burke et al. A survey of hyper-heuristics
US8924341B2 (en) Method and system for optimizing mixed integer programming solutions
Gebruers et al. Using CBR to select solution strategies in constraint programming
Weise et al. Frequency fitness assignment: Optimization without bias for good solutions can be efficient
Weise et al. Frequency fitness assignment: Making optimization algorithms invariant under bijective transformations of the objective function value
Kaveh Chaos embedded metaheuristic algorithms
Urošević et al. Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
Van Deusen Scheduling spatial arrangement and harvest simultaneously
Koohestani et al. A hyper-heuristic approach to evolving algorithms for bandwidth reduction based on genetic programming
Aalvanger et al. Heuristics in permutation gomea for solving the permutation flowshop scheduling problem
Pope et al. Evolving random graph generators: A case for increased algorithmic primitive granularity
Zelinka et al. Controlling complexity
Boukhari et al. A study on self-adaptation in the evolutionary strategy algorithm
Perera et al. Multi-objective evolutionary approaches for the knapsack problem with stochastic profits
Liu et al. An empirical study of building compact ensembles
Qian et al. A hybrid differential evolution algorithm for the multi-objective reentrant job-shop scheduling problem
Barbucha et al. JABAT middleware as a tool for solving optimization problems
Jędrzejowicz et al. Reinforcement learning strategy for solving the resource-constrained project scheduling problem by a team of a-teams
Middendorf et al. An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer
Bosman A solution merging heuristic for the steiner problem in graphs using tree decompositions
Meuwly et al. Solution methods for a scheduling problem with incompatibility and precedence constraints