Combinatorial optimization

Facilitation of Efficient Software Downloads for Vehicles - Continuation

The novel idea behind our solution is to use device level location analytics coupled with network load and performance metrics at radio level to create an optimized schedule for an OTA software download campaign. Furthermore, because optimization is …

Managing changes to interdependent network elements

The de-confliction algorithm combines the end to end topology of a service with open change management tickets to allow an operations user to identify conflicting change management activities that could impact service to one or more customer edge …

Conflict-free change deployment

A new scalable approach to conflict-free deployment of changes across networks. The conflict rules or constraints may be modeled using policies and algorithms to determine an optimized schedule for change deployment.

Facilitating Model Driven Automated Cell Allocation In Fifth Generation (5G) Or Other Advanced Network

The first method and system that provide combined optimal cell PCI and RSI allocation in 5G wireless networks. It essentially addresses PCI/RSI requirements specific to 5G deployment. It provides initial optimal PCI/RSI allocation and automated …

Model-Driven Implementation of Services on a Software-Defined Network (divisional)

In traditional environments, optimization of assets, services, and other elements are done on a case-by-case basis. Such an approach produces very specialized solutions for each problem, which are hard to generalize and maintain. Even small changes …

Facilitation of Efficient Software Downloads for Vehicles

The novel idea behind our solution is to use device level location analytics coupled with network load and performance metrics at radio level to create an optimized schedule for an OTA software download campaign. Furthermore, because optimization is …

Model-Driven Implementation of Services on a Software-Defined Network

In traditional environments, optimization of assets, services, and other elements are done on a case-by-case basis. Such an approach produces very specialized solutions for each problem, which are hard to generalize and maintain. Even small changes …

Some extensions of biased random-key genetic algorithms

In this paper, we propose two new variants of the Biased Random-Key Genetic Algorithm. In the first, the algorithm assigns a gender to each chromosome and only allows crossover between chromosomes of different gender. In the second variant, more …