A concave–convex problem with a variable operator
نویسندگان
چکیده
منابع مشابه
An improved particle swarm optimization with a new swap operator for team formation problem
Formation of effective teams of experts has played a crucial role in successful projects especially in social networks. In this paper, a new particle swarm optimization (PSO) algorithm is proposed for solving a team formation optimization problem by minimizing the communication cost among experts. The proposed algorithm is called by improved particle optimization with new swap operator (IPSONSO...
متن کاملa genetic algorithm with modified crossover operator for a two-agent scheduling problem
the problem of scheduling with multi agent has been studiedfor more than one decade and significant advances have been madeover the years. however, most work has paid more attention to the conditionthat machines are available during planning horizon. motivatedby the observations, this paper studies a two-agent scheduling modelwith multiple availability constraint. each agent aims at minimizing ...
متن کاملAn analytic solution for a non-local initial-boundary value problem including a partial differential equation with variable coefficients
This paper considers a non-local initial-boundary value problem containing a first order partial differential equation with variable coefficients. At first, the non-self-adjoint spectral problem is derived. Then its adjoint problem is calculated. After that, for the adjoint problem the associated eigenvalues and the subsequent eigenfunctions are determined. Finally the convergence ...
متن کاملInvestigating Zone Pricing in a Location-Routing Problem Using a Variable Neighborhood Search Algorithm
In this paper, we assume a firm tries to determine the optimal price, vehicle route and location of the depot in each zone to maximise its profit. Therefore, in this paper zone pricing is studied which contributes to the literature of location-routing problems (LRP). Zone pricing is one of the most important pricing policies that are prevalently used by many companies. The proposed problem is v...
متن کاملVariable Genetic Operator Search for the Molecular Docking Problem
The aim of this work is to present a new hybrid algorithm for the Molecular Docking problem: Variable Genetic Operator Search (VGOS). The proposed method combines an Evolutionary Algorithm with Variable Neighborhood Search. Experimental results show that the algorithm is able to achieve good results, in terms of energy optimization and RMSD values for several molecules when compared with previo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2017
ISSN: 0944-2669,1432-0835
DOI: 10.1007/s00526-017-1291-9