The vehicle routing problem (VRP) is a typical discrete combinatorial optimization problem, and many models algorithms have been proposed to solve the VRP its variants. Although existing approaches contributed significantly development of this field, these either are limited in size or need manual intervention choosing parameters. To difficulties, studies considered learning-based (LBO) VRP. Th...

With the development of economy, distribution problem logistics becomes more and complex. Based on traffic network data, this study analyzed vehicle routing (VRP), designed a dynamic with time window (DVRPTW) model, solved it genetic algorithm (GA). In order to improve performance algorithm, operation was improved, output solution further optimized by hill climbing algorithm. The analysis examp...

Vehicle routing problem is a kind of common problem in logistics distribution center, in order to solve the high delivery cost of VRP and time constraint problem, the VRP model with the object level and constraints by semi-soft time window is built. Aiming to the semi-soft time window constraints the optimization of the model is discussed. Finally the numerical examples prove the superiority of...

The vehicle routing problem (VRP) is an important aspect of transportation logistics with many variants. This paper studies the VRP with backhauls (VRPB) in which the set of customers is partitioned into two subsets: linehaul customers requiring a quantity of product to be delivered, and backhaul customers with a quantity to be picked up. The basic VRPB involves finding a collection of routes w...

This paper presents a review of vehicle routing problem with simultaneous pickup and deliveries (VRPSPD). VRPSPD is a variant of the VRP where both delivery and pickup demands are fulfilled simultaneously. Due to computer accessibility and increased capability in computing, algorithm development has shown major advancements. These were reflected in VRP researches also. The need to improve vehic...

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 ...

This paper studies approximations to the average length of Vehicle Routing Problems (VRP). The approximations are valuable for strategic and planning analysis of transportation and logistics problems. The research focus is on VRP with varying number of customers, demands, and locations. This modeling environment can be used in transport and logistics models that deal with a distribution center ...

This paper studies approximations to the average length of Vehicle Routing Problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and planning analysis of transportation and logistics problems. Using asymptotic properties of vehicle routing problems and the average probability of successfully sequencing a customer with time w...

The vehicle routing problem (VRP) is an important aspect of transportation logistics with many variants. This paper studies the VRP with backhauls (VRPB) in which the set of customers is partitioned into two subsets: linehaul customers requiring a quantity of product to be delivered, and backhaul customers with a quantity to be picked up. The basic VRPB involves finding a collection of routes w...

In this paper, we present an intelligent solution system for a vehicle routing problem (VRP) with rigid time window in urban distribution. The solution has three stages. The first stage uses Clustering Analysis in Data Mining to classify all customers by a number of attributes, such as distance, demand level, the density of customer, and city layout. The second stage introduces how to generate ...