... planning horizon similar to the dynamic facility layout problem. A hybrid genetic algorithm-based approach integrated with local search heuristic methods is also proposed to improve the solution. Findings This paper finds that the DPLP model is effective in modeling the changing layout of a digital...

... by the tuned parameters achieved from the Taguchi approach. Further analysis of the parameters of the problem is conducted to verify the model behavior in various test problems. Findings The results of this paper have shown that the meta-heuristic algorithm has been done in a suitable time, despite...

... and propose an iterated local search (ILS) integrated with an adaptive large neighborhood search (ALNS) meta-heuristic algorithm to obtain a routing solution. Thereafter, they extend the study in a dynamic environment where new delivery requests occur dynamically and propose a heuristic algorithm to solve...

...Levi Ribeiro de Abreu; Bruno de Athayde Prata Purpose The purpose of this paper is to present a hybrid meta-heuristic based on genetic algorithms (GAs), simulated annealing, variable neighborhood descent and path relinking for solving the variant of the unrelated parallel machine scheduling...

... the preemptive scheduling problem with transportation delays, this study proposes a heuristic and two metaheuristics (simulated annealing and variable neighborhood search), each with two modes of evaluation. Findings Computational experiments are presented and discussed on randomly generated instances...

...Federico Barnabè; Pål I Davidsen Purpose This study aims to contribute to the ongoing debate on behavioral operational research (BOR), specifically discussing the potential of system dynamics (SD) models to analyze decision-making heuristics. In more detail, the study suggests using an SD model...

... 16 06 2019 © Emerald Publishing Limited 2019 Emerald Publishing Limited Licensed re-use rights only Project management Algorithms Scheduling Heuristics Optimization The competitiveness and success of a business organization depend heavily on how effectively it uses...

..., they choose an open multi-depot vehicle routing problem (OMDVRP). A heuristic approach was developed by Osvald and Stirn (2008) for the problem of vegetable distribution with hard time windows (i.e. no delay is allowed) including vegetable perishability as a main factor. They also developed a VRP with time...

... assembly line balancing problem (SALBP) for both straight and U-shaped line, and second to provide a comparative evaluation of 20 constructive heuristics to find solutions to the SALBP-1. Design/methodology/approach A total of 200 problems are solved by 20 different constructive heuristics for both...