An asynchronous parallel metaheuristic for the period vehicle routing problem

Drummond, Lúcia Maria de A.; Ochi, Luiz Satoru; Vianna, Dalessandro Soares

doi:10.1016/s0167-739x(99)00118-1

Cited by 69 publications

(33 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Some references on periodic vehicle routing are Baptista et al (2002), Chao et al (1995), Christofides and Beasley (1984), Cordeau, et al (1997), Drummond et al (2001), Russell and Gribbin (1991), and Tan and Beasley (1984).…”

Section: Periodic Routingmentioning

confidence: 99%

Factory gate pricing: An analysis of the Dutch retail distribution

Blanc

Cruijssen

Fleuren

et al. 2006

European Journal of Operational Research

View full text Add to dashboard Cite

Factory Gate Pricing (FGP) is a relatively new phenomenon in retail distribution. Under FGP, products are no longer delivered at the retailer distribution center, but collected by the retailer at the factory gates of the suppliers. Owing to both the asymmetry in the distribution networks (the supplier sites greatly outnumber the retailer distribution centers) and the better inventory and transport coordination mechanisms, this is likely to result in high savings. A mathematical model was used to analyze the benefits of FGP for a case study in the Dutch retail sector. Extensive numerical results are presented to show the effect of the orchestration shift from supplier to retailer, the improved coordination mechanisms, and sector-wide cooperation.

show abstract

Section: Periodic Routingmentioning

confidence: 99%

Factory gate pricing: An analysis of the Dutch retail distribution

Blanc

Cruijssen

Fleuren

et al. 2006

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…They use a two-phase approach, that first assigns orders to days and then constructs the routes of each day. Finally Drummond et al (2001) proposed parallel genetic algorithms.…”

Section: Introductionmentioning

confidence: 99%

A variable neighborhood search heuristic for periodic routing problems

Hemmelmayr

Doerner

Hartl

2009

European Journal of Operational Research

250

100

View full text Add to dashboard Cite

The aim of this paper is to propose a new heuristic for the Periodic Vehicle Routing Problem (PVRP) without time windows. The PVRP extends the classical Vehicle Routing Problem to a planning horizon of several days. Each customer requires a certain number of visits within this time horizon while there is some flexibility on the exact days of the visits. Hence, one has to choose the visit days for each customer and to solve a VRP for each day. Our method is based on Variable Neighborhood Search (VNS). Computational results are presented, that show that our approach is competitive and even outperforms existing solution procedures proposed in the literature. Also considered is the special case of a single vehicle, i.e. the Periodic Traveling Salesman Problem (PTSP). It is shown that slight changes of the proposed VNS procedure is also competitive for the PTSP.

show abstract

“…Nossa proposta diferencia-se dessas pelo fato de que utilizamos a programação paralela para reduzir o tempo de computação do AG, mantendo, e na maioria casos, melhorando a qualidade das soluções A paralelização de AG vem sendo alvo de pesquisas como, por exemplo, implementações baseadas no modelo de ilhas onde as populações são isoladas em ilhas e o melhor indivíduo de cada ilha é migrado para outra [23]. Esse modelo torna a granularidade do problema maior, possibilitando a execução em clusters de computadores via Message-Passing Interface (MPI) [24].…”

Section: Trabalhos Relacionadosunclassified

O impacto da paralelização com OpenMP no desempenho e na qualidade das soluções de um Algoritmo Genético

Gressler

Cristina

2014

Revista Brasileira De Computação Aplicada

View full text Add to dashboard Cite

Resumo: O Problema do Roteamento de Veículos (PRV) é um problema combinatório de difícil solução, aplicável tanto para logística de empresas de transporte quanto para melhor ocupação das vias públicas. Resolvê-lo testando todas as combinações possíveis (método de força bruta) torna-se inviável à medida que o problema escala, pois demanda um tempo de computação muito grande. Os Algoritmos Genéticos (AG) são meta-heurísticas capazes de encontrar soluções em um tempo computacional aceitável. Entretanto, mesmo os AG podem demandar um elevado tempo de processamento, dependendo das configurações utilizadas. Com a evolução das arquiteturas computacionais e a difusão das arquiteturas multicore, o uso da programação multithread torna-se uma alternativa para reduzir o tempo envolvido na solução de problemas combinatórios. Este artigo objetiva acelerar a resolução do PRV por meio da paralelização do AG com OpenMP, que é um padrão amplamente difundido para programação multithread. Nossos resultados atingiram um speedup acima de 2, utilizando 4 threads em um processador quadcore. Esse ganho está limitado à forma como o AG está implementado. Além do impacto no desempenho do AG também comprovou-se que o uso do OpenMP não afeta a qualidade das soluções. Adicionalmente, o uso do OpenMP permitiu que o AG encontrasse melhores soluções devido ao aumento do número de evoluções computadas num mesmo intervalo de tempo.Palavras-chave: Algoritmos genéticos. Desempenho. OpenMP. Qualidade das soluções. Abstract:Routing Vehicle Problem (RVP) is a combinatorial problem, hard to solve, used to improve the logistics of transport enterprises as well as to improve the traffic in the public ways. To solve it testing all combinations (brute force method) became unfisible as the problem scale, because it demands a large computing time. Genetic Algorithms (GA) are meta-heuristics able to find solutions in an acceptable computing time. However, even GA can demand a large computing time as they are set. Computional architectures evolution and the multicore difusion became the multithread programming an alternativ to reduce GA time. This article aims to speed up the RVP solution through the GA parallelization using OpenMP, which is a popular standard to multithreading programming. Our results show an speedup up to 2 for 4 threads in a quadcore processor. This gain is limited according to our GA is implemented. Beside the performance impact, we also show that the usage of OpenMP did not affect the solutions quality. Furthermore, OpenMP allow the GA to find better solutions because it make possible to increase the number of evolution in an time slice.

show abstract

An asynchronous parallel metaheuristic for the period vehicle routing problem

Cited by 69 publications

References 6 publications

Factory gate pricing: An analysis of the Dutch retail distribution

Factory gate pricing: An analysis of the Dutch retail distribution

A variable neighborhood search heuristic for periodic routing problems

O impacto da paralelização com OpenMP no desempenho e na qualidade das soluções de um Algoritmo Genético

Contact Info

Product

Resources

About