An optimization-driven dynamic vehicle routing algorithm for on-demand meal delivery using drones

VANETs is a rapid developed wireless mobile MANETs network with special challenge nature. It is a distributed and self-organized communication network based on moving vehicle. This network has characteristics like limited bandwidth, strong mobility, strong dynamic network topology, limited node degrees freedom, equipment capacity constraints and weak physical security. These characteristics usually make typical routing protocol in mobile MANET show a low efficiency in mobile VANETs, even fail. MANET routing algorithm is roughly divided into two categories, namely table driven routing protocol and on-demand routing protocol. It is due to the particularity of driving cars on the road. So how to improve network routing protocol in the performance is now a challenging problem. The purpose of this article studies network routing mechanism based on wireless vehicular networks simulation method. On the basis of analyzing the performance of typical routing protocols in MANET, such as DSDV, AODV and DSR, the improved scheme of AODV on-demand routing algorithm is put forward.

Download Full-text

A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food

Journal of Food Engineering ◽

10.1016/j.jfoodeng.2007.07.008 ◽

2008 ◽

Vol 85 (2) ◽

pp. 285-295 ◽

Cited By ~ 153

Author(s):

Ana Osvald ◽

Lidija Zadnik Stirn

Keyword(s):

Vehicle Routing ◽

Routing Algorithm ◽

Fresh Vegetables

Download Full-text

A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows

Scientific Programming ◽

10.1155/2017/1021432 ◽

2017 ◽

Vol 2017 ◽

pp. 1-13 ◽

Cited By ~ 2

Author(s):

Shifeng Chen ◽

Rong Chen ◽

Jian Gao

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Search Algorithm ◽

Time Windows ◽

Harmony Search ◽

Population Diversity ◽

Benchmark Problems ◽

Dynamic Vehicle Routing ◽

Dynamic Vehicle Routing Problem ◽

Routing Problem

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.

Download Full-text