Results 71 to 80 of about 35,479 (232)

Pressurized water reactor in-core nuclear fuel management by tabu search [PDF]

open access: yes, 2015
Optimization of the arrangement of fuel assemblies and burnable poisons when reloading pressurized water reactors has, in the past, been performed with many di erent algorithms in an attempt to make reactors more economic and fuel effi cient.
Hill, NJ, Parks, GT
core  

A tabu search heuristic for the Equitable Coloring Problem [PDF]

open access: yes, 2014
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, called equity constraints, arises naturally in several applications.
A Hajnal   +16 more
core   +2 more sources

Probabilistic GRASP-Tabu Search algorithms for the UBQP problem [PDF]

open access: yesComputers & Operations Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yang   +3 more
openaire   +2 more sources

Collaborative platooning and routing for mixed fleets of electric automated vehicles and conventional trucks

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia   +2 more
wiley   +1 more source

Una comparación de algoritmos basados en trayectoria granular para el problema de localización y ruteo con flota heterogénea (LRPH) [PDF]

open access: yes, 2017
Indexación: Scopus.We consider the Location-Routing Problem with Heterogeneous Fleet (LRPH) in which the goal is to determine the depots to be opened, the customers to be assigned to each open depot, and the corresponding routes fulfilling the demand of ...
Bernal-Moyano, J.A.   +4 more
core   +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

Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data

open access: yesJournal of Computing and Information Technology, 2017
Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension
Arpita Nagpal, Deepti Gaur
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

A fuzzy interval optimization approach for p-hub median problem under uncertain information.

open access: yesPLoS ONE
Stochastic and robust optimization approaches often result in sub-optimal solutions for the uncertain p-hub median problem when continuous design parameters are discretized to form different environmental scenarios.
Yu Wang, Tao Zhu, Kaibo Yuan, Xin Li
doaj   +1 more source

A Novel Tabu Search Algorithm for Multi-AGV Routing Problem

open access: yesMathematics, 2020
In this paper, we propose a novel tabu search (NTS) algorithm that improves the efficiencies of picking goods of automated guided vehicles (AGVs) in an automatic warehouse by solving the conflicts that happen when multiple AGVs work at the same time ...
Lining Xing   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy