The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...

In this paper, a hybrid genetic algorithm is proposed to solve a Capacitated Location-Routing Problem. The objective is to minimize the total cost of the distribution in a network composed of depots and customers, both depots and vehicles have limited capacities, each depot has a homogenous vehicle fleet and customers’ demands are known and must be satisfied. Solving this problem involves makin...

● If one considers the instances with Q= 2 with respect to those with Q= 1, the routing cost decreases by 44.30% in the case of 10 customers, up to 47.65% in the case of 50 customers. ● If one compares the instances with Q= 4 to those with Q= 2, the routing cost decreases by 38.72% in the case of 10 customers, up to 46.06% in the case of 40 customers. ● If one considers the instances with Q= 6 ...

In this paper, we extend the vehicle routing problem with clustered backhauls (VRPCB) to an integrated routing and three-dimensional loading problem, called VRPCB with 3D loading constraints (3L-VRPCB). In the VRPCB each customer is either a linehaul or a backhaul customer and in each route all linehaul customers must be visited before any backhaul customer. In the 3L-VRPCB, each customer deman...

The aim of the interactivity is to integrate the insight and experience of the user, and the power and precision of the heuristics in an interactive environment. An interactive approach enables us to search for a solution by means of a trial and error procedure, in which man and machine divide the tasks in accordance with their best respective capabilities. The machine is by far superior in wha...

The Vehicle Routing Problem with Backhauls (VRPB) is a variant of the Vehicle Routing Problem where the vehicles are not only required to deliver goods but also to pick up some goods from the customers. In the mixed VRPB (MVRPB) each customer has either a delivery or a pick-up demand to be satisfied and the customers can be visited in any order along the route. Given a fleet of vehicles and a s...

With the dense deployment of small cell networks, low-cost backhaul schemes for small cell base stations (SBSs) have attracted great attentions. Self-backhaul using cellular communication technology is considered as a promising solution. Although some excellent works have been done on self-backhaul in small cell networks, most of them do not consider the recent advances of full-duplex (FD) and ...

Vehicle Routing Problem with Backhauls (VRPB) is an extension of the general Vehicle Routing Problem (VRP). In contrast with general VRP, VRPB considers two types of linehaul and backhaul customers. VRPB tries to find optimal routes with minimum cost in which backhaul customers are visited after linehaul customers for a fleet of heterogeneous vehicles. In this paper, a Memetic Algorithm (MA) i...

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the...

This paper introduces a new heuristic based on Kohonen’s self-organizing feature map for the traveling salesman problem with backhauls (TSPB). The TSPB is an extension of the traveling salesman problem in which a set of customers is partitioned into a set of linehaul customers to be visited contiguously at the beginning of the route and a set of backhaul customers to be visited once all linehau...