Results 111 to 120 of about 41,487 (244)

A genetic algorithm simheuristic for solving the stochastic project portfolio selection problem with portfolio reliability constraints

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz   +3 more
wiley   +1 more source

A Hybrid Algorithm for Metaheuristic Optimization

open access: yes, 2019
We propose a novel, flexible algorithm for combining together metaheuristicoptimizers for non-convex optimization problems. Our approach treatsthe constituent optimizers as a team of complex agents that communicateinformation amongst each other at various intervals during the simulationprocess.
Khanna, Sujit Pramod   +1 more
openaire   +2 more sources

An efficient variable neighborhood search approach for the facility location problem with the limited choice rule

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract One of the most common problems in the expansion of a company consists of deciding the most appropriate locations for their facilities. This decision problem, known as the facility location problem, has been studied from different perspectives, considering a number of different constraints.
Enrique García‐Galán   +2 more
wiley   +1 more source

Farmer Ants Optimization Algorithm: A Novel Metaheuristic for Solving Discrete Optimization Problems

open access: yesInformation
Currently, certain complex issues are classified as NP-hard problems, for which there is no exact solution, or they cannot be solved in a reasonable amount of time. As a result, metaheuristic algorithms have been developed as an alternative.
Ali Asghari   +4 more
doaj   +1 more source

A fast metaheuristic approach for the planar multiple obnoxious facility location problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The multiple obnoxious facility location problem is one of the most studied problems in the literature of the obnoxious facility location problems family. In this work, we propose an alternative algorithmic approach for this problem, based on an efficient metaheuristic procedure over a discretization of the plane based on Voronoi diagrams ...
Sergio Salazar   +2 more
wiley   +1 more source

Metaheuristic Optimization of Fractional Order Incremental Conductance (FO-INC) Maximum Power Point Tracking (MPPT)

open access: yesComplexity, 2019
This paper seeks to improve the photovoltaic (PV) system efficiency using metaheuristic, optimized fractional order incremental conductance (FO-INC) control.
Hossam Hassan Ammar   +3 more
doaj   +1 more source

An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri   +3 more
wiley   +1 more source

Hybrid Whale Optimization with a Firefly Algorithm for Function Optimization and Mobile Robot Path Planning

open access: yesBiomimetics
With the wide application of mobile robots, mobile robot path planning (MRPP) has attracted the attention of scholars, and many metaheuristic algorithms have been used to solve MRPP.
Tao Tian   +4 more
doaj   +1 more source

An iterated greedy‐based metaheuristic with local search for the rank pricing problem

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The rank pricing problem involves determining optimal prices for a set of products while accounting for customers' budgets and preferences. This study develops an iterated greedy‐based metaheuristic to efficiently solve this problem. The core idea is to generate a sequence of solutions by iteratively applying destruction and reconstruction ...
Herminia I. Calvete   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy