Long-haul carriers must comply with various safety rules which are rarely taken into account in models and algorithms for vehicle routing problems. In this paper, we consider the rules on truck driver safety during long-haul trips in North America. The problem under study has two dominant features: a routing component that consists in determining the sequence of customers visited by each vehicl...

In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers’ driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a dynamic programming approach for the vehicle routing problem with time windows including the EC...

Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...

Recently, the quality and the diversity of transport services are more and more required. Moreover, in case of a great deal of services and selling goods, a significant part of price is transport cost. Thus, the design of models and applications which make possible efficient transport planning and scheduling becomes important. A great deal of real transport problems may be modelled by using Pic...

This paper considers a routing and scheduling problem of forwarding agencies handling less-than-truckload (LTL) freight. On the one hand, the performance of these companies is influenced by unknown customer orders, increasingly received shortly before the actual pickup. On the other hand, the transport times between two consecutive points in a tour sometimes vary significantly. The objective is...

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different ...

the vehicle routing problem with simultaneous pickup and delivery (vrpspd) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. the objective is to minimize the distance traveled. the vrpspd is an np-hard combinatorial optimization problem. therefore, practical large-scale instances of vrpspd...

in the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. on the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. effective transport activities are also one of the most important c...