Dynamic Scheduling and Division of Labor in Social Insects

Mike Campos; Eric Bonabeau; Guy Théraulaz; Jean‐Louis Deneubourg

doi:10.1177/105971230000800201

Abstract

A method for assigning tasks or resources, based on a model of division of labor in social insects, is introduced and applied to a dynamic flow shop scheduling problem. The problem consists of assigning trucks to paint booths in a truck facility to minimize total makespan and the number of paint flushes. Similarities between the ant-based approach and a market-based approach are high-lighted. Both systems are able to adapt well to changing conditions.

Keywords

Division of labourJob shop schedulingTruckScheduling (production processes)Computer scienceOperations researchAnt colony optimization algorithmsAnt colonyDivision (mathematics)Flow shop schedulingDistributed computingArtificial intelligenceIndustrial engineeringMathematical optimizationOperations managementEngineeringEconomicsComputer networkRouting (electronic design automation)Mathematics

Affiliated Institutions

Related Publications

An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

Luca Maria Gambardella , Marco Dorigo

We present a new local optimizer called SOP-3-exchange for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple cons...

2000 INFORMS journal on computing 367 citations

Ant colony system: a cooperative learning approach to the traveling salesman problem

Marco Dorigo , Luca Maria Gambardella

This paper introduces the ant colony system (ACS), a distributed algorithm that is applied to the traveling salesman problem (TSP). In the ACS, a set of cooperating agents calle...

1997 IEEE Transactions on Evolutionary Com... 7855 citations

Ants can solve constraint satisfaction problems

Christine Solnon

We describe a novel incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to use artifici...

2002 IEEE Transactions on Evolutionary Com... 193 citations

An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem

Alena Shmygelska , Holger H. Hoos

Abstract Background The protein folding problem is a fundamental problems in computational molecular biology and biochemical physics. Various optimisation methods have been appl...

2005 BMC Bioinformatics 261 citations

A Probabilistic Production and Inventory Problem

F. d'Epenoux

R. Howard (R. Howard.1960. Dynamic Programming and Markov Processes. John Wiley and Sons, Inc., New York.) and A. Manne (A. Manne. 1960. Linear programming and sequential decisi...

1963 Management Science 200 citations

Publication Info

Year: 2000
Type: article
Volume: 8
Issue: 2
Pages: 83-95
Citations: 127
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Dynamic Scheduling and Division of Labor in Social Insects

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

127

OpenAlex

Cite This

APA Style

                            
                                
                                    Mike Campos, 
                                
                                    Eric Bonabeau, 
                                
                                    Guy Théraulaz
                                
                                et al.
                            
                            (2000). 
                            Dynamic Scheduling and Division of Labor in Social Insects. 
                            Adaptive Behavior
                            , 8
                            (2)
                            , 83-95.
                            https://doi.org/10.1177/105971230000800201
                        

Identifiers

DOI: 10.1177/105971230000800201