Transportation problems appear in many practically highly relevant areas of our daily life. In this work we deal with a generalized variant of the classical Vehicle Routing Problem (VRP), namely the Periodic Vehicle Routing Problem with Time Windows (PVRPTW), for which only few specific solution techniques have been described in the literature. The basis forms the VRP which is defined on a comp...

The Vehicle Routing Problem with Pickups and Deliveries (VRPPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods. We do not make the assumption common in the VRPPD literature, that goods may only be picked up after all deliveries have been completed. We also eschew the concept of insertion and propose a method that treats pickups an...

The vehicle routing problem with simultaneous delivery and pick-up (VRPSDP) is a type of the classical vehicle routing problem (VRP) where customers require simultaneous delivery and pick-up service. Deliveries are supplied from a single depot at the beginning of the vehicle’s service, while pick-up loads are taken to the same depot at the end of the service. The objective is to determine the o...

In this paper, we discuss the multi-depot vehicle routing problem with regard to mobile beekeeping. Considering that beekeepers usually do not have their own land plots rarely rely on external transporters and often plots, present a fully functional platform pair beekeepers, transporters, plot owners. Two algorithms for calculating optimal beekeeping routes are developed in order increase honey...

We consider an extension of the capacitated Vehicle Routing Problem (VRP), known as the Vehicle Routing Problem with Backhauls (VRPB), in which the set of customers is partitioned into two subsets: Linehaul and Backhaul customers. Each Linehaul customer requires the delivery of a given quantity of product from the depot, whereas a given quantity of product must be picked up from each Backhaul c...

We consider a transport system problem which involves route planning for vehicles with containers attached, and cargo accommodation. The specific problem considered is the vehicle routing problem with loading constraints. Its input consists of a weighted undirected graph where vertices corresponds to clients and edges costs represents the cost to move the vehicle along that edge. Each vertex ha...

The vehicle routing problem with stochastic demands and probabilistic distance constraints (VRPSD-PDC) can be defined on a complete and undirected graph G = (V, E), where V = {0, . . . , n} is the vertex set and E = {(v, u) : v, u ∈ V, v ̸= u} is the edge set. Vertices v = 1, . . . , n represent the customers and vertex v = 0 represents the depot. A distance de is associated with edge e = (v, u)...

We study the tractor and semi-trailer routing problem TSRP , a variant of the vehicle routing problem VRP . In the TSRPmodel for this paper, vehicles are dispatched on a trailer-flow network where there is only onemain depot, and all tractors originate and terminate in themain depot. Two types of decisions are involved: the number of tractors and the route of each tractor. Heuristic algorithms ...

We consider the Split Delivery Vehicle Routing Problem (SDVRP) where a fleet of homogeneous vehicles has to serve a set of customers. Each customer can be visited more than once, contrary to what is usually assumed in the classical Vehicle Routing Problem (VRP) and the demand of each customer can be greater than the capacity of the vehicles. No constraint on the number of available vehicles is ...