In this paper we present a new variant of the classical Vehicle Routing Problem – the Fleet Size and Mix Vehicle Routing Problem with Backhauls (FSMVRPB). An ILP formulation of the FSMVRPB is presented. Optimal solutions for small size instances are produced and upper and lower bounds are generated for larger ones. In this paper we also propose a Set Partitioning Problem (SPP) based heuristic. ...

The mixed vehicle routing problem with backhauls is investigated using ant system heuristic. This distribution problem seems to suffer from a lack of published work even though it has immense practical applicability especially within logistic systems. Some enhancements to the basic ant system algorithm are embedded into the search. In particular a focus is on the choice in the placement of ants...

Vehicle Routing Problem with Backhauls is an extension of vehicle routing problem. In this problem, customers are divided into two sets as linehaul and backhaul customers. All goods are delivered to linehaul customers before goods are brought from backhaul customers. In this study, a heuristic based on integer programming is proposed. Firstly linehaul and backhaul customers are clustered to veh...

The ship routing problem (SRP) is a special variant of the classical vehicle routing problems (VRPs), which is different from both the VRP with backhauls (VRPB) and the VRP with pickup and delivery (VRPPD). This paper proposes a new immune genetic algorithm for the large scale SRP. The backhaul and time window constraints are also considered. The immune GA is innovated based on the classic GA a...

In this article, we investigate the cost-effective 5G-enabled vehicular networks to support emerging vehicular applications, such as autonomous driving, in-car infotainment and location-based road services. To this end, self-sustaining caching stations (SCSs) are introduced to liberate on-road base stations from the constraints of power lines and wired backhauls. Specifically, the cache-enabled...