An iterated tabu search for the multi-compartment vehicle routing problem

Silvestrin, Paulo Vitor; Ritt, Marcus

doi:10.1016/j.cor.2016.12.023

Cited by 78 publications

(24 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Learning real-time A-Star algorithm(LRTA-Star) is a heuristic search algorithm [52], [53], which satisfies the requirements of real-time planning in a dynamic environment by establishing and updating the evaluation cost from each state to the target point. However, the flight path planned by the single-step search is composed of a series of broken lines.…”

Section: Improved A-star Algorithmmentioning

confidence: 99%

A Novel Real-Time Penetration Path Planning Algorithm for Stealth UAV in 3D Complex Dynamic Environment

Zhang

Dai

et al. 2020

IEEE Access

View full text Add to dashboard Cite

In recent years, stealth aircraft penetration path planning has been a significant research subject in the field of low altitude combat. However, previous works have mainly concentrated on the path planning for stealth unmanned aerial vehicle(UAV) in 2D static environment. In contrast, this paper addresses a novel real-time path planning algorithm for stealth UAV to realize the rapid penetration, which aims to devise a route penetration strategy based on the improved A-Star algorithm to address the problems of replanning for stealth UAV in 3D complex dynamic environment. The proposed method introduces the kinematic model of stealth UAV and detection performance of netted radar in the process of low altitude penetration. Additionally, POP-UP threats are adopted into three different threat scenarios, which is closer to the real combat environment. Moreover, further combined with the prediction technique and route planning algorithm, the multi-step search strategy is developed for stealth UAV to deal with POP-UP threats and complete the replanning of the route in different scenarios. Furthermore, the attitude angle information is integrated into the improved A-Star algorithm, which reflects the characteristics of the dynamic radar cross section(RCS) and conforms to the actual flight requirements for the stealth UAV. Finally, the improved A-Star algorithm, the sparse A-Star Search(SAS), and the dynamic A-Star algorithm(D-Star) are respectively adopted to address the problem of penetration route planning for stealth UAV in three different threat scenarios. Numerical simulations are performed to illustrate that the proposed approach can achieve rapid penetration route planning for stealth UAV in a dynamic threat scenario, and verify the validity of the improved A-Star algorithm which is compared to the other two algorithms. INDEX TERMS Stealth unmanned aerial vehicle, dynamic radar cross-section, netted radar, real-time path planning, A-Star algorithm.

show abstract

Section: Improved A-star Algorithmmentioning

confidence: 99%

A Novel Real-Time Penetration Path Planning Algorithm for Stealth UAV in 3D Complex Dynamic Environment

Zhang

Dai

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Neste caso, existe um conjunto de tipos de veıćulos que podem ser aceitos ou não para atender as demandas de determinados clientes (Lin et al, 2014). Crevier et al (2007) No MCVRP, cada veıćulo possui dois ou mais compartimentos (Silvestrin e Ritt, 2017). Este tipo de veıćulo é largamente utilizado em distribuição de produtos derivados do petróleo, coleta seletiva de resıduos (Henke et al, 2015) e distribuição de encomendas em locais com restrição de acesso (Hübner e Ostermeier, 2018).…”

Section: Referencial Teóricounclassified

Planejamento de entregas em áreas urbanas considerando recarregamento intermediário, veículos com múltiplos compartimentos e restrição de acesso

Astoures

Rosa

2020

TRANSPORTES

View full text Add to dashboard Cite

Face ao aumento da demanda por transporte de mercadorias por comércios e residências nos últimos anos e, considerando as restrições de entrada de caminhões de grande porte impostas pelas cidades, faz-se necessário planejar as entregas de maneira diferente. Assim, esse artigo propõe o planejamento da entrega de mercadorias considerando recarregamento intermediário na rota, veículos com múltiplos compartimentos, alocação independente das caixas, período de atendimento e restrições de acesso nos clientes. Para planejar as entregas em áreas urbanas, é proposta uma nova classe de problema denominada Site Dependent Multiple Compartment Vehicle Routing Problem with Intermediate Replenishment Facilities and Time Windows com objetivo de minimizar o custo total do transporte. Foi analisado o problema de uma empresa que está em implantação na cidade de Vitória, ES. Utilizou-se o CPLEX 12.8 para resolver o modelo e os resultados mostraram que a disponibilidade de mais armazéns intermediários é a estratégia mais econômica.

show abstract

“…Maischberger [38] added perturbation mechanism to tabu search algorithm and used multicore parallel technology, both ensuring the diversity and optimization ability of algorithms and improving the efficiency of solving. Silvestrin [39] embedded tabu search algorithms in iterative local search algorithms for better computational results. Inspired by this, considering that genetic algorithm has a strong global search capability, premature algorithm may exist.…”

Section: Literature Reviewmentioning

confidence: 99%

Proactive Two-Level Dynamic Distribution Routing Optimization Based on Historical Data

Xue

Wen

2018

Mathematical Problems in Engineering

View full text Add to dashboard Cite

In view of the dynamic dispersion of e-commerce logistics demand, this paper uses the historical distribution data of logistics companies to study data-driven proactive vehicle routing optimization. First, based on the classic 2E-VRP problem, a single-node/multistage 2E-VRP mathematical model is constructed. Then, a framework for solving the proactive vehicle routing optimization problem is proposed in combination with the characteristics of the proposed model, including four modules: data-driven demand forecasting methods, customer clustering methods, proactive demand quotas and replenishment strategies, and vehicle routing optimization procedure. The significant feature of the proposed solution framework is that the response to dynamic customers is proactive rather than passive. The solution is applied to the distribution practice of a large logistics company in Chongqing. The results show that the proposed method has better dynamic scene adaptability and customer response capabilities in traffic limit.

show abstract

An iterated tabu search for the multi-compartment vehicle routing problem

Cited by 78 publications

References 37 publications

A Novel Real-Time Penetration Path Planning Algorithm for Stealth UAV in 3D Complex Dynamic Environment

A Novel Real-Time Penetration Path Planning Algorithm for Stealth UAV in 3D Complex Dynamic Environment

Planejamento de entregas em áreas urbanas considerando recarregamento intermediário, veículos com múltiplos compartimentos e restrição de acesso

Proactive Two-Level Dynamic Distribution Routing Optimization Based on Historical Data

Contact Info

Product

Resources

About