Results 271 to 280 of about 7,335,515 (304)

Discrete Particle Swarm Optimization for the Orienteering Problem

IEEE Congress on Evolutionary Computation, 2010
In this paper a novel discrete Particle Swarm Optimization (PSO) algorithm is proposed to solve the Orienteering Problem (OP). Discrete evolution is achieved by re-defining all operators and operands used in PSO. To obtain better results, Strengthened-PSO which improves both exploration and exploitation during the search process is employed for ...
Aise Zülal Sevkli, Fatih Erdogan Sevilgen   +1 more
openaire   +2 more sources

Problems in discrete optimization

1993
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1993. ; Includes bibliographical references (p. 89-102). ; by Carolyn H. Norton. ; Ph.D.
openaire   +1 more source

Discrete optimization problem

2015
???????????????????????? ???????????????????????????? ???????????? ?????????????????????? ???????????????????????? ???????????????? (???????????????? ???????????????????? ??????????????) ?? ???????????????? ?????????????????????? ????????????????. ?????????????????????????????? ?????????????????????? ??????????????????????, ?????????????????????? ??????
openaire   +1 more source

The Discrete Optimal Assignment Problem

2016
This chapter considers the finite-dimensional case, which is the case when the marginal probability distributions are discrete with finite support. In this case, the Monge–Kantorovich problem becomes a finite-dimensional linear programming problem; the primal and the dual solutions are related by complementary slackness, which is interpreted in terms ...
openaire   +1 more source

Discrete Approximations to Continuum Optimal Flow Problems

Studies in Applied Mathematics, 2006
Problems in partial differential equations with inequality constraints can be used to describe a continuum analog to various optimal flow/cut problems. While general concepts from convex optimization (like duality) carry over into continuum problems, the application of ideas and algorithms from linear programming and network flow problems is ...
openaire   +1 more source

Direct Optimization: Problem discretization

2013
The goal of this chapter is to obtain a discretized version of OCP (2.6). We discuss a so-called direct approach and summarize its main advantages and disadvantages in Section 3.1 in comparison with alternative approaches. In Sections 3.2 and 3.3 we discretize OCP (2.6) in two steps. First we discretize in space and obtain a large-scale ODE constrained
openaire   +1 more source

A note on the optimal portfolio problem in discrete processes

Kybernetika, 2009
Summary: We deal with the optimal portfolio problem in discrete-time setting. Employing the discrete Itô formula, which is developed by Fujita, we establish the discrete Hamilton-Jacobi-Bellman (d-HJB) equation for the value function. Simple examples of the d-HJB equation are also discussed.
Naoyuki Ishimura, Yuji Mita
openaire   +2 more sources

New Binary Whale Optimization Algorithm for Discrete Optimization Problems

Engineering Optimization, 2020
Abdelazim G Hussien, Ahmad Taher Azar, Essam H Houssein   +2 more
exaly  

Discrete optimization and optimization of ethanol preparation problem

3rd International Conference on Applied Mathematics, Modelling, and Intelligent Computing (CAMMIC 2023), 2023
Kaichen Ouyang, Tian Xiang Xu
openaire   +1 more source

Surrogate-Assisted Evolutionary Algorithm for Expensive Constrained Multi-Objective Discrete Optimization Problems

Complex & Intelligent Systems, 2022
Neal N. Xiong, Qinghua Gu
exaly