Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 425-435 |
| Seitenumfang | 11 |
| Fachzeitschrift | Engineering optimization |
| Jahrgang | 37 |
| Ausgabenummer | 4 |
| Publikationsstatus | Veröffentlicht - 1 Juni 2005 |
Abstract
The liberalization of telecommunication markets allows the choice of call provider for each single connection. This leads to the question of which provider has to be chosen to minimize the charge volume for all the calls over an accounting period. In contrast to the simple derivation of routing policies found in existing least cost routing (LCR) tables, the incremental and global quantity discounts granted by providers are taken into account in the optimization approach developed in this paper. The dynamic, non-convex, non-linear optimization problem arising from the minimization of the charge volume is solved using the evolutionary optimization method of genetic algorithms. The mathematical formulation of the problem, the genetic algorithm used, the limitation of the search space, and the quantity discount regulation developed are presented. The optimization results obtained by applying the concept to the call data of the University of Hanover are analysed and discussed. The paper concludes with an outlook for the implementation of LCR policies.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Angewandte Informatik
- Mathematik (insg.)
- Steuerung und Optimierung
- Entscheidungswissenschaften (insg.)
- Managementlehre und Operations Resarch
- Ingenieurwesen (insg.)
- Wirtschaftsingenieurwesen und Fertigungstechnik
- Mathematik (insg.)
- Angewandte Mathematik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Engineering optimization, Jahrgang 37, Nr. 4, 01.06.2005, S. 425-435.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Charge volume minimization in liberalized telecommunication markets
AU - Niemann, Frank
AU - Schulze, Cord
AU - Jobmann, Klaus
PY - 2005/6/1
Y1 - 2005/6/1
N2 - The liberalization of telecommunication markets allows the choice of call provider for each single connection. This leads to the question of which provider has to be chosen to minimize the charge volume for all the calls over an accounting period. In contrast to the simple derivation of routing policies found in existing least cost routing (LCR) tables, the incremental and global quantity discounts granted by providers are taken into account in the optimization approach developed in this paper. The dynamic, non-convex, non-linear optimization problem arising from the minimization of the charge volume is solved using the evolutionary optimization method of genetic algorithms. The mathematical formulation of the problem, the genetic algorithm used, the limitation of the search space, and the quantity discount regulation developed are presented. The optimization results obtained by applying the concept to the call data of the University of Hanover are analysed and discussed. The paper concludes with an outlook for the implementation of LCR policies.
AB - The liberalization of telecommunication markets allows the choice of call provider for each single connection. This leads to the question of which provider has to be chosen to minimize the charge volume for all the calls over an accounting period. In contrast to the simple derivation of routing policies found in existing least cost routing (LCR) tables, the incremental and global quantity discounts granted by providers are taken into account in the optimization approach developed in this paper. The dynamic, non-convex, non-linear optimization problem arising from the minimization of the charge volume is solved using the evolutionary optimization method of genetic algorithms. The mathematical formulation of the problem, the genetic algorithm used, the limitation of the search space, and the quantity discount regulation developed are presented. The optimization results obtained by applying the concept to the call data of the University of Hanover are analysed and discussed. The paper concludes with an outlook for the implementation of LCR policies.
KW - Genetic algorithms
KW - Least cost routing
KW - Simulation
KW - Telecommunications
UR - http://www.scopus.com/inward/record.url?scp=20444434388&partnerID=8YFLogxK
U2 - 10.1080/03052150500035534
DO - 10.1080/03052150500035534
M3 - Article
AN - SCOPUS:20444434388
VL - 37
SP - 425
EP - 435
JO - Engineering optimization
JF - Engineering optimization
SN - 0305-215X
IS - 4
ER -