This paper presents an improved algorithm based on digital image encryption of knight *** efficient greedy algorithm is used to generate the knight tour matrix to improve the time efficiency of image encryption;the pr...
详细信息
This paper presents an improved algorithm based on digital image encryption of knight *** efficient greedy algorithm is used to generate the knight tour matrix to improve the time efficiency of image encryption;the process of image encryption is specifically improved,and two different knight tour matrices are used to encrypt the ***,every pixel of the image is scrambled one by one,then the scrambled dense image is divided into cell array blocks,and the cell array is used as the operation object to scramble the blocks,and the image is encrypted *** algorithm is simple,easy to implement,and has strong real-time operability,which can be used for real-time sharing of images;only the combination of the knight patrol matrix used for encryption and scrambling is properly matched,then a better encryption effect picture can be obtained,just like random noise,which cannot be *** experimental results show that the improved algorithm has strong ability of anti cutting attack and anti noise attack,good image restoration,high security performance and good reliability.
Online takeout has become the dining style of most urban *** the development of takeout industry,takeout delivery efficiency and cus-tomer satisfaction have attracted more and more attention from the industry and *** e...
详细信息
Online takeout has become the dining style of most urban *** the development of takeout industry,takeout delivery efficiency and cus-tomer satisfaction have attracted more and more attention from the industry and *** essence of takeout delivery problem is a vehicle routing problem under various *** reasonable order dispatching and routing algorithms will help to improve the delivery efficiency and service quality for takeout ***,by analyzing the order dispatching and delivery problem itself,we summarize the characteristics of the problem,compare the theoretical research of related problems,and describe it as a problem with the characteristics of soft time window,vehicle capacity limitation,dynamic order and 1–1 pick-up and ***,the problem scenario is described in detail,and the main elements and constraints of the problem are *** on this,aiming at minimizing the overdue time,we divide the problem into two subtasks:order dispatching and routing,and propose an order dispatching strategy considering couriers’route and a two-stage routing ***fically,this paper improves the calculation the cost in the previous heuristic algorithm based on the cost,that is,when dispatching an order,we consider whether there are orders close enough to the source location or destination location of the new order in every courier’s route,and if so,he can pickup and delivery the new order *** addition,it is also necessary to punish the courier who have long routes and whose orders have large overdue time;When planning the path for each order,wefirstly apply the nearest neighbor greedy algorithm for initial routing,which means iterativelyfind the time-consuming nearest feasible node in the remaining unplanned nodes,and then apply the tabu search algorithm to optimize the initial ***,the static scenario and dynamic scenario are designed to verify the above *** static problem scenar
暂无评论