Results 11 to 20 of about 715,075 (267)

Dynamic Local Path Planning for Intelligent Vehicles Based on Sampling Area Point Discrete and Quadratic Programming

open access: yesIEEE Access, 2022
This paper proposes a dynamic path planning method based on discrete optimization applied to suburban highways or expressways. We optimize the generated candidate points according to the cost function and then generates a local path through the quintic ...
Haobin Jiang   +3 more
doaj   +1 more source

A Software Module for Building an Optimal Schedule for Processing Raw Materials

open access: yesСовременные информационные технологии и IT-образование, 2021
One of the areas of application of software is the organization of the technological process, the scheduling of the equipment. The importance of the problem of optimization of the technological regime is explained by the fact that often a change in the ...
Dmitry Balandin   +2 more
doaj   +1 more source

Discrete Optimal Graph Clustering [PDF]

open access: yesIEEE Transactions on Cybernetics, 2020
Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three disadvantages: 1) the predefined similarity graph is often fixed and may not be optimal for the subsequent clustering.
Yudong Han   +4 more
openaire   +3 more sources

3/4-Discrete Optimal Transport [PDF]

open access: yesSIAM Journal on Scientific Computing, 2020
This paper deals with the 3/4-discrete 2-Wasserstein optimal transport between two measures, where one is supported by a set of segment and the other one is supported by a set of Dirac masses. We select the most suitable optimization procedure that computes the optimal transport and provide numerical examples of approximation of cloud data by segments.
Léo Lebrat   +2 more
openaire   +3 more sources

Uniqueness of market equilibria on networks with transport costs

open access: yesOperations Research Perspectives, 2018
We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity ...
Vanessa Krebs, Martin Schmidt
doaj   +1 more source

Linearized model for optimization of coupled electricity and natural gas systems

open access: yesJournal of Modern Power Systems and Clean Energy, 2017
In this paper a combined optimization of a coupled electricity and gas system is presented. For the electricity network a unit commitment problem with optimization of energy and reserves under a power pool, considering all system operational and unit ...
Mathias SIRVENT   +3 more
doaj   +1 more source

GasLib—A Library of Gas Network Instances

open access: yesData, 2017
The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data
Martin Schmidt   +11 more
doaj   +1 more source

PARAMETER-LESS AND METAPHOR-LESS METAHEURISTIC ALGORITHM SUGGESTION FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS

open access: yesEskişehir Osmangazi Üniversitesi Mühendislik ve Mimarlık Fakültesi Dergisi, 2023
Many optimization problems are complex, challenging and take a significant amount of computational effort to solve. These problems have gained the attention of researchers and they have developed lots of metaheuristic algorithms to use for solving these ...
Aydın Sipahioğlu, İslam Altın
doaj   +1 more source

A New Bilinear Supervised Neighborhood Discrete Discriminant Hashing

open access: yesMathematics, 2022
Feature extraction is an important part of perceptual hashing. How to compress the robust features of images into hash codes has become a hot research topic.
Xueyu Chen   +5 more
doaj   +1 more source

Efficient Discretization of Optimal Transport

open access: yesEntropy, 2023
Obtaining solutions to optimal transportation (OT) problems is typically intractable when marginal spaces are continuous. Recent research has focused on approximating continuous solutions with discretization methods based on i.i.d. sampling, and this has shown convergence as the sample size increases.
Junqi Wang, Pei Wang, Patrick Shafto
openaire   +4 more sources

Home - About - Disclaimer - Privacy