scholarly journals Vehicle Routing Optimization of Instant Distribution Routing Based on Customer Satisfaction

Information ◽  
2020 ◽  
Vol 11 (1) ◽  
pp. 36
Author(s):  
Yan Zhang ◽  
Chunhui Yuan ◽  
Jiang Wu
Keyword(s):  
Customer Satisfaction ◽  
Distribution System ◽  
Time Window ◽  
Route Optimization ◽  
Nsga Ii ◽  
Delivery Cost ◽  
Routing Problem ◽  
Routing Optimization ◽  
A Minor ◽  
Vehicle Routing Optimization

Since the actual factors in the instant distribution service scenario are not considered enough in the existing distribution route optimization, a route optimization model of the instant distribution system based on customer time satisfaction is proposed. The actual factors in instant distribution, such as the soft time window, the pay-to-order mechanism, the time for the merchant to prepare goods before delivery, and the deliveryman’s order combining, were incorporated in the model. A multi-objective optimization framework based on the total cost function and time satisfaction of the customer was established. Dual-layer chromosome coding based on the deliveryman-to-node mapping and the access order was conducted, and the nondominated sorting genetic algorithm version II (NSGA-II) was used to solve the problem. According to the numerical results, when time satisfaction of the customer was considered in the instant distribution routing problem, the customer satisfaction increased effectively and the balance between customer satisfaction and delivery cost in the means of Pareto optimization were obtained, with a minor increase in the delivery cost, while the number of deliverymen slightly increased to meet the on-time delivery needs of customers.

scholarly journals Vehicle Routing Problem for Collaborative Multidepot Petrol Replenishment under Emergency Conditions

2021 ◽  
Vol 2021 ◽  
pp. 1-20
Author(s):  
Guangcan Xu ◽  
Qiguang Lyu
Keyword(s):  
Vehicle Routing ◽  
Time Window ◽  
Programming Model ◽  
Distribution Network ◽  
Mixed Integer ◽  
Small Scale ◽  
Routing Problem ◽  
Routing Optimization ◽  
Multiobjective Particle Swarm Optimization ◽  
Vehicle Routing Optimization

In recent years, emergency events have affected urban distribution with increasing frequency. For example, the 2019 novel coronavirus has caused a considerable impact on the supply guarantee of important urban production and living materials, such as petrol and daily necessities. On this basis, this study establishes a dual-objective mixed-integer linear programming model to formulate and solve the cooperative multidepot petrol emergency distribution vehicle routing optimization problem with multicompartment vehicle sharing and time window coordination. As a method to solve the model, genetic variation of multiobjective particle swarm optimization algorithm is considered. The effectiveness of the proposed method is analyzed and verified by first using a small-scale example and then investigating a regional multidepot petrol distribution network in Chongqing, China. Cooperation between petrol depots in the distribution network, customer clustering, multicompartment vehicle sharing, time window coordination, and vehicle routing optimization under partial road blocking conditions can significantly reduce the total operation cost and shorten the total delivery time. Meanwhile, usage of distribution trucks is optimized in the distribution network, that is, usage of single- and double-compartment trucks is reduced while that of three-compartment trucks is increased. This approach provides theoretical support for relevant government departments to improve the guarantee capability of important materials in emergencies and for relevant enterprises to improve the efficiency of emergency distribution.

Enterprise distribution routing optimization with soft time windows based on genetic algorithm

2021 ◽  
pp. 1-11
Author(s):  
Kaixian Gao ◽  
Guohua Yang ◽  
Xiaobo Sun
Keyword(s):  
Genetic Algorithm ◽  
Customer Satisfaction ◽  
Optimization Problems ◽  
Rapid Development ◽  
Time Windows ◽  
Theory And Practice ◽  
Routing Problem ◽  
Logistics Industry ◽  
Routing Optimization ◽  
A Company

With the rapid development of the logistics industry, the demand of customer become higher and higher. The timeliness of distribution becomes one of the important factors that directly affect the profit and customer satisfaction of the enterprise. If the distribution route is planned rationally, the cost can be greatly reduced and the customer satisfaction can be improved. Aiming at the routing problem of A company’s vehicle distribution link, we establish mathematical models based on theory and practice. According to the characteristics of the model, genetic algorithm is selected as the algorithm of path optimization. At the same time, we simulate the actual situation of a company, and use genetic algorithm to plan the calculus. By contrast, the genetic algorithm suitable for solving complex optimization problems, the practicability of genetic algorithm in this design is highlighted. It solves the problem of unreasonable transportation of A company, so as to get faster efficiency and lower cost.

scholarly journals GREEN LAST MILE DISTRIBUTION SYSTEM: HETEROGENEOUS FLEET VEHICLE ROUTING PROBLEM WITH TIME WINDOW AND EXTERNAL COST

2021 ◽  
pp. 1-8
Author(s):  
Nahry Nahry ◽  
Talitha Ayu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Distribution System ◽  
Time Window ◽  
External Costs ◽  
External Cost ◽  
Negative Externalities ◽  
Routing Problem ◽  
Heterogeneous Fleet ◽  
Last Mile

The development of e-commerce business in Jakarta, Indonesia, in recent years has made the Last Mile Delivery (LMD) business sector develop rapidly. Increased demand for LMD makes the resulting kilometer trips even greater, resulting in negative externalities. On the other hand, logistics costs in Indonesia are only affected by vehicle operating costs and no external cost component. Optimization of LMD services that takes into account internal and external costs is needed to minimize the total cost of LMD and in reducing the impact of negative externalities. The purpose of this paper is to optimize the LMD distribution system on the Heterogeneous Fleet Vehicle Routing Problem with Time Window and External Costs (HFVRPTW-EC) models. The optimization is done by applying the HFVRPTW-EC model using data from one of the parcel delivery companies in Jakarta and then doing a simulation by forming several operational scenarios. The results show that the optimization of LMD has reduced internal and external costs by more than 50% compared to existing conditions. The detailed results show that, for the short-term program, a scenario with a one-tier distribution system and type of motorcycle vehicle can reduce total costs compared to existing conditions by 66.22% on peak day and 59.41% on off peak day. Whereas for long-term program optimization, scenarios with multiple tier distribution systems and types of motorized vehicles for drop mileage and pick up truck for stem mileage can reduce total costs by 69.23% on peak day and 60.24% on off peak day.

scholarly journals Vehicle Routing Optimization System with Smart Geopositioning Updates

2021 ◽  
Vol 11 (22) ◽  
pp. 10933
Author(s):  
Radosław Belka ◽  
Mateusz Godlewski
Keyword(s):  
Vehicle Routing ◽  
Optimization Algorithms ◽  
Real Life ◽  
Distance Matrix ◽  
Gps Tracking ◽  
Routing Problem ◽  
Optimization System ◽  
Routing Optimization ◽  
Vehicle Routing Optimization ◽  
The Impact

Solving the vehicle routing problem (VRP) is one of the best-known optimization issues in the TLS (transport, logistic, spedition) branch market. Various variants of the VRP problem have been presented and discussed in the literature for many years. In most cases, batch versions of the problem are considered, wherein the complete data, including customers’ geographical distribution, is well known. In real-life situations, the data change dynamically, which influences the decisions made by optimization systems. The article focuses on the aspect of geopositioning updates and their impact on the effectiveness of optimization algorithms. Such updates affect the distance matrix, one of the critical datasets used to optimize the VRP problem. A demonstration version of the optimization system was developed, wherein updates are carried out in integration with both open source routing machine and GPS tracking services. In the case of a dynamically changing list of destinations, continuous and effective updates are required. Firstly, temporary values of the distance matrix based on the correction of the quasi-Euclidean distance were generated. Next, the impact of update progress on the proposed optimization algorithms was investigated. The simulation results were compared with the results obtained “manually” by experienced planners. It was found that the upload level of the distance matrix influences the optimization effectiveness in a non-deterministic way. It was concluded that updating data should start from the smallest values in the distance matrix.

scholarly journals Multidepot Recycling Vehicle Routing Problem with Resource Sharing and Time Window Assignment

2021 ◽  
Vol 2021 ◽  
pp. 1-21
Author(s):  
Yong Wang ◽  
Xiuwen Wang ◽  
Xiangyang Guan ◽  
Jinjun Tang
Keyword(s):  
Resource Allocation ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Resource Sharing ◽  
Clustering Algorithm ◽  
Time Window ◽  
Operational Efficiency ◽  
Nsga Ii ◽  
Routing Problem ◽  
Logistics Networks

This study aims to provide tactical and operational decisions in multidepot recycling logistics networks with consideration of resource sharing (RS) and time window assignment (TWA) strategies. The RS strategy contributes to efficient resource allocation and utilization among recycling centers (RCs). The TWA strategy involves assigning time windows to customers to enhance the operational efficiency of logistics networks. A biobjective mathematical model is established to minimize the total operating cost and number of vehicles for solving the multidepot recycling vehicle routing problem with RS and TWA (MRVRPRSTWA). A hybrid heuristic algorithm including 3D k-means clustering algorithm and nondominated sorting genetic algorithm- (NSGA-) II (NSGA-II) is designed. The 3D k-means clustering algorithm groups customers into clusters on the basis of their spatial and temporal distances to reduce the computational complexity in optimizing the multidepot logistics networks. In comparison with NSGA algorithm, the NSGA-II algorithm incorporates an elitist strategy, which can improve the computational speed and robustness. In this study, the performance of the NSGA-II algorithm is compared with the other two algorithms. Results show that the proposed algorithm is superior in solving MRVRPRSTWA. The proposed model and algorithm are applied to an empirical case study in Chongqing City, China, to test their applicability in real logistics operations. Four different scenarios regarding whether the RS and TWA strategies are included or not are developed to test the efficacy of the proposed methods. The results indicate that the RS and TWA strategies can optimize the recycling services and resource allocation and utilization and enhance the operational efficiency, thus promoting the sustainable development of the logistics industry.

scholarly journals Vehicle-Routing Optimization for Municipal Solid Waste Collection Using Genetic Algorithm: The Case of Southern Nablus City

2017 ◽  
Vol 26 (3) ◽  
pp. 43-57 ◽  
Author(s):  
Ramiz Assaf ◽  
Yahya Saleh
Keyword(s):  
Genetic Algorithm ◽  
Solid Waste ◽  
Vehicle Routing ◽  
Service Level ◽  
Current Situation ◽  
Waste Collection ◽  
Solid Waste Collection ◽  
Routing Problem ◽  
Routing Optimization ◽  
Vehicle Routing Optimization

Abstract Municipalities are responsible for solid waste collectiont for environmental, social and economic purposes. Practices of municipalities should be effective and efficient, with the objectives of reducing the total incurred costs in the solid waste collection network concurrently achieving the highest service level. This study aims at finding the best routes of solid waste collection network in Nablus city-Palestine. More specifically, the study seeks the optimal route that minimizes the total travelled distance by the trucks and hence the resulted costs. The current situation is evaluated and the problem is modelled as a Vehicle Routing Problem (VRP). The VRP is then optimized via a genetic algorithm. Specifically, compared to the current situation, the trucks total travelled distance was reduced by 66%, whereas the collection time was reduced from 7 hours per truck-trip to 2.3 hours. The findings of this study is useful for all municipality policy makers that are responsible for solid waste collection.

scholarly journals Transportation route optimization based on heuristic algorithm

2021 ◽  
Vol 2083 (3) ◽  
pp. 032016
Author(s):  
Fan Wu ◽  
Yongan Zhu
Keyword(s):  
Heuristic Algorithm ◽  
Time Window ◽  
Rapid Development ◽  
Route Optimization ◽  
Internet Technology ◽  
Mixed Integer ◽  
Routing Problem ◽  
Freight Volume ◽  
Transportation Organization ◽  
Transportation Company

Abstract With the rapid development of Internet technology, many enterprises are committed to finding the best solution in transportation organization and solving the vehicle distribution routing problem. Firstly, this paper introduces the current situation of transportation organization of Sichuan Yida Feiniu Transportation Company, and analyzes the main problems of the company. Secondly, through the prediction of freight volume, prepare the truck vehicle operation plan and optimize the company’s transportation organization and production plan. Finally, the heuristic algorithm is used to establish a mixed integer programming mathematical model to optimize the pooled vehicle distribution path problem and the vehicle distribution path with time window. In terms of centralized vehicle distribution, combined with the actual situation of Sichuan Yida Feiniu Transportation Company, an example is analyzed, the shortest total path is obtained, and the goal of shortest vehicle travel distance is realized. Through the optimization of the company’s transportation organization, this paper is of great significance to improve the company’s transportation organization to a certain extent.

scholarly journals Research on Coordination and Optimization of Order Allocation and Delivery Route Planning in Take-Out System

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Guofeng Sun ◽  
Zhiqiang Tian ◽  
Renhua Liu ◽  
Yun Jing ◽  
Yawen Ma
Keyword(s):  
Time Window ◽  
Route Planning ◽  
Route Optimization ◽  
Dynamic Allocation ◽  
Improved Genetic Algorithm ◽  
Time Dimension ◽  
Order Allocation ◽  
Routing Problem ◽  
Delivery Problem ◽  
Delivery Route

This paper studies the take-out route delivery problem (TRDP) with order allocation and unilateral soft time window constraints. The TRDP considers the order allocation and delivery route optimization in the delivery service process. The TRDP is a challenging version of vehicle routing problem. In order to solve this problem, this paper aims to minimize the total cost of delivery, builds an optimization model of this problem by using cumulative time, and adds time dimension in order allocation and path optimization dimensions. It can not only track the real-time location of delivery personnel but also record the delivery personnel to perform a certain task. The main algorithm is the dynamic allocation algorithm designed from the perspective of dispatch efficiency, and the subalgorithm is the improved genetic algorithm. Finally, some experiments are designed to verify the effectiveness of the established model and the designed algorithm, the order allocation and route optimization are calculated with/without the consideration of traffic jam, and the results show that the algorithm can generate better solution in each scene.

scholarly journals Optimization of a Low-Carbon Two-Echelon Heterogeneous-Fleet Vehicle Routing for Cold Chain Logistics under Mixed Time Window

2020 ◽  
Vol 12 (5) ◽  
pp. 1967 ◽  
Author(s):  
Ziqi Wang ◽  
Peihan Wen
Keyword(s):  
Customer Satisfaction ◽  
Vehicle Routing ◽  
Carbon Emissions ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Cold Chain ◽  
Carbon Trading ◽  
Low Carbon ◽  
Routing Problem ◽  
Heterogeneous Fleet

Due to the rise of social and environmental concerns on global climate change, developing the low-carbon economy is a necessary strategic step to respond to greenhouse effect and incorporate sustainability. As such, there is a new trend for the cold chain industry to establish the low-carbon vehicle routing optimization model which takes costs and carbon emissions as the measurements of performance. This paper studies a low-carbon vehicle routing problem (LC-VRP) derived from a real cold chain logistics network with several practical constraints, which also takes customer satisfaction into account. A low-carbon two-echelon heterogeneous-fleet vehicle routing problem (LC-2EHVRP) model for cold chain third-party logistics servers (3PL) with mixed time window under a carbon trading policy is constructed in this paper and aims at minimizing costs, carbon emissions and maximizing total customer satisfaction simultaneously. To find the optimal solution of such a nondeterministic polynomial (NP) hard problem, we proposed an adaptive genetic algorithm (AGA) approach validated by a numerical benchmark test. Furthermore, a real cold chain case study is presented to demonstrate the influence of the mixed time window’s changing which affect customers’ final satisfaction and the carbon trading settings on LC-2EHVRP model. Experiment of LC-2EHVRP model without customer satisfaction consideration is also designed as a control group. Results show that customer satisfaction is a critical influencer for companies to plan multi-echelon vehicle routing strategy, and current modest carbon price and trading quota settings in China have only a minimal effect on emissions’ control. Several managerial suggestions are given to cold chain logistics enterprises, governments, and even consumers to help improve the development of cold chain logistics.

Sign in / Sign up

Export Citation Format

Share Document