Minimum concave cost multicommodity network design


BAZLAMAÇCI C. F. , Say F.

TELECOMMUNICATION SYSTEMS, cilt.36, sa.4, ss.181-203, 2007 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 36 Konu: 4
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1007/s11235-008-9068-2
  • Dergi Adı: TELECOMMUNICATION SYSTEMS
  • Sayfa Sayıları: ss.181-203

Özet

The minimum concave cost multicommodity network design problem (MCMNDP) arises in many application areas, such as transportation planning, energy distribution systems and especially in the design of both packet and circuit switching backbone networks. Exact concave cost optimization algorithms have been developed but they are applicable only if the network size is small. Therefore, MCMNDP is usually solved using non-exact iterative methods. In this paper, such heuristic techniques proposed within the context of circuit switching and packet switching network design are evaluated in detail. Following a comprehensive literature survey, Yaged's linearization, Minoux's greedy and Minoux's accelerated greedy methods have been selected for the circuit switching network design case for further investigation. Minoux's greedy methods are found to create routes that include cycles causing degradation in the quality of the solution; therefore, we propose a simple but effective modification scheme as a cycle elimination strategy. Similarly, but within the context of packet switching network design, Gerla and Kleinrock's concave branch elimination, Gersht's greedy, and Stacey's concave link elimination methods have been selected for further investigation. All of these methods consider aggregate flows on each link, simultaneously re-routing more than one commodity in one step. In this paper, we propose an alternative disaggregate approach, where only one commodity is handled at a time. Our final proposal is the adaptation of the algorithms proposed for circuit switching network design to the packet switching case. Then an extensive comparative computational study is performed for a number of networks and cost structures to help establish the best method with respect to time and solution quality. Our computational results have shown that the performances of the MCMNDP algorithms heavily depend on the network type and the cost structure. The results have also revealed that our proposed modification to Minoux greedy to eliminate cycles leads to considerable improvements and our proposed disaggregate approach gives the best result in some networks with certain cost structures.