Path assignment for call routing: An application of tabu search

DOI10.1007/BF02022997zbMath0775.90144OpenAlexW2083824513MaRDI QIDQ2367008

Kathryn Fraughnaugh, Charles A. Anderson, Mark Parker, Jennifer K. Ryan

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02022997

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (14)

A cutting plane approach to combinatorial bandwidth packing problem with queuing delays ⋮ Genetic algorithms and tabu search: Hybrids for optimization ⋮ Bandwidth packing problem with queueing delays: modelling and exact solution approach ⋮ Metaheuristics: A bibliography ⋮ The combinatorial bandwidth packing problem ⋮ On the minimum cost multiple-source unsplittable flow problem ⋮ Bandwidth packing with priority classes ⋮ Optimizing the system of virtual paths by tabu search. ⋮ The selection and scheduling of telecommunication calls with time windows ⋮ Applying tabu search to backup path planning for multicast networks ⋮ Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures ⋮ A simple tabu search method to solve the mixed-integer linear bilevel programming problem ⋮ A branch and price approach for the robust bandwidth packing problem with queuing delays ⋮ Digital data networks design using genetic algorithms

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: Path assignment for call routing: An application of tabu search