A hybrid particle swarm optimization for the generalized assignment problem with time window

Abstract

Abstract. This study focuses on the inbound logistics of the sugarcane industry, which has three main procedures consisting of cultivation, harvest and transportation. Generally, small-scale growers cannot manage all of the procedures effectively, because of their lack of bargaining power and inadequate equipment. For this reason a resource-sharing policy, such as harvester and truck sharing, is used by factories to reduce the cost of the sugarcane harvest, and increase harvester and truck utilization. To solve the generalized assignment problem (GAP) with time window, thus minimizing the total cost from the assignment of the third-party logistics providers to service small-scale growers under capacity and time limitations, a mathematical model has been developed for small-sized problems. For large-scale problems, particle swarm optimization (PSO) is applied and improved by the hybridization of PSO with k-cyclic moves algorithm (PSOK). The results demonstrate that the proposed metaheuristics can solve the problem efficiently since the results are equal to, or close to, the optimal solutions in which the averaged performances of PSO and PSOK are 99.61% and 99.64%, respectively and the averaged relative improvement is 0.1519%.

Um modelo de programação linear inteira mista para a alocação de funcionários de uma empresa de software

“…O problema abordado é NP-Difícil é e proposta uma abordagem que utiliza elementos da teoria dos jogos. Simulações realizadas mostraram a eficiência do método proposto Phudphad et al (2018). utilizam o GAP para procedimentos de cultivo, colheita e transporte em uma indústria canavieira com o objetivo de minimizar o custo logístico total de atendimento, por fornecedores terceirizados, de produtores de pequeno porte com limitações de capacidade e de tempo.…”