Results 1 to 10 of about 267 (48)
Mobility offer allocations in corporate settings
EURO Journal on Computational Optimization, 2021 Corporate mobility is often based on a fixed assignment of vehicles to employees. Relaxing this fixation and including alternatives such as public transportation or taxis for business and private trips could increase fleet utilization and foster the use ...
Sebastian Knopp +2 more
doaj +1 more source
Best Polynomial Harmony Search with Best β-Hill Climbing Algorithm
Journal of Intelligent Systems, 2020 Harmony Search Algorithm (HSA) is an evolutionary algorithm which mimics the process of music improvisation to obtain a nice harmony. The algorithm has been successfully applied to solve optimization problems in different domains.
Abu Doush Iyad, Santos Eugene
doaj +1 more source
EURO Journal on Computational Optimization, 2020 Integrated packing and sequence-optimization problems appear in many industrial applications. As an example of this type of problem, we consider the production of glued laminated timber (glulam) in sawmills: Wood beams must be packed into a sequence of ...
Heiner Ackermann, Erik Diessel
doaj +1 more source
Solving Single Nesting Problem Using a Genetic Algorithm
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 Since the Bin Packing Problem (BPP) has application to industry and supply chain management problems (to mention only the most important ones), it attracted attention from its formulation.
Şerban C. +2 more
doaj +1 more source
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization, 2019 The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been ...
Timo Berthold +2 more
doaj +1 more source
A unified matheuristic for solving multi-constrained traveling salesman problems with profits
EURO Journal on Computational Optimization, 2017 In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search.
Rahma Lahyani +2 more
doaj +1 more source
An Improved Particle Swarm Optimization Algorithm for Global Multidimensional Optimization
Journal of Intelligent Systems, 2017 This paper introduces a new variant of the particle swarm optimization (PSO) algorithm, designed for global optimization of multidimensional functions.
Fajr Rkia, Bouroumi Abdelaziz
doaj +1 more source
Variable neighborhood search: basics and variants
EURO Journal on Computational Optimization, 2017 Variable neighborhood search (VNS) is a framework for building heuristics, based upon systematic changes of neighborhoods both in a descent phase, to find a local minimum, and in a perturbation phase to escape from the corresponding valley. In this paper,
Pierre Hansen +3 more
doaj +1 more source
EURO Journal on Computational Optimization, 2017 One challenge for social network researchers is to evaluate balance in a social network. The degree of balance in a social group can be used as a tool to study whether and how this group evolves to a possible balanced state.
Mario Levorato +3 more
doaj +1 more source
New geometrical compactness measures for zones design
Revista de Matemática: Teoría y Aplicaciones, 2012 The design of compact zones has been studied because of its influence in the creation of zones with regular forms, which are easier to analyze, to investigate or to administer.
Eric Alfredo Rincón-García +3 more
doaj +1 more source