The vehicle routing problem (VRP) is a family of problems whereby a fleet of vehicles must service the commodity demands of a set of geographically scattered customers from one or more depots, subject to a number of constraints. Early hyper-heuristic research focussed on selecting and applying a low-level heuristic at a given stage of an optimisation process. Recent trends have led to a number ...

The distribution of finished products from depots to customers is a practical and challenging problem in logistics management. Better routing and scheduling decisions can result in higher level of customer satisfaction because more customers can be served in a shorter time. The distribution problem is generally formulated as the vehicle routing problem (VRP). Nevertheless, there is a rigid assu...

The objective of vehicle routing problem (VRP) is to design a set of vehicle routes in which a fixed fleet of delivery vehicles from one or several depots to a number of customers have to be set with some constraints. To this date in the literature, many instances of VRP model have been introduced and applied for various types of scheduling problems. However, when implemented in a real life app...

Development of vaccines against cytomegalovirus (CMV) is an important public health priority. We used a propagation-defective, single-cycle RNA replicon vector system derived from an attenuated strain of an alphavirus, Venezuelan equine encephalitis virus, to produce virus-like replicon particles (VRP) expressing various combinations of pp65, IE1, or gB proteins of human CMV. Protein expression...

In today’s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem CLP) and delivery route planning (referred as Vehicle Routing Problem VRP). Several authors address...

This paper studies parsimonious, intuitive, and effective formulas to approximate the length of Traveling Salesman Problems (TSP) and Vehicle Routing Problems (VRP). Using intuition derived from continuous models and graph theory, a formula to approximate the length of vehicle routes is proposed. In instances with different patterns of customer spatial distribution, time windows, customer deman...

The vehicle routing problem (vrp) is related to service a number of customers with a fleet of vehicles. In real life, the applications of transportation, distribution and logistics are mostly studied as a research area for scientists and industrial practioners. In this study, the cargo distribution problem has been presented by using vrp procedures for a cargo company in Isparta City, Turkiye. ...

Vehicle Routing Problem (VRP) has been an interesting research area since its introduction. There are various types of VRP models and different solution techniques proposed for this problem. This paper uses several clustering algorithms in initialization of Simulated Annealing to solve VRP. The main contribution of this research is to assess the effect of using some clustering methods in buildi...

In Hong Kong, 35% of residential mortgage loans are adjustable rate mortgages with variable tenor (VRT). That is, with a change in interest rates, the loan adjusts its maturity and principal payment such that the monthly installment remains the same. In other words, instead of bearing a volatility on monthly payments as in a ®xed-tenor variable payment (VRP) mortgage, VRT mortgagors bear intere...

Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, to provide the efficient vehicle serving to the customer through different services by visiting the number of cities or stops, the VRP follows the Travelling Salesman Problem (TSP), in which each of vehicle visiting a set of cities such that every city is vis...