scholarly journals A Heuristics-Based Parthenogenetic Algorithm for the VRP with Potential Demands and Time Windows

2016 ◽  
Vol 2016 ◽  
pp. 1-12
Author(s):  
Chenghua Shi ◽  
Tonglei Li ◽  
Yu Bai ◽  
Fei Zhao
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Computation Time ◽  
Routing Problem ◽  
Split Delivery ◽  
Soft Time Windows ◽  
Comparison Results ◽  
Potential Demand ◽  
The Cost

We present the vehicle routing problem with potential demands and time windows (VRP-PDTW), which is a variation of the classical VRP. A homogenous fleet of vehicles originated in a central depot serves customers with soft time windows and deliveries from/to their locations, and split delivery is considered. Also, besides the initial demand in the order contract, the potential demand caused by conformity consuming behavior is also integrated and modeled in our problem. The objective of minimizing the cost traveled by the vehicles and penalized cost due to violating time windows is then constructed. We propose a heuristics-based parthenogenetic algorithm (HPGA) for successfully solving optimal solutions to the problem, in which heuristics is introduced to generate the initial solution. Computational experiments are reported for instances and the proposed algorithm is compared with genetic algorithm (GA) and heuristics-based genetic algorithm (HGA) from the literature. The comparison results show that our algorithm is quite competitive by considering the quality of solutions and computation time.

scholarly journals Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution

2015 ◽  
Vol 2015 ◽  
pp. 1-8 ◽  
Author(s):  
Peiqing Li ◽  
Jie He ◽  
Dunyong Zheng ◽  
Yongsheng Huang ◽  
Chenhao Fan
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Fruits And Vegetables ◽  
Time Windows ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Total Cost ◽  
Soft Time Windows ◽  
Distribution Process

Fresh fruits and vegetables, perishable by nature, are subject to additional deterioration and bruising in the distribution process due to vibration and shock caused by road irregularities. A nonlinear mathematical model was developed that considered not only the vehicle routing problem with time windows but also the effect of road irregularities on the bruising of fresh fruits and vegetables. The main objective of this work was to obtain the optimal distribution routes for fresh fruits and vegetables considering different road classes with the least amount of logistics costs. An improved genetic algorithm was used to solve the problem. A fruit delivery route among the 13 cities in Jiangsu Province was used as a real analysis case. The simulation results showed that the vehicle routing problem with time windows, considering road irregularities and different classes of toll roads, can significantly influence total delivery costs compared with traditional VRP models. The comparison between four models to predict the total cost and actual total cost in distribution showed that the improved genetic algorithm is superior to the Group-based pattern, CW pattern, and O-X type cross pattern.

scholarly journals K-Means Clustering and Genetic Algorithm to Solve Vehicle Routing Problem with Time Windows Problem

2018 ◽  
Vol 11 (2) ◽  
pp. 462
Author(s):  
Adyan Nur Alfiyatin ◽  
Wayan Firdaus Mahmudy ◽  
Yusuf Priyo Anggodo
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Computation Time ◽  
Combination Method ◽  
Operational Cost ◽  
Routing Problem ◽  
Replacement Method ◽  
Suitable Combination

<span lang="EN-US">Distribution is an important aspect of industrial activity to serve customers on time with minimal operational cost. Therefore, it is necessary to design a quick and accurate distribution route. One of them can be design travel distribution route using the k-means method and genetic algorithms. This research will combine k-means method and genetic algorithm to solve VRPTW problem. K-means can do clustering properly and genetic algorithms can optimize the route. The proposed genetic algorithm employs initialize chromosome from the result of k-means and using replacement method of selection. Based on the comparison between genetic algorithm and hybrid k-means genetic algorithm proves that k-means genetic algorithm is a suitable combination method with relative low computation time, are the comparison between 2700 and 3900 seconds.</span>

Annealing Partheno-Genetic Algorithm for VRP with Soft Time Windows

2013 ◽  
Vol 791-793 ◽  
pp. 1224-1227
Author(s):  
Qun Fang ◽  
Dong Mei
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Inverse Operator ◽  
Selection Method ◽  
Routing Problem ◽  
Soft Time Windows ◽  
Simulation Results ◽  
New Algorithms

In order to resolve the vehicle routing problem with soft time window, a kind of Partheno-genetic Algorithms combined with Simulated Annealing was proposed in the paper, inverse operator and 2-change operator were presented.Centre point was replaced by the dummy natural number, then it is easy to made use of the available methods using by TSP. A selection method with tournament of three copies can keep the diversity of population. The simulation results show that new algorithm can effectively resole VRPTW, and get better results than common GA, new algorithms searching efficiency and convergence probability are effectively enhanced.

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 Integrated Tomato Picking and Distribution Scheduling Based on Maturity

2020 ◽  
Vol 12 (19) ◽  
pp. 7934
Author(s):  
Anqi Zhu ◽  
Bei Bian ◽  
Yiping Jiang ◽  
Jiaxiang Hu
Keyword(s):  
Genetic Algorithm ◽  
Time Windows ◽  
Joint Optimization ◽  
Adaptive Genetic Algorithm ◽  
Maturity Model ◽  
Improved Genetic Algorithm ◽  
Routing Problem ◽  
Order Processing ◽  
Supply Chain Efficiency ◽  
Distribution Scheduling

Agriproducts have the characteristics of short lifespan and quality decay due to the maturity factor. With the development of e-commerce, high timelines and quality have become a new pursuit for agriproduct online retailing. To satisfy the new demands of customers, reducing the time from receiving orders to distribution and improving agriproduct quality are significantly needed advancements. In this study, we focus on the joint optimization of the fulfillment of online tomato orders that integrates picking and distribution simultaneously within the context of the farm-to-door model. A tomato maturity model with a firmness indicator is proposed firstly. Then, we incorporate the tomato maturity model function into the integrated picking and distribution schedule and formulate a multiple-vehicle routing problem with time windows. Next, to solve the model, an improved genetic algorithm (the sweep-adaptive genetic algorithm, S-AGA) is addressed. Finally, we prove the validity of the proposed model and the superiority of S-AGA with different numerical experiments. The results show that significant improvements are obtained in the overall tomato supply chain efficiency and quality. For instance, tomato quality and customer satisfaction increased by 5% when considering the joint optimization, and the order processing speed increased over 90% compared with traditional GA. This study could provide scientific tomato picking and distribution scheduling to satisfy the multiple requirements of consumers and improve agricultural and logistics sustainability.

Sign in / Sign up

Export Citation Format

Share Document