Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...

this research presents and solves a new mathematical model for school bus routing problem (sbrp). sbrp is a specific case of vehicle routing problem (vrp). despite prevalent models, this model includes location and routing simultaneously. besides, the vehicles are non-homogenous. in addition, instead of locating schools which are the depots, we consider locating bus stops that are mentioned &ap...

In this paper, we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined load acceptance and generalised vehicle routing problem. Among the real-life requirements are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimen...

The classical Vehicle Routing Problem (VRP) is defined on a graph G = (V,A) where V = {111, v 2 . . . . , v,} is a set of vertices and A = {(vi,vj):i # j , v i, vj ~ V} is the arc set. Vertex v 1 represents a depot at which are based m identical vehicles, while the remaining vertices correspond to cities or customers. A matrix C = (ciy) is defined on A. The coefficients cgy represent distances,...

The Cumulative Capacitated Vehicle Routing Problem (CCVRP) is a variation of the classical Capacitated Vehicle Routing Problem in which the objective is the minimization of the sum of arrival times at customers, instead of the total routing cost. This paper presents an adaptive large neighborhood search heuristic for the CCVRP. This algorithm is applied to a set of benchmark instances and compa...

Multi-vehicle routing problems in systems and control theory are concerned with the design of control policies to coordinate several vehicles moving in a metric space, in order to complete spatially localized, exogenously generated tasks, in an efficient way. Control policies depend on several factors, including the definition of the tasks, of the task generation process, of the vehicle dynamic...

 We consider a pickup and delivery vehicle routing problem (PDP) commonly find in real-world logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. In this problem, there are multiple vehicle types available to cover a set of transportation orders, each of which has pickup time windows and delivery time...

Cellular vehicle-to-everything (C-V2X) communications have gained traction as they can improve safe driving, efficiency, and convenience. However, mobility the rising number of vehicles make efficiency resource allocation (RA) schemes more difficult. Different RA been proposed to share C-V2X resources effectively. Nevertheless, routing-aware has not attracted enough attention in literature. Thi...

---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Vehicular ad-hoc network (VANET) is special class of the MANET that consists of vehicle to vehicle communication and vehicle to roadside communication. Vehicular Ad-hoc network (VANET) requires trusted vehicles to vehicles communication. In this pa...

The goal of this paper is to propose and test a new memetic algorithm for the capacitated vehicle routing problem in parallel computing environment. In this paper we consider a simple variation of the vehicle routing problem in which the only parameter is the capacity of the vehicle and each client only needs one package. We analyze the efficiency of the algorithm using the hierarchical Paralle...