Results 31 to 40 of about 3,152,913 (284)

A PageRank-based heuristic for the minimization of open stacks problem. [PDF]

PLoS ONE, 2018
The minimization of open stacks problem (MOSP) aims to determine the ideal production sequence to optimize the occupation of physical space in manufacturing settings.
Rafael de Magalhães Dias Frinhani, Marco Antonio Moreira de Carvalho, Nei Yoshihiro Soma   +2 more
doaj   +1 more source

Comparison of heuristic solutions and optimal solutions.

, 2020
Comparison of heuristic solutions and optimal solutions.
Omer Faruk Aydin (8532450), Onur Kalan (8532456), Ilgin Gokasar (8532453)   +2 more
core   +1 more source

An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

Manufacturing Review, 2014
In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented.
Farahmand-Mehr Mohammad, Fattahi Parviz, Kazemi Mohammad, Zarei Hassan, Piri Ali   +4 more
doaj   +1 more source

A Compact Model for the Clustered Orienteering Problem

Logistics
Background: The Clustered Orienteering Problem is an optimization problem faced in last-mile logistics. The aim is, given an available time window, to visit vertices and to collect as much profit as possible in the given time.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

On Solving the Knapsack Problem with Conflicts

Mathematics
A variant of the well-known Knapsack Problem is studied in this paper. In the classic problem, a set of items is given, with each item characterized by a weight and a profit.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

Multi-objective optimization and heuristic based solutions for evacuation modeling

Transportation Research Interdisciplinary Perspectives, 2023
This paper presents efficient approaches to evacuation modeling through solving the underlying transit network design problem. Given the road network of an area, our goal here is to compute a set of routes to evacuate all residents (i.e., evacuees ...
Mohimenul Kabir, Jaiaid Mobin, Muhammad Ali Nayeem, Muhammad Ahsanul Habib, M. Sohel Rahman   +4 more
doaj   +1 more source

Heuristic Search for the Analysis of Graph Transition Systems [PDF]

, 2006
Graphs are suitable modeling formalisms for software and hardware systems involving aspects such as communication, object orientation, concurrency, mobility and distribution.
Lluch-Lafuente, Alberto, Jabbar, Shahid, Edelkamp, Stefan, Alberto Lluch Lafuente, Shahid Jabbar, Stefan Edelkamp   +5 more
core   +1 more source

On Solving the Minimum Spanning Tree Problem with Conflicting Edge Pairs

Algorithms
The Minimum Spanning Tree with Conflicting Edge Pairs is a generalization that adds conflict constraints to a classical optimization problem on graphs used to model several real-world applications.
Roberto Montemanni, Derek H. Smith
doaj   +1 more source

An Optimization Heuristic Based on Non-Dominated Sorting and Tabu Search for the Fixed Spectrum Frequency Assignment Problem

IEEE Access, 2018
Frequency assignment for minimum interference is a fundamental problem in telecommunications networks. Combinatorial optimization heuristics are among the successful techniques employed to solve this problem.
Umair F. Siddiqi, Sadiq M. Sait
doaj   +1 more source

A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics

Complexity, 2020
Selection hyper-heuristics are generic search tools that dynamically choose, from a given pool, the most promising operator (low-level heuristic) to apply at each iteration of the search process. The performance of these methods depends on the quality of
Jorge A. Soria-Alcaraz, Gabriela Ochoa, Andres Espinal, Marco A. Sotelo-Figueroa, Manuel Ornelas-Rodriguez, Horacio Rostro-Gonzalez   +5 more
doaj   +1 more source