An Ant-Based Heuristic for the Railway Traveling Salesman Problem. Pop, P. C., Pintea, C., & Sitar, C. P. In Giacobini, M., Brabazon, A., Cagnoni, S., Caro, G. D., Drechsler, R., Farooq, M., Fink, A., Lutton, E., Machado, P., Minner, S., O'Neill, M., Romero, J., Rothlauf, F., Squillero, G., Takagi, H., Uyar, S., & Yang, S., editors, EvoWorkshops, volume 4448, of Lecture Notes in Computer Science, pages 702-711, 2007. Springer.
Link
Paper bibtex @inproceedings{conf/evoW/PopPS07,
added-at = {2017-05-21T00:00:00.000+0200},
author = {Pop, Petrica C. and Pintea, Camelia-Mihaela and Sitar, Corina Pop},
biburl = {https://www.bibsonomy.org/bibtex/268fb87a27bcf6e50bfdbccafc5135711/dblp},
booktitle = {EvoWorkshops},
crossref = {conf/evoW/2007},
editor = {Giacobini, Mario and Brabazon, Anthony and Cagnoni, Stefano and Caro, Gianni Di and Drechsler, Rolf and Farooq, Muddassar and Fink, Andreas and Lutton, Evelyne and Machado, Penousal and Minner, Stefan and O'Neill, Michael and Romero, Juan and Rothlauf, Franz and Squillero, Giovanni and Takagi, Hideyuki and Uyar, Sima and Yang, Shengxiang},
ee = {https://doi.org/10.1007/978-3-540-71805-5_76},
interhash = {1d614dd8e8b6efa3d0a8558fadd9060c},
intrahash = {68fb87a27bcf6e50bfdbccafc5135711},
isbn = {978-3-540-71804-8},
keywords = {dblp},
pages = {702-711},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T17:22:51.000+0200},
title = {An Ant-Based Heuristic for the Railway Traveling Salesman Problem.},
url = {http://dblp.uni-trier.de/db/conf/evoW/evoW2007.html#PopPS07},
volume = 4448,
year = 2007
}
Downloads: 0
{"_id":"EZ8Tr6vW7BTyKEt6R","bibbaseid":"pop-pintea-sitar-anantbasedheuristicfortherailwaytravelingsalesmanproblem-2007","authorIDs":[],"author_short":["Pop, P. C.","Pintea, C.","Sitar, C. P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2017-05-21T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Pop"],"firstnames":["Petrica","C."],"suffixes":[]},{"propositions":[],"lastnames":["Pintea"],"firstnames":["Camelia-Mihaela"],"suffixes":[]},{"propositions":[],"lastnames":["Sitar"],"firstnames":["Corina","Pop"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/268fb87a27bcf6e50bfdbccafc5135711/dblp","booktitle":"EvoWorkshops","crossref":"conf/evoW/2007","editor":[{"propositions":[],"lastnames":["Giacobini"],"firstnames":["Mario"],"suffixes":[]},{"propositions":[],"lastnames":["Brabazon"],"firstnames":["Anthony"],"suffixes":[]},{"propositions":[],"lastnames":["Cagnoni"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Caro"],"firstnames":["Gianni","Di"],"suffixes":[]},{"propositions":[],"lastnames":["Drechsler"],"firstnames":["Rolf"],"suffixes":[]},{"propositions":[],"lastnames":["Farooq"],"firstnames":["Muddassar"],"suffixes":[]},{"propositions":[],"lastnames":["Fink"],"firstnames":["Andreas"],"suffixes":[]},{"propositions":[],"lastnames":["Lutton"],"firstnames":["Evelyne"],"suffixes":[]},{"propositions":[],"lastnames":["Machado"],"firstnames":["Penousal"],"suffixes":[]},{"propositions":[],"lastnames":["Minner"],"firstnames":["Stefan"],"suffixes":[]},{"propositions":[],"lastnames":["O'Neill"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Romero"],"firstnames":["Juan"],"suffixes":[]},{"propositions":[],"lastnames":["Rothlauf"],"firstnames":["Franz"],"suffixes":[]},{"propositions":[],"lastnames":["Squillero"],"firstnames":["Giovanni"],"suffixes":[]},{"propositions":[],"lastnames":["Takagi"],"firstnames":["Hideyuki"],"suffixes":[]},{"propositions":[],"lastnames":["Uyar"],"firstnames":["Sima"],"suffixes":[]},{"propositions":[],"lastnames":["Yang"],"firstnames":["Shengxiang"],"suffixes":[]}],"ee":"https://doi.org/10.1007/978-3-540-71805-5_76","interhash":"1d614dd8e8b6efa3d0a8558fadd9060c","intrahash":"68fb87a27bcf6e50bfdbccafc5135711","isbn":"978-3-540-71804-8","keywords":"dblp","pages":"702-711","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T17:22:51.000+0200","title":"An Ant-Based Heuristic for the Railway Traveling Salesman Problem.","url":"http://dblp.uni-trier.de/db/conf/evoW/evoW2007.html#PopPS07","volume":"4448","year":"2007","bibtex":"@inproceedings{conf/evoW/PopPS07,\n added-at = {2017-05-21T00:00:00.000+0200},\n author = {Pop, Petrica C. and Pintea, Camelia-Mihaela and Sitar, Corina Pop},\n biburl = {https://www.bibsonomy.org/bibtex/268fb87a27bcf6e50bfdbccafc5135711/dblp},\n booktitle = {EvoWorkshops},\n crossref = {conf/evoW/2007},\n editor = {Giacobini, Mario and Brabazon, Anthony and Cagnoni, Stefano and Caro, Gianni Di and Drechsler, Rolf and Farooq, Muddassar and Fink, Andreas and Lutton, Evelyne and Machado, Penousal and Minner, Stefan and O'Neill, Michael and Romero, Juan and Rothlauf, Franz and Squillero, Giovanni and Takagi, Hideyuki and Uyar, Sima and Yang, Shengxiang},\n ee = {https://doi.org/10.1007/978-3-540-71805-5_76},\n interhash = {1d614dd8e8b6efa3d0a8558fadd9060c},\n intrahash = {68fb87a27bcf6e50bfdbccafc5135711},\n isbn = {978-3-540-71804-8},\n keywords = {dblp},\n pages = {702-711},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T17:22:51.000+0200},\n title = {An Ant-Based Heuristic for the Railway Traveling Salesman Problem.},\n url = {http://dblp.uni-trier.de/db/conf/evoW/evoW2007.html#PopPS07},\n volume = 4448,\n year = 2007\n}\n\n","author_short":["Pop, P. C.","Pintea, C.","Sitar, C. P."],"editor_short":["Giacobini, M.","Brabazon, A.","Cagnoni, S.","Caro, G. D.","Drechsler, R.","Farooq, M.","Fink, A.","Lutton, E.","Machado, P.","Minner, S.","O'Neill, M.","Romero, J.","Rothlauf, F.","Squillero, G.","Takagi, H.","Uyar, S.","Yang, S."],"key":"conf/evoW/PopPS07","id":"conf/evoW/PopPS07","bibbaseid":"pop-pintea-sitar-anantbasedheuristicfortherailwaytravelingsalesmanproblem-2007","role":"author","urls":{"Link":"https://doi.org/10.1007/978-3-540-71805-5_76","Paper":"http://dblp.uni-trier.de/db/conf/evoW/evoW2007.html#PopPS07"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/corina?items=1000","creationDate":"2019-05-18T19:26:18.308Z","downloads":0,"keywords":["dblp"],"search_terms":["ant","based","heuristic","railway","traveling","salesman","problem","pop","pintea","sitar"],"title":"An Ant-Based Heuristic for the Railway Traveling Salesman Problem.","year":2007,"dataSources":["nk4Sfi2ddzBtdLpRN"]}