Buscar
Mostrando ítems 1-10 de 501
Hybrid strategies of enumeration in constraint solving
(Academic Journals, 2011)
Improving the shift-scheduling problem using non-stationary queueing models with local heuristic and genetic algorithm
(2020-01-01)
We improve the shift-scheduling process by using nonstationary queueing models to evaluate schedules and two heuristics to generate schedules. Firstly, we improved the fitness function and the initial population generation ...
A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
(Elsevier Science BvAmsterdamHolanda, 1996)
Heuristic Approaches for the Robust Vehicle Routing Problem
(Combinatorial Optimization, 2014-07-22)
In this article, the Robust Vehicle Routing Problem (RVRP) with uncertain traveling costs is studied. It covers a number of important applications in urban transportation and large scale bio-terrorism emergency. The uncertain ...
Adaptive granular local search heuristic for a dynamic vehicle routing problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2009)
An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times
(Engineering Applications of Artificial Intelligence, 2019)
Search intensity versus search diversity: a false trade off?
(Springer, 2010-06)
An implicit tenet of modern search heuristics is that there is a mutually exclusive balance between two desirable goals: search diversity (or distribution), i.e., search through a maximum number of distinct areas, and, ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
Domain reduction using GRASP construction phase for transmission expansion planning problem
(2012-04-03)
This paper proposes a new strategy to reduce the combinatorial search space of a mixed integer linear programming (MILP) problem. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) is employed ...
An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks
(2013-01-01)
We present a metaheuristic approach which combines constructive heuristics and local searches based on sampling with path relinking. Its effectiveness is demonstrated by an application to the problem of allocating switches ...