Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solut...

In this paper the classical Vehicle Routing Problem (VRP) is extended to cover the more realistic case of uncertainty about customer demands. This case is modelled as a VRP with stochastic demands and tackled with a heuristic solution approach based on Ant Colony Optimization (ACO). The main issues studied in this paper are the modelling of the uncertainty (i) in terms of its influence on the p...

This work introduces the Green Vehicle Routing Problem (GVRP). The GVRP is an extension of the well-known vehicle routing problem (VRP). Moreover, the GVRP includes an objective function that minimizes weighted distance. Minimizing weighted distance reduces fuel consumption and consequently CO2 emissions. Therefore, the GVRP is more environmentally friendly than traditional versions of the VRP....

To solve the low-carbon vehicle routing problem (VRP) with sustainable development background, VRP considering impact of speed on carbon emissions is studied. A optimization model aims to minimize total cost distribution, penalty and emission cost. In model, driving time are calculated basis varying matching real road network. Moreover, improved genetic algorithm applied optimize in this paper....

The VRP’s main objective is to obtain the lowest-cost set of routes to deliver demand to customers, but we can also think about reducing the cardinality of the set of routes. In addition, we can contemplate other objectives like the makespan, workload balance, and some others [10]. This means that we can consider VRP as a multi-objective problem. Moreover, VRP has several variants of increased ...

Distribution is a substantial cost in many companies and in some sectors it contributes a high percentage of the value added to goods. Therefore the potential for savings is large, and there is much interest in improving distribution eeciency. The Vehicle Routing Problem (vrp) is an abstraction of a class of problems that has been studied both as a theoretical problem and for its practical rele...

This paper introduces a new class of stochastic volatility models which allows for stochastic volatility of volatility (SVV): Volatility modulated non–Gaussian Ornstein–Uhlenbeck (VMOU) processes. Various probabilistic properties of (integrated) VMOU processes are presented. Further we study the effect of the SVV on the leverage effect and on the presence of long memory. One of the key results ...

In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common application arise in newspaper and food delivery, and in milk collection. This paper summarizes the main known results for the classical VRP in which only vehicle ca...

Providing safe transportation for Hazardous Materials (Hazmat) is a concern that attracts a wide range of resaerchers. Different types of problems have been defined in the literature in order to cope as much as possible with real situations. Most of existing studies consider the transportation between two points, while few of them considered resolving the Vehicle Routing Problem (VRP) in the co...

To solve the problem of easily trapped into local optimization and instable calculation results, a new fine-adjustment mechanism-based particle swarm optimized algorithm applicable to solution seeking of VRP model is presented in this paper. This algorithm introduces the fine-adjustment mechanism so as to get adapt to the judgment base of function directional derivative value. By adjusting the ...