With significant advances in computing power during recent years, increasingly complex variants of the vehicle routing problem (VRP) with added constraints are coming into focus. VRP is a combination of the classical traveling salesman and bin packing problems, with many real world applications in various fields – from physical resource manipulation planning to virtual resource management in th...

The Vehicle Routing Problem (VRP) is a hard combinatorial problem with numerous industrial applications. Among the large number of extensions to the canonical VRP, we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. A cellular Genetic Algorithm (cGA)—a kind of decentralized population based heuristic—is used for solving CVRP, improving seve...

In the paper we examine a modification of the classical Vehicle Routing Problem (VRP) in which three-dimensional shapes of transported cargo are accounted for. This approach, in contrast to the standard capacitated VRP (CVRP) formulation, is appropriate when transported commodities are not perfectly divisible, but have fixed and heterogeneous dimensions. However, nesting a version of a threedim...

The Vehicle Routing Problem (VRP) has existed as long as a distributor has needed to deliver items. As such, the VRP has been solved with many different methods, including agent architecture and ant colony modeling. However, these methods have generally been set up for an established organization that has a specific number of vehicles with only a few unique capacities. This project aims to crea...

Mobile ad hoc networks (MANETs) have dynamic irregular topologies by nature, and suffer from inherent limitations such as limited bandwidth and power. A number of routing protocols have been proposed in the past few years to deal with these issues efficiently. The paper proposes and evaluates a new routing protocol, referred to here as the vector routing protocol (VRP). One of the main features...

A. Determined the exact structure of the asymptotic optimal solution value of the VRP with capacity and time window constraints and used it to develop a new and efficient algorithm. In Bramel and Simchi-Levi (1996) we have characterized the asymptotic optimal cost of the VRP with Capacity and Time Window constraints. This characterization enabled us to understand the algorithmic structure requi...

In this paper we define a new problem, the aim of which is to find a set of k dissimilar solutions for a vehicle routing problem (VRP) on a single instance. This problem has several practical applications in the cashin-transit sector and in the transportation of hazardous materials. A min–max mathematical formulation is proposed which requires a maximum similarity threshold between VRP solution...

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the...

Jedan je od glavnih zadataka vidnoga radnog pamćenja (VRP) zaštita pohranjenih sadržaja nevažnih vidnih podražaja u okolini, tj. distraktirajućih informacija. Iako velik broj istraživanja pokazuje negativan utjecaj distraktora na sadržaje VRP-u, nejasno utječu li distraktori jednako VRP različitim fazama obrade, tijekom kodiranja, zadržavanja i dosjećanja. U provedenome su istraživanju sudionic...