scholarly journals A New Plant Intelligent Behaviour Optimisation Algorithm for Solving Vehicle Routing Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Godfrey Chagwiza
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Future Research ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Optimisation Algorithm ◽  
Input Parameters ◽  
Problem Instances

A new plant intelligent behaviour optimisation algorithm is developed. The algorithm is motivated by intelligent behaviour of plants and is implemented to solve benchmark vehicle routing problems of all sizes, and results were compared to those in literature. The results show that the new algorithm outperforms most of algorithms it was compared to for very large and large vehicle routing problem instances. This is attributed to the ability of the plant to use previously stored memory to respond to new problems. Future research may focus on improving input parameters so as to achieve better results.

The Research of Vehicle Routing Problem With Time Window for Changsha Yunda Express in Kaifu District

2013 ◽  
Vol 336-338 ◽  
pp. 2525-2528
Author(s):  
Zhong Liu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Distribution Center ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Service Levels ◽  
Shortest Distance

For express companies' distribution center, optimizing the vehicle routing can improve service levels and reduce logistics costs. This paper combines the present vehicle routing situation of Chang Sha Yunda Express in KaiFu area with the specific circumstances to analyze. A model of the vehicle routing problem with time window for the shortest distance was built and then use genetic algorithm to solve the problem. Its application showed that the method can effectively solve the current vehicle routing problems.

scholarly journals Multiple Ant Colony Optimization for Single Depot Multiple Trip Vehicle Routing Problems

10.29007/8tjs ◽  
2018 ◽  
Author(s):  
Zhengmao Ye ◽  
Habib Mohamadian
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Urban Areas ◽  
Ant Colony ◽  
Ant Colony System ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Single Vehicle

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different trips as long as the total time or distance is not exceeded. Various approaches are developed to solve the vehicle routing problem (VRP). Except for the simplest cases, VRP is always a computationally complex issue in order to optimize the objective function in terms or both time and expense. Ant colony optimization (ACO) has been introduced to solve the vehicle routing problem. The multiple ant colony system is proposed to search for alternative trails between the source and destination so as to minimize (fuel consumption, distance, time) among numerous geographically scattered routes. The objective is to design adaptive routing so as to balance loads among congesting city networks and to be adaptable to connection failures. As the route number increases, each route becomes less densely packed. It can be viewed as the vehicle scheduling problem with capacity constraints. The proposed scheme is applied to typical cases of vehicle routing problems with a single depot and flexible trip numbers. Results show feasibility and effectiveness of the approach.

scholarly journals C.H. Robinson Uses Heuristics to Solve Rich Vehicle Routing Problems

2021 ◽  
Author(s):  
Ehsan Khodabandeh ◽  
Lawrence V. Snyder ◽  
John Dennis ◽  
Joshua Hammond ◽  
Cody Wanless
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Daily Basis ◽  
Setup Times ◽  
Third Party ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Customer Outcomes ◽  
Practical Constraints

We consider a broad family of vehicle routing problem variants with many complex and practical constraints, known as rich vehicle routing problems, which are faced on a daily basis by C.H. Robinson (CHR). Because CHR has many customers, each with distinct requirements, various routing problems with different objectives and constraints must be solved. We propose a novel framework for solving rich vehicle routing problems, which we demonstrate is effective in solving a variety of different problems. This framework, along with a simple user interface, has been wrapped into a new module and integrated into the company’s transportation planning and execution technology platform. Since its implementation, this new module has outperformed the previously used third-party technologies at CHR, significantly reduced setup times, and improved users’ productivity as well as customer outcomes.

scholarly journals A Contemporary Recapitulation of Major Findings on Vehicle Routing Problems : Models and Methodologies

2019 ◽  
Vol 8 (2S4) ◽  
pp. 581-585
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Distribution Systems ◽  
Time Windows ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Innovative Solutions ◽  
The Common ◽  
Ultimate Objective

In introdusing and designing innovative solutions to the problems related to transportation and distribution systems is a contemporary area in logistics. The ultimate objective of this paper is to initiate a thought provoking discusion on Vehicle Routing Problems (VRP) along with its modifications or changes which incorporates recent model developments and improvements. Both in operational research and computer science, VRP is a combinatorial optimization issue researched at length. Capacitated Vehicle Routing Problem (CVRP), Vehicle Routing Problem with Time Windows (VRPTW), Vehicle Routing Problem with MultiDepot (MDVRP) and other variants are integral components of VRP. In recent times, the areas of VRP categorization has been further discussed, the common constraints have been summarized and model algorithms have been developed. In toto the future model implications of VRP are analyzed and further, it is predicted that the Intelligent Vehicle Routing Problem and Intelligent Heuristic Algorithm would be an important arena of future researches

scholarly journals Overview of fuzzy vehicle routing problems

2020 ◽  
Vol 20 (3) ◽  
pp. 325-331
Author(s):  
Yu. O. Chernyshev ◽  
V. N. Kubil ◽  
A. V. Trebukhin
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Fuzzy Variable ◽  
Optimal Solution ◽  
Fuzzy Programming ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Fuzzy Variables ◽  
Fundamental Properties

Introduction. Various algorithms for solving fuzzy vehicle routing problems are considered. The work objective was to study modern methods for the optimal solution to fuzzy, random and rough vehicle routing problems. Materials and Methods. The paper reviews fuzzy vehicle routing problems, existing methods and approaches to their solution. The most effective features of some approaches to solving fuzzy vehicle routing problems considering their specificity, are highlighted. Results. The Fuzzy Vehicle Routing Problem (FVRP) occurs whenever the routing data is vague, unclear, or ambiguous. In many cases, these fuzzy elements can better reflect reality. However, it is very difficult to use Vehicle Routing Problem (VRP) solving algorithms to solve FVRP since several fundamental properties of deterministic problems are no longer fulfilled in FVRP. Therefore, it is required to introduce new models and algorithms of fuzzy programming to solve such problems. Thus, the use of methods of the theory of fuzzy sets will provide successful simulation of the problems containing elements of uncertainty and subjectivity. Discussion and conclusions. As a result of reviewing various methods and approaches to solving vehicle routing problems, it is concluded that the development and study of new solutions come into sharp focus of researchers nowadays, but the degree of elaboration of various options varies. Methods for the optimal solution of FVRP are limited, in general, to some single fuzzy variable. There is a very limited number of papers that consider a large number of fuzzy variables.

scholarly journals A review on the electric vehicle routing problems: Variants and algorithms

2021 ◽  
Author(s):  
Hu Qin ◽  
Xinxin Su ◽  
Teng Ren ◽  
Zhixing Luo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Location Routing Problem ◽  
Routing Problems ◽  
Routing Problem ◽  
Delivery Problem ◽  
Pickup And Delivery Problem ◽  
The Past ◽  
Location Routing ◽  
Comprehensive Survey

AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.

scholarly journals Current State of Dynamic Vehicle Routing Problems Solved by Ant Colony Optimization Algorithm

2021 ◽  
Vol 15 (3) ◽  
pp. 429-434
Author(s):  
Luka Olivari ◽  
Goran Đukić
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Optimization Algorithm ◽  
Vehicle Routing Problem ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Routing Problem ◽  
Solution Methods

Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the present, real-world problems. Heuristic methods are used to solve the problem as Vehicle Routing Problem is NP-hard. Among many different solution methods, the Ant Colony Optimization algorithm is proven to be the efficient solution when dealing with the dynamic version of the problem. Even though this problem is known to the scientific community for decades, the field is extremely active due to technological advancements and the current relevance of the problem. As various sub-types of routing problems and solution methods exist, there is a great number of possible problem-solution combinations and research directions. This paper aims to make a focused review of the current state in the field of Dynamic Vehicle Routing Problems solved by Ant Colony Optimization algorithm, to establish current trends in the field.

scholarly journals Electric Vehicle Routing Problem with Industry Constraints: Trends and Insights for Future Research

2014 ◽  
Vol 3 ◽  
pp. 452-459 ◽  
Author(s):  
Anagnostopoulou Afroditi ◽  
Maria Boile ◽  
Sotirios Theofanis ◽  
Eleftherios Sdoukopoulos ◽  
Dimitrios Margaritis
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Vehicle Routing Problem ◽  
Future Research ◽  
Routing Problem

scholarly journals Two metaheuristic approaches for solving the multi-compartment vehicle routing problem

2018 ◽  
Vol 20 (4) ◽  
pp. 2085-2108 ◽  
Author(s):  
Hiba Yahyaoui ◽  
Islem Kaabachi ◽  
Saoussen Krichen ◽  
Abdulkader Dekdouk
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Large Problem ◽  
Solution Quality ◽  
Routing Problem ◽  
Petrol Station ◽  
Capacity Limitations ◽  
Problem Instances

Abstract We address in this paper a multi-compartment vehicle routing problem (MCVRP) that aims to plan the delivery of different products to a set of geographically dispatched customers. The MCVRP is encountered in many industries, our research has been motivated by petrol station replenishment problem. The main objective of the delivery process is to minimize the total driving distance by the used trucks. The problem configuration is described through a prefixed set of trucks with several compartments and a set of customers with demands and prefixed delivery. Given such inputs, the minimization of the total traveled distance is subject to assignment and routing constraints that express the capacity limitations of each truck’s compartment in terms of the pathways’ restrictions. For the NP-hardness of the problem, we propose in this paper two algorithms mainly for large problem instances: an adaptive variable neighborhood search (AVNS) and a Partially Matched Crossover PMX-based Genetic Algorithm to solve this problem with the goal of ensuring a better solution quality. We compare the ability of the proposed AVNS with the exact solution using CPLEX and a set of benchmark problem instances is used to analyze the performance of the both proposed meta-heuristics.

Sign in / Sign up

Export Citation Format

Share Document