Solving the Inventory Location-Routing Problem can been seen as an approach to optimize both a supply chain design and its operations costs. Assumptions consider that vehicles might visit more than one retailer per route and that inventory management decisions are included for a multi-depot, multi-retailer system with storage capacity over a discrete time planning horizon. The problem is to det...

To alleviate congestion in traffic networks is one of the most important problems to establish effective movements of vehicles. In this paper, we propose a new routing strategy using a memory effect. From the view points in the field of the complex networks, this paper deals with efficient control of flow on the complex networks. Conventional routing strategies use probabilistic rules to route ...

Access to information services while on the move is becoming increasingly prevalent within transport systems. Whereas Internet access is now common place in trains, it still remains a challenge for vehicles, particularly when travelling through high speed motorways. Motorway vehicles equipped with wireless communication nodes form an ad hoc network have been examined by which data can be exchan...

In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority class arrive in the environment randomly over time and require a random amount of on-site service that is characteristic of the class. To service a demand, one of the vehicles must travel to the demand location and r...

This article presents a comprehensive survey of routing protocols proposed for routing in Vehicular Delay Tolerant Networks (VDTN) in vehicular environment. DTNs are utilized in various operational environments, including those subject to disruption and disconnection and those with high-delay, such as Vehicular Ad-Hoc Networks (VANET). We focus on a special type of VANET, where the vehicular tr...

Despite the considerable progress made in a transport logistics research, an actual problem today is an optimization of time spends on search for optimal solution [1]. This article describes a method that can be used to simplify and solve the cargo routing problem with several vehicles. The method offers easier and faster solution compare to other known methods. The cargo routing problems are b...

This paper addresses a Three-Dimensional Loading Capacitated Vehicle Routing Problem (3L-CVRP) which combines a three-dimensional loading problem and vehicle routing problem in distribution logistics. The problem requires the combinatorial optimization of a feasible loading solution and a successive routing of vehicles to satisfy client demands, where all vehicles must start and terminate at a ...