Abstract Carriers can remarkably reduce transportation costs and emissions when they collaborate, for example through a platform. Such gains, however, have only been investigated relatively small problem instances with low numbers of carriers. We develop auction-based methods large-scale dynamic collaborative pickup delivery problems, combining techniques multi-agent systems combinatorial aucti...

The vehicle routing problem (VRP) in trees is a restriction of the general vehicle routing problem in which the underlying graph is a tree. In this paper, we introduce several NP-complete variants of the problem (e.g., common-source, common-destinations, in-place, flexiblerequests, and bring-it-back), and we present five fast approximation algorithms for these variants. We mainly focus on the 2...

E-cargo bikes, i.e., electric bicycles equipped with baskets for transporting goods, are perceived as an advantageous solution urban last-mile logistics. Particularly short distances and low volumes of the use e-cargo bikes is ideal in areas where access conventional cars may be prohibited. In this context, study presents bike routing model deliveries. The problem formulated a Capacitated Vehic...

Two types of ad hoc networks in mobile communications are mainly existing; one is Mobile Ad Hoc Network (MANET) and other one Vehicular Ad Hoc Network (VANET). Vehicular Ad Hoc Network (VANET) is highly demanded wireless ad hoc network. It is based on IEEE 802.11 wireless standard, which facilitates vehicle to vehicle and vehicle to roadside communications through air interface. Federal Communi...

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...

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

Routing in vehicular network is a challenging task due to network partitioning, high vehicular speed, and city environment characteristics. These characteristics results in degraded performance in traditional routing protocols. Traditional routing protocols, addressing the issues of mobile ad hoc network, are applicable for MANET applications. Position-based routing protocols, which are mostly ...