Piotr Ratajczak, Malgorzata Michaluszko, Dawid Polak, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak
{"title":"线路规划问题的混合算法","authors":"Piotr Ratajczak, Malgorzata Michaluszko, Dawid Polak, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak","doi":"10.1109/ISCBI.2013.42","DOIUrl":null,"url":null,"abstract":"The line planning problem belongs to the area of the public transportation strategic planning. In this paper, we propose a new hybrid algorithm dealing with this problem. Its performance is verified against a simulated annealing algorithm and random search. The obtained results are promising, the hybrid algorithm has produced good solutions in almost all of tested scenarios.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"153 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hybrid Algorithm for Line Planning Problem\",\"authors\":\"Piotr Ratajczak, Malgorzata Michaluszko, Dawid Polak, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak\",\"doi\":\"10.1109/ISCBI.2013.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The line planning problem belongs to the area of the public transportation strategic planning. In this paper, we propose a new hybrid algorithm dealing with this problem. Its performance is verified against a simulated annealing algorithm and random search. The obtained results are promising, the hybrid algorithm has produced good solutions in almost all of tested scenarios.\",\"PeriodicalId\":311471,\"journal\":{\"name\":\"2013 International Symposium on Computational and Business Intelligence\",\"volume\":\"153 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Symposium on Computational and Business Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCBI.2013.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Symposium on Computational and Business Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCBI.2013.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The line planning problem belongs to the area of the public transportation strategic planning. In this paper, we propose a new hybrid algorithm dealing with this problem. Its performance is verified against a simulated annealing algorithm and random search. The obtained results are promising, the hybrid algorithm has produced good solutions in almost all of tested scenarios.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
