Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change

This article studies the affinity scheduling problem in multicore computing systems, considering the minimization of communications and synchronizations. The problem consists in assigning a set of tasks to resources to minimize the overall execution time of the set of tasks and the execution time required to compute the schedule. A Multiobjective Iterated Local Search method is proposed to solve the studied affinity scheduling problem, which considers the different times required for communication and synchronization of tasks executing on different cores of a multicore computer. The experimental evaluation of the proposed scheduling method is performed over realistic instances of the scheduling problem, considering a set of common benchmark applications from the parallel scientific computing field, and a modern multicore platform from National Supercomputing Center, Uruguay. The main results indicate that the proposed multiobjective Iterated Local Search method improves up to 21.6% over the traditional scheduling techniques (a standard Round Robin and a Greedy scheduler)

Download Full-text

A novel local search method for LSGO with golden ratio and dynamic search step

Soft Computing ◽

10.1007/s00500-020-05284-x ◽

2020 ◽

Author(s):

Havva Gül Koçer ◽

Sait Ali Uymaz

Keyword(s):

Local Search ◽

Golden Ratio ◽

Search Method ◽

Local Search Method ◽

Dynamic Search

Download Full-text

Fullbore Image Construction of Imaging Logging Based on the Improved Texture Inpainting Method

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.571-572.825 ◽

2014 ◽

Vol 571-572 ◽

pp. 825-828

Author(s):

Xiang Zhang ◽

Jun Hua Wang ◽

Xiao Ling Xiao

Keyword(s):

Local Search ◽

Texture Synthesis ◽

Synthesis Method ◽

Image Inpainting ◽

Search Method ◽

Local Search Method ◽

Synthesis Algorithm ◽

Image Construction ◽

Tv Model ◽

Improved Algorithm

The image inpainting method based on CriminiciA’s algorithm is slowly complete the image for large blank area. An improved algorithm based on the classic texture synthesis algorithm for image inpainting is proposed for imaging logging inpainting, which is used to generate the fullbore image. Two schemes, the local search method and priority calculation with TV model, are employed in the improved texture synthesis method. Some examples were given to demonstrate the effectiveness of the proposed algorithm on dealing with fullbore image construction with large blank area and raising efficiency obviously.

Download Full-text

Uma Heurística ILS para Resolução do Problema de Carregamento e Descarregamento de Contêineres em Navios Porta-contêineres

10.5753/sbsi.2011.14563 ◽

2011 ◽

Author(s):

Amaro José De S. Neto ◽

Dalessandro S. Vianna ◽

Marcilene De Fátima D. Vianna

Keyword(s):

Local Search ◽

Search Method ◽

Greedy Heuristic ◽

Local Search Method ◽

Loading And Unloading ◽

Loading Sequence

When docking at a port terminal it may be necessary to perform various operations of loading and unloading containers. Sometimes, when unloading, the target container which needs to be unloaded may be positioned below other containers that will not be unloaded at this time. These ones need to be removed to unload the target container. The goal is to find the best loading sequence minimizing thus the number of "rearrangements". The proposed heuristic was compared with a greedy heuristic and a local search method. The results show the adequacy of ILS heuristic to the problem addressed.

Download Full-text