Pricing Resources in LTE Networks through Multiobjective Optimization

Algorithm 1

Pricing resources with profit and satisfaction optimization (PRPSO) algorithm.

Input:

𝐏: Profit function

𝐔: Utilization function

Output: Pareto front

// Initialization

𝑡=0; 𝑃_𝑡 = random population; 𝑄_𝑡=∅

// Main Loop

S1: 𝐻_𝑡=𝑃_𝑡∪𝑄_𝑡

S2: 𝐹 = Nondominated_Fronts_Sort𝐻_𝑡,𝐏,𝐔, where 𝐹=𝐹₁,𝐹₂,…,𝐹_𝑟 is the front set

S3: 𝑃_𝑡+1=∅; 𝑖=1

S4: While (𝑃_𝑖+1+𝐹_𝑖<𝑁) Do 𝑃_𝑡+1=𝑃_𝑡+1∪𝐹_𝑖;𝑖++;

S5: Crowding_Distance_Sort𝐹_𝑖

S6: Insert the first 𝑁−𝑃_𝑡+1 elements in the sorted 𝐹_𝑖 into 𝑃_𝑡+1

S7: 𝑄_𝑡+1 ← GenerateNewPouluation𝑃_𝑡+1

S8: If (𝑡 < MAX_GEN) Then {𝑡=𝑡+1;GotoS1;} Else Return the Pareto front 𝐹₁