Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
A compact model and tight bounds for a combined location-routing problem
Computers and Operations Research
A column generation approach to the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
Computers and Operations Research
Multi-criteria mathematical model for designing the distribution network of a consumer goods company
Computers and Industrial Engineering
The multi-depot capacitated location-routing problem with fuzzy travel times
Expert Systems with Applications: An International Journal
A hierarchical algorithm for the planar single-facility location routing problem
Computers and Operations Research
Capacitated location-routing problem with time windows under uncertainty
Knowledge-Based Systems
| Hi-index | 0.01 |
We deal with a distribution network design problem that involves location, fleet assignment and routing decisions. Specifically, the distribution network under investigation is characterized by one central depot, a set of customers split into regions, and a heterogeneous fleet of vehicles. The goal is to locate one regional depot in each region, to assign some vehicles to each region, and to design the vehicles routes, each starting and ending at the central depot, in such a way that the regional depot is visited once by all vehicles assigned to the corresponding region, the vehicle capacities are not exceeded, the customer demands are satisfied and the overall distribution cost is minimized. The study has been motivated by a real life application related to a company operating in the North of Italy. We propose a two-phase heuristic for this problem which first determines an initial feasible solution, and then improves it by using very large neighborhood search techniques. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among routes, the so-called multi-exchanges. We also extend the definition of multi-exchange in such a way to allow fleet assignment modifications. We then complement the multi-exchange methodology with a more classic relocation mechanism, designed to perform depot location adjustments. The proposed approach has been validated with the real life case study as well as with several randomly generated instances. The results of the extensive computational experimentation show that the proposed approach is very promising. In the case of instances characterized by a small or a medium size the heuristic was able to compute very good quality solutions in a limited amount of time. In the case of very large instances, including the real case study, the heuristic proved to be the only tool for determining feasible solutions to the problem, whereas a commercial solver such as CPLEX generally was not able to discover any feasible solution within a time limit of 25h.