Hybridizing Beam-ACO with constraint programming for single machine job scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5818 LNCS, Issue , 2009, Pages 30-44

  Thiruvady, Dhananjay ^a,c   Blum, Christian ^b   Meyer, Bernd ^a   Ernst, Andreas ^c  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANT-COLONY OPTIMIZATION; COMPUTATION TIME; CONSTRAINT PROGRAMMING; CONSTRAINT PROPAGATION; CONSTRUCTION PROCESS; FEASIBLE SOLUTION; HYBRID ALGORITHMS; INTEGRATING CONSTRAINTS; PARALLELIZING; POSSIBLE SOLUTIONS; SEARCH TREES; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE MACHINES; TIME SPENT;

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; INTEGRATION; MACHINERY; OPTIMIZATION;

CONSTRAINED OPTIMIZATION;

EID: 71049146815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04918-7_3     Document Type: Conference Paper

References (19)

1. Abramson, D., Giddy, J., Kotler, L.: High performance parametric modeling with nimrod/g: Killer application for the global grid? In: International Parallel and Distributed Processing Symposium (IPDPS), pp. 520-528. IEEE Computer Society Press, Los Alamitos (2000)
2. Ascheuer, N., Fischetti, M., Griotschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming 90, 475-506 (2001)
3. Blum, C.: Beam-ACO: hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers and Operations Research 32, 1565-1591 (2005)
4. Blum, C., Blesa, M., Roli, A., Sampels, M. (eds.): Hybrid Metaheuristics: An Emerging Approach to Optimization. Studies in Computational Intelligence, vol.114. Springer, Heidelberg (2008)
5. Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 3, 1161-1172 (2004)
6. Camazine, S., Deneubourg, J.-L., Franks, N.R., Sneyd, J., Theraulaz, G., Bonabeau, E.: Self-Organization in Biological Systems. Princeton University Press, Princeton (2001)
7. Carpaneto, G., Martello, S., Toth, P.: Algorithms and codes for the assignment problem. Annals of Operations Research 13, 193-223 (1988)
8. Coello, C.A.: Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Computer Methods in Applied Mechanics and Engineering 191, 1245-1287 (2002)
9. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
10. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)
11. Glover, F.W., Kochenberger, G.A. (eds.): Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.57. Springer, Heidelberg (2003)
12. Ĺopez-Ib́añez, M., Blum, C., Thiruvady, D., Ernst, A.T., Meyer, B.: Beam-ACO based on stochastic sampling for makespan optimization concerning the TSP with time windows. In: Evolutionary Computation in Combinatorial Optimization. LNCS, vol.5482, pp. 97-108. Springer, Heidelberg (2009)
13. Marriott, K., Stuckey, P.: Programming With Constraints. MIT Press, Cambridge (1998)
14. Meyer, B., Ernst, A.: Integrating ACO and constraint propagation. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol.3172, pp. 166-177. Springer, Heidelberg (2004)
15. Pinedo, M.L.: Planning and Scheduling in Manufacturing and Services. Springer, New York (2005)
16. Savelsbergh, M.W.P.: Local search in routing problems with time windows. Annals of Operations Research 4, 285-305 (1985)
17. St?utzle, T., Hoos, H.H.: Max-min ant system. Future Generation Computer Systems 16, 889-914 (2000)
18. Gecode Team. Gecode: Generic constraint development environment (2008), http://www.gecode.org
19. Valente, J.M.S., Alves, R.A.F.S.: Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Computers and Operations Research 35(7), 2388-2405 (2008)