default search action
BibTeX records: Tapio Tyni
@article{DBLP:journals/eor/TyniY06, author = {Tapio Tyni and Jari Ylinen}, title = {Evolutionary bi-objective optimisation in the elevator car routing problem}, journal = {Eur. J. Oper. Res.}, volume = {169}, number = {3}, pages = {960--977}, year = {2006}, url = {https://doi.org/10.1016/j.ejor.2004.08.027}, doi = {10.1016/J.EJOR.2004.08.027}, timestamp = {Fri, 21 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eor/TyniY06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ppsn/TyniY04, author = {Tapio Tyni and Jari Ylinen}, editor = {Xin Yao and Edmund K. Burke and Jos{\'{e}} Antonio Lozano and Jim Smith and Juan Juli{\'{a}}n Merelo Guerv{\'{o}}s and John A. Bullinaria and Jonathan E. Rowe and Peter Ti{\~{n}}o and Ata Kab{\'{a}}n and Hans{-}Paul Schwefel}, title = {Evolutionary Bi-objective Controlled Elevator Group Regulates Passenger Service Level and Minimises Energy Consumption}, booktitle = {Parallel Problem Solving from Nature - {PPSN} VIII, 8th International Conference, Birmingham, UK, September 18-22, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3242}, pages = {822--831}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30217-9\_83}, doi = {10.1007/978-3-540-30217-9\_83}, timestamp = {Wed, 28 Jun 2023 16:19:43 +0200}, biburl = {https://dblp.org/rec/conf/ppsn/TyniY04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gecco/TyniY02, author = {Tapio Tyni and Jari Ylinen}, editor = {William B. Langdon and Erick Cant{\'{u}}{-}Paz and Keith E. Mathias and Rajkumar Roy and David Davis and Riccardo Poli and Karthik Balakrishnan and Vasant G. Honavar and G{\"{u}}nter Rudolph and Joachim Wegener and Larry Bull and Mitchell A. Potter and Alan C. Schultz and Julian F. Miller and Edmund K. Burke and Natasa Jonoska}, title = {Bi-directional Circular Linked Lists In Fitness Caching}, booktitle = {{GECCO} 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, 9-13 July 2002}, pages = {700}, publisher = {Morgan Kaufmann}, year = {2002}, timestamp = {Mon, 13 Nov 2017 18:15:11 +0100}, biburl = {https://dblp.org/rec/conf/gecco/TyniY02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icannga/AlanderHMTY97, author = {Jarmo T. Alander and J. Heraj{\"{a}}rvi and G. Moghadampour and Tapio Tyni and Jari Ylinen}, editor = {George D. Smith and Nigel C. Steele and Rudolf F. Albrecht}, title = {Genetic Algorithms in the Elevator Allocation Problem}, booktitle = {Proceedings of the International Conference on Artificial Neural Nets and Genetic Algorithms, {ICANNGA} 1997, Norwich, UK, 1997}, pages = {255--258}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/978-3-7091-6492-1\_56}, doi = {10.1007/978-3-7091-6492-1\_56}, timestamp = {Mon, 04 May 2020 15:33:52 +0200}, biburl = {https://dblp.org/rec/conf/icannga/AlanderHMTY97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icannga/AlanderYT95, author = {Jarmo T. Alander and Jari Ylinen and Tapio Tyni}, editor = {David W. Pearson and Nigel C. Steele and Rudolf F. Albrecht}, title = {Elevator group control using distributed genetic algorithm}, booktitle = {Artificial Neural Nets and Genetic Algorithms, {ICANNGA} 1995, Proceedings of the International Conference in Al{\`{e}}s, France, 1995}, pages = {400--403}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/978-3-7091-7535-4\_104}, doi = {10.1007/978-3-7091-7535-4\_104}, timestamp = {Fri, 05 Jul 2019 13:13:56 +0200}, biburl = {https://dblp.org/rec/conf/icannga/AlanderYT95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.