In the well-known Vehicle Routing Problem (VRP), a set of identical vehicles, based at a central depot, is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. An important variant of the VRP arises when a fleet of vehicles characterized by different capacities and costs, is available for distribution activities. The problem is known as the Mixe...

The Vehicle Routing Problem (VRP) is a NP-hard and Combinatorial optimization problem. Combinatorial optimization problem can be viewed as searching for best element in a set of discrete items, which can be solved using search algorithm or meta heuristic. In this work, VRP is solved using population based search algorithm, Particle Swarm Optimization (PSO) with crossover and mutation operators....

The purpose of this paper is to discuss the design and implementation of comprehensive mission planning systems for swarms of autonomous aerial vehicles (UAV). Such a system could integrate several problem domains including path planning, vehicle routing, and swarm behavior as based upon a hierarchical architecture. The example developed system consists of a parallel multi-objective evolutionar...

Vehicle routing problems (VRP’s) involve assigning a fleet of limited capacity service vehicles to service a set of customers. This paper describes an innovative, agent-based approach to solving a real-world vehicle-routing problem embedded in a highly dynamic, unpredictable domain. Most VRP research, and all commercial products for solving VRP’s, make a static-world assumption, ignoring the dy...

In order to solve real-world vehicle routing problems, the standard Vehicle Routing Problem (VRP) model usually needs to be extended. Here we consider the case when customers can call in orders during the daily operations, i.e. both customer locations and demand may be unknown in advance. Our heuristic approach attempts to minimize the expected number of vehicles and their travel distance in th...

The classical vehicle routing problem (VRP) can be extended by including customers who want to send goods to the depot. This type of VRP is called the vehicle routing problem with pickups and deliveries (VRPPD). This study proposes a novel way to solve VRPPD by introducing a two-phase heuristic routing algorithm which consists of a clustering phase and uses the geometrical center of a cluster a...