Advertisement

A User Experiment on Interactive Reoptimization Using Iterated Local Search

  • David MeignanEmail author
Chapter
  • 645 Downloads
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 62)

Abstract

This article presents an experimental study conducted with subjects on an interactive reoptimization method applied to a shift scheduling problem . The studied task is the adjustment, by a user, of candidate solutions provided by an optimization system in order to introduce a missing constraint. Two procedures are compared on this task. The first one is a manual adjustment of solutions assisted by a software that dynamically computes the cost of the current solution. The second procedure is based on reoptimization. For this procedure, the user defines some desired changes on a solution, and then a reoptimization method is applied to integrate the changes and reoptimize the rest of the solution. This process is iterated with additional desired changes until a satisfactory solution is obtained. For this interactive approach, the proposed reoptimization procedure is an iterated local search metaheuristic. The experiment, conducted with 16 subjects, provides a quantitative evaluation of the manual and reoptimization approaches. The results show that, even for small local adjustments, the manual modification of a solution has an important impact on the quality of the solution. In addition, the experiment demonstrates the efficiency of the interactive reoptimization approach and the adequacy of the iterated local search method for reoptimizing solutions. Finally, the experiment revealed some limitations of interactive reoptimization that are discussed in this article.

Keywords

Interactive optimization Shift scheduling Heuristic Reoptimization 

Notes

Acknowledgements

This work was supported by the Deutsche Forschungsgemeinschaft (DFG), under grant ME 4045/2-1, for the project “Interactive metaheuristics for optimization-based decision support systems”. I acknowledge the support of Google, through the Google Focused Grant Program on “Mathematical Optimization and Combinatorial Optimization in Europe” (2012), which allowed us to initiate this study. I want to thank Sigrid Knust for her support throughout the project.

References

  1. 1.
    D. Anderson, E. Anderson, N. Lesh, J. Marks, B. Mirtich, D. Ratajczak, K. Ryall, Human-guided simple search, in AAAI 2000, pp. 209–216 (2000)Google Scholar
  2. 2.
    G. Ausiello, V. Bonifaci, B. Escoffier, Complexity and approximation in reoptimization, in Computability in Context: Computation and Logic in the Real World (Imperial College Press, London, 2007), pp. 101–129. ISBN:978-1-84816-245-7Google Scholar
  3. 3.
    A.T. Ernst, H. Jiang, M. Krishnamoorthy, D. Sier, Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3–27 (2004)CrossRefGoogle Scholar
  4. 4.
    G.A. Forgionne, An architecture for the integration of decision making support functionalities, in Decision Making Support Systems: Achievements and Challenges for the New Decade, Idea Group Publishing, Hershey, 2002, pp. 1–19Google Scholar
  5. 5.
    S. Hamel, J. Gaudreault, C.-G. Quimper, M. Bouchard, P. Marier, Human-machine interaction for real-time linear optimization, in IEEE International Conference on Systems, Man, and Cybernetics, pp. 673–680 (2012)Google Scholar
  6. 6.
    P. Hansen, N. Mladenović, Variable neighborhood search, in Handbook of Metaheuristics (Kluwer Academic, Boston, 2003), pp. 145–184CrossRefGoogle Scholar
  7. 7.
    S. Haspeslagh, P.D. Causmaecker, A. Schaerf, M. Stølevik, The first international nurse rostering competition 2010. Ann. Oper. Res. 218(1), 221–236 (2014)Google Scholar
  8. 8.
    G.W. Klau, N. Lesh, J. Marks, M. Mitzenmacher, Human-guided search. J. Heuristics 16(3), 289–310 (2010)CrossRefGoogle Scholar
  9. 9.
    H.R. Lourenço, O.C. Martin, T. Stützle, Iterated local search: framework and applications, in Handbook of Metaheuristics (Springer, Berlin, 2010), pp. 363–397Google Scholar
  10. 10.
    D. Meignan, A heuristic approach to schedule reoptimization in the context of interactive optimization, in Proceedings of the 2014 Conference on Genetic and Evolutionary Computation (ACM, New York, 2014), pp. 461–468Google Scholar
  11. 11.
    D. Meignan, An experimental investigation of reoptimization for shift scheduling, in Proceedings of the 11th Metaheuristics International Conference (MIC’15) (2015)Google Scholar
  12. 12.
    D. Meignan, S. Knust, J.-M. Frayret, G. Pesant, N. Gaud, A review and taxonomy of interactive optimization methods in operations research. ACM Trans. Interactive Intell. Syst. 5(3), 17 (2015)Google Scholar
  13. 13.
    M.L. Pinedo, Design and implementation of scheduling systems: basic concepts, in Scheduling Theory, Algorithms, and Systems, 4th edn. (Springer, Berlin, 2012), pp. 459–483Google Scholar
  14. 14.
    H. Shachnai, G. Tamir, T. Tamir, A theory and algorithms for combinatorial reoptimization, in LATIN 2012: Theoretical Informatics. Lecture Notes in Computer Science, vol. 7256 (Springer, Berlin, 2012), pp. 618–630Google Scholar
  15. 15.
    J. Shim, M. Warkentin, J.F. Courtney, D.J. Power, R. Sharda, C. Carlsson, Past, present, and future of decision support technology. Decis. Support. Syst. 33(2), 111–126 (2002)CrossRefGoogle Scholar
  16. 16.
    A. Zych, Reoptimization of NP-hard problems. PhD thesis, Eidgenössische Technische Hochschule ETH Zürich (2012). Nr. 20257Google Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Universität OsnabrückInstitut für InformatikOsnabrückGermany

Personalised recommendations