Results 91 to 100 of about 36,801 (217)

Experiments to shed light on the best way to use Iterated Local Search for a complex combinatorial problem [PDF]

, 2007
Iterated Local Search (ILS) is a popular metaheuristic search technique for use on combinatorial optimisation problems. As with most such techniques, there are many ways in which ILS can be implemented.
Wright, M B
core  

Pulse shape optimization for electron-positron production in rotating fields

, 2017
We optimize the pulse shape and polarization of time-dependent electric fields to maximize the production of electron-positron pairs via strong field quantum electrodynamics processes.
Fillion-Gourdeau, François, Gagnon, Denis, Hebenstreit, Florian, MacLean, Steve   +3 more
core   +1 more source

Heuristics for the traveling repairman problem with profits [PDF]

, 2010
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue.
Dewilde, Thijs, Dirk, Cattrysse, Sofie, Coene, Spieksma, Frits CR, Vansteenwegen, Pieter   +4 more
core   +1 more source

Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms

Decision Sciences, EarlyView.
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham, Alex Kuiper, Robert H. Lee   +2 more
wiley   +1 more source

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

International Transactions in Operational Research, EarlyView.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel, Fayçal Belkaid, Nadjib Brahimi   +2 more
wiley   +1 more source

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

International 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, David Lopez‐Lopez, Laura Calvet, Angel A. Juan   +3 more
wiley   +1 more source

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

International 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, Alberto Herrán, J. Manuel Colmenar   +2 more
wiley   +1 more source

A recent review of solution approaches for green vehicle routing problem and its variants

Operations Research Perspectives
The green vehicle routing problem (GVRP) has been a prominent topic in the literature on logistics and transportation, leading to extensive research and previous review studies covering various aspects.
Annisa Kesy Garside, Robiah Ahmad, Mohd Nabil Bin Muhtazaruddin   +2 more
doaj   +1 more source

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

International 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, Abraham Duarte, J. Manuel Colmenar   +2 more
wiley   +1 more source

Evolutionary Algorithms and Quantum Computing: Recent Advances, Opportunities, and Challenges

IEEE Access
Quantum computers have made significant progress in the last two decades showing great potential in tackling some of the most challenging problems in computing.
Junaid Ur Rehman, Muhammad Shohibul Ulum, Abdurrahman Wachid Shaffar, Amirul Adlil Hakim, Mujirin, Zaid Abdullah, Hayder Al-Hraishawi, Symeon Chatzinotas, Hyundong Shin   +8 more
doaj   +1 more source