Hybrid Genetic Algorithm with Simulated Annealing for Resource-Constrained Project Scheduling

Bettemir, Önder Halis; Sönmez, Rifat

doi:10.1061/(asce)me.1943-5479.0000323

Cited by 63 publications

(40 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…With the development of computer science, HGA was first proposed by Mahfoud [ Mahfoud and Golberg , ]. At present, HGA have been used in various fields [ Bettemir and Sonmez , ; Chen and Shahandashti , ; Chen et al ., ]. And it was first introduced to study ionosphere by Song [ Song et al ., ].…”

Section: The Automatic Scaling Methodsmentioning

confidence: 99%

An automatic scaling method for obtaining the trace and parameters from oblique ionogram based on hybrid genetic algorithm

et al. 2016

View full text Add to dashboard Cite

Scaling oblique ionogram plays an important role in obtaining ionospheric structure at the midpoint of oblique sounding path. The paper proposed an automatic scaling method to extract the trace and parameters of oblique ionogram based on hybrid genetic algorithm (HGA). The extracted 10 parameters come from F2 layer and Es layer, such as maximum observation frequency, critical frequency, and virtual height. The method adopts quasi‐parabolic (QP) model to describe F2 layer's electron density profile that is used to synthesize trace. And it utilizes secant theorem, Martyn's equivalent path theorem, image processing technology, and echoes' characteristics to determine seven parameters' best fit values, and three parameter's initial values in QP model to set up their searching spaces which are the needed input data of HGA. Then HGA searches the three parameters' best fit values from their searching spaces based on the fitness between the synthesized trace and the real trace. In order to verify the performance of the method, 240 oblique ionograms are scaled and their results are compared with manual scaling results and the inversion results of the corresponding vertical ionograms. The comparison results show that the scaling results are accurate or at least adequate 60–90% of the time.

show abstract

Section: The Automatic Scaling Methodsmentioning

confidence: 99%

An automatic scaling method for obtaining the trace and parameters from oblique ionogram based on hybrid genetic algorithm

et al. 2016

View full text Add to dashboard Cite

show abstract

“…In this sense, a standard RCPSP is regarded as a special case of MRCPSP, since each activity only has one execution mode. The RCPSP and its extended forms are non-deterministic polynomial hard (NP-hard) problems, to solve which effective heuristic and meta-heuristic solutions are highly preferred [50][51][52][53][54][55]. In shipbuilding projects, each task can be completed by several different manufacturing units, which can be regarded as execution modes with different resources requirements.…”

Section: Resource Constrained Project Schedulingmentioning

confidence: 99%

Research on Collaborative Planning and Symmetric Scheduling for Parallel Shipbuilding Projects in the Open Distributed Manufacturing Environment

Mao

Guo

et al. 2020

Symmetry

View full text Add to dashboard Cite

In the current distributed manufacturing environment, more extensive enterprise cooperation is an effective means for shipbuilding companies to increase the competitiveness. However, considering the project scale and the uneven production capacity between the collaborative enterprises, a key issue for shipbuilding companies is to effectively combine the product-oriented project tasks and the specialized production-oriented plants. Due to information privatization, the decision-making process of project planning and scheduling is distributed and symmetric. Existing project scheduling methods and collaboration mechanisms in the shipbuilding industry are somehow inefficient. The aim of the research is to provide an assistant decision-making method to support effective task dispatching and multi-party cooperation for better utilization of the distributed resources and to help project managers control the shipbuilding process. The article initially establishes an agent-based complex shipbuilding project collaborative planning and symmetric scheduling framework, simulating the distributed collaborative decision-making process and bridging the multi-project planning with the individual project scheduling in much detail, which fills the research gap. A negotiation method based on iterative combination auction (ICA) is further proposed to solve the integration problem of project planning and task scheduling, and an illustrative example is conducted to demonstrate the effectiveness and rationality of the methods. Finally, an application case using a prototype system on shipbuilding projects collaborative planning and scheduling will be reported as a result.

show abstract

“…El algortimo Simulated Annealing (SA) (Templado Simulado), tiene la característica principal de simular el enfriamiento del acero, utilizando un proceso cíclico y de velocidad regulada, donde la matriz poblacional es dividida en capas desde afuera hacia adentro. Estas capas rotan al mismo paso y horizontalmente se miden los costos de las rutas, guardándose los resultados en la zona computacional, luego se ordena y se sigue el proceso hasta que algunas de las rutas sea inferior al umbral; esto emula el acomodo de los átomos del proceso martensítico para obtener el acero (enfriamiento lento) (Bettemir, et al, 2015;Rodriguez et al, 2011). El algoritmo búsqueda Tabú (TS), tiene la característica principal del intercambio de las columnas de la matriz poblacional donde los cambios generan disminuciones de los costos; si los intercambios producen un decremento del costo de la ruta ese intercambio se premia y si el intercambio produce un aumento en el costo de las rutas se castiga por una cantidad específica de iteraciones que disminuye hasta que vuelve a estar operativo el intercambio de esas columnas.…”

Section: Algoritmos Heurísticosunclassified

Estrategia Metaheurística para Redes Ópticas sin Conversión de Longitud de Onda con Tráfico Dinámico (WDM)

2016

View full text Add to dashboard Cite

ResumenLa presente investigación muestra la comparación entre diferentes heurísticas tales como Algoritmos genéticos, Simulated Annealing, Tabú Search, Snake-One y una nueva metaheurística Snake-Two. Anteriormente se obtuvieron bajos niveles de probabilidad de bloqueo con tendencia de aumento del uso de recursos. La estrategia Snake-Two demuestra que el comportamiento de la probabilidad de bloqueo disminuye a un costo bajo de utilización de la red. Estos resultados son comparados con un algoritmo convencional utilizado como referencia que permite visualizar la mejora en cada indicador. Los indicadores utilizados son la probabilidad de bloqueo y la utilización de la red y un nuevo indicador denominado Tasa de Algoritmo Heurístico. Esta estrategia propone utilizar enlaces congestionados hasta saturarlos permitiendo que el tráfico se concentre en algunas zonas y desdensifique otras. Los resultados son prometedores al lograr disminuir la probabilidad de bloqueo pero se mantiene la tendencia de aumento del uso de los recursos de la red. Palabras clave: recocido simulado; algortimos genéticos; modelo activo de contorno; snake one; snake twoAbstract This research shows the performance comparison between different heuristics such as genetic algorithms, simulated annealing, Tabu Search, Snake-One and a new metaheuristic called Snake-Two. Earlier were obtained low blocking probability but with a tendency to increase network utilization. The new Snake-Two strategy can prove that the behavior of the blocking probability decreases at low network usage. These results are compared with a conventional algorithm that was used to visualize the improvement of each indicator. The indicators used for comparison, are the blocking probability and the network utilization and a new indicator called Heuristic Algorithm Rate. This strategy proposes using the congested links, allowing increasing the traffic in some areas, and reducing it in other areas. The results are promising to achieve lower blocking probability but the tendency of increasing the use of the network resources continues.

show abstract

Hybrid Genetic Algorithm with Simulated Annealing for Resource-Constrained Project Scheduling

Cited by 63 publications

References 36 publications

An automatic scaling method for obtaining the trace and parameters from oblique ionogram based on hybrid genetic algorithm

An automatic scaling method for obtaining the trace and parameters from oblique ionogram based on hybrid genetic algorithm

Research on Collaborative Planning and Symmetric Scheduling for Parallel Shipbuilding Projects in the Open Distributed Manufacturing Environment

Estrategia Metaheurística para Redes Ópticas sin Conversión de Longitud de Onda con Tráfico Dinámico (WDM)

Contact Info

Product

Resources

About