Abstract
The article describes the proposition and implementation of a demonstration, learning and decision support system for the resolution of combinatorial optimization problems under multiple objectives. The system brings together two key aspects of higher education: research and teaching. It allows the user to define modern metaheuristics and test their resolution behavior on machine scheduling problems. The software may be used by students and researcher with even little knowledge in the mentioned field of research, as the interaction of the user with the system is supported by an extensive graphical user interface. All functions can be easily parameterized, and expensive software licenses are not required. In order to address a large number of users, the system is localizable with little effort. So far, the user interface is available in seven languages.
The software has been honored in Ronneby (Sweden) with the European Academic Software Award 2002, a prize for learning and research software awarded biannually by EKMA, the European Knowledge Media Association (http://www.easa-award.net/, http://www.bth.se/llab/easa_2002.nsf).
Chapter PDF
Similar content being viewed by others
Keywords
- Schedule Problem
- Decision Support System
- Problem Instance
- Pareto Front
- Combinatorial Optimization Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Tapan P. Bagchi. Multiobjective scheduling by genetic algorithms. Kluwer Academic Publishers, Boston, Dordrecht, London, 1999.
Matthieu Basseur, Franck Seynhaeve, and El-ghazali Talbi. Design of multi-objective evolutionary algorithms: Application to the flow-shop scheduling problem. In Congress on Evolutionary Computation (CEC’2002), volume 2, pages 1151–1156, Piscataway, NJ, May 2002. IEEE Service Center.
J. E. Beasley. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11):1069–1072, 1990.
Carlos A. Coello Coello. List of software on evolutionary multiobjective optimization. http://www.lania.mx/~ccoello/EMOO/EMOOsoftware.html.
Carlos A. Coello Coello, David A. Van Veldhuizen, and Gary B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, 2002.
Richard L. Daniels and Joseph B. Mazzola. A tabu-search heuristic for the flexible-resource flow shop scheduling problem. Annals of Operations Research, 41:207–230, 1993.
M. R. Garey and D. S. Johnson. Computers and Intractability — A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco, CA, 1979.
B. Giffler and G. L. Thompson. Algorithms for solving production-scheduling problems. Operations Research, 8:487–503, 1960.
R. Haupt. A survey of priority rule-based scheduling. Operations Research Spektrum, 11(1):3–16, 1989.
Dorit Hochbaum. The remote interactive optimization testbed RIOT. http://riot.ieor.berkeley.edu/riot/.
V. Lotfi, T. J. Stewart, and S. Zionts. An aspiration-level interactive model for multiple criteria decision making. Computers & Operations Research, 19(7):671–681, 1992.
Colin R. Reeves. Landscapes, operators and heuristic search. Annals of Operations Research, 86:473–490, 1999.
Alan C. Schultz. The GA archives. http://www.aic.nrl.navy.mil/galist/src/.
E. L. Ulungu, J. Teghem, P. H. Fortemps, and D. Tuyttens. MOSA method: A tool for solving multiobjective combinatorial optimization problems. Journal of Multi-Criteria Decision Making, 8:221–236, 1999.
Darrell Whitley. Permutations. In Thomas Back, David B. Fogel, and Zbigniew Michalewicz, editors, Handbook of Evolutionary Computation, chapter C3.3.3, pages C3.3:14–C3.3.20. Institute of Physics Publishing, Bristol, 1997.
James M. Wilson. Gantt charts: A centenary appreciation. European Journal of Operational Research, 149:430–437, 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Geiger, M.J. (2006). Teaching Modern Heuristics in Combinatorial Optimization. In: Kumar, D., Turner, J. (eds) Education for the 21st Century — Impact of ICT and Digital Resources. IFIP WCC TC3 2006. IFIP International Federation for Information Processing, vol 210. Springer, Boston, MA . https://doi.org/10.1007/978-0-387-34731-8_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-34731-8_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34627-4
Online ISBN: 978-0-387-34731-8
eBook Packages: Computer ScienceComputer Science (R0)