Results 51 to 60 of about 15,134 (244)

Memetic Multilevel Hypergraph Partitioning

open access: yes, 2018
Hypergraph partitioning has a wide range of important applications such as VLSI design or scientific computing. With focus on solution quality, we develop the first multilevel memetic algorithm to tackle the problem.
Akhremtsev Y.   +13 more
core   +1 more source

Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem [PDF]

open access: yes, 2010
The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some other problems.
Balas   +24 more
core   +3 more sources

A Novel Memetic Framework for Enhancing Differential Evolution Algorithms via Combination With Alopex Local Search

open access: yesInternational Journal of Computational Intelligence Systems
Differential evolution (DE) represents a class of population-based optimization techniques that uses differences of vectors to search for optimal solutions in the search space.
Miguel Leon   +3 more
doaj   +1 more source

APPLICATION OF HYBRID MEMETIC ALGORITHM IN OPTIMAL CONTROL NONLINEAR STOCHASTIC SYSTEMS WITH INCOMPLETE FEEDBACK PROBLEMS

open access: yesНаучный вестник МГТУ ГА, 2018
The application of hybrid memetic algorithm of global constrained optimization in the search optimal control of nonlinear stochastic systems problem is researched in the paper.
A. V. Panteleev, V. N. Panovskiy
doaj   +1 more source

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

open access: yesInternational 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   +2 more
wiley   +1 more source

A matheuristic for the traveling salesman problem with positional consistency constraints

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley   +1 more source

A unified formulation for home healthcare routing and scheduling problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract Home Healthcare is an essential component of healthcare systems, where caregivers visit patients' homes to deliver services. While presenting advantages with respect to institutional care, such as being cost‐effective and alleviating family burdens, it presents challenges in scheduling and routing caregivers efficiently.
Sara Ceschia   +7 more
wiley   +1 more source

A Comprehensive Robust Bi-objective Model and a Memetic Solution Algorithm for Designing Reverse Supply Chain Network under Uncertainty [PDF]

open access: yesچشم‌انداز مدیریت صنعتی, 2015
One of the major issues in a reverse supply chainmanagement is dealing with returned productsthrough a reverse logistics while considering uncertainty and non-financial performance measures alongside the more traditional financial measures. In this paper,
Aliakbar Hasani   +1 more
doaj  

Meta-Lamarckian Learning in Memetic Algorithms [PDF]

open access: yesIEEE Transactions on Evolutionary Computation, 2004
Over the last decade, memetic algorithms (MAs) have relied on the use of a variety of different methods as the local improvement procedure. Some recent studies on the choice of local search method employed have shown that this choice significantly affects the efficiency of problem searches.
Ong, Yew Soon, Keane, A.J.
openaire   +3 more sources

Memetic Algorithms for Spatial Partitioning Problems

open access: yesACM Transactions on Spatial Algorithms and Systems, 2023
Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives, and/or constraint functions. In this article, we focus on a specific type of SOP called spatial partitioning, which is a combinatorial problem due to the presence of discrete spatial units.
Subhodip Biswas   +4 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy