Genetic branch-and-bound or exact genetic algorithm?

Authors:
C. Pessan;J.-L. Bouquard;E. Néron
Affiliations:
LI, Université François Rabelais Tours, Tours, France and SKF France SA, Industrial division, MDGBB Factory, Saint-Cyr-sur-Loire Cedex, France;LI, Université François Rabelais Tours, Tours, France;LI, Université François Rabelais Tours, Tours, France
Venue:
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Year:
2007

Citing 5
Cited 2

`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications

Journal of the ACM (JACM)
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming

Journal of the ACM (JACM)
Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems

Journal of Heuristics
Optimal parallel machines scheduling with availability constraints

Discrete Applied Mathematics
Combining metaheuristics and exact algorithms in combinatorial optimization: a survey and classification

IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II

A cooperative tree-based hybrid GA-B&B approach for solving challenging permutation-based problems.

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Single-machine multi-agent scheduling problems with a global objective function

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

Production resettings is a vital element of production flexibilityand optimizing the setup tasks scheduling within a productionchannel is required to improve production rate. This paper deals with aNP-Hard production resetting optimization problem based on an industrialcase. In this paper we present how to hybrid a Branch-and-Bound method for this problem with a genetic algorithm. The idea is to use thegenetic algorithm to improve the upper bound and thus speeding up theBranch-and-Bound while the genetic algorithm uses the content of theBranch-and-Bound stack to reduce its search space. Both methods arerunning in parallel and are therefore collaborating together.