Results 41 to 50 of about 14,432 (202)

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

, 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, Ben-Arieh, Bontoux, D. Karapetyan, Fischetti, Fischetti, G. Gutin, Gutin, Helsgaun, Helsgaun, Johnson, Laporte, Laporte, Lin, Noon, Noon, Pintea, Pop, Pop, Rego, Reinelt, Renaud, Snyder, Tasgetiren, Yang   +24 more
core   +3 more sources

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 matheuristic for the traveling salesman problem with positional consistency constraints

International 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

Addressing Expensive Multi-objective Games with Postponed Preference Articulation via Memetic Co-evolution

, 2017
This paper presents algorithmic and empirical contributions demonstrating that the convergence characteristics of a co-evolutionary approach to tackle Multi-Objective Games (MOGs) with postponed preference articulation can often be hampered due to the ...
Gupta, Abhishek, Mańdziuk, Jacek, Ong, Yew Soon, Żychowski, Adam   +3 more
core   +1 more source

A unified formulation for home healthcare routing and scheduling problems

International 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, Francesca Da Ros, Luca Di Gaspero, Simona Mancini, Vittorio Maniezzo, Roberto Montemanni, Roberto Maria Rosati, Andrea Schaerf   +7 more
wiley   +1 more source

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

Научный вестник МГТУ ГА, 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

Memetic Strategy of Particle Swarm Optimization for One-Dimensional Magnetotelluric Inversions

Mathematics, 2021
The heuristic algorithm represented by particle swarm optimization (PSO) is an effective tool for addressing serious nonlinearity in one-dimensional magnetotelluric (MT) inversions. PSO has the shortcomings of insufficient population diversity and a lack
Ruiheng Li, Lei Gao, Nian Yu, Jianhua Li, Yang Liu, Enci Wang, Xiao Feng   +6 more
doaj   +1 more source

Meta-Lamarckian Learning in Memetic Algorithms [PDF]

IEEE 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

ACM 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, Fanglan Chen, Zhiqian Chen, Chang-Tien Lu, Naren Ramakrishnan   +4 more
openaire   +3 more sources

Memetic Multilevel Hypergraph Partitioning

, 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., Areibi S., Armstrong E., Devine K. D., Fiduccia C.M., Heuer T., Hu T. C., Mann Z., Radcliffe N. J., Roberts K., Sanders P., Sanders P., Sanders P., Schlag S.   +13 more
core   +1 more source