A semifeasible trust-region model algorithm for minimization with inequality constraint.
Martínez, José Mario (1998)
Novi Sad Journal of Mathematics
Similarity:
Martínez, José Mario (1998)
Novi Sad Journal of Mathematics
Similarity:
Mario C. Lopez-Loces, Jedrzej Musial, Johnatan E. Pecero, Hector J. Fraire-Huacuja, Jacek Blazewicz, Pascal Bouvry (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
Internet shopping has been one of the most common online activities, carried out by millions of users every day. As the number of available offers grows, the difficulty in getting the best one among all the shops increases as well. In this paper we propose an integer linear programming (ILP) model and two heuristic solutions, the MinMin algorithm and the cellular processing algorithm, to tackle the Internet shopping optimization problem with delivery costs. The obtained results improve...
Yanjun Shen, Bo Yang, Xiongfeng Huang, Yujiao Zhang, Chao Tan (2019)
Kybernetika
Similarity:
In this paper, we propose a new economic dispatch model with random wind power, demand response and carbon tax. The specific feature of the demand response model is that the consumer's electricity demand is divided into two parts: necessary part and non-essential part. The part of the consumer's participation in the demand response is the non-essential part of the electricity consumption. The optimal dispatch objective is to obtain the minimum total cost (fuel cost, random wind power...
Stanisław Bańka, Michał Brasel, Paweł Dworak, Krzysztof Jaroszewski (2015)
International Journal of Applied Mathematics and Computer Science
Similarity:
The paper presents algorithms for parameter identification of linear vessel models being in force for the current operating point of a ship. Advantages and disadvantages of gradient and genetic algorithms in identifying the model parameters are discussed. The study is supported by presentation of identification results for a nonlinear model of a drilling vessel.
Lazo Roljić (2002)
The Yugoslav Journal of Operations Research
Similarity:
Cláudio Alves, J.M. Valério de Carvalho (2009)
RAIRO - Operations Research
Similarity:
In cutting stock problems, after an optimal (minimal stock usage) cutting plan has been devised, one might want to further reduce the operational costs by minimizing the number of setups. A setup operation occurs each time a different cutting pattern begins to be produced. The related optimization problem is known as the Pattern Minimization Problem, and it is particularly hard to solve exactly. In this paper, we present different techniques to strengthen a formulation proposed in the...
Peng-Sheng You, Yi-Chih Hsieh, Hisn-Hung Chen (2011)
RAIRO - Operations Research
Similarity:
Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection...
Peng-Sheng You, Yi-Chih Hsieh, Hisn-Hung Chen (2011)
RAIRO - Operations Research
Similarity:
Various topics related to reverse logistics have been discussed over the years. Most of them have assumed that facilities are kept open once they are established, and no returned products or recovery parts are stocked in intermediate recycling stations. However, firms may have the right to repeatedly open or close their facilities according to their economic benefits if they can acquire their facilities by lease. It also turns out that intermediate recycling stations like collection...
Roman Dębski (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Nada I. Žuranović-Miličić (2000)
The Yugoslav Journal of Operations Research
Similarity:
José Luis Quintero, Alejandro Crema (2009)
RAIRO - Operations Research
Similarity:
The multiparametric 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to a generalized min max objective function such that the min sum and min max are particular cases.
Roman Dębski (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
A new dynamic programming based parallel algorithm adapted to on-board heterogeneous computers for simulation based trajectory optimization is studied in the context of “high-performance sailing”. The algorithm uses a new discrete space of continuously differentiable functions called the multi-splines as its search space representation. A basic version of the algorithm is presented in detail (pseudo-code, time and space complexity, search space auto-adaptation properties). Possible extensions...
Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech (2010)
RAIRO - Operations Research
Similarity:
In this paper, a discrete-event simulation model is coupled with a genetic algorithm to treat highly combinatorial scheduling problems encountered in a production campaign of a fine chemistry plant. The main constraints and features of fine chemistry have been taken into account in the development of the model, thus allowing a realistic evaluation of the objective function used in the stochastic optimization procedure. After a presentation of problem combinatorics, the coupling strategy...
Enrique Alba, Francisco Luna, Antonio Nebro (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
In this paper we address an extension of a very efficient genetic algorithm (GA) known as Hy3, a physical parallelization of the gradual distributed real-coded GA (GD-RCGA). This search model relies on a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimization by using crossover operators tuned to explore and exploit the solutions...
José Luis Quintero, Alejandro Crema (2005)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
Maric, Miroslav (2013)
Serdica Journal of Computing
Similarity:
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...