Hybrid heuristics for multimodal homecare scheduling

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

Volumn 7298 LNCS, Issue , 2012, Pages 339-355

  Rendl, Andrea ^a   Prandtstetter, Matthias ^a   Hiermann, Gerhard ^b   Puchinger, Jakob ^a   Raidl, Günther ^b  

^a AIT AUSTRIAN INSTITUTE OF TECHNOLOGY   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EXPERIMENT; CONSTRAINT PROGRAMMING; DIFFERENT MODES; HOMECARE; HYBRID APPROACH; HYBRID HEURISTICS; HYBRID SOLUTION METHODS; HYPERHEURISTIC; INITIAL SOLUTION; META-HEURISTIC APPROACH; MULTI-MODAL; PROBLEM INSTANCES; SCATTER SEARCH; VARIABLE NEIGHBORHOOD SEARCH;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; SCHEDULING; SIMULATED ANNEALING;

CONSTRAINT THEORY;

EID: 84861435805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-29828-8_22     Document Type: Conference Paper

References (21)

1. Ahuja, R.K., Orlin, J.B., Sharma, D.: Very large-scale neighborhood search. International Transactions in Operational Research 7(4-5), 301-317 (2000)
2. Bai, R., Blazewicz, J., Burke, E.K., Kendall, G., Mccollum, B.: A simulated annealing hyper-heuristic methodology for flexible decision support. Tech. rep., School of Computer Science, University of Nottingham, England (2006)
3. Bai, R., Burke, E.K., Kendall, G., Li, J., McCollum, B.: A hybrid evolutionary approach to the nurse rostering problem. IEEE Transactions on Evolutionary Computation 14(4), 580-590 (2010)
4. Bertels, S., Fahle, T.: A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem. Comput. Oper. Res. 33, 2866-2890 (2006)
5. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Science 39(1), 104- 118 (2005)
6. Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part ii: Metaheuristics. Transportation Science 39(1), 119-139 (2005)
7. Burke, E.K., Curtois, T., Qu, R., Berghe, G.V.: A scatter search approach to the nurse rostering problem. Journal of the Operational Research Society 61(11), 1667-1679 (2010)
8. Burke, E.K., De Causmaecker, P., Berghe, G.V., Van Landeghem, H.: The state of the art of nurse rostering. Journal of Scheduling 7, 441-499 (2004)
9. Eveborn, P., Flisberg, P., Ronnqvisb, M.: Laps care - an operational system for staff planning. European Journal of Operational Research 171, 962-976 (2006)
10. Gent, I., Walsh, T.: CSPlib: A benchmark library for constraints. Tech. rep., Technical report APES-09-1999 (1999), http://csplib.cs.strath.ac.uk/; A shorter version appears in: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 480-481. Springer, Heidelberg (1999)
11. Glover, F., Laguna, M., Mart, R.: Fundamentals of scatter search and path relinking. Control and Cybernetics 39, 653-684 (2000)
12. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston (1989)
13. Hansen, P., Mladenovíc, N.: Variable neighborhood search. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 145-184. Kluwer Academic Publisher, New York (2003)
14. Krzysztof, K., Szymanek, R.: Jacop java constraint solver (December 2011), http://www.jacop.eu
15. Moscato, P.: Memetic algorithms: a short introduction, pp. 219-234. McGraw-Hill Ltd., Maidenhead (1999)
16. Nikolaev, A.G., Jacobson, S.H.: Simulated annealing. In: Gendreau, M., Potvin, J.Y., Hillier, F.S. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146, pp. 1-39. Springer (2010)
17. Prandtstetter, M., Raidl, G.R., Misar, T.: A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 25-36. Springer, Heidelberg (2009)
18. Rasmussen, M.S., Justesen, T., Dohn, A., Larsen, J.: The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. Tech. Rep. 11-2010, DTU Management Engineering (May 2010)
19. Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., New York (2006)
20. Steeg, J., Schröder, M.: A hybrid approach to solve the periodic home health care problem. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings 2007. Operations Research Proceedings, vol. 2007, pp. 297-302. Springer, Heidelberg (2008)
21. Whitley, D., Kauth, J.: Genitor: A different genetic algorithm. In: Proc. of the Rocky Mountain Conf. on Artificial Intelligence, pp. 118-130 (1988)