Smart cities make use of a variety smart technology to improve societies in better ways. Such intelligent technologies, on the other hand, pose significant concerns terms power usage and emission carbons. The suggested study is focused technological networks for big data-driven systems. With support software-defined transportation-aided multicast routing system suggested. By using public transp...

this paper addresses the vehicle routing problem with delivery time cost. this problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. in this research, a hybrid metaheuristic approa...

The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the vehicle servicing arcs has a finite capacity, and hence has to return to the depot or a secondary station to be refilled (or emptied). In contrast, in the CARP-RP, the vehicle servicing arcs must be refilled on the spot by using a second vehic...

The objective of the Vehicle Routing Problem (VRP) is to construct a minimum cost set of vehicle routes that visits all customers and satisfies demands without violating the vehicle capacity constraints. The Stochastic Vehicle Routing Problem (SVRP) results when one or more elements of the VRP are modeled as random variables. In this paper, we present a set-partitioning-based modeling framework...

Title of dissertation: INTEGER PROGRAMMING-BASED HEURISTICS FOR VEHICLE ROUTING PROBLEMS Damon J. Gulczynski Doctor of Philosophy, 2010 Dissertation directed by: Professor Bruce Golden Applied Mathematics and Scientific Computation Robert H. Smith School of Business The vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical ap...

A three-level relief chain including a number of suppliers in fixed locations, candidate distribution centers and affected areas at certain points are considered. A mixed integer nonlinear programming model is proposed for open transportation location routing problem by considering split delivery of demand. To solve a realistic problem, foregoing parameters are considered as fuzzy in our propos...

The Vehicle Routing Problem with Backhauls is a generalization of the ordinary capacitated vehicle routing problem where goods are delivered from the depot to the linehaul customers, and additional goods are brought back to the depot from the backhaul customers. Numerous ways of modeling the backhaul constraints have been proposed in the literature, each imposing different restrictions on the h...

Establishing innovative fulfillment options for online orders has become a key challenge bricks-and-mortar retailers. A mere focus on store sales is no longer affordable due to the competition by pure players. Retailers are continuously developing new approaches order and last-mile logistics. Further shortening lead times becoming even more important in this context. One recently developed conc...

We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the Capacitated Chinese Postman Problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles w...