IEEE Organizations related to Vehicle Routing

Back to Top

No organizations are currently tagged "Vehicle Routing"



Conferences related to Vehicle Routing

Back to Top

No conferences are currently tagged "Vehicle Routing"


Periodicals related to Vehicle Routing

Back to Top

No periodicals are currently tagged "Vehicle Routing"


Most published Xplore authors for Vehicle Routing

Back to Top

Xplore Articles related to Vehicle Routing

Back to Top

Hybrid ant colony system algorithm for the vehicle routing problem with dynamic customers and traffic factors

2017 Intelligent Systems and Computer Vision (ISCV), 2017

A recent research showed that the Ant Colony System (ACS) algorithm hybridized with the Large Neighborhood Search (LNS) algorithm perform well on the Vehicle Routing Problem (VRP) in the dynamic environment. In this paper, we address this hybridization for this problem with traffic factors, which takes into account the variation of the travel cost between two locations. The main goal ...


Solving vehicle routing problem using hybrid swarm intelligent methods

2016 International Conference on Communication and Signal Processing (ICCSP), 2016

Vehicle Routing Problem arises in real life applications when vehicles are routed to several locations to fulfill customer's requirements within specified constraints. A comprehensive study of recent works on Vehicle Routing Problem; mostly on Vehicle Routing Problem with Time Window is carried out based on their problem characteristics. Exact Methods, Heuristics, Meta Heuristics and Hybrid Methods are found to be ...


Vehicle scheduling base on the improved particle swarm

2016 World Automation Congress (WAC), 2016

In order to effectively prevent particle swarm into local optimum and enhance the ability of particles to find the optimal solution, the paper proposes an improved particle swarm algorithm. The paper is on the background of vehicle scheduling, which is using the load priority strategy, and establishes the model for vehicle scheduling problem with load and vehicle scheduling problem with ...


An improved ant colony algorithm based on vehicle routing problem

2015 34th Chinese Control Conference (CCC), 2015

The vehicle routing problem is a classical combinatorial optimization and integer programming problem. This paper proposed an improved ant colony algorithm to avoid the premature convergence and increase convergence speed, its main improvements including a novel probabilistic state transition, dynamically adjusting the value of the pheromone volatile parameter, and coupled with local optimization heuristics(2-Opt heuristics). Apply this algorithm to instance ...


An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

2017 International Conference on Computer Network, Electronic and Automation (ICCNEA), 2017

The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case studies involving less than 100 nodes to optimality, but time-consuming. To overcome the limitation, this paper presents a novel two-phase heuristic approach for the capacitated vehicle routing problem. Phase I aims to identifying sets of cost-effective feasible ...


More Xplore Articles

Educational Resources on Vehicle Routing

Back to Top

IEEE-USA E-Books

  • Hybrid ant colony system algorithm for the vehicle routing problem with dynamic customers and traffic factors

    A recent research showed that the Ant Colony System (ACS) algorithm hybridized with the Large Neighborhood Search (LNS) algorithm perform well on the Vehicle Routing Problem (VRP) in the dynamic environment. In this paper, we address this hybridization for this problem with traffic factors, which takes into account the variation of the travel cost between two locations. The main goal of this work is to minimize the total cost in the vehicle routing problem with dynamic requests and traffic factors using a hybridized ant colony system algorithm.

  • Solving vehicle routing problem using hybrid swarm intelligent methods

    Vehicle Routing Problem arises in real life applications when vehicles are routed to several locations to fulfill customer's requirements within specified constraints. A comprehensive study of recent works on Vehicle Routing Problem; mostly on Vehicle Routing Problem with Time Window is carried out based on their problem characteristics. Exact Methods, Heuristics, Meta Heuristics and Hybrid Methods are found to be the common methods for solving Vehicle Routing Problem. Hybrid Swarm Intelligent Methods are to be experimented to solve Vehicle Routing Problem.

  • Vehicle scheduling base on the improved particle swarm

    In order to effectively prevent particle swarm into local optimum and enhance the ability of particles to find the optimal solution, the paper proposes an improved particle swarm algorithm. The paper is on the background of vehicle scheduling, which is using the load priority strategy, and establishes the model for vehicle scheduling problem with load and vehicle scheduling problem with soft time windows. The experimental results show that the improved particle swarm can quickly and efficiently obtain the optimal solution for vehicle routing problem.

  • An improved ant colony algorithm based on vehicle routing problem

    The vehicle routing problem is a classical combinatorial optimization and integer programming problem. This paper proposed an improved ant colony algorithm to avoid the premature convergence and increase convergence speed, its main improvements including a novel probabilistic state transition, dynamically adjusting the value of the pheromone volatile parameter, and coupled with local optimization heuristics(2-Opt heuristics). Apply this algorithm to instance Eil22, the result shows that the proposed algorithm can obtain the optimal solution rapidly and accurately.

  • An Efficient Density-Based Clustering Algorithm for the Capacitated Vehicle Routing Problem

    The capacitated vehicle routing problem (CVRP) is one of the most challenging problems in the optimization of distribution. Most approaches can solve case studies involving less than 100 nodes to optimality, but time-consuming. To overcome the limitation, this paper presents a novel two-phase heuristic approach for the capacitated vehicle routing problem. Phase I aims to identifying sets of cost-effective feasible clusters through an improved density-based clustering algorithm. Phase II assigns clusters to vehicles and sequences them on each tour. Max-min ant system is used to order nodes within clusters. The simulation results indicate efficiency of the proposed algorithm.

  • Vehicle routing problem with simultaneous delivery and pick-up under different weights

    In order to solve the enterprise's actual problem and meet the demand under different priority level of new product distribution and old product recycling in business enterprise, This paper improves the traditional vehicle routing problem with simultaneous delivery and pick-up. Considering the importance of the new product distribution and old product recycling in enterprise operation, we put forward the pickup and delivery vehicle routing optimization problem under different weights and establish a mathematical model. With the introduction of power grid enterprise actual calculation example and by using lingo, a software tool to solve mathematical model, for calculating, we analyze and verify the effectiveness of the model and its actual effect.

  • A hybrid Genetic Algorithm for Vehicle Routing Problem with Time Windows

    The Vehicle Routing Problem with Time Windows (VRPTW) consists of a homogenous set of vehicles and a set of customer located in a city. In VRPTW all the vehicles starts from the depot visit the customer and end at the depot. Each customer is visited exactly by one vehicle within the specified time window. The objective is to minimize the number of vehicles and total distance travelled simultaneously. This represents the multiobjective Vehicle Routing Problem with Time Windows. The proposed work consists of Hybrid Genetic Search with Diversity Control using the Genetic Algorithm for solving the VRPTW. The Pareto approach is used for finding the set of optimal solutions for achieving the multiobjective. The crossover operator is used for exchanging the best routes, which have shortest distance. Two mutation operators such as relocation mutation operator and split mutation operator were used in this application. In this, it accounts penalty for an infeasible solutions with respect to time-window and duration constrains. The computations are performed using the instances which are obtained from the VRPLIB.

  • Logistics - 2

    In this regular session we aim to highlight some different research areas with regards to the logistics problems.

  • Modified clarke wright algorithms for solving the realistic vehicle routing problem

    The Vehicle Routing Problem (VRP) is a well-known management problem in large enterprises' logistic departments; in fact, it is classified as a combinatorial problem, where customers of known demands are supplied by one or several depots. Several realistic constraints are related to the vehicle routing problem; and thus, much time is needed to solve this problem in a deterministic way. The purpose of this work is to resolve a major concern for several enterprises that needs to serve their `prioritized' customers in the shortest possible time. Thus, in this paper we implement and test a modified version of the Clarke Wright algorithm where we concentrate on route time and customer's priority. In this modified version, we, further, want to serve all customers as per their pre-assigned priorities, keeping in mind to cover the needed working hours. The results of our modified algorithm show that ....

  • Exponential smoothing for emergency service forecasting in electric power distribution utilities

    The present study is aimed to estimate service time on the emergency service orders of an electric company. For this, a sequence of steps has been developed and described for the structuring of a demand forecasting system, which must be able to design patterns and tendencies of the analyzed data from past demands. Intending to meet these assumptions, the study sought to support the prediction method by exponential smoothing. The results obtained with this method, assist the process of service demand per hour and day of the week.



Standards related to Vehicle Routing

Back to Top

No standards are currently tagged "Vehicle Routing"


Jobs related to Vehicle Routing

Back to Top