The vehicle routing problem is one of the most studied combinatorial optimization topics, due to its practical importance and methodological interest. Yet, despite extensive progress, many recent studies are hampered by limited access simple efficient open-source solution methods. Given sophistication current algorithms, reimplementation becoming a difficult time-consuming exercise that require...

Split procedures have been proved to be efficient within global framework optimization for routing problems by splitting giant tour into trips. This is done by generating optimal shortest path within an auxiliary graph built from the giant tour. An efficient application has been introduced for the first time by Lacomme et al. (2001) within a metaheuristic approach to solve the Capacitated Arc R...

In this paper we tackle a two-echelon location-routing problem (2E-LRP) by a tabu search metaheuristic. The aim is to define the location and number of two kinds of capacitated facilities, the size of two different vehicle fleets and the related routes on each echelon. The proposed Tabu Search (TS) for the 2E-LRP is based on the decomposition of the problem in two location-routing sub-problems,...

The soft-clustered vehicle-routing problem (SoftCluVRP) is a variant of the classical capacitated problem. Customers are partitioned into clusters and all customers same cluster must be served by vehicle. In this paper, we present large multiple neighborhood search for SoftCluVRP. We design analyze destroy repair operators as well two post-optimization components, which both based on variable d...

The Traveling Salesman Problem (TSP) and its allied problems like Vehicle Routing Problem (VRP) are one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solv...

In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with soft Time Windows (CVRPsTW). The Tabu Search algorithms are of two kinds: Two of them are parallel with respect to functional decomposition and one approach is a collaborative multisearch TS. The implementation builds upon a framework called Di...

Cuckoo search (CS) is one of the most recent population-based meta-heuristics. CS algorithm is based on the cuckoo’s behaviour and the mechanism of Lévy flights. Unfortunately, the standard CS algorithm is proposed only for continuous optimisation problems. In this paper, we propose a discrete binary cuckoo search (BCS) algorithm in order to deal with binary optimisation problems. To get binary...