An Efficient Improvement Of Ant Colony System Algorithm For Handling Capacity Vehicle Routing Problem

Capacitated Vehicle Routing Problem (CVRP) is considered as one of the most famous specialized forms of VRP that has attracted considerable attention from researchers. This problem belongs to complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that needs difficult computation. This paper presents an improvement of Ant Colony System (ACS) to solve this problem. In this study, the problem deals with a few vehicles which are used for transporting products to specific places. Each vehicle starts from a main location at different times every day. The capacitated vehicle routing problem (CVRP) is defined to serve a group of delivery customers with known demands. The proposed study seeks to find the best solution of CVRP by using improvement ACS with the accompanying targets: (1) To decrease the distance as long distances negatively affect the course of the process since it consumes a great time to visit all customers. (2) To implement the improvement of ACS algorithm on new data from the database of CVRP. Through the implementation of the proposed algorithm better results were obtained from the results of other methods and the results were compared

Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing

Alongside the rise of ‘last-mile’ delivery in contemporary urban logistics, drones have demonstrate commercial potential, given their outstanding triple-bottom-line performance. However, as a lithium-ion battery-powered device, drones’ social and environmental merits can be overturned by battery recycling and disposal. To maintain economic performance, yet minimise environmental negatives, fleet sharing is widely applied in the transportation field, with the aim of creating synergies within industry and increasing overall fleet use. However, if a sharing platform’s transparency is doubted, the sharing ability of the platform will be discounted. Known for its transparent and secure merits, blockchain technology provides new opportunities to improve existing sharing solutions. In particular, the decentralised structure and data encryption algorithm offered by blockchain allow every participant equal access to shared resources without undermining security issues. Therefore, this study explores the implementation of a blockchain-enabled fleet sharing solution to optimise drone operations, with consideration of battery wear and disposal effects. Unlike classical vehicle routing with fleet sharing problems, this research is more challenging, with multiple objectives (i.e., shortest path and fewest charging times), and considers different levels of sharing abilities. In this study, we propose a mixed-integer programming model to formulate the intended problem and solve the problem with a tailored branch-and-price algorithm. Through extensive experiments, the computational performance of our proposed solution is first articulated, and then the effectiveness of using blockchain to improve overall optimisation is reflected, and a series of critical influential factors with managerial significance are demonstrated