A heuristic algorithm for profit maximization problem on customer social networking

2013 ◽  
Author(s):  
Xin Zhou
Keyword(s):  
Social Networking ◽  
Heuristic Algorithm ◽  
Profit Maximization ◽  
Maximization Problem ◽  
For Profit

Inventory Replenishment for Profit Maximization over a Finite Horizon under One-time Cost Changes

2018 ◽  
Vol 19 (3_suppl) ◽  
pp. S235-S248
Author(s):  
F. J. Arcelus ◽  
T. P. M. Pakkala ◽  
G. Srinivasan
Keyword(s):  
Cost Minimization ◽  
Profit Maximization ◽  
Planning Horizon ◽  
Finite Horizon ◽  
Maximization Problem ◽  
Decision Variable ◽  
Time Cost ◽  
For Profit ◽  
Optimal Policies ◽  
The Cost

This article considers the optimal inventory ordering, purchasing and holding policies of the profit-maximization problem, as against the well-known cost-minimization case, over a finite horizon of length H, under two special conditions. First, there is change in at least one of the inventory costs, that is, in the cost of ordering and/or purchasing/holding, at some point, Tc < H, during the planning horizon. Second, it is not necessary to satisfy the demand, at a rate of R units per year, for the entire horizon. Rather, the objective is to meet the demand for a period of length H1 ≤ H. In fact, if the retailer does not have the obligation to meet the entire demand, this article shows the conditions wherein it may be more profitable to meet only a portion or may be even none of the demand. Further, such a determination can be made up front, with H1 as a decision variable and the optimal policies of the cost-minimization models, by fulfilling the entire demand, will result in lower profits. Numerical examples are included to identify the demand fulfilment and the profit differences between the cost-minimization and profit-maximization optimal policies, under the different one-time cost changes.

scholarly journals Genetic Algorithm for the Retailers’ Shelf Space Allocation Profit Maximization Problem

2021 ◽  
Vol 11 (14) ◽  
pp. 6401
Author(s):  
Kateryna Czerniachowska ◽  
Karina Sachpazidu-Wójcicka ◽  
Piotr Sulikowski ◽  
Marcin Hernes ◽  
Artur Rot
Keyword(s):  
Genetic Algorithm ◽  
Profit Maximization ◽  
Allocation Rule ◽  
Maximization Problem ◽  
Shelf Space ◽  
Allocation Model ◽  
Space Allocation ◽  
Shelf Space Allocation ◽  
To Receive

This paper discusses the problem of retailers’ profit maximization regarding displaying products on the planogram shelves, which may have different dimensions in each store but allocate the same product sets. We develop a mathematical model and a genetic algorithm for solving the shelf space allocation problem with the criteria of retailers’ profit maximization. The implemented program executes in a reasonable time. The quality of the genetic algorithm has been evaluated using the CPLEX solver. We determine four groups of constraints for the products that should be allocated on a shelf: shelf constraints, shelf type constraints, product constraints, and virtual segment constraints. The validity of the developed genetic algorithm has been checked on 25 retailing test cases. Computational results prove that the proposed approach allows for obtaining efficient results in short running time, and the developed complex shelf space allocation model, which considers multiple attributes of a shelf, segment, and product, as well as product capping and nesting allocation rule, is of high practical relevance. The proposed approach allows retailers to receive higher store profits with regard to the actual merchandising rules.

Measuring the effects of tourists’ relative willingness to spend and third-degree price discrimination on inbound tourism expenditure differentials

2021 ◽  
pp. 135481662110300
Author(s):  
Usamah F Alfarhan ◽  
Khaldoon Nusair ◽  
Hamed Al-Azri ◽  
Saeed Al-Muharrami ◽  
Nan Hua
Keyword(s):  
Price Discrimination ◽  
Profit Maximization ◽  
Tourism Industry ◽  
Theoretical Argument ◽  
Total Expenditure ◽  
Conditional Quantile ◽  
For Profit ◽  
Inbound Tourism ◽  
Tourism Expenditure ◽  
Quantile Estimates

Tourism expenditures are determined by a set of antecedents that reflect tourists’ willingness and ability to spend, and de facto incremental monetary outlays at which willingness and ability is transformed into total expenditures. Based on the neoclassical theoretical argument of utility-constrained expenditure minimization, we extend the current literature by applying a sustainability-based segmentation criterion, namely, the Legatum Prosperity IndexTM to the decomposition of a total expenditure differential into tourists’ relative willingness to spend and an upper bound of third-degree price discrimination, using mean-level and conditional quantile estimates. Our results indicate that understanding the price–quantity composition of international inbound tourism expenditure differentials assists agents in the tourism industry in their quest for profit maximization.

scholarly journals A Novel Integrated Profit Maximization Model for Retailers under Varied Penetration Levels of Photovoltaic Systems

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 92
Author(s):  
Ioannis P. Panapakidis ◽  
Nikolaos Koltsaklis ◽  
Georgios C. Christoforidis
Keyword(s):  
Profit Maximization ◽  
Energy Markets ◽  
Maximization Problem ◽  
Selling Price ◽  
Retail Market ◽  
Stochastic Variable ◽  
Wholesale Market ◽  
Market Operation ◽  
Pv Penetration ◽  
Marginal Price

In contemporary energy markets, the Retailer acts as the intermediate between the generation and demand sectors. The scope of the Retailer is to maximize its profits by selecting the appropriate procurement mechanism and selling price to the consumers. The wholesale market operation influences the profits since the mix of generation plants determines the system marginal price (SMP). In the related literature, the SMP is treated as a stochastic variable, and the wholesale market conditions are not taken into account. The present paper presents a novel methodology that aims at connecting the wholesale and retail market operations from a Retailer’s perspective. A wholesale market clearing problem is formulated and solved. The scope is to examine how different photovoltaics (PV) penetration levels in the generation side influences the profits of the Retailer and the selling prices to the consumers. The resulting SMPs are used as inputs in a retailer profit maximization problem. This approach allows the Retailer to minimize economic risks and maximize profits. The results indicate that different PV implementation levels on the generation side highly influences the profits and the selling prices.

scholarly journals Non-submodular model for group profit maximization problem in social networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Jianming Zhu ◽  
Smita Ghosh ◽  
Weili Wu ◽  
Chuangen Gao
Keyword(s):  
Social Networks ◽  
Profit Maximization ◽  
Randomized Algorithm ◽  
Political Orientation ◽  
Submodular Functions ◽  
Maximization Problem ◽  
Modular Algorithm ◽  
The Difference ◽  
Group Enterprise ◽  
Theoretical Results

AbstractIn social networks, there exist many kinds of groups in which people may have the same interests, hobbies, or political orientation. Sometimes, group decisions are made by simply majority, which means that most of the users in this group reach an agreement, such as US Presidential Elections. A group is called activated if $$\beta$$ β percent of users are influenced in the group. Enterprise will gain income from all influenced groups. Simultaneously, to propagate influence, enterprise needs pay advertisement diffusion cost. Group profit maximization (GPM) problem aims to pick k seeds to maximize the expected profit that considers the benefit of influenced groups with the diffusion cost. GPM is proved to be NP-hard and the objective function is proved to be neither submodular nor supermodular. An upper bound and a lower bound which are difference of two submodular functions are designed. We propose a submodular–modular algorithm (SMA) to solve the difference of two submodular functions and SMA is shown to converge to a local optimal. We present an randomized algorithm based on weighted group coverage maximization for GPM and apply sandwich framework to get theoretical results. Our experiments verify the efficiency of our methods.

Nonsubmodular Constrained Profit Maximization in Attribute Networks

2021 ◽  
Author(s):  
Liman Du ◽  
Wenguo Yang ◽  
Suixiang Gao
Keyword(s):  
Profit Maximization ◽  
Logistic Function ◽  
Influence Maximization ◽  
Maximization Problem ◽  
Cardinality Constraint ◽  
Three Phase ◽  
Marginal Increment ◽  
The Difference ◽  
Classical Influence ◽  
Influence Maximization Problem

The number of social individuals who interact with their friends through social networks is increasing, leading to an undeniable fact that word-of-mouth marketing has become one of the useful ways to promote sale of products. The Constrained Profit Maximization in Attribute network (CPMA) problem, as an extension of the classical influence maximization problem, is the main focus of this paper. We propose the profit maximization in attribute network problem under a cardinality constraint which is closer to the actual situation. The profit spread metric of CPMA calculates the total benefit and cost generated by all the active nodes. Different from the classical Influence Maximization problem, the influence strength should be recalculated according to the emotional tendency and classification label of nodes in attribute networks. The profit spread metric is no longer monotone and submodular in general. Given that the profit spread metric can be expressed as the difference between two submodular functions and admits a DS decomposition, a three-phase algorithm named as Marginal increment and Community-based Prune and Search(MCPS) Algorithm frame is proposed which is based on Louvain algorithm and logistic function. Due to the method of marginal increment, MPCS algorithm can compute profit spread more directly and accurately. Experiments demonstrate the effectiveness of MCPS algorithm.

scholarly journals Impact of emission trading and renewable energy support scheme on the optimality of generator side bidding

2020 ◽  
Vol 167 ◽  
pp. 05008 ◽  
Author(s):  
A Arya ◽  
SPS Mathur ◽  
M Dubey
Keyword(s):  
Renewable Energy ◽  
Ghg Emissions ◽  
Profit Maximization ◽  
Emission Trading ◽  
Pso Algorithm ◽  
Optimization Method ◽  
Developed Countries ◽  
Test System ◽  
For Profit ◽  
System Operator

As a major Green House Gases (GHG) producer, CO2 in particular, the electricity industry’s emissions have turned in to a matter of immense concern in many countries, especially in India. India’s economy and fast economic development has attracts the attention of the world. Emission trading schemes (ETS) and renewable energy support schemes (RESS) are implemented by the various developed countries to alleviate the affect of GHG emissions. In this paper, an optimization based market simulation approach is proposed with the consideration of emission trading schemes and renewable support schemes. To simulate the bidding strategy and for profit maximization, a particle swarm optimization (PSO) algorithm is used. As above problem is a multi-objective optimization problem, Where, in the first level each Genco submit the bid to the independent system operator and in the next level a optimization method is used for the determination of optimal bidding with the implementation of emission trading schemes and renewable support schemes. It is assumed that each generator should submit bid as a price taker’s in sealed auction based on pay-as-bid market clearing price mechanism. The practicability of proposed optimization method is checked by an IEEE-30 bus test system consists of six suppliers.

Sign in / Sign up

Export Citation Format

Share Document