Resource title

Applying ant colony optimization to solve the single machine total tardiness problem

Resource image

image for OpenScout resource :: Applying ant colony optimization to solve the single machine total tardiness problem

Resource description

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardiness for a given set of jobs to be processed on a single, continuously available machine, the Single Machine Total Tardiness Problem. We experiment with various heuristic information as well as with variants for local search. Experiments with 250 benchmark problems with 50 and 100 jobs illustrate that Ant Colony Optimization is an adequate method to tackle the SMTTP. (author's abstract) ; Series: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"

Resource author

Andreas Bauer, Bernd Bullnheimer, Richard F. Hartl, Christine Strauß

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://epub.wu.ac.at/1368/1/document.pdf

Resource license

Adapt according to the license agreement. Always reference the original source and author.