Results 261 to 270 of about 10,004,845 (289)
Some of the next articles are maybe not open access.
Evaluating the importance of randomization in adaptive large neighborhood search
International Transactions in Operational Research, 2016AbstractRandomization is common in many implementations of metaheuristics, and is typically a main ingredient while considering adaptive large neighborhood search (ALNS). This paper considers a standard implementation of ALNS for maritime pickup and delivery problems, identifies seven randomized components in that implementation, and proposes and ...
Ahmad Hemmati, Lars Magnus Hvattum
openaire +1 more source
A Multiobjective Large Neighborhood Search for a Vehicle Routing Problem
2014In this paper, a multiobjective adaptive large neighborhood search is proposed for a vehicle routing problem (VRP) of which the objectives are the total travel time and the cumulative time, i.e., the total arrival time at all customers. It hybrids destroy-repair operators with local search for generating new solutions.
Liangjun Ke, Laipeng Zhai
openaire +1 more source
MaxSAT-based large neighborhood search for high school timetabling
Computers & Operations Research, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emir Demirovic, Nysret Musliu
openaire +3 more sources
Large neighborhood search for break scheduling
2016A high a level of concentration is essential in certain working areas such as in air traffic control, assembly line works or supervision. In such areas breaks are mandatory to avoid fatal errors. Breaks are regulated due to safety rules or legal demands. The break scheduling problem (Bsp) deals with these kind of regulations.
openaire +1 more source
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem
2013Data centers are a critical and ubiquitous resource for providing infrastructure for banking, Internet and electronic commerce. One way of managing data centers efficiently is to minimize a cost function that takes into account the load of the machines, the balance among a set of available resources of the machines, and the costs of moving processes ...
Yuri Malitsky +3 more
openaire +1 more source
An adaptive large neighborhood search for the robust rig routing
Expert Systems with Applications, 2023Igor Kulachenko, Polina A. Kononova
openaire +2 more sources
New neighborhood search algorithms based on exponentially large neighborhoods
2001A practical approach for solving computationally intractable problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computational time. An improvement algorithm is an approximation algorithm which starts with a feasible solution and iteratively attempts to obtain a better solution.
openaire +1 more source
Variable Neighborhood Search: Principles and Applications
European Journal of Operational Research, 2001Nenad Mladenovic, Pierre Hansen
exaly
Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications
2007Özlem Ergun +3 more
openaire +1 more source