Kurt, M.Kutucu, H.Gürsoy, A.Nuriyev, U.2024-09-292024-09-292014978-364240077-31876-1100https://doi.org/10.1007/978-3-642-40078-0_9https://hdl.handle.net/20.500.14619/96407th International Conference on Management Science and Engineering Management, ICMSEM 2013 -- 7 November 2013 through 9 November 2013 -- Philadelphia, PA -- 102588The Bandpass problem has applications to provide a cost reduction in design and operating telecommunication network. Given a binary matrix A m×n and a positive integer B called the Bandpass length, a set of B consecutive non-zero elements in any column is called a Bandpass. No two bandpasses in the same column can have common rows. The general Bandpass Problem consists of finding an optimal permutation of rows of the matrix A that produces the maximum total number of bandpasses having the same given bandpass length B in all columns. The Multi- Bandpass problem includes different bandpass lengths Bj in each column j of the matrix A, where j = 1,2, ?,n. In this paper, we propose an extended formulation for the Multi-Bandpass problem. A given Bj may not be always efficient bandpass lengths for the communication network. Therefore, it is important to find an optimal values of the bandpass lengths in the Multi-Bandpass problem. In this approach, the lengths in each destination are defined as zj and we present a model to find the optimal values of zj. Then, we calculate the approximate solution of this model using genetic algorithm for the problem instances which are presented in an online library. © Springer-Verlag Berlin Heidelberg 2014.eninfo:eu-repo/semantics/closedAccessBandpass problemCombinatorial optimizationGenetic algorithmTelecommunicationConference Object10.1007/978-3-642-40078-0_92-s2.0-84958546033123VOL. 1Q4115241 LNEE