The object of logistic management is to optimise the whole value chain of the distribution of goods and merchandise. One of the main aspects of such an analysis is the optimisation of vehicle routes to deliver final products to customers. There are many algorithms to optimise the related vehicle routing problem. The objective function of that problem usually involves distance, cost, number of v...

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...

In this paper we will deal with the sequencing and routing problem of order pickers in conventional multi-parallel-aisle warehouse systems. For this NP-hard Steiner Travelling Salesman Problem exact algorithms only exist for warehouses with at most three cross aisles. We propose a new approach were the problem of routing order pickers in multiple-block warehouses is translated into a classical ...

Periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

Low-carbon economy has been a hot research topic in recent years. This paper firstly considers the vehicle load weight, key factors affecting fuel consumption, to establish consumption model, and then constructs routing planning model last mile delivery with multiple depots within time windows. In order solve this problem, we improve classical fruit fly algorithm which is easy fall into local o...