Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation.

Science.gov (United States)

Bula, Gustavo Alfredo; Prodhon, Caroline; Gonzalez, Fabio Augusto; Afsar, H Murat; Velasco, Nubia

2017-02-15

This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed. Copyright © 2016 Elsevier B.V. All rights reserved.

Classification of Dynamic Vehicle Routing Systems

DEFF Research Database (Denmark)

Larsen, Allan; Madsen, Oli B.G.; Solomon, Marius M.

2007-01-01

This chapter discusses important characteristics seen within dynamic vehicle routing problems. We discuss the differences between the traditional static vehicle routing problems and its dynamic counterparts. We give an in-depth introduction to the degree of dynamism measure which can be used to c...

On the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2006-01-01

. The fourth and final paper ‘Vehicle routing problem with time windows’ (Kallehauge, Larsen, Madsen, and Solomon. In Desaulniers, Desrosiers, and Solomon, editors, Column generation, pages 67-98, Springer, New York, 2005) is a contribution to a book on column generation edited by G. Desaulniers, J. Desrosiers......The vehicle routing problem with time windows is concerned with the optimal routing of a fleet of vehicles between a depot and a number of customers that must be visited within a specified time interval, called a time window. The purpose of this thesis is to develop new and efficient solution...... techniques for solving the vehicle routing problem with time windows (VRPTW). The thesis consists of a section of introductory remarks and four independent papers. The first paper ‘Formulations and exact approaches for the vehicle routing problem with time windows’ (Kallehauge, 2005, unpublished) is a review...

New heuristics for the fleet size and mix vehicle routing problem with time windows

NARCIS (Netherlands)

Dullaert, W.; Janssens, Gerrit K.; Sirensen, K.; Vernimmen, Bert

2002-01-01

In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2011-01-01

that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. To achieve this result, we reduce k-LocVRP to the following generalization of k median, which might be of independent interest. Given a metric (V, d), bound k...... median forest, which leads to a (12+E)-approximation algorithm for k-LocVRP, for any constant E > 0. The algorithm for k median forest is t-swap local search, and we prove that it has locality gap 3 + 2 t ; this generalizes the corresponding result for k median [3]. Finally we consider the k median......We study a location-routing problem in the context of capacitated vehicle routing. The input to k-LocVRP is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so...

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

Time and timing in vehicle routing problems

NARCIS (Netherlands)

Jabali, O.

2010-01-01

The distribution of goods to a set of geographically dispersed customers is a common problem faced by carrier companies, well-known as the Vehicle Routing Problem (VRP). The VRP consists of finding an optimal set of routes that minimizes total travel times for a given number of vehicles with a fixed

Vehicle Routing With User Generated Trajectory Data

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

Anticipatory vehicle routing using delegate multi-agent systems

OpenAIRE

Weyns, Danny; Holvoet, Tom; Helleboogh, Alexander

2007-01-01

This paper presents an agent-based approach, called delegate multi-agent systems, for anticipatory vehicle routing to avoid traffic congestion. In this approach, individual vehicles are represented by agents, which themselves issue light-weight agents that explore alternative routes in the environment on behalf of the vehicles. Based on the evaluation of the alternatives, the vehicles then issue light-weight agents for allocating road segments, spreading the vehicles’ intentions and coordi...

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2008-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW

Optimizing Departure Times in Vehicle Routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2011-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

Routing Cooperating Vehicles to Perform Precedence-Linked Tasks

National Research Council Canada - National Science Library

Vakhutinsky, Andrew; Wu, Cynara

2005-01-01

The problem of scheduling cooperating vehicles is a generalization of the classical vehicle routing problem where certain tasks are linked by precedence constraints and vehicles have varying constrained resources...

A case study of heterogeneous fleet vehicle routing problem: Touristic distribution application in Alanya

Directory of Open Access Journals (Sweden)

Kenan Karagül

2014-07-01

Full Text Available In this study, Fleet Size and Mix Vehicle Routing Problem is considered in order to optimize the distribution of the tourists who have traveled between the airport and the hotels in the shortest distance by using the minimum cost. The initial solution space for the related methods are formed as a combination of Savings algorithm, Sweep algorithm and random permutation alignment. Then, two well-known solution methods named as Standard Genetic Algorithms and random search algorithms are used for changing the initial solutions. Computational power of the machine and heuristic algorithms are used instead of human experience and human intuition in order to solve the distribution problem of tourists coming to hotels in Alanya region from Antalya airport. For this case study, daily data of tourist distributions performed by an agency operating in Alanya region are considered. These distributions are then modeled as Vehicle Routing Problem to calculate the solutions for various applications. From the comparisons with the decision of a human expert, it is seen that the proposed methods produce better solutions with respect to human experience and insight. Random search method produces a solution more favorable in terms of time. As a conclusion, it is seen that, owing to the distribution plans offered by the obtained solutions, the agencies may reduce the costs by achieving savings up to 35%.

Vehicle routing with dynamic travel times : a queueing approach

NARCIS (Netherlands)

Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

2008-01-01

Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle routing problem with dynamic

Routing of Electric Vehicles: City Distribution in Copenhagen

DEFF Research Database (Denmark)

Linde, Esben; Larsen, Allan; Nørrelund, Anders Vedsted

In this work, a Vehicle Routing Problem with Time Windows considering EV constraints of limited driving range and freight capacity is addressed (EVRPTW). The EVs are allowed to recharge at certain locations, and aspects of intelligent location of these recharging points are considered....... The objective is to find the least cost plan for EV routing and compare this to conventional routing. A heuristic method is developed and tested on data based on real-life collected data on distribution vehicles in central Copenhagen, Denmark. The EVRPTW has so far received little attention in the literature...

The vehicle routing problem latest advances and new challenges

CERN Document Server

Golden, Bruce L; Wasil, Edward A

2008-01-01

The Vehicle Routing Problem (VRP) has been an especially active and fertile area of research. Over the past five to seven years, there have been numerous technological advances and exciting challenges that are of considerable interest to students, teachers, and researchers. The Vehicle Routing Problem: Latest Advances and New Challenges will focus on a host of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and variants. New approaches for solving VRPs have been developed from important methodological advances. These developments have resulted in faster solution algorithms, more accurate techniques, and an improvement in the ability to solve large-scale, complex problems. The book will systematically examine these recent developments in the VRP and provide the following in a unified and carefully developed presentation: Present novel problems that have arisen in the vehicle routing domain and highlight new challenges for the field; Pre...

A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles

Directory of Open Access Journals (Sweden)

İsmail Karaoğlan

2015-06-01

Full Text Available This paper addresses the vehicle routing problem with multiple use of vehicles (VRPMUV, an important variant of the classic vehicle routing problem (VRP. Unlike the classical VRP, vehicles are allowed to use more than one route in the VRPMUV. We propose a branch-and-cut algorithm for solving the VRPMUV. The proposed algorithm includes several valid inequalities from the literature for the purpose of improving its lower bounds, and a heuristic algorithm based on simulated annealing and a mixed integer programming-based intensification procedure for obtaining the upper bounds. The algorithm is evaluated in terms of the test problems derived from the literature. The computational results which follow show that, if there were 120 customers on the route (in the simulation, the problem would be solved optimally in a reasonable amount of time.

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

Science.gov (United States)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

Commercial vehicle route tracking using video detection.

Science.gov (United States)

2010-10-31

Interstate commercial vehicle traffic is a major factor in the life of any road surface. The ability to track : these vehicles and their routes through the state can provide valuable information to planning : activities. We propose a method using vid...

Route-Based Signal Preemption Control of Emergency Vehicle

Directory of Open Access Journals (Sweden)

Haibo Mu

2018-01-01

Full Text Available This paper focuses on the signal preemption control of emergency vehicles (EV. A signal preemption control method based on route is proposed to reduce time delay of EV at intersections. According to the time at which EV is detected and the current phase of each intersection on the travelling route of EV, the calculation methods of the earliest start time and the latest start time of green light at each intersection are given. Consequently, the effective time range of green light at each intersection is determined in theory. A multiobjective programming model, whose objectives are the minimal residence time of EV at all intersections and the maximal passing numbers of general society vehicles, is presented. Finally, a simulation calculation is carried out. Calculation results indicate that, by adopting the signal preemption method based on route, the delay of EV is reduced and the number of society vehicles passing through the whole system is increased. The signal preemption control method of EV based on route can reduce the time delay of EV and improve the evacuation efficiency of the system.

Optimization Using Simulation of the Vehicle Routing Problem

OpenAIRE

Nayera E. El-Gharably; Khaled S. El-Kilany; Aziz E. El-Sayed

2013-01-01

A key element of many distribution systems is the routing and scheduling of vehicles servicing a set of customers. A wide variety of exact and approximate algorithms have been proposed for solving the vehicle routing problems (VRP). Exact algorithms can only solve relatively small problems of VRP, which is classified as NP-Hard. Several approximate algorithms have proven successful in finding a feasible solution not necessarily optimum. Although different parts of the pro...

Congestion avoidance and break scheduling within vehicle routing

NARCIS (Netherlands)

Kok, A.L.

2010-01-01

Vehicle routing is a complex daily task for businesses such as logistic service providers and distribution firms. Planners have to assign many orders to many vehicles and, for each vehicle, assign a delivery sequence. The objective is to minimize total transport costs. These costs typically include

Rich Vehicle Routing Problems and Applications

DEFF Research Database (Denmark)

Wen, Min

very short computational time on real-life data involving up to 200 pairs of suppliers and customers. The second problem we consider is a dynamic vehicle routing problem with multiple objectives over a planning horizon that consists of multiple periods. In this problem, customer orders are revealed...... the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints....... The method is implemented and tested on real-life data involving up to 2000 orders. It is shown that the method is able to provide solutions of good quality within reasonable running time....

Research on the optimization of vehicle distribution routes in logistics enterprises

Science.gov (United States)

Fan, Zhigou; Ma, Mengkun

2018-01-01

With the rapid development of modern logistics, the vehicle routing problem has become one of the urgent problems in the logistics industry. The rationality of distribution route planning directly affects the efficiency and quality of logistics distribution. This paper first introduces the definition of logistics distribution and the three methods of optimizing the distribution routes, and then analyzes the current vehicle distribution route by using a representative example, finally puts forward the optimization schemes of logistics distribution route.

The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

Directory of Open Access Journals (Sweden)

Huey-Kuo Chen

2011-01-01

Full Text Available This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW. Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.

Fund allocation using capacitated vehicle routing problem

Science.gov (United States)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita; Darus, Maslina

2014-09-01

In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Annisa Kesy Garside

2014-01-01

Full Text Available Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.

Multicriteria vehicle routing problem solved by artificial immune system

Directory of Open Access Journals (Sweden)

Bogna MRÓWCZYŃSKA

2015-09-01

Full Text Available Vehicles route planning in large transportation companies, where drivers are workers, usually takes place on the basis of experience or intuition of the employees. Because of the cost and environmental protection, it is important to save fuel, thus planning routes in an optimal way. In this article an example of the problem is presented solving delivery vans route planning taking into account the distance and travel time within the constraints of vehicle capacities, restrictions on working time of drivers and having varying degrees of movement. An artificial immune system was used for the calculations.

Optimizing investment fund allocation using vehicle routing problem framework

Science.gov (United States)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah Rozita

2014-07-01

The objective of investment is to maximize total returns or minimize total risks. To determine the optimum order of investment, vehicle routing problem method is used. The method which is widely used in the field of resource distribution shares almost similar characteristics with the problem of investment fund allocation. In this paper we describe and elucidate the concept of using vehicle routing problem framework in optimizing the allocation of investment fund. To better illustrate these similarities, sectorial data from FTSE Bursa Malaysia is used. Results show that different values of utility for risk-averse investors generate the same investment routes.

Optimization for routing vehicles of seafood product transportation

Science.gov (United States)

Soenandi, I. A.; Juan, Y.; Budi, M.

2017-12-01

Recently, increasing usage of marine products is creating new challenges for businesses of marine products in terms of transportation that used to carry the marine products like seafood to the main warehouse. This can be a problem if the carrier fleet is limited, and there are time constraints in terms of the freshness of the marine product. There are many ways to solve this problem, including the optimization of routing vehicles. In this study, this strategy is to implement in the marine product business in Indonesia with such an expected arrangement of the company to optimize routing problem in transportation with time and capacity windows. Until now, the company has not used the scientific method to manage the routing of their vehicle from warehouse to the location of marine products source. This study will solve a stochastic Vehicle Routing Problems (VRP) with time and capacity windows by using the comparison of six methods and looking the best results for the optimization, in this situation the company could choose the best method, in accordance with the existing condition. In this research, we compared the optimization with another method such as branch and bound, dynamic programming and Ant Colony Optimization (ACO). Finally, we get the best result after running ACO algorithm with existing travel time data. With ACO algorithm was able to reduce vehicle travel time by 3189.65 minutes, which is about 23% less than existing and based on consideration of the constraints of time within 2 days (including rest time for the driver) using 28 tons capacity of truck and the companies need two units of vehicles for transportation.

Vehicle Routing Problems for Drone Delivery

OpenAIRE

Dorling, Kevin; Heinrichs, Jordan; Messier, Geoffrey G.; Magierowski, Sebastian

2016-01-01

Unmanned aerial vehicles, or drones, have the potential to significantly reduce the cost and time of making last-mile deliveries and responding to emergencies. Despite this potential, little work has gone into developing vehicle routing problems (VRPs) specifically for drone delivery scenarios. Existing VRPs are insufficient for planning drone deliveries: either multiple trips to the depot are not permitted, leading to solutions with excess drones, or the effect of battery and payload weight ...

An efficient heuristic for the multi-compartment vehicle routing problem

OpenAIRE

Paulo Vitor Silvestrin

2016-01-01

We study a variant of the vehicle routing problem that allows vehicles with multiple compartments. The need for multiple compartments frequently arises in practical applications when there are several products of different quality or type, that must be kept or handled separately. The resulting problem is called the multi-compartment vehicle routing problem (MCVRP). We propose a tabu search heuristic and embed it into an iterated local search to solve the MCVRP. In several experiments we analy...

An optimization algorithm for a capacitated vehicle routing problem ...

Indian Academy of Sciences (India)

In this paper, vehicle routing problem (VRP) with time windows and real world constraints are considered as a real-world application on google maps. Also, tabu search is used and Hopfield neural networks is utilized. Basic constraints consist of customer demands, time windows, vehicle speed, vehicle capacity andworking ...

METHOD OF CHOOSING THE TECHNOLOGY OF VEHICLE OPERATION ON DELIVERY ROUTES

Directory of Open Access Journals (Sweden)

Ye. Nagornyi

2014-10-01

Full Text Available A method for determining the technology of vehicles operation on delivery (team routes, which allows to determine the optimal sequence of cargo delivery to customers by vehicles of certain capacity in order to meet the requirements of cargo owners regarding the conditions of service is offered. Recommendations for creation of an automated system of forming the technology of vehicles operation on delivery routes are developed.

Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles

National Research Council Canada - National Science Library

Sonmezocak, Erkan; Kurt, Senol

2008-01-01

.... The route planning of UAVs is the most critical and challenging problem of wartime. This thesis will develop three algorithms to solve a model that produces executable routings in order to dispatch three Unmanned Aerial Vehicles (UAV...

Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem

Science.gov (United States)

Korayem, L.; Khorsid, M.; Kassem, S. S.

2015-05-01

The capacitated vehicle routing problem (CVRP) is a class of the vehicle routing problems (VRPs). In CVRP a set of identical vehicles having fixed capacities are required to fulfill customers' demands for a single commodity. The main objective is to minimize the total cost or distance traveled by the vehicles while satisfying a number of constraints, such as: the capacity constraint of each vehicle, logical flow constraints, etc. One of the methods employed in solving the CVRP is the cluster-first route-second method. It is a technique based on grouping of customers into a number of clusters, where each cluster is served by one vehicle. Once clusters are formed, a route determining the best sequence to visit customers is established within each cluster. The recently bio-inspired grey wolf optimizer (GWO), introduced in 2014, has proven to be efficient in solving unconstrained, as well as, constrained optimization problems. In the current research, our main contributions are: combining GWO with the traditional K-means clustering algorithm to generate the ‘K-GWO’ algorithm, deriving a capacitated version of the K-GWO algorithm by incorporating a capacity constraint into the aforementioned algorithm, and finally, developing 2 new clustering heuristics. The resulting algorithm is used in the clustering phase of the cluster-first route-second method to solve the CVR problem. The algorithm is tested on a number of benchmark problems with encouraging results.

Routing Unmanned Vehicles in GPS-Denied Environments

OpenAIRE

Sundar, Kaarthik; Misra, Sohum; Rathinam, Sivakumar; Sharma, Rajnikant

2017-01-01

Most of the routing algorithms for unmanned vehicles, that arise in data gathering and monitoring applications in the literature, rely on the Global Positioning System (GPS) information for localization. However, disruption of GPS signals either intentionally or unintentionally could potentially render these algorithms not applicable. In this article, we present a novel method to address this difficulty by combining methods from cooperative localization and routing. In particular, the article...

Real time monitoring system used in route planning for the electric vehicle

Science.gov (United States)

Ionescu, LM; Mazare, A.; Serban, G.; Ionita, S.

2017-10-01

The electric vehicle is a new consumer of electricity that is becoming more and more widespread. Under these circumstances, new strategies for optimizing power consumption and increasing vehicle autonomy must be designed. These must include route planning along with consumption, fuelling points and points of interest. The hardware and software solution proposed by us allows: non-invasive monitoring of power consumption, energy autonomy - it does not add any extra consumption, data transmission to a server and data fusion with the route, the points of interest of the route and the power supply points. As a result: an optimal route planning service will be provided to the driver, considering the route, the requirements of the electric vehicle and the consumer profile. The solution can be easily installed on any type of electric car - it does not involve any intervention on the equipment.

Partial Path Column Generation for the Vehicle Routing Problem

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn

This paper presents a column generation algorithm for the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the CVRP and VRPTW have consisted of a Set Partitioning master problem with each column...... of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution space for the pricing problem can be obtained....

Nearest greedy for solving the waste collection vehicle routing problem: A case study

Science.gov (United States)

Mat, Nur Azriati; Benjamin, Aida Mauziah; Abdul-Rahman, Syariza; Wibowo, Antoni

2017-11-01

This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.

Evolutionary algorithms for the Vehicle Routing Problem with Time Windows

NARCIS (Netherlands)

Bräysy, Olli; Dullaert, Wout; Gendreau, Michel

2004-01-01

This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way

Dynamic origin-to-destination routing of wirelessly connected, autonomous vehicles on a congested network

Science.gov (United States)

Davis, L. C.

2017-07-01

Up-to-date information wirelessly communicated among vehicles can be used to select the optimal route between a given origin and destination. To elucidate how to make use of such information, simulations are performed for autonomous vehicles traveling on a square lattice of roads. All the possible routes between the origin and the destination (without backtracking) are of the same length. Congestion is the only determinant of delay. At each intersection, right-of-way is given to the closest vehicle. There are no traffic lights. Trip times of a subject vehicle are recorded for various initial conditions using different routing algorithms. Surprisingly, the simplest algorithm, which is based on the total number of vehicles on a route, is as good as one based on computing travel times from the average velocity of vehicles on each road segment.

Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem

DEFF Research Database (Denmark)

Bektas, Tolga; Erdogan, Günes; Røpke, Stefan

2011-01-01

The Generalized Vehicle Routing Problem (GVRP) consists of nding a set of routes for a number of vehicles with limited capacities on a graph with the vertices partitioned into clusters with given demands such that the total cost of travel is minimized and all demands are met. This paper offers four...

Shortest Paths and Vehicle Routing

DEFF Research Database (Denmark)

Petersen, Bjørn

This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown....

Two models of the capacitated vehicle routing problem

Directory of Open Access Journals (Sweden)

Zuzana Borčinova

2017-01-01

Full Text Available The aim of the Capacitated Vehicle Routing Problem (CVRP is to find a set of minimum total cost routes for a fleet of capacitated vehicles based at a single depot, to serve a set of customers. There exist various integer linear programming models of the CVRP. One of the main differences lies in the way to eliminate sub-tours, i.e. cycles that do not go through the depot. In this paper, we describe a well-known flow formulation of CVRP, where sub-tour elimination constraints have a cardinality exponentially growing with the number of customers. Then we present a mixed linear programming formulation with polynomial cardinality of sub-tour elimination constraints. Both of the models were implemented and compared on several benchmarks.

A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material

Energy Technology Data Exchange (ETDEWEB)

Yu, S.W.; Ding, C.; Zhu, K.J. [China University of Geoscience, Wuhan (China)

2011-08-15

In the open vehicle routing problem (OVRP), the objective is to minimize the number of vehicles and the total distance (or time) traveled. This study primarily focuses on solving an open vehicle routing problem (OVRP) by applying a novel hybrid genetic algorithm and the Tabu search (GA-TS), which combines the GA's parallel computing and global optimization with TS's Tabu search skill and fast local search. Firstly, the proposed algorithm uses natural number coding according to the customer demands and the captivity of the vehicle for globe optimization. Secondly, individuals of population do TS local search with a certain degree of probability, namely, do the local routing optimization of all customer sites belong to one vehicle. The mechanism not only improves the ability of global optimization, but also ensures the speed of operation. The algorithm was used in Zhengzhou Coal Mine and Power Supply Co., Ltd.'s transport vehicle routing optimization.

Fault-Aware Resource Allocation for Heterogeneous Data Sources with Multipath Routing

Directory of Open Access Journals (Sweden)

Xiaomei Zhang

2017-01-01

Full Text Available With the rapid development of cloud computing and big data, diverse types of traffic generated from heterogeneous data sources are delivered throughout communication networks, which consist of various node kinds such as digital sensors and smart actuators, and different applications. Due to the shared medium, communication networks are vulnerable to misbehaving nodes, and it is a crucial aspect to maintain an acceptable level of service degradation. This paper studies the fault-aware resource allocation problem by exploiting multipath routing and dynamic rate assignment for heterogeneous sources. We estimate the impacts of faults and formulate the resource allocation as a lossy network flow optimization problem based on these estimates. The traditional flow optimization solutions focus on homogeneous traffic. In our work, we model the performance of heterogeneous applications as a relaxed utility function and develop an effective utility framework of rate control for heterogeneous sources with multipath routing in presence of misbehaving nodes. We design a distributed algorithm to decide the routing strategy and obtain the rate assignments on the available paths in a lossy utility fair manner. Extensive performance evaluations corroborate the significant performance of our algorithm in effective utility and utility fairness in the presence of misbehaving nodes.

Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem

NARCIS (Netherlands)

Allahyari, S.; Salari, M.; Vigo, D.

2015-01-01

We propose a generalization of themulti-depot capacitated vehicle routing problem where the assumption of visiting each customer does not hold. In this problem, called the Multi-Depot Covering Tour Vehicle Routing Problem (MDCTVRP), the demand of each customer could be satisfied in two different

Analysis of Vehicle-Following Heterogeneity Using Self-Organizing Feature Maps

Directory of Open Access Journals (Sweden)

Jie Yang

2014-01-01

Full Text Available A self-organizing feature map (SOM was used to represent vehicle-following and to analyze the heterogeneities in vehicle-following behavior. The SOM was constructed in such a way that the prototype vectors represented vehicle-following stimuli (the follower’s velocity, relative velocity, and gap while the output signals represented the response (the follower’s acceleration. Vehicle trajectories collected at a northbound segment of Interstate 80 Freeway at Emeryville, CA, were used to train the SOM. The trajectory information of two selected pairs of passenger cars was then fed into the trained SOM to identify similar stimuli experienced by the followers. The observed responses, when the stimuli were classified by the SOM into the same category, were compared to discover the interdriver heterogeneity. The acceleration profile of another passenger car was analyzed in the same fashion to observe the interdriver heterogeneity. The distribution of responses derived from data sets of car-following-car and car-following-truck, respectively, was compared to ascertain inter-vehicle-type heterogeneity.

Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)

Science.gov (United States)

Ramdhani, M. N.; Baihaqi, I.; Siswanto, N.

2018-04-01

Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle’s assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter’s has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result’s model has the maximum of two journeys for each route.

MULTI-VEHICLE COVERING TOUR PROBLEM: BUILDING ROUTES FOR URBAN PATROLLING

Directory of Open Access Journals (Sweden)

Washington Alves de Oliveira

2015-12-01

Full Text Available ABSTRACT In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek routes that guarantee visibility, as this has a sizable impact on the community perceived safety, allowing quick emergency responses and providing surveillance of selected sites (e.g., hospitals, schools. The planning is restricted to the availability of vehicles and strives to achieve balanced routes. We study an adaptation of the model for the multi-vehicle covering tour problem, in which a set of locations must be visited, whereas another subset must be close enough to the planned routes. It constitutes an NP-complete integer programming problem. Suboptimal solutions are obtained with several heuristics, some adapted from the literature and others developed by us. We solve some adapted instances from TSPLIB and an instance with real data, the former being compared with results from literature, and latter being compared with empirical data.

A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

DEFF Research Database (Denmark)

Wen, Min; Krapper, Emil; Larsen, Jesper

2011-01-01

in their fresh meat supply logistics system. The problem consists of a 1‐week planning horizon, heterogeneous vehicles, and drivers with predefined work regulations. These regulations include, among other things, predefined workdays, fixed starting time, maximum weekly working duration, and a break rule......The world's second largest producer of pork, Danish Crown, also provides a fresh meat supply logistics system within Denmark. This is used by the majority of supermarkets in Denmark. This article addresses an integrated vehicle routing and driver scheduling problem arising at Danish Crown....... The objective is to minimize the total delivery cost that is a weighted sum of two kinds of delivery costs. A multilevel variable neighborhood search heuristic is proposed for the problem. In a preprocessing step, the problem size is reduced through an aggregation procedure. Thereafter, the aggregated weekly...

Methodology for kinematic cycle characterization of vehicles with fixed routes in urban areas

OpenAIRE

Jiménez Alonso, Felipe; Román de Andrés, Alfonso; López Martínez, José María

2013-01-01

This paper analyses the driving cycles of a fleet of vehicles with predetermined urban itineraries. Most driving cycles developed for such type of vehicles do not properly address variability among itineraries. Here we develop a polygonal driving cycle that assesses each group of related routes, based on microscopic parameters. It measures the kinematic cycles of the routes traveled by the vehicle fleet, segments cycles into micro-cycles, and characterizes their properties, groups them int...

Routing Optimization of Intelligent Vehicle in Automated Warehouse

Directory of Open Access Journals (Sweden)

Yan-cong Zhou

2014-01-01

Full Text Available Routing optimization is a key technology in the intelligent warehouse logistics. In order to get an optimal route for warehouse intelligent vehicle, routing optimization in complex global dynamic environment is studied. A new evolutionary ant colony algorithm based on RFID and knowledge-refinement is proposed. The new algorithm gets environmental information timely through the RFID technology and updates the environment map at the same time. It adopts elite ant kept, fallback, and pheromones limitation adjustment strategy. The current optimal route in population space is optimized based on experiential knowledge. The experimental results show that the new algorithm has higher convergence speed and can jump out the U-type or V-type obstacle traps easily. It can also find the global optimal route or approximate optimal one with higher probability in the complex dynamic environment. The new algorithm is proved feasible and effective by simulation results.

Potential air pollutant emission from private vehicles based on vehicle route

Science.gov (United States)

Huboyo, H. S.; Handayani, W.; Samadikun, B. P.

2017-06-01

Air emissions related to the transportation sector has been identified as the second largest emitter of ambient air quality in Indonesia. This is due to large numbers of private vehicles commuting within the city as well as inter-city. A questionnaire survey was conducted in Semarang city involving 711 private vehicles consisting of cars and motorcycles. The survey was conducted in random parking lots across the Semarang districts and in vehicle workshops. Based on the parking lot survey, the average distance private cars travelled in kilometers (VKT) was 17,737 km/year. The machine start-up number of cars during weekdays; weekends were on average 5.19 and 3.79 respectively. For motorcycles the average of kilometers travelled was 27,092 km/year. The machine start-up number of motorcycles during weekdays and weekends were on average 5.84 and 3.98, respectively. The vehicle workshop survey showed the average kilometers travelled to be 9,510 km/year for motorcycles, while for private cars the average kilometers travelled was 21,347 km/year. Odometer readings for private cars showed a maximum of 3,046,509 km and a minimum of 700 km. Meanwhile, for motorcycles, odometer readings showed a maximum of 973,164 km and a minimum of roughly 54.24 km. Air pollutant emissions on East-West routes were generally higher than those on South-North routes. Motorcycles contribute significantly to urban air pollution, more so than cars. In this study, traffic congestion and traffic volume contributed much more to air pollution than the impact of fluctuating terrain.

Multiple depots vehicle routing based on the ant colony with the genetic algorithm

Directory of Open Access Journals (Sweden)

ChunYing Liu

2013-09-01

Full Text Available Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm

The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations

DEFF Research Database (Denmark)

Hiermann, Gerhard; Puchinger, Jakob; Røpke, Stefan

2016-01-01

Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes...... detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order to sustain the competitiveness of electric vehicles compared to conventional vehicles. We introduce the Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (E......-FSMFTW) to model decisions to be made with regards to fleet composition and the actual vehicle routes including the choice of recharging times and locations. The available vehicle types differ in their transport capacity, battery size and acquisition cost. Furthermore, we consider time windows at customer...

Route-Based Control of Hybrid Electric Vehicles: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J. D.

2008-01-01

Today's hybrid electric vehicle controls cannot always provide maximum fuel savings over all drive cycles. Route-based controls could improve HEV fuel efficiency by 2%-4% and help save nearly 6.5 million gallons of fuel annually.

Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption

Directory of Open Access Journals (Sweden)

Yong Zhang

2017-01-01

Full Text Available The application of automated vehicles in logistics can efficiently reduce the cost of logistics and reduce the potential risks in the last mile. Considering the path restriction in the initial stage of the application of automated vehicles in logistics, the conventional model for a vehicle routing problem (VRP is modified. Thus, the automated vehicle routing problem with time windows (AVRPTW model considering path interruption is established. Additionally, an improved particle swarm optimisation (PSO algorithm is designed to solve this problem. Finally, a case study is undertaken to test the validity of the model and the algorithm. Four automated vehicles are designated to execute all delivery tasks required by 25 stores. Capacities of all of the automated vehicles are almost fully utilised. It is of considerable significance for the promotion of automated vehicles in last-mile situations to develop such research into real problems arising in the initial period.

Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

Directory of Open Access Journals (Sweden)

Goran Martinovic

2008-01-01

Full Text Available We present a novel variation of the vehicle routing problem (VRP. Single commodity cargo with pickup and delivery service is considered. Customers are labeled as either cargo sink or cargo source, depending on their pickup or delivery demand. This problem is called a single commodity vehicle routing problem with pickup and delivery service (1-VRPPD. 1-VRPPD deals with multiple vehicles and is the same as the single-commodity traveling salesman problem (1-PDTSP when the number of vehicles is equal to 1. Since 1-VRPPD specializes VRP, it is hard in the strong sense. Iterative modified simulated annealing (IMSA is presented along with greedy random-based initial solution algorithm. IMSA provides a good approximation to the global optimum in a large search space. Experiment is done for the instances with different number of customers and their demands. With respect to average values of IMSA execution times, proposed method is appropriate for practical applications.

An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Leilei Wang

2017-11-01

Full Text Available Vehicular ad hoc networks (VANETs have emerged as a new powerful technology for data transmission between vehicles. Efficient data transmission accompanied with low data delay plays an important role in selecting the ideal data forwarding path in VANETs. This paper proposes a new opportunity routing protocol for data forwarding based on vehicle mobility association (OVMA. With assistance from the vehicle mobility association, data can be forwarded without passing through many extra intermediate nodes. Besides, each vehicle carries the only replica information to record its associated vehicle information, so the routing decision can adapt to the vehicle densities. Simulation results show that the OVMA protocol can extend the network lifetime, improve the performance of data delivery ratio, and reduce the data delay and routing overhead when compared to the other well-known routing protocols.

The Dynamic Multi-Period Vehicle Routing Problem

DEFF Research Database (Denmark)

Wen, Min; Cordeau, Jean-Francois; Laporte, Gilbert

This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minim......This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives...... are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling...... planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that our solutions improve upon those of the Swedish distributor....

Heterogeneous Teams of Autonomous Vehicles: Advanced Sensing & Control

Science.gov (United States)

2009-03-01

Final Technical 3. DATES COVERED (From To) 7/1/05-12/31708 4. TITLE AND SUBTITLE Heterogeneous Teams of Autonomous Vehicles Advanced Sensing...assimilating data from underwater and surface autonomous vehicles in addition to the usual sources of Eulerian and Lagrangian systems into a small scale

Full truckload vehicle routing problem with profits

Directory of Open Access Journals (Sweden)

Jian Li

2014-04-01

Full Text Available A new variant of the full truckload vehicle routing problem is studied. In this problem there are more than one delivery points corresponding to the same pickup point, and one order is allowed to be served several times by the same vehicle or different vehicles. For the orders which cannot be assigned because of resource constraint, the logistics company outsources them to other logistics companies at a certain cost. To maximize its profits, logistics company decides which to be transported by private fleet and which to be outsourced. The mathematical model is constructed for the problem. Since the problem is NP-hard and it is difficult to solve the large-scale problems with an exact algorithm, a hybrid genetic algorithm is proposed. Computational results show the effectiveness of the hybrid genetic algorithm.

Vehicle routing with stochastic time-dependent travel times

NARCIS (Netherlands)

Lecluyse, C.; Woensel, van T.; Peremans, H.

2009-01-01

Assigning and scheduling vehicle routes in a stochastic time-dependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work in which the

Vehicle routing with stochastic time-dependent travel times

NARCIS (Netherlands)

Lecluyse, C.; Woensel, van T.; Peremans, H.

2007-01-01

Assigning and scheduling vehicle routes in a stochastic time-dependent environment is a crucial management problem. The assumption that in a real-life environment everything goes according to an a priori determined static schedule is unrealistic. Our methodology builds on earlier work in which the

Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution

Science.gov (United States)

Kurnia, Hari; Gustri Wahyuni, Elyza; Cergas Pembrani, Elang; Gardini, Syifa Tri; Kurnia Aditya, Silfa

2018-03-01

The problem that is often gained by the industries of managing and distributing vegetables is how to distribute vegetables so that the quality of the vegetables can be maintained properly. The problems encountered include optimal route selection and little travel time or so-called TSP (Traveling Salesman Problem). These problems can be modeled using the Vehicle Routing Problem (VRP) algorithm with rating ranking, a cross order based crossing, and also order based mutation mutations on selected chromosomes. This study uses limitations using only 20 market points, 2 point warehouse (multi compartment) and 5 vehicles. It is determined that for one distribution, one vehicle can only distribute to 4 market points only from 1 particular warehouse, and also one such vehicle can only accommodate 100 kg capacity.

A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Shifeng Chen

2017-09-01

Full Text Available The dynamic vehicle routing problem (DVRP is a variant of the Vehicle Routing Problem (VRP in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP.

A New Plant Intelligent Behaviour Optimisation Algorithm for Solving Vehicle Routing Problem

OpenAIRE

Chagwiza, Godfrey

2018-01-01

A new plant intelligent behaviour optimisation algorithm is developed. The algorithm is motivated by intelligent behaviour of plants and is implemented to solve benchmark vehicle routing problems of all sizes, and results were compared to those in literature. The results show that the new algorithm outperforms most of algorithms it was compared to for very large and large vehicle routing problem instances. This is attributed to the ability of the plant to use previously stored memory to respo...

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

Science.gov (United States)

Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

Performance of clustering techniques for solving multi depot vehicle routing problem

Directory of Open Access Journals (Sweden)

Eliana M. Toro-Ocampo

2016-01-01

Full Text Available The vehicle routing problem considering multiple depots is classified as NP-hard. MDVRP determines simultaneously the routes of a set of vehicles and aims to meet a set of clients with a known demand. The objective function of the problem is to minimize the total distance traveled by the routes given that all customers must be served considering capacity constraints in depots and vehicles. This paper presents a hybrid methodology that combines agglomerative clustering techniques to generate initial solutions with an iterated local search algorithm (ILS to solve the problem. Although previous studies clustering methods have been proposed like strategies to generate initial solutions, in this work the search is intensified on the information generated after applying the clustering technique. Besides an extensive analysis on the performance of techniques, and their effect in the final solution is performed. The operation of the proposed methodology is feasible and effective to solve the problem regarding the quality of the answers and computational times obtained on request evaluated literature

Simulated annealing (SA to vehicle routing problems with soft time windows

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2014-12-01

Full Text Available The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems with Soft Time Windows (VRPSTW. For this case there was only one depot, multi customers which each generally sparse either or demand was different though perceived number of demand and specific period of time to receive them. The Operation Research was representative combinatorial optimization problems and is known to be NP-hard. In this research algorithm, use Simulated Annealing (SA to determine the optimum solutions which rapidly time solving. After developed the algorithms, apply them to examine the factors and the optimum extended time windows and test these factors with vehicle problem routing under specific time windows by Solomon in OR-Library in case of maximum 25 customers. Meanwhile, 6 problems are including of C101, C102, R101, R102, RC101 and RC102 respectively. The result shows the optimum extended time windows at level of 50%. At last, after comparison these answers with the case of vehicle problem routing under specific time windows and flexible time windows, found that percentage errors on number of vehicles approximately by -28.57% and percentage errors on distances approximately by -28.57% which this algorithm spent average processing time on 45.5 sec/problems.

Application of the multi-objective cross-entropy method to the vehicle routing problem with soft time windows

Directory of Open Access Journals (Sweden)

C Hauman

2014-06-01

Full Text Available The vehicle routing problem with time windows is a widely studied problem with many real-world applications. The problem considered here entails the construction of routes that a number of identical vehicles travel to service different nodes within a certain time window. New benchmark problems with multi-objective features were recently suggested in the literature and the multi-objective optimisation cross-entropy method is applied to these problems to investigate the feasibility of the method and to determine and propose reference solutions for the benchmark problems. The application of the cross-entropy method to the multi-objective vehicle routing problem with soft time windows is investigated. The objectives that are evaluated include the minimisation of the total distance travelled, the number of vehicles and/or routes, the total waiting time and delay time of the vehicles and the makespan of a route.

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

DEFF Research Database (Denmark)

Wøhlk, Sanne; Lysgaard, Jens

2014-01-01

The paper considers the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing...... the sum of arrival times at the customers. A branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem is proposed. Computational results based on a set of standard CVRP benchmarks are presented....

Planning of Vehicle Routing with Backup Provisioning Using Wireless Sensor Technologies

Directory of Open Access Journals (Sweden)

Noélia Correia

2017-08-01

Full Text Available Wireless sensor technologies can be used by intelligent transportation systems to provide innovative services that lead to improvements in road safety and congestion, increasing end-user satisfaction. In this article, we address vehicle routing with backup provisioning, where the possibility of reacting to overloading/overcrowding of vehicles at certain stops is considered. This is based on the availability of vehicle load information, which can be captured using wireless sensor technologies. After discussing the infrastructure and monitoring tool, the problem is mathematically formalized, and a heuristic algorithm using local search procedures is proposed. Results show that planning routes with backup provisioning can allow fast response to overcrowding while reducing costs. Therefore, sustainable urban mobility, with efficient use of resources, can be provided while increasing the quality of service perceived by users.

Exact method for the vehicle routing problem with mixed linehaul and backhaul customers, heterogeneous fleet, time window and manufacturing capacity

OpenAIRE

Oesterle, Jonathan; Bauernhansl, Thomas

2016-01-01

Due to concerns over food safety, quality, and transparency, the food industry has been challenged to deal with an increased complexity in its logistics and production planning. This complexity is mostly associated to the task of optimally exploring a highly constrained solution space. This paper addresses the problem of designing a set of vehicle routes satisfying the delivery and the collection requirements of a set of geographically scattered linehaul and backhaul customers. Each customer ...

Waste Collection Vehicle Routing Problem: Literature Review

Directory of Open Access Journals (Sweden)

Hui Han

2015-08-01

Full Text Available Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP in literature. Based on a classification of waste collection (residential, commercial and industrial, firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

A novel heuristic algorithm for capacitated vehicle routing problem

Science.gov (United States)

Kır, Sena; Yazgan, Harun Reşit; Tüncel, Emre

2017-09-01

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 algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.

Vehicle Routing with Three-dimensional Container Loading Constraints—Comparison of Nested and Joint Algorithms

Science.gov (United States)

Koloch, Grzegorz; Kaminski, Bogumil

2010-10-01

In the paper we examine a modification of the classical Vehicle Routing Problem (VRP) in which shapes of transported cargo are accounted for. This problem, known as a three-dimensional VRP with loading constraints (3D-VRP), is appropriate when transported commodities are not perfectly divisible, but they have fixed and heterogeneous dimensions. In the paper restrictions on allowable cargo positionings are also considered. These restrictions are derived from business practice and they extended the baseline 3D-VRP formulation as considered by Koloch and Kaminski (2010). In particular, we investigate how additional restrictions influence relative performance of two proposed optimization algorithms: the nested and the joint one. Performance of both methods is compared on artificial problems and on a big-scale real life case study.

Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system

Science.gov (United States)

Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

2016-05-01

With the rapid development of transportation, traffic questions have become the major issue for social, economic and environmental aspects. Especially, during serious emergencies, it is very important to alleviate road traffic congestion and improve the efficiency of evacuation to reduce casualties, and addressing these problems has been a major task for the agencies responsible in recent decades. Advanced road guidance strategies have been developed for homogeneous traffic flows, or to reduce traffic congestion and enhance the road capacity in a symmetric two-route scenario. However, feedback strategies have rarely been considered for pedestrian-vehicle mixed traffic flows with variable velocities and sizes in an asymmetric multi-route traffic system, which is a common phenomenon in many developing countries. In this study, we propose a weighted road occupancy feedback strategy (WROFS) for pedestrian-vehicle mixed traffic flows, which considers the system equilibrium to ease traffic congestion. In order to more realistic simulating the behavior of mixed traffic objects, the paper adopted a refined and dynamic cellular automaton model (RDPV_CA model) as the update mechanism for pedestrian-vehicle mixed traffic flow. Moreover, a bounded rational threshold control was introduced into the feedback strategy to avoid some negative effect of delayed information and reduce. Based on comparisons with the two previously proposed strategies, the simulation results obtained in a pedestrian-vehicle traffic flow scenario demonstrated that the proposed strategy with a bounded rational threshold was more effective and system equilibrium, system stability were reached.

Routing strategies for efficient deployment of alternative fuel vehicles for freight delivery.

Science.gov (United States)

2017-02-01

With increasing concerns on environmental issues, recent research on Vehicle Routing Problems : (VRP) has added new factors such as greenhouse gas emissions and alternative fuel vehicles into : the models. In this report, we consider one such promisi...

Vehicle routing for the eco-efficient collection of household plastic waste.

Science.gov (United States)

Bing, Xiaoyun; de Keizer, Marlies; Bloemhof-Ruwaard, Jacqueline M; van der Vorst, Jack G A J

2014-04-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of other waste, although plastic is different than other waste in terms of volume to weight ratio. This paper aims for redesigning the collection routes and compares the collection options of plastic waste using eco-efficiency as performance indicator. Eco-efficiency concerns the trade-off between environmental impacts, social issues and costs. The collection problem is modeled as a vehicle routing problem. A tabu search heuristic is used to improve the routes. Collection alternatives are compared by a scenario study approach. Real distances between locations are calculated with MapPoint. The scenario study is conducted based on real case data of the Dutch municipality Wageningen. Scenarios are designed according to the collection alternatives with different assumptions in collection method, vehicle type, collection frequency and collection points, etc. Results show that the current collection routes can be improved in terms of eco-efficiency performance by using our method. The source-separation drop-off collection scenario has the best performance for plastic collection assuming householders take the waste to the drop-off points in a sustainable manner. The model also shows to be an efficient decision support tool to investigate the impacts of future changes such as alternative vehicle type and different response rates. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.

Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

Science.gov (United States)

Sun, Zhonghao; Zhou, Xingshe

2016-01-01

The existing transportation sector creates heavily environmental impacts and is a prime cause for the current climate change. The need to reduce emissions from this sector has stimulated efforts to speed up the application of electric vehicles (EVs). A subset of EVs, called plug-in hybrid electric vehicles (PHEVs), backup batteries with combustion engine, which makes PHEVs have a comparable driving range to conventional vehicles. However, this hybridization comes at a cost of higher emissions than all-electric vehicles. This paper studies the routing problem for PHEVs to minimize emissions. The existing shortest-path based algorithms cannot be applied to solving this problem, because of the several new challenges: (1) an optimal route may contain circles caused by detour for recharging; (2) emissions of PHEVs not only depend on the driving distance, but also depend on the terrain and the state of charge (SOC) of batteries; (3) batteries can harvest energy by regenerative braking, which makes some road segments have negative energy consumption. To address these challenges, this paper proposes a green navigation algorithm (GNA) which finds the optimal strategies: where to go and where to recharge. GNA discretizes the SOC, then makes the PHEV routing problem to satisfy the principle of optimality. Finally, GNA adopts dynamic programming to solve the problem. We evaluate GNA using synthetic maps generated by the delaunay triangulation. The results show that GNA can save more than 10 % energy and reduce 10 % emissions when compared to the shortest path algorithm. We also observe that PHEVs with the battery capacity of 10-15 KWh detour most and nearly no detour when larger than 30 KWh. This observation gives some insights when developing PHEVs.

Optimal Routing and Scheduling of Charge for Electric Vehicles: Case Study

OpenAIRE

Barco, John; Guerra, Andres; Muñoz, Luis; Quijano, Nicanor

2013-01-01

In Colombia, there is an increasing interest about improving public transportation. One of the proposed strategies in that way is the use battery electric vehicles (BEVs). One of the new challenges is the BEVs routing problem, which is subjected to the traditional issues of the routing problems, and must also consider the particularities of autonomy, charge and battery degradation of the BEVs. In this work, a scheme that coordinates the routing, scheduling of charge and operating costs of BEV...

The vehicle routing problem with edge set costs

DEFF Research Database (Denmark)

Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications and other costly investments....... The certifications and contributions impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. Different versions for defining the edge sets are discussed and formulated. A MIP-formulation of the problem is presented, and a solution method based...

Penerapan Algoritma Genetika Untuk Penyelesaian Vehicle Routing Problem With Delivery And Pick-Up (VRP-DP)

OpenAIRE

Simanullang, Herlin

2013-01-01

Vehicle Routing Problem (VRP) is a problem of combinatorial optimization complexeses that has essential role in management distribution system which is aimed to minimize the needed cost, the cost is determined in relationship with the distance of route which is taken by the distribution vehicle. The characteristic from VRP is the use of vehicle in certain capacity and its activity is centralized in one depot to serve the customer on certain locations with certain known demand. ...

A Hybrid Tabu Search Algorithm for a Real-World Open Vehicle Routing Problem Involving Fuel Consumption Constraints

Directory of Open Access Journals (Sweden)

Yunyun Niu

2018-01-01

Full Text Available Outsourcing logistics operation to third-party logistics has attracted more attention in the past several years. However, very few papers analyzed fuel consumption model in the context of outsourcing logistics. This problem involves more complexity than traditional open vehicle routing problem (OVRP, because the calculation of fuel emissions depends on many factors, such as the speed of vehicles, the road angle, the total load, the engine friction, and the engine displacement. Our paper proposed a green open vehicle routing problem (GOVRP model with fuel consumption constraints for outsourcing logistics operations. Moreover, a hybrid tabu search algorithm was presented to deal with this problem. Experiments were conducted on instances based on realistic road data of Beijing, China, considering that outsourcing logistics plays an increasingly important role in China’s freight transportation. Open routes were compared with closed routes through statistical analysis of the cost components. Compared with closed routes, open routes reduce the total cost by 18.5% with the fuel emissions cost down by nearly 29.1% and the diver cost down by 13.8%. The effect of different vehicle types was also studied. Over all the 60- and 120-node instances, the mean total cost by using the light-duty vehicles is the lowest.

Modeling connected and autonomous vehicles in heterogeneous traffic flow

Science.gov (United States)

Ye, Lanhang; Yamamoto, Toshiyuki

2018-01-01

The objective of this study was to develop a heterogeneous traffic-flow model to study the possible impact of connected and autonomous vehicles (CAVs) on the traffic flow. Based on a recently proposed two-state safe-speed model (TSM), a two-lane cellular automaton (CA) model was developed, wherein both the CAVs and conventional vehicles were incorporated in the heterogeneous traffic flow. In particular, operation rules for CAVs are established considering the new characteristics of this emerging technology, including autonomous driving through the adaptive cruise control and inter-vehicle connection via short-range communication. Simulations were conducted under various CAV-penetration rates in the heterogeneous flow. The impact of CAVs on the road capacity was numerically investigated. The simulation results indicate that the road capacity increases with an increase in the CAV-penetration rate within the heterogeneous flow. Up to a CAV-penetration rate of 30%, the road capacity increases gradually; the effect of the difference in the CAV capability on the growth rate is insignificant. When the CAV-penetration rate exceeds 30%, the growth rate is largely decided by the capability of the CAV. The greater the capability, the higher the road-capacity growth rate. The relationship between the CAV-penetration rate and the road capacity is numerically analyzed, providing some insights into the possible impact of the CAVs on traffic systems.

The Potential Impact of Vehicle-to-Vehicle Communication on On-Street Parking Under Heterogeneous Conditions

NARCIS (Netherlands)

Tasseron, G.; Martens, C.J.C.M.; Heijden, R.E.C.M. van der

2016-01-01

The aim of this paper is to study the impacts of bottom-up information provision about on-street parking places on parking dynamics under heterogeneous conditions. Using an agent-based simulation model, performance is compared between a bottom-up vehicle-to-vehicle communication strategy and a

Dynamic vehicle routing problems: Three decades and counting

DEFF Research Database (Denmark)

Psaraftis, Harilaos N.; Wen, Min; Kontovas, Christos A.

2016-01-01

of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the natureof the dynamic element, (10......Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing areal explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy......) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis-à-vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit...

Analysis of parameter estimation and optimization application of ant colony algorithm in vehicle routing problem

Science.gov (United States)

Xu, Quan-Li; Cao, Yu-Wei; Yang, Kun

2018-03-01

Ant Colony Optimization (ACO) is the most widely used artificial intelligence algorithm at present. This study introduced the principle and mathematical model of ACO algorithm in solving Vehicle Routing Problem (VRP), and designed a vehicle routing optimization model based on ACO, then the vehicle routing optimization simulation system was developed by using c ++ programming language, and the sensitivity analyses, estimations and improvements of the three key parameters of ACO were carried out. The results indicated that the ACO algorithm designed in this paper can efficiently solve rational planning and optimization of VRP, and the different values of the key parameters have significant influence on the performance and optimization effects of the algorithm, and the improved algorithm is not easy to locally converge prematurely and has good robustness.

Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

Science.gov (United States)

Iswari, T.; Asih, A. M. S.

2018-04-01

In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

Waste Collection Vehicle Routing Problem: Literature Review

OpenAIRE

Hui Han; Eva Ponce Cueto

2015-01-01

Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP) in litera...

Municipal solid waste transportation optimisation with vehicle routing approach: case study of Pontianak City, West Kalimantan

Science.gov (United States)

Kamal, M. A.; Youlla, D.

2018-03-01

Municipal solid waste (MSW) transportation in Pontianak City becomes an issue that need to be tackled by the relevant agencies. The MSW transportation service in Pontianak City currently requires very high resources especially in vehicle usage. Increasing the number of fleets has not been able to increase service levels while garbage volume is growing every year along with population growth. In this research, vehicle routing optimization approach was used to find optimal and efficient routes of vehicle cost in transporting garbage from several Temporary Garbage Dump (TGD) to Final Garbage Dump (FGD). One of the problems of MSW transportation is that there is a TGD which exceed the the vehicle capacity and must be visited more than once. The optimal computation results suggest that the municipal authorities only use 3 vehicles from 5 vehicles provided with the total minimum cost of IDR. 778,870. The computation time to search optimal route and minimal cost is very time consuming. This problem is influenced by the number of constraints and decision variables that have are integer value.

Navigation API Route Fuel Saving Opportunity Assessment on Large-Scale Real-World Travel Data for Conventional Vehicles and Hybrid Electric Vehicles: Preprint

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Holden, Jacob [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gonder, Jeffrey D [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2017-12-06

The green routing strategy instructing a vehicle to select a fuel-efficient route benefits the current transportation system with fuel-saving opportunities. This paper introduces a navigation API route fuel-saving evaluation framework for estimating fuel advantages of alternative API routes based on large-scale, real-world travel data for conventional vehicles (CVs) and hybrid electric vehicles (HEVs). The navigation APIs, such Google Directions API, integrate traffic conditions and provide feasible alternative routes for origin-destination pairs. This paper develops two link-based fuel-consumption models stratified by link-level speed, road grade, and functional class (local/non-local), one for CVs and the other for HEVs. The link-based fuel-consumption models are built by assigning travel from a large number of GPS driving traces to the links in TomTom MultiNet as the underlying road network layer and road grade data from a U.S. Geological Survey elevation data set. Fuel consumption on a link is calculated by the proposed fuel consumption model. This paper envisions two kinds of applications: 1) identifying alternate routes that save fuel, and 2) quantifying the potential fuel savings for large amounts of travel. An experiment based on a large-scale California Household Travel Survey GPS trajectory data set is conducted. The fuel consumption and savings of CVs and HEVs are investigated. At the same time, the trade-off between fuel saving and time saving for choosing different routes is also examined for both powertrains.

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

Science.gov (United States)

Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

2018-01-01

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Comparative chlorpyrifos pharmacokinetics via multiple routes of exposure and vehicles of administration in the adult rat

International Nuclear Information System (INIS)

Smith, Jordan Ned; Campbell, James A.; Busby-Hjerpe, Andrea L.; Lee, Sookwang; Poet, Torka S.; Barr, Dana B.; Timchalk, Charles

2009-01-01

Chlorpyrifos (CPF) is a commonly used organophosphorus pesticide. A number of toxicity and mechanistic studies have been conducted in animals, where CPF has been administered via a variety of different exposure routes and dosing vehicles. This study compared chlorpyrifos (CPF) pharmacokinetics using oral, intravenous (IV), and subcutaneous (SC) exposure routes and corn oil, saline/Tween 20, and dimethyl sulfoxide (DMSO) as dosing vehicles. Two groups of rats were co-administered target doses (5 mg/kg) of CPF and isotopically labeled CPF (L-CPF). One group was exposed by both oral (CPF) and IV (L-CPF) routes using saline/Tween 20 vehicle; whereas, the second group was exposed by the SC route using two vehicles, corn oil (CPF) and DMSO (L-CPF). A third group was only administered CPF by the oral route in corn oil. For all treatments, blood and urine time course samples were collected and analyzed for 3,5,6-trichloro-2-pyridinol (TCPy), and isotopically labeled 3,5,6-trichloro-2-pyridinol (L-TCPy). Peak TCPy/L-TCPy concentrations in blood (20.2 μmol/l), TCPy/L-TCPy blood AUC (94.9 μmol/l h), and percent of dose excreted in urine (100%) were all highest in rats dosed orally with CPF in saline/Tween 20 and second highest in rats dosed orally with CPF in corn oil. Peak TCPy concentrations in blood were more rapidly obtained after oral administration of CPF in saline/Tween 20 compared to all other dosing scenarios (>1.5 h). These results indicate that orally administered CPF is more extensively metabolized than systemic exposures of CPF (SC and IV), and vehicle of administration also has an effect on absorption rates. Thus, equivalent doses via different routes and/or vehicles of administration could potentially lead to different body burdens of CPF, different rates of bioactivation to CPF-oxon, and different toxic responses. Simulations using a physiologically based pharmacokinetic and pharmacodynamic (PBPK/PD) model for CPF are consistent with these possibilities

Reachability cuts for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Lysgaard, Jens

2004-01-01

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem with Time Windows and to k-path cuts...

The Emergency Vehicle Routing Problem with Uncertain Demand under Sustainability Environments

Directory of Open Access Journals (Sweden)

Jin Qin

2017-02-01

Full Text Available The reasonable utilization of limited resources is critical to realize the sustainable developments. In the initial 72-h crucial rescue period after the disaster, emergency supplies have always been insufficient and the demands in the affected area have always been uncertain. In order to improve timeliness, utilization and sustainability of emergency service, the allocation of the emergency supplies and the emergency vehicle routes should be determined simultaneously. Assuming the uncertain demands follow normal distribution, an optimization model for the emergency vehicle routing, by considering the insufficient supplies and the uncertain demands, is developed. The objective function is applied to minimize the total costs, including the penalty costs induced by more or less supplies than the actual demands at all demand points, as well as the constraints of the time windows and vehicle load capacity taken into account. In more details, a solution method for the model, based on the genetic algorithm, is proposed, which solves the problem in two stages. A numerical example is presented to demonstrate the efficiency and validity of the proposed model and algorithm.

A model-based eco-routing strategy for electric vehicles in large urban networks

OpenAIRE

De Nunzio , Giovanni; Thibault , Laurent; Sciarretta , Antonio

2016-01-01

International audience; A novel eco-routing navigation strategy and energy consumption modeling approach for electric vehicles are presented in this work. Speed fluctuations and road network infrastructure have a large impact on vehicular energy consumption. Neglecting these effects may lead to large errors in eco-routing navigation, which could trivially select the route with the lowest average speed. We propose an energy consumption model that considers both accelerations and impact of the ...

Opportunity costs calculation in agent-based vehicle routing and scheduling

NARCIS (Netherlands)

Mes, Martijn R.K.; van der Heijden, Matthijs C.; Schuur, Peter

2006-01-01

In this paper we consider a real-time, dynamic pickup and delivery problem with timewindows where orders should be assigned to one of a set of competing transportation companies. Our approach decomposes the problem into a multi-agent structure where vehicle agents are responsible for the routing and

Path inequalities for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian; Boland, Natashia; Madsen, Oli B.G.

2007-01-01

In this paper we introduce a new formulation of the vehicle routing problem with time windows (VRPTW) involving only binary variables. The new formulation is based on the formulation of the asymmetric traveling salesman problem with time windows by Ascheuer et al. (Networks 36 (2000) 69-79) and has...

Refinements of the column generation process for the Vehicle Routing Problem with Time Windows

DEFF Research Database (Denmark)

Larsen, Jesper

2004-01-01

interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance) with respect to the above mentioned constraints. Currently the best approaches for determining optimal solutions are based on column generation and Branch......-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for using run-time refinements when speeding up an exact approach without compromising...

The multi-depot electric vehicle location routing problem with time windows

Directory of Open Access Journals (Sweden)

Juan Camilo Paz

2018-01-01

Full Text Available In this paper, the Multi-Depot Electric Vehicle Location Routing Problem with Time Windows (MDVLRP is addressed. This problem is an extension of the MDVLRP, where electric vehicles are used instead of internal combustion engine vehicles. The recent development of this model is explained by the advantages of this technology, such as the diminution of carbon dioxide emissions, and the support that they can provide to the design of the logistic and energy-support structure of electric vehicle fleets. There are many models that extend the classical VRP model to take electric vehicles into consideration, but the multi-depot case for location-routing models has not been worked out yet. Moreover, we consider the availability of two energy supply technologies: the “Plug-in” Conventional Charge technology, and Battery Swapping Stations; options in which the recharging time is a function of the amount of energy to charge and a fixed time, respectively. Three models are proposed: one for each of the technologies mentioned above, and another in which both options are taken in consideration. The models were solved for small scale instances using C++ and Cplex 12.5. The results show that the models can be used to design logistic and energy-support structures, and compare the performance of the different options of energy supply, as well as measure the impact of these decisions on the overall distance traveled or other optimization objectives that could be worked on in the future.

Simulation of Routing Protocol with CoS/QoS Enhancements in Heterogeneous Communication Network

National Research Council Canada - National Science Library

Kubera, Emil; Sliwa, Joanna; Zubel, Krzysztof; Mroczko, Adrian

2006-01-01

The article describes the subject of QoS routing mechanism in tactical heterogeneous communication network consisting of network elements built in different technologies and connected following rules...

SOLVING THE PROBLEM OF VEHICLE ROUTING BY EVOLUTIONARY ALGORITHM

Directory of Open Access Journals (Sweden)

Remigiusz Romuald Iwańkowicz

2016-03-01

Full Text Available In the presented work the vehicle routing problem is formulated, which concerns planning the collection of wastes by one garbage truck from a certain number of collection points. The garbage truck begins its route in the base point, collects the load in subsequent collection points, then drives the wastes to the disposal site (landfill or sorting plant and returns to the another visited collection points. The filled garbage truck each time goes to the disposal site. It returns to the base after driving wastes from all collection points. Optimization model is based on genetic algorithm where individual is the whole garbage collection plan. Permutation is proposed as the code of the individual.

The Vehicle Routing Problem with Time Windows and Temporal Dependencies

DEFF Research Database (Denmark)

Rasmussen, Matias Sevel; Dohn, Anders Høeg; Larsen, Jesper

to be scheduled with a certain slack between them. They refer to the vehicle problem as having interdependent time windows. Temporal dependencies have been modeled for a home care routing problem in a mixed integer programming model (MIP) which was solved with a standard MIP solver. An application with general...

Vehicle Routing with Traffic Congestion and Drivers' Driving and Working Rules

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.; Zijm, Willem H.M.

2010-01-01

For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport

Lagrangian duality applied to the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian; Larsen, Jesper; Madsen, Oli B.G.

2006-01-01

This paper considers the vehicle routing problem with time windows, where the service of each customer must start within a specified time interval. We consider the Lagrangian relaxation of the constraint set requiring that each customer must be served by exactly one vehicle yielding a constrained...... respectively, which to date are the largest problems ever solved to optimality. We have implemented the LBCP algorithm using the ABACUS open-source framework for solving mixed-integer linear-programs by branch, cut, and price....

The waste collection vehicle routing problem with time windows in a city logistics context

DEFF Research Database (Denmark)

Buhrkal, Katja Frederik; Larsen, Allan; Røpke, Stefan

2012-01-01

Collection of waste is an important logistic activity within any city. In this paper we study how to collect waste in an efficient way. We study the Waste Collection Vehicle Routing Problem with Time Window which is concerned with finding cost optimal routes for garbage trucks such that all garbage...

The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem

DEFF Research Database (Denmark)

Black, Daniel; Eglese, Richard; Wøhlk, Sanne

2015-01-01

-life traffic situations where the travel times change with the time of day are taken into account. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time......In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real...

An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

DEFF Research Database (Denmark)

Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing...

Branch-and-cut algorithms for the split delivery vehicle routing problem

NARCIS (Netherlands)

Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia

2014-01-01

In this paper we present two exact branch-and-cut algorithms for the Split Delivery Vehicle Routing Problem (SDVRP) based on two relaxed formulations that provide lower bounds to the optimum. Procedures to obtain feasible solutions to the SDVRP from a feasible solution to the relaxed formulations

Routing of Electric Vehicles: Case Study of City Distribution in Copenhagen

DEFF Research Database (Denmark)

Linde, Esben; Larsen, Allan; Nørrelund, Anders Vedsted

freight magnitude and the distribution of goods in the old city centre. Based on the survey, analysis of possible UCC locations was carried out using simulation. Distribution from the UCC is assumed to be conducted with electric vehicles (EVs) as they are considered suitable for the overall aim. However...... a tour. Furthermore, intelligent location of these recharging points is considered. The objective is to find a least cost plan for routing and recharging the vehicles so that each customer is serviced by exactly one vehicle within its time windows and the vehicle capacity and driving range constraints...... are satisfied. The EVRPTW is a new problem that only has received little attention in the literature; see for example [2] and [3]. The costs are compared to distribution conducted by conventional vehicles. A heuristic method is developed and tested on the data generated on the basis of real-life collected data...

Routing the asteroid surface vehicle with detailed mechanics

Science.gov (United States)

Yu, Yang; Baoyin, He-Xi

2014-06-01

The motion of a surface vehicle on/above an irregular object is investigated for a potential interest in the insitu explorations to asteroids of the solar system. A global valid numeric method, including detailed gravity and geomorphology, is developed to mimic the behaviors of the test particles governed by the orbital equations and surface coupling effects. A general discussion on the surface mechanical environment of a specified asteroid, 1620 Geographos, is presented to make a global evaluation of the surface vehicle's working conditions. We show the connections between the natural trajectories near the ground and differential features of the asteroid surface, which describes both the good and bad of typical terrains from the viewpoint of vehicles' dynamic performances. Monte Carlo simulations are performed to take a further look at the trajectories of particles initializing near the surface. The simulations reveal consistent conclusions with the analysis, i.e., the open-field flat ground and slightly concave basins/valleys are the best choices for the vehicles' dynamical security. The dependence of decending trajectories on the releasing height is studied as an application; the results show that the pole direction (where the centrifugal force is zero) is the most stable direction in which the shift of a natural trajectory will be well limited after landing. We present this work as an example for pre-analysis that provides guidance to engineering design of the exploration site and routing the surface vehicles.

Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization

Directory of Open Access Journals (Sweden)

Haitao Xu

2018-01-01

Full Text Available As we all know, there are a great number of optimization problems in the world. One of the relatively complicated and high-level problems is the vehicle routing problem (VRP. Dynamic vehicle routing problem (DVRP is a major variant of VRP, and it is closer to real logistic scene. In DVRP, the customers’ demands appear with time, and the unserved customers’ points must be updated and rearranged while carrying out the programming paths. Owing to the complexity and significance of the problem, DVRP applications have grabbed the attention of researchers in the past two decades. In this paper, we have two main contributions to solving DVRP. Firstly, DVRP is solved with enhanced Ant Colony Optimization (E-ACO, which is the traditional Ant Colony Optimization (ACO fusing improved K-means and crossover operation. K-means can divide the region with the most reasonable distance, while ACO using crossover is applied to extend search space and avoid falling into local optimum prematurely. Secondly, several new evaluation benchmarks are proposed, which can objectively and comprehensively estimate the proposed method. In the experiment, the results for different scale problems are compared to those of previously published papers. Experimental results show that the algorithm is feasible and efficient.

Simulation of product distribution at PT Anugrah Citra Boga by using capacitated vehicle routing problem method

Science.gov (United States)

Lamdjaya, T.; Jobiliong, E.

2017-01-01

PT Anugrah Citra Boga is a food processing industry that produces meatballs as their main product. The distribution system of the products must be considered, because it needs to be more efficient in order to reduce the shipment cost. The purpose of this research is to optimize the distribution time by simulating the distribution channels with capacitated vehicle routing problem method. Firstly, the distribution route is observed in order to calculate the average speed, time capacity and shipping costs. Then build the model using AIMMS software. A few things that are required to simulate the model are customer locations, distances, and the process time. Finally, compare the total distribution cost obtained by the simulation and the historical data. It concludes that the company can reduce the shipping cost around 4.1% or Rp 529,800 per month. By using this model, the utilization rate can be more optimal. The current value for the first vehicle is 104.6% and after the simulation it becomes 88.6%. Meanwhile, the utilization rate of the second vehicle is increase from 59.8% to 74.1%. The simulation model is able to produce the optimal shipping route with time restriction, vehicle capacity, and amount of vehicle.

Partial path column generation for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Petersen, Bjørn; Jepsen, Mads Kehlet

2009-01-01

This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting...... and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large...... number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution...

Genetic algorithm with Lin-Kernighan heuristic as a substep of solving the multinomenclature vehicle routing problem

Directory of Open Access Journals (Sweden)

T.A. Yakovleva

2011-05-01

Full Text Available This paper is dealing with the vehicle routing problem, where different types of vehicles are managing to deliver different types of products. Three step heuristic with genetic algorithm is proposed for solving the problem.

Improvement of Network Performance by In-Vehicle Routing Using Floating Car Data

Directory of Open Access Journals (Sweden)

Gerdien A. Klunder

2017-01-01

Full Text Available This paper describes a study which gives insight into the size of improvement that is possible with individual in-car routing advice based on the actual traffic situation derived from floating car data (FCD. It also gives an idea about the required penetration rate of floating car data needed to achieve a certain degree of improvement. The study uses real loop detector data from the region of Amsterdam collected for over a year, a route generating algorithm for in-car routing advice, and emulated floating car data to generate the routing advice. The case with in-car routing advice has been compared to the base case, where drivers base their routing decisions on average knowledge of travel times in the network. The improvement in total delay using the in-vehicle system is dependent on penetration rate and accuracy of the floating car data and varies from 2.0% to 3.4% for 10% penetration rate. This leads to yearly savings of about 15 million euros if delay is monetarised using standard prices for value of time (VOT.

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

Directory of Open Access Journals (Sweden)

Yingcheng Xu

2013-01-01

Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

A hybrid meta-heuristic algorithm for the vehicle routing problem with stochastic travel times considering the driver's satisfaction

Science.gov (United States)

Tavakkoli-Moghaddam, Reza; Alinaghian, Mehdi; Salamat-Bakhsh, Alireza; Norouzi, Narges

2012-05-01

A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. On the other hand, this satisfaction, which will decrease by increasing the service time, is considered as an important logistic problem for a company. The stochastic time dominated by a probability variable leads to variation of the service time, while it is ignored in classical routing problems. This paper investigates the problem of the increasing service time by using the stochastic time for each tour such that the total traveling time of the vehicles is limited to a specific limit based on a defined probability. Since exact solutions of the vehicle routing problem that belong to the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with genetic operators was proposed to obtain an efficient solution with reasonable computational cost and time. Finally, for some small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm.

A Constraint-Based Model for Fast Post-Disaster Emergency Vehicle Routing

Directory of Open Access Journals (Sweden)

Roberto Amadini

2013-12-01

Full Text Available Disasters like terrorist attacks, earthquakes, hurricanes, and volcano eruptions are usually unpredictable events that affect a high number of people. We propose an approach that could be used as a decision support tool for a post-disaster response that allows the assignment of victims to hospitals and organizes their transportation via emergency vehicles. By exploiting the synergy between Mixed Integer Programming and Constraint Programming techniques, we are able to compute the routing of the vehicles so as to rescue much more victims than both heuristic based and complete approaches in a very reasonable time.

An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

OpenAIRE

Rao, Weizhen; Liu, Feng; Wang, Shengbin

2016-01-01

The classical model of vehicle routing problem (VRP) generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP) becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is ...

A Hybrid Chaos-Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window

Directory of Open Access Journals (Sweden)

Qi Hu

2013-04-01

Full Text Available State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data’s real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.

Approximation algorithms for deadline-TSP and vehicle routing with time-windows

NARCIS (Netherlands)

Bansal, N.; Blum, A.; Chawla, S.; Meyerson, A.; Babai, L.

2004-01-01

Given a metric space G on n nodes, with a start node r and deadlines D(v) for each vertex v, we consider the Deadline-TSP problem of finding a path starting at r that visits as many nodes as possible by their deadlines. We also consider the more general Vehicle Routing with Time-Windows problem, in

Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle

Directory of Open Access Journals (Sweden)

Wang Li-ying

2015-11-01

Full Text Available This paper presents the electric vehicle (EV multiple charging station location-routing problem with time window to optimize the routing plan of capacitated EVs and the strategy of charging stations. In particular, the strategy of charging stations includes both infrastructure-type selection and station location decisions. The problem accounts for two critical constraints in logistic practice: the vehicle loading capacity and the customer time windows. A hybrid heuristic that incorporates an adaptive variable neighborhood search (AVNS with the tabu search algorithm for intensification was developed to address the problem. The specialized neighborhood structures and the selection methods of charging station used in the shaking step of AVNS were proposed. In contrast to the commercial solver CPLEX, experimental results on small-scale test instances demonstrate that the algorithm can find nearly optimal solutions on small-scale instances. The results on large-scale instances also show the effectiveness of the algorithm.

Vehicle Routing Problems with Fuel Consumption and Stochastic Travel Speeds

Directory of Open Access Journals (Sweden)

Yanling Feng

2017-01-01

Full Text Available Conventional vehicle routing problems (VRP always assume that the vehicle travel speed is fixed or time-dependent on arcs. However, due to the uncertainty of weather, traffic conditions, and other random factors, it is not appropriate to set travel speeds to fixed constants in advance. Consequently, we propose a mathematic model for calculating expected fuel consumption and fixed vehicle cost where average speed is assumed to obey normal distribution on each arc which is more realistic than the existing model. For small-scaled problems, we make a linear transformation and solve them by existing solver CPLEX, while, for large-scaled problems, an improved simulated annealing (ISA algorithm is constructed. Finally, instances from real road networks of England are performed with the ISA algorithm. Computational results show that our ISA algorithm performs well in a reasonable amount of time. We also find that when taking stochastic speeds into consideration, the fuel consumption is always larger than that with fixed speed model.

Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking

Directory of Open Access Journals (Sweden)

Zhi-Hua Hu

2013-01-01

Full Text Available Cross-docking, as a strategy to reduce lead time and enhance the efficiency of the fashion supply chain, has attracted substantial attention from both the academy and the industry. Cross-docking is a critical part of many fashion and textiles supply chains in practice because it can help to achieve many supply chain strategies such as postponement. We consider a model where there are multiple suppliers and customers in a single cross-docking center. With such a model setting, the issue concerning the coordinated routing between the inbound and outbound routes is much more complex than many traditional vehicle routing problems (VRPs. We formulate the optimal route selection problems from the suppliers to the cross-docking center and from the cross-docking center to the customers as the respective VRPs. Based on the relationships between the suppliers and the customers, we integrate the two VRP models to optimize the overall traveling time, distance, and waiting time at the cross-docking center. In addition, we propose a novel mixed 0/1 integer linear programming model by which the complexity of the problem can be reduced significantly. As demonstrated by the simulation analysis, our proposed model can be solved very efficiently by a commonly used optimization software package.

Formulations and exact algorithms for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2008-01-01

In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...

A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints

Directory of Open Access Journals (Sweden)

Wei Tu

2015-10-01

Full Text Available Vehicle routing optimization (VRO designs the best routes to reduce travel cost, energy consumption, and carbon emission. Due to non-deterministic polynomial-time hard (NP-hard complexity, many VROs involved in real-world applications require too much computing effort. Shortening computing time for VRO is a great challenge for state-of-the-art spatial optimization algorithms. From a spatial-temporal perspective, this paper presents a spatial-temporal Voronoi diagram-based heuristic approach for large-scale vehicle routing problems with time windows (VRPTW. Considering time constraints, a spatial-temporal Voronoi distance is derived from the spatial-temporal Voronoi diagram to find near neighbors in the space-time searching context. A Voronoi distance decay strategy that integrates a time warp operation is proposed to accelerate local search procedures. A spatial-temporal feature-guided search is developed to improve unpromising micro route structures. Experiments on VRPTW benchmarks and real-world instances are conducted to verify performance. The results demonstrate that the proposed approach is competitive with state-of-the-art heuristics and achieves high-quality solutions for large-scale instances of VRPTWs in a short time. This novel approach will contribute to spatial decision support community by developing an effective vehicle routing optimization method for large transportation applications in both public and private sectors.

A memory structure adapted simulated annealing algorithm for a green vehicle routing problem.

Science.gov (United States)

Küçükoğlu, İlker; Ene, Seval; Aksoy, Aslı; Öztürk, Nursel

2015-03-01

Currently, reduction of carbon dioxide (CO2) emissions and fuel consumption has become a critical environmental problem and has attracted the attention of both academia and the industrial sector. Government regulations and customer demands are making environmental responsibility an increasingly important factor in overall supply chain operations. Within these operations, transportation has the most hazardous effects on the environment, i.e., CO2 emissions, fuel consumption, noise and toxic effects on the ecosystem. This study aims to construct vehicle routes with time windows that minimize the total fuel consumption and CO2 emissions. The green vehicle routing problem with time windows (G-VRPTW) is formulated using a mixed integer linear programming model. A memory structure adapted simulated annealing (MSA-SA) meta-heuristic algorithm is constructed due to the high complexity of the proposed problem and long solution times for practical applications. The proposed models are integrated with a fuel consumption and CO2 emissions calculation algorithm that considers the vehicle technical specifications, vehicle load, and transportation distance in a green supply chain environment. The proposed models are validated using well-known instances with different numbers of customers. The computational results indicate that the MSA-SA heuristic is capable of obtaining good G-VRPTW solutions within a reasonable amount of time by providing reductions in fuel consumption and CO2 emissions.

A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem

NARCIS (Netherlands)

K. Dalmeijer (Kevin); R. Spliet (Remy)

2016-01-01

textabstractThis paper presents a branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem (TWAVRP), the problem of assigning time windows for delivery before demand volume becomes known. A novel set of valid inequalities, the precedence inequalities, is introduced and

Applications of a saving method with max-min ant system to a vehicle routing problem with time windows and speed limits

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2014-06-01

Full Text Available This study aims to solve a Vehicle Routing Problem with Time Windows and Speed Limits (VRPTWSL, which has received considerable attention in recent years. The vehicle routing problem with time windows is an extension of the well-known Vehicle Routing Problem (VRP and involves a fleet of vehicles set of from a depot to serve a number of customers at different geographic locations with various demands within specific time and speed limits before returning to the depot eventually. To solve the problem, an efficient Saving Method-Max Min Ant System (Saving-MMAS with Local Search algorithm is applied. Using minimization of the total transportation costs as the objective of the extension VRPTWSL, a mathematic model is constructed. Finally, the Saving-MMAS algorithms indicated the good quality of the method in this problem.

The life and times of the Savings Method for Vehicle Routing Problems

African Journals Online (AJOL)

Forty ve years ago, an academic and practitioner from the north of England published a method of tackling the vehicle routing problem (VRP) in an American journal. Little could they have realised how the method they devised would still be a signicant part of the research agenda nearly half a century later. Adaptations of ...

The Edge Set Cost of the Vehicle Routing Problem with Time Windows

DEFF Research Database (Denmark)

Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

2016-01-01

. The certifications and investments impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. This violates the traditional assumption that the path between two destinations is well defined and independent of other choices. Different versions......We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications, and other costly investments...

Model and algorithm for bi-fuel vehicle routing problem to reduce GHG emissions.

Science.gov (United States)

Abdoli, Behroz; MirHassani, Seyed Ali; Hooshmand, Farnaz

2017-09-01

Because of the harmful effects of greenhouse gas (GHG) emitted by petroleum-based fuels, the adoption of alternative green fuels such as biodiesel and compressed natural gas (CNG) is an inevitable trend in the transportation sector. However, the transition to alternative fuel vehicle (AFV) fleets is not easy and, particularly at the beginning of the transition period, drivers may be forced to travel long distances to reach alternative fueling stations (AFSs). In this paper, the utilization of bi-fuel vehicles is proposed as an operational approach. We present a mathematical model to address vehicle routing problem (VRP) with bi-fuel vehicles and show that the utilization of bi-fuel vehicles can lead to a significant reduction in GHG emissions. Moreover, a simulated annealing algorithm is adopted to solve large instances of this problem. The performance of the proposed algorithm is evaluated on some random instances.

The Role of Spatial Ability in the Relationship Between Video Game Experience and Route Effectiveness Among Unmanned Vehicle Operators

Science.gov (United States)

2008-12-01

Effective route planning is essential to the successful operation of unmanned vehicles. Video game experience has been shown to affect route planning...and execution, but why video game experience helps has not been addressed. One answer may be that spatial skills, necessary for route planning and...mediates the relationship between video game experience and route planning. Results indicated that this mediated relationship existed for the UGV

Ant colony system (ACS with hybrid local search to solve vehicle routing problems

Directory of Open Access Journals (Sweden)

Suphan Sodsoon

2016-02-01

Full Text Available This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP from a single depot when the customers’ requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six meta-heuristics in the literature.

VANET Routing Protocols: Pros and Cons

OpenAIRE

Paul, Bijan; Ibrahim, Md.; Bikas, Md. Abu Naser

2012-01-01

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol h...

A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution

NARCIS (Netherlands)

Zhou, Lin; Baldacci, Roberto; Vigo, Daniele; Wang, Xu

2018-01-01

In this paper, we introduce a new city logistics problem arising in the last mile distribution of e-commerce. The problem involves two levels of routing problems. The first requires a design of the routes for a vehicle fleet located at the depots to transport the customer demands to a subset of the

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics

Science.gov (United States)

Hemmelmayr, Vera C.; Cordeau, Jean-François; Crainic, Teodor Gabriel

2012-01-01

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP. PMID:23483764

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics.

Science.gov (United States)

Hemmelmayr, Vera C; Cordeau, Jean-François; Crainic, Teodor Gabriel

2012-12-01

In this paper, we propose an adaptive large neighborhood search heuristic for the Two-Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The 2E-VRP arises in two-level transportation systems such as those encountered in the context of city logistics. In such systems, freight arrives at a major terminal and is shipped through intermediate satellite facilities to the final customers. The LRP can be seen as a special case of the 2E-VRP in which vehicle routing is performed only at the second level. We have developed new neighborhood search operators by exploiting the structure of the two problem classes considered and have also adapted existing operators from the literature. The operators are used in a hierarchical scheme reflecting the multi-level nature of the problem. Computational experiments conducted on several sets of instances from the literature show that our algorithm outperforms existing solution methods for the 2E-VRP and achieves excellent results on the LRP.

Implementation of Cooperation for Recycling Vehicle Routing Optimization in Two-Echelon Reverse Logistics Networks

Directory of Open Access Journals (Sweden)

Yong Wang

2018-04-01

Full Text Available The formation of a cooperative alliance is an effective means of approaching the vehicle routing optimization in two-echelon reverse logistics networks. Cooperative mechanisms can contribute to avoiding the inefficient assignment of resources for the recycling logistics operations and reducing long distance transportation. With regard to the relatively low performance of waste collection, this paper proposes a three-phase methodology to properly address the corresponding vehicle routing problem on two echelons. First, a bi-objective programming model is established to minimize the total cost and the number of vehicles considering semitrailers and vehicles sharing. Furthermore, the Clarke–Wright (CW savings method and the Non-dominated Sorting Genetic Algorithm-II (NSGA-II are combined to design a hybrid routing optimization heuristic, which is denoted CW_NSGA-II. Routes on the first and second echelons are obtained on the basis of sub-optimal solutions provided by CW algorithm. Compared to other intelligent algorithms, CW_NSGA-II reduces the complexity of the multi-objective solutions search and mostly converges to optimality. The profit generated by cooperation among retail stores and the recycling hub in the reverse logistics network is fairly and reasonably distributed to the participants by applying the Minimum Costs-Remaining Savings (MCRS method. Finally, an empirical study in Chengdu City, China, reveals the superiority of CW_NSGA over the multi-objective particle swarm optimization and the multi objective genetic algorithms in terms of solutions quality and convergence. Meanwhile, the comparison of MCRS method with the Shapley value model, equal profit method and cost gap allocation proves that MCRS method is more conducive to the stability of the cooperative alliance. In general, the implementation of cooperation in the optimization of the reverse logistics network effectively leads to the sustainable development of urban and sub

Location and multi-depot vehicle routing for emergency vehicles using tour coverage and random sampling

Directory of Open Access Journals (Sweden)

Alireza Goli

2015-09-01

Full Text Available Distribution and optimum allocation of emergency resources are the most important tasks, which need to be accomplished during crisis. When a natural disaster such as earthquake, flood, etc. takes place, it is necessary to deliver rescue efforts as quickly as possible. Therefore, it is important to find optimum location and distribution of emergency relief resources. When a natural disaster occurs, it is not possible to reach some damaged areas. In this paper, location and multi-depot vehicle routing for emergency vehicles using tour coverage and random sampling is investigated. In this study, there is no need to visit all the places and some demand points receive their needs from the nearest possible location. The proposed study is implemented for some randomly generated numbers in different sizes. The preliminary results indicate that the proposed method was capable of reaching desirable solutions in reasonable amount of time.

The vehicle routing game: An application of cost allocation in a gas and oil company

Energy Technology Data Exchange (ETDEWEB)

Engevall, Stefan; Goethe-Lundgren, Maud; Vaerbrand, Peter

2000-12-01

In this article we study a cost allocation problem that arises in a distribution planning situation at the Logistics department at Norsk Hydro Olje AB. The routes from one depot during one day are considered, for which the total distribution cost is to be divided among the customers that are visited. This cost allocation problem is formulated as a vehicle routing game, allowing the use of vehicles with different capacities. Cost allocation methods based on different concepts from cooperative game theory, such as the core and the nucleolus, are discussed. A procedure that can be used to investigate whether the core is empty or not is presented, as well as a procedure to compute the nucleolus. Computational results for the Norsk Hydro case are also presented and discussed.

Solving Inventory Routing Problems Using Location Based Heuristics

Directory of Open Access Journals (Sweden)

Paweł Hanczar

2014-01-01

Full Text Available Inventory routing problems (IRPs occur where vendor managed inventory replenishment strategies are implemented in supply chains. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. The research presented in this paper aims at extending IRP formulation developed on the basis of location based heuristics proposed by Bramel and Simchi-Levi and continued by Hanczar. In the first phase of proposed algorithms, mixed integer programming is used to determine the partitioning of customers as well as dates and quantities of deliveries. Then, using 2-opt algorithm for solving the traveling sales-person problem the optimal routes for each partition are determined. In the main part of research the classical formulation is extended by additional constraints (visit spacing, vehicle filling rate, driver (vehicle consistency, and heterogeneous fleet of vehicles as well as the additional criteria are discussed. Then the impact of using each of proposed extensions for solution possibilities is evaluated. The results of computational tests are presented and discussed. Obtained results allow to conclude that the location based heuristics should be considered when solving real life instances of IRP. (original abstract

Similarity-Based Prediction of Travel Times for Vehicles Traveling on Known Routes

DEFF Research Database (Denmark)

Tiesyte, Dalia; Jensen, Christian Søndergaard

2008-01-01

, historical data in combination with real-time data may be used to predict the future travel times of vehicles more accurately, thus improving the experience of the users who rely on such information. We propose a Nearest-Neighbor Trajectory (NNT) technique that identifies the historical trajectory......The use of centralized, real-time position tracking is proliferating in the areas of logistics and public transportation. Real-time positions can be used to provide up-to-date information to a variety of users, and they can also be accumulated for uses in subsequent data analyses. In particular...... of vehicles that travel along known routes. In empirical studies with real data from buses, we evaluate how well the proposed distance functions are capable of predicting future vehicle movements. Second, we propose a main-memory index structure that enables incremental similarity search and that is capable...

Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows

OpenAIRE

Sala Reixach, Joan

2012-01-01

El projecte es centra en el "Vehicle Routing Problem with Time Windows". Explora i testeja un mètode basat en una formulació del problema en termes de programació de restriccions. Implementa un mètode de cerca local amb la capacitat de fer grans moviments anomenat "Large Neighbourhood Search".

Metaheuristics applied to vehicle routing. A case study. Parte 1: formulating the problem

Directory of Open Access Journals (Sweden)

Guillermo González Vargas

2006-09-01

Full Text Available This paper deals with VRP (vehicle routing problem mathematical formulation and presents some methodologies used by different authors to solve VRP variation. This paper is presented as the springboard for introducing future papers about a manufacturing company’s location decisions based on the total distance traveled to distribute its product.

Test bed for applications of heterogeneous unmanned vehicles

Directory of Open Access Journals (Sweden)

Filiberto Muñoz Palacios

2017-01-01

Full Text Available This article addresses the development and implementation of a test bed for applications of heterogeneous unmanned vehicle systems. The test bed consists of unmanned aerial vehicles (Parrot AR.Drones versions 1 or 2, Parrot SA, Paris, France, and Bebop Drones 1.0 and 2.0, Parrot SA, Paris, France, ground vehicles (WowWee Rovio, WowWee Group Limited, Hong Kong, China, and the motion capture systems VICON and OptiTrack. Such test bed allows the user to choose between two different options of development environments, to perform aerial and ground vehicles applications. On the one hand, it is possible to select an environment based on the VICON system and LabVIEW (National Instruments or robotics operating system platforms, which make use the Parrot AR.Drone software development kit or the Bebop_autonomy Driver to communicate with the unmanned vehicles. On the other hand, it is possible to employ a platform that uses the OptiTrack system and that allows users to develop their own applications, replacing AR.Drone’s original firmware with original code. We have developed four experimental setups to illustrate the use of the Parrot software development kit, the Bebop Driver (AutonomyLab, Simon Fraser University, British Columbia, Canada, and the original firmware replacement for performing a strategy that involves both ground and aerial vehicle tracking. Finally, in order to illustrate the effectiveness of the developed test bed for the implementation of advanced controllers, we present experimental results of the implementation of three consensus algorithms: static, adaptive, and neural network, in order to accomplish that a team of multiagents systems move together to track a target.

A capacitated vehicle routing problem with order available time in e-commerce industry

Science.gov (United States)

Liu, Ling; Li, Kunpeng; Liu, Zhixue

2017-03-01

In this article, a variant of the well-known capacitated vehicle routing problem (CVRP) called the capacitated vehicle routing problem with order available time (CVRPOAT) is considered, which is observed in the operations of the current e-commerce industry. In this problem, the orders are not available for delivery at the beginning of the planning period. CVRPOAT takes all the assumptions of CVRP, except the order available time, which is determined by the precedent order picking and packing stage in the warehouse of the online grocer. The objective is to minimize the sum of vehicle completion times. An efficient tabu search algorithm is presented to tackle the problem. Moreover, a Lagrangian relaxation algorithm is developed to obtain the lower bounds of reasonably sized problems. Based on the test instances derived from benchmark data, the proposed tabu search algorithm is compared with a published related genetic algorithm, as well as the derived lower bounds. Also, the tabu search algorithm is compared with the current operation strategy of the online grocer. Computational results indicate that the gap between the lower bounds and the results of the tabu search algorithm is small and the tabu search algorithm is superior to the genetic algorithm. Moreover, the CVRPOAT formulation together with the tabu search algorithm performs much better than the current operation strategy of the online grocer.

Multilevel QoS-policy-based routing management architecture appropriate for heterogeneous network environments

Science.gov (United States)

Chatzaki, Magda; Sartzetakis, Stelios

1998-09-01

As telecom providers introduce new and more sophisticated services the necessity of a global, unified view of the network infrastructure becomes demanding. Today, heterogenous backbone networks are interconnected in order to provide global connectivity. Due to technological impairments the cost of network operation, the maintenance complexity and the overuse of resources are extremely high under the goal of supporting the diverting customer requirements. We propose a scheme for ATM QoS support in such heterogenous, multi-domain, multi-technology network environment. The objective is to optimize users' and networks' profits by giving them the opportunity to satisfy their requirements. Our approach introduces a manager able to take routing decisions supporting quality of service guarantees for the customers, while making efficient use of network resources.

Split delivery vehicle routing problem with time windows: a case study

Science.gov (United States)

Latiffianti, E.; Siswanto, N.; Firmandani, R. A.

2018-04-01

This paper aims to implement an extension of VRP so called split delivery vehicle routing problem (SDVRP) with time windows in a case study involving pickups and deliveries of workers from several points of origin and several destinations. Each origin represents a bus stop and the destination represents either site or office location. An integer linear programming of the SDVRP problem is presented. The solution was generated using three stages of defining the starting points, assigning busses, and solving the SDVRP with time windows using an exact method. Although the overall computational time was relatively lengthy, the results indicated that the produced solution was better than the existing routing and scheduling that the firm used. The produced solution was also capable of reducing fuel cost by 9% that was obtained from shorter total distance travelled by the shuttle buses.

A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Spoorendonk, Simon; Røpke, Stefan

2013-01-01

This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow...

Vehicle routing problem with time windows using natural inspired algorithms

Science.gov (United States)

Pratiwi, A. B.; Pratama, A.; Sa’diyah, I.; Suprajitno, H.

2018-03-01

Process of distribution of goods needs a strategy to make the total cost spent for operational activities minimized. But there are several constrains have to be satisfied which are the capacity of the vehicles and the service time of the customers. This Vehicle Routing Problem with Time Windows (VRPTW) gives complex constrains problem. This paper proposes natural inspired algorithms for dealing with constrains of VRPTW which involves Bat Algorithm and Cat Swarm Optimization. Bat Algorithm is being hybrid with Simulated Annealing, the worst solution of Bat Algorithm is replaced by the solution from Simulated Annealing. Algorithm which is based on behavior of cats, Cat Swarm Optimization, is improved using Crow Search Algorithm to make simplier and faster convergence. From the computational result, these algorithms give good performances in finding the minimized total distance. Higher number of population causes better computational performance. The improved Cat Swarm Optimization with Crow Search gives better performance than the hybridization of Bat Algorithm and Simulated Annealing in dealing with big data.

Analysis of energy consumption and emission of the heterogeneous traffic flow consisting of traditional vehicles and electric vehicles

Science.gov (United States)

Xiao, Hong; Huang, Hai-Jun; Tang, Tie-Qiao

2017-12-01

Electric vehicle (EV) has become a potential traffic tool, which has attracted researchers to explore various traffic phenomena caused by EV (e.g. congestion, electricity consumption, etc.). In this paper, we study the energy consumption (including the fuel consumption and the electricity consumption) and emissions of heterogeneous traffic flow (that consists of the traditional vehicle (TV) and EV) under three traffic situations (i.e. uniform flow, shock and rarefaction waves, and a small perturbation) from the perspective of macro traffic flow. The numerical results show that the proportion of electric vehicular flow has great effects on the TV’s fuel consumption and emissions and the EV’s electricity consumption, i.e. the fuel consumption and emissions decrease while the electricity consumption increases with the increase of the proportion of electric vehicular flow. The results can help us better understand the energy consumption and emissions of the heterogeneous traffic flow consisting of TV and EV.

Innovative Sol-Gel Routes for the Bottom-up Preparation of Heterogeneous Catalysts.

Science.gov (United States)

Debecker, Damien P

2017-12-11

Heterogeneous catalysts can be prepared by different methods offering various levels of control on the final properties of the solid. In this account, we exemplify bottom-up preparation routes that are based on the sol-gel chemistry and allow to tailor some decisive properties of solid catalysts. First, an emulsion templating strategy is shown to lead to macrocellular self-standing monoliths with a macroscopic 3D structure. The latter can be used as catalyst or catalyst supports in flow chemistry, without requiring any subsequent shaping step. Second, the aerosol-assisted sol-gel process allows for the one-step and continuous production of porous mixed oxides. Tailored textural properties can be obtained together with an excellent control on composition and homogeneity. Third, the application of non-hydrolytic sol-gel routes, in the absence of water, leads to mixed oxides with outstanding textural properties and with peculiar surface chemistry. In all cases, the resulting catalytic performance can be correlated with the specificities of the preparation routes presented. This is exemplified in catalytic reactions in the fields of biomass conversion, petro chemistry, enantioselective organic synthesis, and air pollution mitigation. © 2017 The Chemical Society of Japan & Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Rich Vehicle Routing Problem with Multiple Trips and Driver Shifts

OpenAIRE

Arda, Yasemin; Crama, Yves; Kucukaydin, Hande; Talla Nobibon, Fabrice

2012-01-01

This study is concerned with a rich vehicle routing problem (RVRP) encountered at a Belgian transportation company in charge of servicing supermarkets and hypermarkets belonging to a franchise. The studied problem can be classified as a one-to-many-to-one pick-up and delivery problem, where there is a single depot from which all delivery customers are served and to which every pick-up demand must be carried back (Gutiérrez-Jarpa et al., 2010). The delivery and backhaul customers are considere...

Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach

Directory of Open Access Journals (Sweden)

Hossein Yousefi

2017-06-01

Full Text Available A vehicle routing problem with time windows (VRPTW is an important problem with many real applications in a transportation problem. The optimum set of routes with the minimum distance and vehicles used is determined to deliver goods from a central depot, using a vehicle with capacity constraint. In the real cases, there are other objective functions that should be considered. This paper considers not only the minimum distance and the number of vehicles used as the objective function, the customer’s satisfaction with the priority of customers is also considered. Additionally, it presents a new model for a bi-objective VRPTW solved by a revised multi-choice goal programming approach, in which the decision maker determines optimistic aspiration levels for each objective function. Two meta-heuristic methods, namely simulated annealing (SA and genetic algorithm (GA, are proposed to solve large-sized problems. Moreover, the experimental design is used to tune the parameters of the proposed algorithms. The presented model is verified by a real-world case study and a number of test problems. The computational results verify the efficiency of the proposed SA and GA.

Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

Directory of Open Access Journals (Sweden)

Baozhen Yao

2014-02-01

Full Text Available This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity of the problem by changing the multi-depot open vehicle routing problem into an open vehicle routing problem with a dummy central depot in this paper. Then, ant colony optimization is used to solve the problem. To improve the performance of the algorithm, crossover operation and some adaptive strategies are used. Finally, the computational results for the benchmark problems of the multi-depot vehicle routing problem indicate that the proposed ant colony optimization is an effective method to solve the multi-depot vehicle routing problem. Furthermore, the computation results of the seafood product delivery problem from Dalian, China also suggest that the proposed ant colony optimization is feasible to solve the seafood product delivery routing problem.

An artificial bee colony algorithm for the capacitated vehicle routing problem

DEFF Research Database (Denmark)

Szeto, W.Y.; Wu, Yongzhong; Ho, Sin C.

2011-01-01

This paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also...... proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms...

A Food Chain Algorithm for Capacitated Vehicle Routing Problem with Recycling in Reverse Logistics

Science.gov (United States)

Song, Qiang; Gao, Xuexia; Santos, Emmanuel T.

2015-12-01

This paper introduces the capacitated vehicle routing problem with recycling in reverse logistics, and designs a food chain algorithm for it. Some illustrative examples are selected to conduct simulation and comparison. Numerical results show that the performance of the food chain algorithm is better than the genetic algorithm, particle swarm optimization as well as quantum evolutionary algorithm.

Stochastic vehicle routing with recourse

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi

2012-01-01

instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

Directory of Open Access Journals (Sweden)

N. Rincon-Garcia

2017-01-01

Full Text Available This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%, travel distance (10.88% and travel time (12.00% compared to previous implementations in reasonable time.

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

Science.gov (United States)

2015-01-01

solution approach that combines heuristic search and integer programming. Boudia et al. (2007) solved an SDVRP instance using a memetic algorithm with...Boudia, M., Prins, C., Reghioui, M., 2007. An effective memetic algorithm with population management for the split delivery vehicle routing problem

An Immune Cooperative Particle Swarm Optimization Algorithm for Fault-Tolerant Routing Optimization in Heterogeneous Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Yifan Hu

2012-01-01

Full Text Available The fault-tolerant routing problem is important consideration in the design of heterogeneous wireless sensor networks (H-WSNs applications, and has recently been attracting growing research interests. In order to maintain k disjoint communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which multiple paths are calculated and maintained in advance, and alternate paths are created once the previous routing is broken. Then, we propose an immune cooperative particle swarm optimization algorithm (ICPSOA in the model to provide the fast routing recovery and reconstruct the network topology for path failure in H-WSNs. In the ICPSOA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by immune mechanism, which can enhance the capacity of global search and improve the converging rate of the algorithm. Then we validate this theoretical model with simulation results. The results indicate that the ICPSOA-based fault-tolerant routing protocol outperforms several other protocols due to its capability of fast routing recovery mechanism, reliable communications, and prolonging the lifetime of WSNs.

Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route

Directory of Open Access Journals (Sweden)

Mohammad Mirabi

2016-11-01

Full Text Available This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.

An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems

DEFF Research Database (Denmark)

Helsgaun, Keld

This report describes the implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver for solving constrained traveling salesman and vehicle routing problems. The extension, which is called LKH-3, is able to solve a variety of well-known problems, including the sequential ordering...... problem (SOP), the traveling repairman problem (TRP), variants of the multiple travel-ing salesman problem (mTSP), as well as vehicle routing problems (VRPs) with capacity, time windows, pickup-and-delivery and distance constraints. The implementation of LKH-3 builds on the idea of transforming...... the problems into standard symmetric traveling salesman problems and handling constraints by means of penalty functions. Extensive testing on benchmark instances from the literature has shown that LKH-3 is effective. Best known solutions are often obtained, and in some cases, new best solutions are found...

A new formulation for the 2-echelon capacitated vehicle routing problem

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Røpke, Stefan; Spoorendonk, Simon

The 2-echelon capacitated vehicle routing problem (2E-CVRP) is a transportation and distribution problem where goods are transported from a depot to a set of customers possible via optional satellite facilities. The 2E-CVRP is relevant in city-logistic applications where legal restrictions make...... it infeasible to use large trucks within the center of large cities. We propose a new mathematical formulation for the 2E-CVRP with much fewer variables than the previously proposed but with several constraint sets of exponential size. The strength of the model is implied by the facts that many cutting planes...

Evaluation of Data Transfer Performance Between Moving Sender and Receiver in Mobile Communication Networks for Heterogeneous Service Support

Directory of Open Access Journals (Sweden)

Dalė Dzemydienė

2011-12-01

Full Text Available Vehicular communication networks are acquiring more and more commercial relevance because of recent advances in inter-vehicular communications via the DSRC/WAVE standard, which stimulates a brand new family of visionary services for vehicles, from road safety to entertainment and multimedia applications. After deep analysis of the literature it was decided to investigate evaluation of data transfer performance between moving sender and receiver in mobile communication network for heterogeneous service support. After careful analysis of the simulation tools the NCTUns 6.0 software package was chosen for planned investigations. The results illustrate that the longest communication can be maintained at the maximum number of vehicles participating on the network, but the quality of communication is inversely proportional to the number of vehicles. On this changing topology network when growing number of nodes (vehicles increases flooding of network with the data packages and it determines many collisions. The number of rejected packages increases directly in proportion to the number of vehicles. When the number of nodes (vehicle increases—it is increasing the number of the received same packages which are received from different nodes in the recipient node. On the sender node, the packages are rejected because the collisions occur due to improperly functioning access channel allocation mechanisms. It can be concluded that the routing protocols created for a normal MANET networks is useless in a fast-changing topology large-scale vehicle communication network. To provide heterogeneous services new routing protocols and channel access methods are needed, specifically for vehicle communication networks.

Evaluation of Data Transfer Performance Between Moving Sender and Receiver in Mobile Communication Networks for Heterogeneous Service Support

Directory of Open Access Journals (Sweden)

Dalė Dzemydienė

2013-08-01

Full Text Available Vehicular communication networks are acquiring more and more commercial relevance because of recent advances in inter-vehicular communications via the DSRC/WAVE standard, which stimulates a brand new family of visionary services for vehicles, from road safety to entertainment and multimedia applications. After deep analysis of the literature it was decided to investigate evaluation of data transfer performance between moving sender and receiver in mobile communication network for heterogeneous service support. After careful analysis of the simulation tools the NCTUns 6.0 software package was chosen for planned investigations. The results illustrate that the longest communication can be maintained at the maximum number of vehicles participating on the network, but the quality of communication is inversely proportional to the number of vehicles. On this changing topology network when growing number of nodes (vehicles increases flooding of network with the data packages and it determines many collisions. The number of rejected packages increases directly in proportion to the number of vehicles. When the number of nodes (vehicle increases—it is increasing the number of the received same packages which are received from different nodes in the recipient node. On the sender node, the packages are rejected because the collisions occur due to improperly functioning access channel allocation mechanisms. It can be concluded that the routing protocols created for a normal MANET networks is useless in a fast-changing topology large-scale vehicle communication network. To provide heterogeneous services new routing protocols and channel access methods are needed, specifically for vehicle communication networks.

A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows

NARCIS (Netherlands)

Bräysy, Olli; Porkka, Pasi P.; Dullaert, Wout; Repoussis, Panagiotis P.; Tarantilis, Christos D.

This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The

A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands

NARCIS (Netherlands)

Veenstra, Marjolein; Roodbergen, Kees Jan; Coelho, Leandro C.; Zhu, Stuart X.

2018-01-01

This paper introduces a simultaneous facility location and vehicle routing problem that arises in health care logistics in the Netherlands. In this problem, the delivery of medication from a local pharmacy can occur via lockers, from where patients that are within the coverage distance of a locker

Economic and Environmental Evaluation of a Brick Delivery System Based on Multi-Trip Vehicle Loader Routing Problem for Small Construction Sites

Directory of Open Access Journals (Sweden)

Heungjo An

2018-05-01

Full Text Available While large construction sites have on-site loaders to handle heavy and large packages of bricks, small brick manufacturers employ a truck-mounted loader or sometimes deploy a loader truck to accompany normal brick delivery trucks to small construction sites lacking on-site loaders. It may be very challenging for small contractors to manage a sustainable delivery system that is both cost-effective and environmentally friendly. To address this issue, this paper proposes to solve a multi-trip vehicle loader routing problem by uniquely planning routes and schedules of several types of vehicles considering their synchronized operations at customer sites and multi trips. This paper also evaluates the sustainability of the developed model from both economic and environmental perspectives. Case studies based on small construction sites in the Middle East demonstrate applications of the proposed model to make the most economical plans for delivering bricks. Compared to the single-trip vehicle loader routing problem, the proposed model reduces, on average, 18.7% of the total delivery cost while increasing CO2 emission negligibly. The economic benefit is mainly achieved by reducing the required number of vehicles. Brick plant managers can use the proposed mathematical model to plan the most cost-effective delivery schedules sustainably while minimizing negative environmental effects.

A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Ligang Cui

2013-01-01

Full Text Available The capacitated vehicle routing problem (CVRP is the most classical vehicle routing problem (VRP; many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given.

Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

Directory of Open Access Journals (Sweden)

Marco Antonio Cruz-Chávez

2016-01-01

Full Text Available A stochastic algorithm for obtaining feasible initial populations to the Vehicle Routing Problem with Time Windows is presented. The theoretical formulation for the Vehicle Routing Problem with Time Windows is explained. The proposed method is primarily divided into a clustering algorithm and a two-phase algorithm. The first step is the application of a modified k-means clustering algorithm which is proposed in this paper. The two-phase algorithm evaluates a partial solution to transform it into a feasible individual. The two-phase algorithm consists of a hybridization of four kinds of insertions which interact randomly to obtain feasible individuals. It has been proven that different kinds of insertions impact the diversity among individuals in initial populations, which is crucial for population-based algorithm behavior. A modification to the Hamming distance method is applied to the populations generated for the Vehicle Routing Problem with Time Windows to evaluate their diversity. Experimental tests were performed based on the Solomon benchmarking. Experimental results show that the proposed method facilitates generation of highly diverse populations, which vary according to the type and distribution of the instances.

Coordinated Platoon Routing in a Metropolitan Network

Energy Technology Data Exchange (ETDEWEB)

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing the platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.

Biased random key genetic algorithm with insertion and gender selection for capacitated vehicle routing problem with time windows

Science.gov (United States)

Rochman, Auliya Noor; Prasetyo, Hari; Nugroho, Munajat Tri

2017-06-01

Vehicle Routing Problem (VRP) often occurs when the manufacturers need to distribute their product to some customers/outlets. The distribution process is typically restricted by the capacity of the vehicle and the working hours at the distributor. This type of VRP is also known as Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). A Biased Random Key Genetic Algorithm (BRKGA) was designed and coded in MATLAB to solve the CVRPTW case of soft drink distribution. The standard BRKGA was then modified by applying chromosome insertion into the initial population and defining chromosome gender for parent undergoing crossover operation. The performance of the established algorithms was then compared to a heuristic procedure for solving a soft drink distribution. Some findings are revealed (1) the total distribution cost of BRKGA with insertion (BRKGA-I) results in a cost saving of 39% compared to the total cost of heuristic method, (2) BRKGA with the gender selection (BRKGA-GS) could further improve the performance of the heuristic method. However, the BRKGA-GS tends to yield worse results compared to that obtained from the standard BRKGA.

A Two-Phase Heuristic Algorithm for the Common Frequency Routing Problem with Vehicle Type Choice in the Milk Run

Directory of Open Access Journals (Sweden)

Yu Lin

2015-01-01

Full Text Available High frequency and small lot size are characteristics of milk runs and are often used to implement the just-in-time (JIT strategy in logistical systems. The common frequency problem, which simultaneously involves planning of the route and frequency, has been extensively researched in milk run systems. In addition, vehicle type choice in the milk run system also has a significant influence on the operating cost. Therefore, in this paper, we simultaneously consider vehicle routing planning, frequency planning, and vehicle type choice in order to optimize the sum of the cost of transportation, inventory, and dispatch. To this end, we develop a mathematical model to describe the common frequency problem with vehicle type choice. Since the problem is NP hard, we develop a two-phase heuristic algorithm to solve the model. More specifically, an initial satisfactory solution is first generated through a greedy heuristic algorithm to maximize the ratio of the superior arc frequency to the inferior arc frequency. Following this, a tabu search (TS with limited search scope is used to improve the initial satisfactory solution. Numerical examples with different sizes establish the efficacy of our model and our proposed algorithm.

A spring-mass-damper system dynamics-based driver-vehicle integrated model for representing heterogeneous traffic

Science.gov (United States)

Munigety, Caleb Ronald

2018-04-01

The traditional traffic microscopic simulation models consider driver and vehicle as a single unit to represent the movements of drivers in a traffic stream. Due to this very fact, the traditional car-following models have the driver behavior related parameters, but ignore the vehicle related aspects. This approach is appropriate for homogeneous traffic conditions where car is the major vehicle type. However, in heterogeneous traffic conditions where multiple vehicle types are present, it becomes important to incorporate the vehicle related parameters exclusively to account for the varying dynamic and static characteristics. Thus, this paper presents a driver-vehicle integrated model hinged on the principles involved in physics-based spring-mass-damper mechanical system. While the spring constant represents the driver’s aggressiveness, the damping constant and the mass component take care of the stability and size/weight related aspects, respectively. The proposed model when tested, behaved pragmatically in representing the vehicle-type dependent longitudinal movements of vehicles.

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...

Penerapan Konsep Vehicle Routing Problem dalam Kasus Pengangkutan Sampah di Perkotaan

Directory of Open Access Journals (Sweden)

Harun Al Rasyid Lubis

2016-12-01

Full Text Available Cities in developing countries still operate a traditional waste transport and handling where rubbish were collected at regular intervals by specialized trucks from curb-side collection or transfer point prior to transport them to a final dump site. The problem are worsening as some cities experience exhausted waste collection services because the system is inadequately managed, fiscal capacity to invest in adequate vehicle fleets is lacking and also due to uncontrolled dumpsites location. In this paper problem of waste collection and handling is formulated based on Capacitated Vehicle Routing Problem Time Window Multiple Depo Intermediete Facility (CVRPTWMDIF. Each vehicle was assigned to visit several intermediate transfer points, until the truck loading or volume capacity reached then waste are transported to final landfill or dump site. Finally all trucks will return to a depot at the end of daily operation. Initially the solution of CVRPTWMDIF problem was tested on a simple hypothetical waste handling before being implemented into a real case problem. Solutions found using CVRPTWMDIF compared with the practice of waste transport and handling in the city of Bandung. Based on a common hours of operation and the same number of transport fleets, it was found that CVRPTWMDIF can reduce the volume of waste that is not transported by almost half by the end of the daily operations.

Computational results with a branch and cut code for the capacitated vehicle routing problem

Energy Technology Data Exchange (ETDEWEB)

Augerat, P.; Naddef, D. [Institut National Polytechnique, 38 - Grenoble (France); Belenguer, J.M.; Benavent, E.; Corberan, A. [Valencia Univ. (Spain); Rinaldi, G. [Consiglio Nazionale delle Ricerche, Rome (Italy)

1995-09-01

The Capacitated Vehicle Routing Problem (CVRP) we consider in this paper consists in the optimization of the distribution of goods from a single depot to a given set of customers with known demand using a given number of vehicles of fixed capacity. There are many practical routing applications in the public sector such as school bus routing, pick up and mail delivery, and in the private sector such as the dispatching of delivery trucks. We present a Branch and Cut algorithm to solve the CVRP which is based in the partial polyhedral description of the corresponding polytope. The valid inequalities used in our method can ne found in Cornuejols and Harche (1993), Harche and Rinaldi (1991) and in Augerat and Pochet (1995). We concentrated mainly on the design of separation procedures for several classes of valid inequalities. The capacity constraints (generalized sub-tour eliminations inequalities) happen to play a crucial role in the development of a cutting plane algorithm for the CVRP. A large number of separation heuristics have been implemented and compared for these inequalities. There has been also implemented heuristic separation algorithms for other classes of valid inequalities that also lead to significant improvements: comb and extended comb inequalities, generalized capacity inequalities and hypo-tour inequalities. The resulting cutting plane algorithm has been applied to a set of instances taken from the literature and the lower bounds obtained are better than the ones previously known. Some branching strategies have been implemented to develop a Branch an Cut algorithm that has been able to solve large CVRP instances, some of them which had never been solved before. (authors). 32 refs., 3 figs., 10 tabs.

Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows

Directory of Open Access Journals (Sweden)

Rafael Grosso

2018-01-01

Full Text Available The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.

Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem.

Science.gov (United States)

Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

2015-01-01

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA.

Wheeled mobility device transportation safety in fixed route and demand-responsive public transit vehicles within the United States.

Science.gov (United States)

Frost, Karen L; van Roosmalen, Linda; Bertocci, Gina; Cross, Douglas J

2012-01-01

An overview of the current status of wheelchair transportation safety in fixed route and demand-responsive, non-rail, public transportation vehicles within the US is presented. A description of each mode of transportation is provided, followed by a discussion of the primary issues affecting safety, accessibility, and usability. Technologies such as lifts, ramps, securement systems, and occupant restraint systems, along with regulations and voluntary industry standards have been implemented with the intent of improving safety and accessibility for individuals who travel while seated in their wheeled mobility device (e.g., wheelchair or scooter). However, across both fixed route and demand-responsive transit systems a myriad of factors such as nonuse and misuse of safety systems, oversized wheeled mobility devices, vehicle space constraints, and inadequate vehicle operator training may place wheeled mobility device (WhMD) users at risk of injury even under non-impact driving conditions. Since WhMD-related incidents also often occur during the boarding and alighting process, the frequency of these events, along with factors associated with these events are described for each transit mode. Recommendations for improving WhMD transportation are discussed given the current state of

An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Weizhen Rao

2016-01-01

Full Text Available The classical model of vehicle routing problem (VRP generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient. Complexity analysis of FCVRP is presented through analogy with the capacitated VRP. To tackle the FCVRP’s computational intractability, we propose an efficient two-objective hybrid local search algorithm (TOHLS. TOHLS is based on a hybrid local search algorithm (HLS that is also used to solve FCVRP. Based on the Golden CVRP benchmarks, 60 FCVRP instances are generated and tested. Finally, the computational results show that the proposed TOHLS significantly outperforms the HLS.

Cost analysis of hybrid adaptive routing protocol for heterogeneous ...

Indian Academy of Sciences (India)

NONITA SHARMA

Event detection; wireless sensor networks; hybrid routing; cost benefit analysis; proactive routing; reactive routing. 1. ... additional energy, high processing power, etc. are deployed to extend the .... transmit to its parent node. (2) Reactive ...

A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands

DEFF Research Database (Denmark)

Christiansen, Christian Holk; Lysgaard, Jens

. The CVRPSD can be formulated as a Set Partitioning Problem. We show that, under the above assumptions on demands, the associated column generation subproblem can be solved using a dynamic programming scheme which is similar to that used in the case of deterministic demands. To evaluate the potential of our......In this article we introduce a new exact solution approach to the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). In particular, we consider the case where all customer demands are distributed independently and where each customer's demand follows a Poisson distribution...

Multi-Objective Emergency Material Vehicle Dispatching and Routing under Dynamic Constraints in an Earthquake Disaster Environment

Directory of Open Access Journals (Sweden)

Jincheng Jiang

2017-05-01

Full Text Available Emergency material vehicle dispatching and routing (EMVDR is an important task in emergency relief after large-scale earthquake disasters. However, EMVDR is subject to dynamic disaster environment, with uncertainty surrounding elements such as the transportation network and relief materials. Accurate and dynamic emergency material dispatching and routing is difficult. This paper proposes an effective and efficient multi-objective multi-dynamic-constraint emergency material vehicle dispatching and routing model. Considering travel time, road capacity, and material supply and demand, the proposed EMVDR model is to deliver emergency materials from multiple emergency material depositories to multiple disaster points while satisfying the objectives of maximizing transport efficiency and minimizing the difference of material urgency degrees among multiple disaster points at any one time. Furthermore, a continuous-time dynamic network flow method is developed to solve this complicated model. The collected data from Ludian earthquake were used to conduct our experiments in the post-quake and the results demonstrate that: (1 the EMVDR model adapts to the dynamic disaster environment very well; (2 considering the difference of material urgency degree, the material loss ratio is −10.7%, but the variance of urgency degree decreases from 2.39 to 0.37; (3 the EMVDR model shows good performance in time and space, which allows for decisions to be made nearly in real time. This paper can provide spatial decision-making support for emergency material relief in large-scale earthquake disasters.

A Genetic Algorithm on Inventory Routing Problem

Directory of Open Access Journals (Sweden)

Nevin Aydın

2014-03-01

Full Text Available Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.

Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO

Directory of Open Access Journals (Sweden)

Xiaobing Gan

2012-01-01

Full Text Available This paper considers two additional factors of the widely researched vehicle routing problem with time windows (VRPTW. The two factors, which are very common characteristics in realworld, are uncertain number of vehicles and simultaneous delivery and pick-up service. Using minimization of the total transport costs as the objective of the extension VRPTW, a mathematic model is constructed. To solve the problem, an efficient multiswarm cooperative particle swarm optimization (MCPSO algorithm is applied. And a new encoding method is proposed for the extension VRPTW. Finally, comparing with genetic algorithm (GA and particle swarm optimization (PSO algorithm, the MCPSO algorithm performs best for solving this problem.

A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

Directory of Open Access Journals (Sweden)

Xuhao Zhang

2014-01-01

Full Text Available A framing link (FL based tabu search algorithm is proposed in this paper for a large-scale multidepot vehicle routing problem (LSMDVRP. Framing links are generated during continuous great optimization of current solutions and then taken as skeletons so as to improve optimal seeking ability, speed up the process of optimization, and obtain better results. Based on the comparison between pre- and postmutation routes in the current solution, different parts are extracted. In the current optimization period, links involved in the optimal solution are regarded as candidates to the FL base. Multiple optimization periods exist in the whole algorithm, and there are several potential FLs in each period. If the update condition is satisfied, the FL base is updated, new FLs are added into the current route, and the next period starts. Through adjusting the borderline of multidepot sharing area with dynamic parameters, the authors define candidate selection principles for three kinds of customer connections, respectively. Link split and the roulette approach are employed to choose FLs. 18 LSMDVRP instances in three groups are studied and new optimal solution values for nine of them are obtained, with higher computation speed and reliability.

Preference heterogeneity in a count data model of demand for off-highway vehicle recreation

Science.gov (United States)

Thomas P Holmes; Jeffrey E Englin

2010-01-01

This paper examines heterogeneity in the preferences for OHV recreation by applying the random parameters Poisson model to a data set of off-highway vehicle (OHV) users at four National Forest sites in North Carolina. The analysis develops estimates of individual consumer surplus and finds that estimates are systematically affected by the random parameter specification...

Route Optimization for the Distribution Network of a Confectionary Chain

Directory of Open Access Journals (Sweden)

Anıl İnanlı

2015-12-01

Full Text Available This study considers the distribution network of a well-known perishable food manufacturer and its franchises in Turkey. As the countrywide number of stores is increasing fast, the company is facing problems due to its central distribution of products from a single factory. The objective is to decrease the cost of transportation while maintaining a high level of customer satisfaction. Hence, the focus is on the vehicle routing problem (VRP of this large franchise chain within each city. The problem is defined as a rich VRP with heterogeneous fleet, site-dependent and compartmentalized vehicles, and soft/hard time windows. This NP-hard problem is modelled and tried with real data on a commercial solver. A basic heuristic procedure which can be used easily by the decision makers is also employed for obtaining quick and high-quality solutions for large instances.

Systems and methods for vehicle speed management

Science.gov (United States)

Sujan, Vivek Anand; Vajapeyazula, Phani; Follen, Kenneth; Wu, An; Forst, Howard Robert

2016-03-01

Controlling a speed of a vehicle based on at least a portion of a route grade and a route distance divided into a plurality of route sections, each including at least one of a section grade and section length. Controlling the speed of the vehicle is further based on determining a cruise control speed mode for the vehicle for each of the plurality of route sections and determining a speed reference command of the vehicle based on at least one of the cruise control speed mode, the section length, the section grade, and a current speed.

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Directory of Open Access Journals (Sweden)

Ji Ung Sun

2015-01-01

Full Text Available We consider a capacitated hub location-routing problem (HLRP which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated p-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

A queueing framework for routing problems with time-dependent travel times

NARCIS (Netherlands)

Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

2007-01-01

Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle

The impact of short term traffic forecasting on the effectiveness of vehicles routes planning in urban areas

Energy Technology Data Exchange (ETDEWEB)

Kubek, D.

2016-07-01

An impossibility to foresee in advance the accurate traffic parameters in face of dynamism phenomena in complex transportation system is a one of the major source of uncertainty. The paper presents an approach to robust optimization of logistics vehicle routes in urban areas on the basis of estimated short-term traffic time forecasts in a selected area of the urban road network. The forecast values of optimization parameters have been determined using the spectral analysis model, taking into account the forecast uncertainty degree. The robust counterparts approach of uncertain bi-criteria shortest path problem formulation is used to determining the robust routes for logistics vehicles in the urban network. The uncertainty set is created on the basis of forecast travel times in chosen sections, estimated by means of spectral analysis. The advantages and the characteristics are exemplified in the actual Krakow road network. The obtained data have been compared with classic approach wherein it is assumed that the optimization parameters are certain and accurate. The results obtained in the simulation example indicate that use of forecasting techniques with robust optimization models has a positive impact on the quality of final solutions. (Author)

A Review of Vehicle to Vehicle Communication Protocols for VANETs in the Urban Environment

Directory of Open Access Journals (Sweden)

Irshad Ahmed Abbasi

2018-01-01

Full Text Available Vehicular Ad-hoc Networks (VANETs have been gaining significant attention from the research community due to their increasing importance for building an intelligent transportation system. The characteristics of VANETs, such as high mobility, network partitioning, intermittent connectivity and obstacles in city environments, make routing a challenging task. Due to these characteristics of VANETs, the performance of a routing protocol is degraded. The position-based routing is considered to be the most significant approach in VANETs. In this paper, we present a brief review of most significant position based unicast routing protocols designed for vehicle to vehicle communications in the urban environment. We provide them with their working features for exchanging information between vehicular nodes. We describe their pros and cons. This study also provides a comparison of the vehicle to vehicle communication based routing protocols. The comparative study is based on some significant factors such as mobility, traffic density, forwarding techniques and method of junction selection mechanism, and strategy used to handle a local optimum situation. It also provides the simulation based study of existing dynamic junction selection routing protocols and a static junction selection routing protocol. It provides a profound insight into the routing techniques suggested in this area and the most valuable solutions to advance VANETs. More importantly, it can be used as a source of references to other researchers in finding literature that is relevant to routing in VANETs.

Vehicle-Routing Optimization for Municipal Solid Waste Collection Using Genetic Algorithm: The Case of Southern Nablus City

Science.gov (United States)

Assaf, Ramiz; Saleh, Yahya

2017-09-01

Municipalities are responsible for solid waste collectiont for environmental, social and economic purposes. Practices of municipalities should be effective and efficient, with the objectives of reducing the total incurred costs in the solid waste collection network concurrently achieving the highest service level. This study aims at finding the best routes of solid waste collection network in Nablus city-Palestine. More specifically, the study seeks the optimal route that minimizes the total travelled distance by the trucks and hence the resulted costs. The current situation is evaluated and the problem is modelled as a Vehicle Routing Problem (VRP). The VRP is then optimized via a genetic algorithm. Specifically, compared to the current situation, the trucks total travelled distance was reduced by 66%, whereas the collection time was reduced from 7 hours per truck-trip to 2.3 hours. The findings of this study is useful for all municipality policy makers that are responsible for solid waste collection.

A Combination of Genetic Algorithm and Particle Swarm Optimization for Vehicle Routing Problem with Time Windows.

Science.gov (United States)

Xu, Sheng-Hua; Liu, Ji-Ping; Zhang, Fu-Hao; Wang, Liang; Sun, Li-Jian

2015-08-27

A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions for solving the VRPTW issue. One new well-known solution for this benchmark problem is also outlined in the following.

Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

Science.gov (United States)

Zhang, Yuanfei; Pei, Qianwen; Dai, Feifei; Zhang, Lei

2017-10-01

Vehicular ad-hoc network (VANET) is a core component of intelligent traffic management system which could provide various of applications such as accident prediction, route reporting, etc. Due to the problems caused by traffic congestion, route reporting becomes a prospective application which can help a driver to get optimal route to save her travel time. Before enjoying the convenience of route reporting, security and privacy-preserving issues need to be concerned. In this paper, we propose a new secure and privacy-preserving route reporting scheme for VANETs. In our scheme, only an authenticated vehicle can use the route reporting service provided by the traffic management center. Further, a vehicle may receive the response from the traffic management center with low latency and without violating the privacy of the vehicle. Experiment results show that our scheme is much more efficiency than the existing one.

Modified artificial bee colony for the vehicle routing problems with time windows.

Science.gov (United States)

Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana

2016-01-01

The natural behaviour of the honeybee has attracted the attention of researchers in recent years and several algorithms have been developed that mimic swarm behaviour to solve optimisation problems. This paper introduces an artificial bee colony (ABC) algorithm for the vehicle routing problem with time windows (VRPTW). A Modified ABC algorithm is proposed to improve the solution quality of the original ABC. The high exploration ability of the ABC slows-down its convergence speed, which may due to the mechanism used by scout bees in replacing abandoned (unimproved) solutions with new ones. In the Modified ABC a list of abandoned solutions is used by the scout bees to memorise the abandoned solutions, then the scout bees select a solution from the list based on roulette wheel selection and replace by a new solution with random routs selected from the best solution. The performance of the Modified ABC is evaluated on Solomon benchmark datasets and compared with the original ABC. The computational results demonstrate that the Modified ABC outperforms the original ABC also produce good solutions when compared with the best-known results in the literature. Computational investigations show that the proposed algorithm is a good and promising approach for the VRPTW.

Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

Directory of Open Access Journals (Sweden)

Julia Rieck

2013-05-01

Full Text Available In reverse logistics networks, products (e.g., bottles or containers have to be transported from a depot to customer locations and, after use, from customer locations back to the depot. In order to operate economically beneficial, companies prefer a simultaneous delivery and pick-up service. The resulting Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRPSDP is an operational problem, which has to be solved daily by many companies. We present two mixed-integer linear model formulations for the VRPSDP, namely a vehicle-flow and a commodity-flow model. In order to strengthen the models, domain-reducing preprocessing techniques, and effective cutting planes are outlined. Symmetric benchmark instances known from the literature as well as new asymmetric instances derived from real-world problems are solved to optimality using CPLEX 12.1.

Integrated planning of electric vehicles routing and charging stations location considering transportation networks and power distribution systems

Directory of Open Access Journals (Sweden)

Andrés Arias

2018-09-01

Full Text Available Electric Vehicles (EVs represent a significant option that contributes to improve the mobility and reduce the pollution, leaving a future expectation in the merchandise transportation sector, which has been demonstrated with pilot projects of companies operating EVs for products delivering. In this work a new approach of EVs for merchandise transportation considering the location of Electric Vehicle Charging Stations (EVCSs and the impact on the Power Distribution System (PDS is addressed. This integrated planning is formulated through a mixed integer non-linear mathematical model. Test systems of different sizes are designed to evaluate the model performance, considering the transportation network and PDS. The results show a trade-off between EVs routing, PDS energy losses and EVCSs location.

Natural gas application in light- and heavy-duty vehicles in Brazil: panorama, technological routes and perspectives

Energy Technology Data Exchange (ETDEWEB)

Machado, Guilherme Bastos, Cordeiro de Melo, Tadeu Cavalcante; Leao, Raphael Riemke de Campos Cesar; Iaccarino, Fernando Aniello; Figueiredo Moreira, Marcia

2007-07-01

The Brazilian CNG light-duty vehicle fleet has currently reached more than 1,300,000 units. This growth increased in the late 1990's, when CNG was approved for use in passenger cars. In 2001, the IBAMA (Brazilian Institute for Environment and Natural Renewable Resources), concerned with this uncontrolled growth, published CONAMA (National Environmental Council, controlled by IBAMA) resolution 291, which establishes rules for CNG conversion kit environmental certification.This paper discusses the technological challenges for CNG-converted vehicles to comply with PROCONVE (Brazilian Program for Automotive Air Pollution Control) emission limits. In the 1980's, because of the oil crisis, Natural Gas (NG) emerged as a fuel with great potential to replace Diesel in heavy-duty vehicles. Some experiences were conducted for partial conversions from Diesel to NG (Diesel-gas). Other experiences using NG Otto Cycle buses were conducted in some cities, but have not expanded. Another technological route called 'Ottolization' (Diesel to Otto cycle convertion) appeared recently. Population increase and the great growth in vehicle fleet promote a constant concern with automotive emissions. More restrictive emission limits, high international oil prices, and the strategic interest in replacing Diesel imports, altogether form an interesting scenario for CNG propagation to public transportation in the main Brazilian metropolises.

Electric Vehicles in Logistics and Transportation: A Survey on Emerging Environmental, Strategic, and Operational Challenges

Directory of Open Access Journals (Sweden)

Angel Alejandro Juan

2016-01-01

Full Text Available Current logistics and transportation (L&T systems include heterogeneous fleets consisting of common internal combustion engine vehicles as well as other types of vehicles using “green” technologies, e.g., plug-in hybrid electric vehicles and electric vehicles (EVs. However, the incorporation of EVs in L&T activities also raise some additional challenges from the strategic, planning, and operational perspectives. For instance, smart cities are required to provide recharge stations for electric-based vehicles, meaning that investment decisions need to be made about the number, location, and capacity of these stations. Similarly, the limited driving-range capabilities of EVs, which are restricted by the amount of electricity stored in their batteries, impose non-trivial additional constraints when designing efficient distribution routes. Accordingly, this paper identifies and reviews several open research challenges related to the introduction of EVs in L&T activities, including: (a environmental-related issues; and (b strategic, planning and operational issues associated with “standard” EVs and with hydrogen-based EVs. The paper also analyzes how the introduction of EVs in L&T systems generates new variants of the well-known Vehicle Routing Problem, one of the most studied optimization problems in the L&T field, and proposes the use of metaheuristics and simheuristics as the most efficient way to deal with these complex optimization problems.

Recent advances in heterogeneous catalytic conversion of glucose to 5-hydroxymethylfurfural via green routes

KAUST Repository

Wang, Jianjian

2017-05-12

With concerns of diminishing fossil fuel reserves and environmental deterioration, great efforts have been made to explore novel approaches of efficiently utilizing bio-renewable feedstocks to produce chemicals and fuels. 5-Hydroxymethylfurfural (HMF), generated from dehydration of six-carbon ketose, is regarded as a primary and versatile renewable building block to realize the goal of production of these high valued products from renewable biomass resources transformation. In this review, we summarize the recent advances via green routes in the heterogeneous reaction system for the catalytic production of HMF from glucose conversion, and emphasize reaction pathways of these reaction approaches based on the fundamental mechanistic chemistry as well as highlight the challenges (such as separation and purification of products, reusing and regeneration of catalyst, recycling solvent) in this field.

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

Science.gov (United States)

Fu, Zhuo; Wang, Jiangtao

2018-01-01

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics. PMID:29747469

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack-From a Green Operation Perspective.

Science.gov (United States)

Xia, Yangkun; Fu, Zhuo; Tsai, Sang-Bing; Wang, Jiangtao

2018-05-10

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

Capacitated arc routing problem and its extensions in waste collection

International Nuclear Information System (INIS)

Fadzli, Mohammad; Najwa, Nurul; Luis, Martino

2015-01-01

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time

Capacitated arc routing problem and its extensions in waste collection

Energy Technology Data Exchange (ETDEWEB)

Fadzli, Mohammad; Najwa, Nurul [Institut Matematik Kejuruteraan, Universiti Malaysia Perlis, Kampus Pauh Putra, 02600 Arau, Perlis (Malaysia); Luis, Martino [Othman Yeop Abdullah Graduate School of Business, Universiti Utara Malaysia, 06010 Sintok, Kedah (Malaysia)

2015-05-15

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.

Subset-row inequalities applied to the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

2008-01-01

constraints as the pricing problem. We introduce the subset-row inequalities, which are Chvatal-Gomory rank-1 cuts based on a subset of the constraints in the master problem. Applying a subset-row inequality in the master problem increases the complexity of the label-setting algorithm used to solve......This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource...... the pricing problem because an additional resource is added for each inequality. We propose a modified dominance criterion that makes it possible to dominate more labels by exploiting the step-like structure of the objective function of the pricing problem. Computational experiments have been performed...

A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce

Science.gov (United States)

Xia, Chao; Sheng, Ying; Jiang, Zhong-Zhong; Tan, Chunqiao; Huang, Min; He, Yuanjian

2015-12-01

In this paper, a novel discrete differential evolution (DDE) algorithm is proposed to solve the vehicle routing problems (VRP) in B2C e-commerce, in which VRP is modeled by the incomplete graph based on the actual urban road system. First, a variant of classical VRP is described and a mathematical programming model for the variant is given. Second, the DDE is presented, where individuals are represented as the sequential encoding scheme, and a novel reparation operator is employed to repair the infeasible solutions. Furthermore, a FLOYD operator for dealing with the shortest route is embedded in the proposed DDE. Finally, an extensive computational study is carried out in comparison with the predatory search algorithm and genetic algorithm, and the results show that the proposed DDE is an effective algorithm for VRP in B2C e-commerce.

A multi-objective location routing problem using imperialist competitive algorithm

Directory of Open Access Journals (Sweden)

Amir Mohammad Golmohammadi

2016-06-01

Full Text Available Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.

An adversarial queueing model for online server routing

NARCIS (Netherlands)

Bonifaci, V.

2007-01-01

In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing

Design and Implementation of a Combinatorial Optimization Multi-population Meta-heuristic for Solving Vehicle Routing Problems

Directory of Open Access Journals (Sweden)

Eneko Osaba

2016-12-01

Full Text Available This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at the University of Deusto. The thesis can be placed in the field of artificial intelligence. Specifically, it is related with multi- population meta-heuristics for solving vehicle routing problems. The dissertation was held in the main auditorium of the University, in a publicly open presentation. After the presentation, Eneko was awarded with the highest grade (cum laude. Additionally, Eneko obtained the PhD obtaining award granted by the Basque Government through.

Capacitated Vehicle Routing with Non-Uniform Speeds

DEFF Research Database (Denmark)

Gørtz, Inge Li; Molinaro, Marco; Nagarajan, Viswanath

2011-01-01

-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm. The technical heart of our result lies in achieving a constant approximation to the following TSP variant (called Heterogenous TSP). Given a metric denoting distances between vertices, a depot r containing k...

Formation Learning Control of Multiple Autonomous Underwater Vehicles With Heterogeneous Nonlinear Uncertain Dynamics.

Science.gov (United States)

Yuan, Chengzhi; Licht, Stephen; He, Haibo

2017-09-26

In this paper, a new concept of formation learning control is introduced to the field of formation control of multiple autonomous underwater vehicles (AUVs), which specifies a joint objective of distributed formation tracking control and learning/identification of nonlinear uncertain AUV dynamics. A novel two-layer distributed formation learning control scheme is proposed, which consists of an upper-layer distributed adaptive observer and a lower-layer decentralized deterministic learning controller. This new formation learning control scheme advances existing techniques in three important ways: 1) the multi-AUV system under consideration has heterogeneous nonlinear uncertain dynamics; 2) the formation learning control protocol can be designed and implemented by each local AUV agent in a fully distributed fashion without using any global information; and 3) in addition to the formation control performance, the distributed control protocol is also capable of accurately identifying the AUVs' heterogeneous nonlinear uncertain dynamics and utilizing experiences to improve formation control performance. Extensive simulations have been conducted to demonstrate the effectiveness of the proposed results.

Real-Time Vehicle Routing for Repairing Damaged Infrastructures Due to Natural Disasters

Directory of Open Access Journals (Sweden)

Huey-Kuo Chen

2011-01-01

Full Text Available We address the task of repairing damaged infrastructures as a series of multidepot vehicle-routing problems with time windows in a time-rolling frame. The network size of the tackled problems changes from time to time, as new disaster nodes will be added to and serviced disaster nodes will be deleted from the current network. In addition, an inaccessible disaster node would become accessible when one of its adjacent disaster nodes has been repaired. By the “take-and-conquer” strategy, the repair sequence of the disaster nodes in the affected area can be suitably scheduled. Thirteen instances were tested with our proposed heuristic, that is, Chen et al.'s approach. For comparison, Hsueh et al.'s approach (2008 with necessary modification was also tested. The results show that Chen et al.'s approach performs slightly better for larger size networks in terms of objective value.

A proposal to improve e-waste collection efficiency in urban mining: Container loading and vehicle routing problems - A case study of Poland.

Science.gov (United States)

Nowakowski, Piotr

2017-02-01

Waste electrical and electronic equipment (WEEE), also known as e-waste, is one of the most important waste streams with high recycling potential. Materials used in these products are valuable, but some of them are hazardous. The urban mining approach attempts to recycle as many materials as possible, so efficiency in collection is vital. There are two main methods used to collect WEEE: stationary and mobile, each with different variants. The responsibility of WEEE organizations and waste collection companies is to assure all resources required for these activities - bins, containers, collection vehicles and staff - are available, taking into account cost minimization. Therefore, it is necessary to correctly determine the capacity of containers and number of collection vehicles for an area where WEEE need to be collected. There are two main problems encountered in collection, storage and transportation of WEEE: container loading problems and vehicle routing problems. In this study, an adaptation of these two models for packing and collecting WEEE is proposed, along with a practical implementation plan designed to be useful for collection companies' guidelines for container loading and route optimization. The solutions are presented in the case studies of real-world conditions for WEEE collection companies in Poland. Copyright © 2016 Elsevier Ltd. All rights reserved.

A stochastic time-dependent green capacitated vehicle routing and scheduling problem with time window, resiliency and reliability: a case study

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2018-09-01

Full Text Available This paper presents a new multi-objective model for a vehicle routing problem under a stochastic uncertainty. It considers traffic point as an inflection point to deal with the arrival time of vehicles. It aims to minimize the total transportation cost, traffic pollution, customer dissatisfaction and maximizes the reliability of vehicles. Moreover, resiliency factors are included in the model to increase the flexibility of the system and decrease the possible losses that may impose on the system. Due to the NP-hardness of the presented model, a meta-heuristic algorithm, namely Simulated Annealing (SA is developed. Furthermore, a number of sensitivity analyses are provided to validate the effectiveness of the proposed model. Lastly, the foregoing meta-heuristic is compared with GAMS, in which the computational results demonstrate an acceptable performance of the proposed SA.

Neighboring and Connectivity-Aware Routing in VANETs

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2014-01-01

Full Text Available A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR for vehicular ad hoc networks (VANETs is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments, and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

A lower bound for the node, edge, and arc routing problem

DEFF Research Database (Denmark)

Bach, Lukas; Hasle, Geir; Wøhlk, Sanne

2013-01-01

The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004, although similar problems have been studied before. This problem, also called the Mixed Capacitated General Routing Problem (MCGRP), generalizes the classical Capacitated Vehicle Routing Problem (CVRP......), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. It captures important aspects of real-life routing problems that were not adequately modeled in previous Vehicle Routing Problem (VRP) variants. The authors also proposed a memetic algorithm procedure and defined a set of test instances...... called the CBMix benchmark. The NEARP definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound procedure for the NEARP. It is a further development of lower bounds for the CARP. We also define two novel sets of test instances to complement...

36 CFR 4.10 - Travel on park roads and designated routes.

Science.gov (United States)

2010-07-01

... 36 Parks, Forests, and Public Property 1 2010-07-01 2010-07-01 false Travel on park roads and... THE INTERIOR VEHICLES AND TRAFFIC SAFETY § 4.10 Travel on park roads and designated routes. (a) Operating a motor vehicle is prohibited except on park roads, in parking areas and on routes and areas...

Design of a Multi-layer Lane-Level Map for Vehicle Route Planning

Directory of Open Access Journals (Sweden)

Liu Chaoran

2017-01-01

Full Text Available With the development of intelligent transportation system, there occurs further demand for high precision localization and route planning, and simultaneously the traditional road-level map fails to meet with this requirement, by which this paper is motivated. In this paper, t he three-layer lane-level map architecture for vehicle path guidance is established, and the mathematical models of road-level layer, intermediate layer and lane-level layer are designed considering efficiency and precision. The geometric model of the lane-level layer of the map is characterized by Cubic Hermite Spline for continuity. A method of generating the lane geometry with fixed and variable control points is proposed, which can effectively ensure the accuracy with limited num ber of control points. In experimental part, a multi-layer map of an intersection is built to validate the map model, and an example of a local map was generated with the lane-level geometry.

Inventory slack routing application in emergency logistics and relief distributions.

Science.gov (United States)

Yang, Xianfeng; Hao, Wei; Lu, Yang

2018-01-01

Various natural and manmade disasters during last decades have highlighted the need of further improving on governmental preparedness to emergency events, and a relief supplies distribution problem named Inventory Slack Routing Problem (ISRP) has received increasing attentions. In an ISRP, inventory slack is defined as the duration between reliefs arriving time and estimated inventory stock-out time. Hence, a larger inventory slack could grant more responsive time in facing of various factors (e.g., traffic congestion) that may lead to delivery lateness. In this study, the relief distribution problem is formulated as an optimization model that maximize the minimum slack among all dispensing sites. To efficiently solve this problem, we propose a two-stage approach to tackle the vehicle routing and relief allocation sub-problems. By analyzing the inter-relations between these two sub-problems, a new objective function considering both delivery durations and dispensing rates of demand sites is applied in the first stage to design the vehicle routes. A hierarchical routing approach and a sweep approach are also proposed in this stage. Given the vehicle routing plan, the relief allocation could be easily solved in the second stage. Numerical experiment with a comparison of multi-vehicle Traveling Salesman Problem (TSP) has demonstrated the need of ISRP and the capability of the proposed solution approaches.

Reserving Charging Decision-Making Model and Route Plan for Electric Vehicles Considering Information of Traffic and Charging Station

Directory of Open Access Journals (Sweden)

Haoming Liu

2018-04-01

Full Text Available With the advance of battery energy technology, electric vehicles (EV are catching more and more attention. One of the influencing factors of electric vehicles large-scale application is the availability of charging stations and convenience of charging. It is important to investigate how to make reserving charging strategies and ensure electric vehicles are charged with shorter time and lower charging expense whenever charging request is proposed. This paper proposes a reserving charging decision-making model for electric vehicles that move to certain destinations and need charging services in consideration of traffic conditions and available charging resources at the charging stations. Besides, the interactive mechanism is described to show how the reserving charging system works, as well as the rolling records-based credit mechanism where extra charges from EV is considered to hedge default behavior. With the objectives of minimizing driving time and minimizing charging expenses, an optimization model with two objective functions is formulated. Then the optimizations are solved by a K shortest paths algorithm based on a weighted directed graph, where the time and distance factors are respectively treated as weights of corresponding edges of transportation networks. Case studies show the effectiveness and validity of the proposed route plan and reserving charging decision-making model.

Multihopping Multilevel Clustering Heterogeneity-Sensitive Optimized Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Muhammad Aslam

2017-01-01

Full Text Available Effective utilization of energy resources in Wireless Sensor Networks (WSNs has become challenging under uncertain distributed cluster-formation and single-hop intercluster communication capabilities. So, sensor nodes are forced to operate at expensive full rate transmission power level continuously during whole network operation. These challenging network environments experience unwanted phenomena of drastic energy consumption and packet drop. In this paper, we propose an adaptive immune Multihopping Multilevel Clustering (MHMLC protocol that executes a Hybrid Clustering Algorithm (HCA to perform optimal centralized selection of Cluster-Heads (CHs within radius of centrally located Base Station (BS and distributed CHs selection in the rest of network area. HCA of MHMLC also produces optimal intermediate CHs for intercluster multihop communications that develop heterogeneity-aware economical links. This hybrid cluster-formation facilitates the sensors to function at short range transmission power level that enhances link quality and avoids packet drop. The simulation environments produce fair comparison among proposed MHMLC and existing state-of-the-art routing protocols. Experimental results give significant evidence of better performance of the proposed model in terms of network lifetime, stability period, and data delivery ratio.

36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.

Science.gov (United States)

2010-07-01

... roads and designated routes. 1004.10 Section 1004.10 Parks, Forests, and Public Property PRESIDIO TRUST VEHICLES AND TRAFFIC SAFETY § 1004.10 Travel on Presidio Trust roads and designated routes. (a) Operating a motor vehicle is prohibited except on Presidio Trust roads and in parking areas. (b) The following are...

Modelo matemático Two-echelon Capacitated Vehicle Routing Problem para a logística de distribuição de encomendas

Directory of Open Access Journals (Sweden)

Karina Pedrini Fraga

2016-12-01

Full Text Available Many cities are facing difficulties in urban mobility and therefore are imposing restrictions on the movement of larger trucks. Thus, logistics companies developed a two level logistics strategy based on Urban Distribution Centers (CDU that receives larger trucks and split the cargo to put in small trucks to distribute to customers. To support this type of logistics planning, this paper presents an adaptation of a mathematical model based on the Two-echelon capacitated Vehicle Routing Problem (2E-CVRP to plan the routes from the central depot to the satelites and from these to the clients. The model was applied to the logistics of Correios in the metropolitan area of the Espírito Santo, Brazil, and instances with up to 4 CDU and 25 clients were tested using CPLEX solver 12.6 obtaining routes for deliveries at both levels.

Research on vehicle routing optimization for the terminal distribution of B2C E-commerce firms

Science.gov (United States)

Zhang, Shiyun; Lu, Yapei; Li, Shasha

2018-05-01

In this paper, we established a half open multi-objective optimization model for the vehicle routing problem of B2C (business-to-customer) E-Commerce firms. To minimize the current transport distance as well as the disparity between the excepted shipments and the transport capacity in the next distribution, we applied the concept of dominated solution and Pareto solutions to the standard particle swarm optimization and proposed a MOPSO (multi-objective particle swarm optimization) algorithm to support the model. Besides, we also obtained the optimization solution of MOPSO algorithm based on data randomly generated through the system, which verified the validity of the model.

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

Impacts of Bus-stops on the Speed of Motorized Vehicles under Heterogeneous Traffic Conditions: A Case-Study of Delhi, India

Directory of Open Access Journals (Sweden)

Prateek Bansal

2014-06-01

Full Text Available The presence of friction generators1 such as bus-stops, intersections, petrol pumps and pedestrian crossings, etc. significantly influences the speed of traffic stream. Among all the friction generators, understanding the impact of bus-stops is particularly important from planning and modeling perspective in the Indian context. Therefore, this study presents a methodology to quantify the impact of bus-stops on the speed of other motorized vehicles (the total motorized vehicle fleet minus the buses under heterogeneous traffic conditions. The methodology was validated on the typical urban arterials in Delhi, India. Two types of data, location of bus-stops and speed profiles of motorized vehicles, were collected by GPS and V-box respectively. These two data sets were mapped and merged using ArcGIS. To understand the nature of traffic stream near bus-stops, ‘influence regions’ of bus-stops were extracted. Later, characteristic parameters such as lengths of the influence regions and average speeds in the influence regions were computed. Finally, 95% confidence intervals of these characteristic parameters were obtained and regression analysis was performed to quantify the impact of bus-stops on the speed of motorized vehicles. The results of study suggest that the influence region of bus-stops on the corridors investigated varies from 140–170 meters and average speed of motorized vehicles in the influence region is reduced by 26–38% of the free flow speed. These findings can better inform planners about the speeds used in traffic flow and travel demand modeling under heterogeneous conditions by helping them in accounting for the speed-reducing impacts of bus-stops. Moreover, transit planners may also consider the magnitudes and characteristics of the influence regions of bus-stops while determining their locations along the corridor to minimize their adverse impacts on the speed of other motorized vehicles.

Tourism Routes, Local Economic Promotion and Pro-Poor ...

African Journals Online (AJOL)

In southern Africa, there is growing interest in the potential for establishing tourism routes as vehicles for tourism expansion and the promotion of local economic development. This article contributes towards understanding the potential and importance of organising routes for local tourism promotion and economic ...

Adaptive powertrain control for plugin hybrid electric vehicles

Science.gov (United States)

Kedar-Dongarkar, Gurunath; Weslati, Feisel

2013-10-15

A powertrain control system for a plugin hybrid electric vehicle. The system comprises an adaptive charge sustaining controller; at least one internal data source connected to the adaptive charge sustaining controller; and a memory connected to the adaptive charge sustaining controller for storing data generated by the at least one internal data source. The adaptive charge sustaining controller is operable to select an operating mode of the vehicle's powertrain along a given route based on programming generated from data stored in the memory associated with that route. Further described is a method of adaptively controlling operation of a plugin hybrid electric vehicle powertrain comprising identifying a route being traveled, activating stored adaptive charge sustaining mode programming for the identified route and controlling operation of the powertrain along the identified route by selecting from a plurality of operational modes based on the stored adaptive charge sustaining mode programming.

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

Roteamento de veículos com base em sistemas de informação geográfica Vehicle routing based on geographical information systems

Directory of Open Access Journals (Sweden)

Roberto Diéguez Galvão

1997-08-01

Full Text Available Um algoritmo para roteamento de veículos é integrado a um Sistema de Informação Geográfica, de cuja base de dados obtém as informações necessárias para o roteamento e no qual mostra as rotas resultantes. O algoritmo de roteamento utilizado tem como base a metaheurística de simulated annealing, que apresenta neste caso resultados computacionais de boa qualidade. Descrevemos a interface do algoritmo com um SIG específico e a aplicação do sistema resultante a um programa de entregas simulado, no bairro de Copacabana, no Rio de Janeiro.An algorithm for vehicle routing is embedded into a Geographical Information System (GIS, from the database of which it extracts the information needed for the routing and where it displays the resulting routes. The routing algorithm is a simulated annealing metaheuristic that produces good quality routes in reduced computational times. We describe the embedding of the algorithm into a specific GIS software and the application of the routing system to a simulated delivery schedule in the neighbourhood of Copacabana, in Rio de Janeiro.

On line routing per mobile phone

DEFF Research Database (Denmark)

Bieding, Thomas; Görtz, Simon; Klose, Andreas

2009-01-01

On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology....... Additionally it is of utmost importance that the employed communication system is suitable integrated with the firm’s enterprise application system and business processes. On basis of a case study, we describe in this paper a system that is cheap and easy to implement due to the use of simple mobile phones...

The Effect of Route, Vehicle, and Divided Doses on the Pharmacokinetics of Chlorpyrifos and its Metabolite Trichloropyridinol in Neonatal Sprague-Dawley Rats

Energy Technology Data Exchange (ETDEWEB)

Marty, M. S.; Domoradzki, J. Y.; Hansen, S. C.; Timchalk, Chuck; Bartels, M. J.; Mattsson, Joel L.

2007-12-01

There is a paucity of data on neonatal systemic exposure using different dosing paradigms. Male CD (Sprague-Dawley derived) rats at postnatal day (PND) 5 were dosed with chlorpyrifos (CPF, 1 mg/kg) using different routes of exposure, vehicles, and single vs. divided doses. Blood concentrations of CPF and its primary metabolite, trichloropyridinol (TCP), were measured at multiple times through 24 h. Groups included: single gavage bolus vs. divided gavage doses in corn oil (1 vs 3 times in 24 h), single gavage bolus vs. divided gavage doses in rat milk, and subcutaneous administration in DMSO. These data were compared with lactational exposure of PND 5 pups from dams exposed to CPF in the diet at 5 mg/kg/day for four weeks or published data from dams exposed to daily gavage with CPF at 5 mg/kg/day. Maternal blood CPF levels were an order of magnitude lower from dietary exposure than gavage (1.1 vs 14.8 ng/g), and blood CPF levels in PND 5 pups that nursed dietary-exposed or gavage-exposed dams were below the limit of detection. Single gavage doses of 1 mg/kg CPF in corn oil vehicle in pups resulted in CPF blood levels of 49 ng/g, and in milk vehicle about 9 ng/g. Divided doses led to lower peak CPF levels. A bolus dose of 1 mg/kg CPF in DMSO administered sc appeared to have substantially altered pharmacokinetics from orally administered chlorpyrifos. To be meaningful for risk assessment, neonatal studies require attention to the exposure scenario, since route, vehicle, dose and frequency of administration result in different systemic exposure to the test chemical and its metabolites.

Multiobjective Quantum Evolutionary Algorithm for the Vehicle Routing Problem with Customer Satisfaction

Directory of Open Access Journals (Sweden)

Jingling Zhang

2012-01-01

Full Text Available The multiobjective vehicle routing problem considering customer satisfaction (MVRPCS involves the distribution of orders from several depots to a set of customers over a time window. This paper presents a self-adaptive grid multi-objective quantum evolutionary algorithm (MOQEA for the MVRPCS, which takes into account customer satisfaction as well as travel costs. The degree of customer satisfaction is represented by proposing an improved fuzzy due-time window, and the optimization problem is modeled as a mixed integer linear program. In the MOQEA, nondominated solution set is constructed by the Challenge Cup rules. Moreover, an adaptive grid is designed to achieve the diversity of solution sets; that is, the number of grids in each generation is not fixed but is automatically adjusted based on the distribution of the current generation of nondominated solution set. In the study, the MOQEA is evaluated by applying it to classical benchmark problems. Results of numerical simulation and comparison show that the established model is valid and the MOQEA is effective for MVRPCS.

Evaluation of cyclic battery ageing for railway vehicle application

OpenAIRE

Sigle, Sebastian; Kaimer, Stefan; Dittus, Holger; Barai, Anup; McGordon, Andrew; Widanage, W. Dhammika

2017-01-01

Mobile transportation systems rely heavily on hydrocarbon based internal combustions engines (ICE) as the prime mover of vehicles. For rail applications electrification of the route provides an opportunity to improve efficiency and eliminate local emissions at point of use. However, route electrification is not always cost effective for secondary routes which see lower passenger volumes and less frequent trains; there is therefore an increasing interest in railway vehicles being equipped with...

JOINT OPTIMIZATION OF PRODUCTION PLANNING AND VEHICLE ROUTING PROBLEMS: A REVIEW OF EXISTING STRATEGIES

Directory of Open Access Journals (Sweden)

Marc Reimann

2014-05-01

Full Text Available Keen competition and increasingly demanding customers have forced companies to use their resources more efficiently and to integrate production and transportation planning. In the last few years more and more researchers have also focused on this challenging problem by trying to determine the complexity of the individual problems and then developing fast and robust algorithms to solve them. This paper reviews existing literature on integrated production and distribution decisions at the tactical and operational level, where the distribution part is modelled as some variation of the well-known Vehicle Routing Problem (VRP. The focus is thereby on problems that explicitly consider deliveries to multiple clients in a less-than-truckload fashion. In terms of the production decisions we distinguish in our review between tactical and operational production problems by considering lot-sizing/capacity allocation and scheduling models, respectively.

Development of a hybrid genetic algorithm based decision support system for vehicle routing and scheduling in supply chain logistics managment

OpenAIRE

Khanian, Seyed Mohammad Shafi

2007-01-01

Vehicle Routing and Scheduling (VRS) constitute an important part of logistics management. Given the fact that the worldwide cost on physical distribution is evermore increasing, the global competition and the complex nature of logistics problems, one area, which determines the efficiency of all others, is the VRS activities. The application of Decision Support Systems (DSS) to assist logistics management with an efficient VRS could be of great benefit. Although the benefits of DSS in VRS are...

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Holden, Jacob [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gonder, Jeffrey D [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Wood, Eric W [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2017-07-31

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigation systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.

Introducing radiality constraints in capacitated location-routing problems

Directory of Open Access Journals (Sweden)

Eliana Mirledy Toro Ocampo

2017-03-01

Full Text Available In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP and for the Capacitated Location Routing Problem (CLRP, adopting radiality constraints in order to guarantee valid routes and eliminate subtours. This idea is inspired by formulations already employed in electric power distribution networks, which requires a radial topology in its operation. The results show that the proposed formulation greatly improves the convergence of the solver.

An Adaptive Tabu Search Heuristic for the Location Routing Pickup and Delivery Problem with Time Windows with a Theater Distribution Application

National Research Council Canada - National Science Library

Burks, Jr, Robert E

2006-01-01

.... The location routing problem (LRP) is an extension of the vehicle routing problem where the solution identifies the optimal location of the depots and provides the vehicle schedules and distribution routes...

A Solution Approach from an Analytic Model to Heuristic Algorithm for Special Case of Vehicle Routing Problem with Stochastic Demands

Directory of Open Access Journals (Sweden)

2009-03-01

Full Text Available We define a special case for the vehicle routing problem with stochastic demands (SC-VRPSD where customer demands are normally distributed. We propose a new linear model for computing the expected length of a tour in SC-VRPSD. The proposed model is based on the integration of the “Traveling Salesman Problem” (TSP and the Assignment Problem. For large-scale problems, we also use an Iterated Local Search (ILS algorithm in order to reach an effective solution.

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data: Preprint

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei; Holden, Jacob; Gonder, Jeff; Wood, Eric

2017-07-13

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigation systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.

Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J.; Wood, E.; Rajagopalan, S.

2014-09-01

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3% respectively. These represent substantial opportunities considering that they only require software adjustments to implement.

An inventory location routing model with environmental considerations

Directory of Open Access Journals (Sweden)

Lerhlaly Sanaa

2017-01-01

Full Text Available In this work we consider an integrated Inventory Location Routing problem ILRP. The objective is to select depots to open, the routes to perform distribution from the capacitated depots to the clients by a homogeneous fleet of vehicles and over a multi-period planning horizon. To solve the problem, an exact model is designed in order to minimize the total cost (location, routing and inventory and the routing CO2 emissions, while respecting transport and storage constraints for a hazardous material. We have also studied an industrial real case to illustrate the problem.

Location-routing Problem with Fuzzy time windows and Traffic time

Directory of Open Access Journals (Sweden)

Shima Teimoori

2014-05-01

Full Text Available The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.

Performance Evaluation of AODV Routing Protocol in VANET with NS2

Directory of Open Access Journals (Sweden)

Divya Rathi

2017-03-01

Full Text Available In intelligent transportation systems, the collaboration between vehicles and the road side units is essential to bring these systems to realization. The emerging Vehicular Ad Hoc Network (VANET is becoming more and more important as it provides intelligent transportation application, comfort, safety, entertainment for people in vehicles. In order to provide stable routes and to get good performance in VANET, there is a need of proper routing protocols must be designed. In this paper, we are working with the very well-known ad-hoc on-demand distance vector (AODV routing protocol. The existing Routing protocol AODV-L which is based on the Link expiration time is extended to propose a more reliable AODV-AD which is based on multichannel MAC protocol. For the performance evaluation of routing protocols, a simulation tool ‘NS2’ has been used. Simulation results show that the proposed AODV-AD protocol can achieves better performances in forms of high Route stability, Packet Delivery ratio and packet loss rate than traditional AODV-L and traditional AODV.

Distribution Route Planning of Clean Coal Based on Nearest Insertion Method

Science.gov (United States)

Wang, Yunrui

2018-01-01

Clean coal technology has made some achievements for several ten years, but the research in its distribution field is very small, the distribution efficiency would directly affect the comprehensive development of clean coal technology, it is the key to improve the efficiency of distribution by planning distribution route rationally. The object of this paper was a clean coal distribution system which be built in a county. Through the surveying of the customer demand and distribution route, distribution vehicle in previous years, it was found that the vehicle deployment was only distributed by experiences, and the number of vehicles which used each day changed, this resulted a waste of transport process and an increase in energy consumption. Thus, the mathematical model was established here in order to aim at shortest path as objective function, and the distribution route was re-planned by using nearest-insertion method which been improved. The results showed that the transportation distance saved 37 km and the number of vehicles used had also been decreased from the past average of 5 to fixed 4 every day, as well the real loading of vehicles increased by 16.25% while the current distribution volume staying same. It realized the efficient distribution of clean coal, achieved the purpose of saving energy and reducing consumption.

Multiple vehicle routing and dispatching to an emergency scene

OpenAIRE

M S Daskin; A Haghani

1984-01-01

A model of the distribution of arrival time at the scene of an emergency for the first of many vehicles is developed for the case in which travel times on the links of the network are normally distributed and the path travel times of different vehicles are correlated. The model suggests that the probability that the first vehicle arrives at the scene within a given time may be increased by reducing the path time correlations, even if doing so necessitates increasing the mean path travel time ...

A Problem-Reduction Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Wanfeng Liu

2015-01-01

Full Text Available Assessment of the components of a solution helps provide useful information for an optimization problem. This paper presents a new population-based problem-reduction evolutionary algorithm (PREA based on the solution components assessment. An individual solution is regarded as being constructed by basic elements, and the concept of acceptability is introduced to evaluate them. The PREA consists of a searching phase and an evaluation phase. The acceptability of basic elements is calculated in the evaluation phase and passed to the searching phase. In the searching phase, for each individual solution, the original optimization problem is reduced to a new smaller-size problem. With the evolution of the algorithm, the number of common basic elements in the population increases until all individual solutions are exactly the same which is supposed to be the near-optimal solution of the optimization problem. The new algorithm is applied to a large variety of capacitated vehicle routing problems (CVRP with customers up to nearly 500. Experimental results show that the proposed algorithm has the advantages of fast convergence and robustness in solution quality over the comparative algorithms.

Route Assessment for Unmanned Aerial Vehicle Based on Cloud Model

Directory of Open Access Journals (Sweden)

Xixia Sun

2014-01-01

Full Text Available An integrated route assessment approach based on cloud model is proposed in this paper, where various sources of uncertainties are well kept and modeled by cloud theory. Firstly, a systemic criteria framework incorporating models for scoring subcriteria is developed. Then, the cloud model is introduced to represent linguistic variables, and survivability probability histogram of each route is converted into normal clouds by cloud transformation, enabling both randomness and fuzziness in the assessment environment to be managed simultaneously. Finally, a new way to measure the similarity between two normal clouds satisfying reflexivity, symmetry, transitivity, and overlapping is proposed. Experimental results demonstrate that the proposed route assessment approach outperforms fuzzy logic based assessment approach with regard to feasibility, reliability, and consistency with human thinking.

A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem

DEFF Research Database (Denmark)

Bach, Lukas; Wøhlk, Sanne; Lysgaard, Jens

2016-01-01

In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch-and-Cut-and-Price algorithm...

Bilayer Local Search Enhanced Particle Swarm Optimization for the Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

A. K. M. Foysal Ahmed

2018-03-01

Full Text Available The classical capacitated vehicle routing problem (CVRP is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been established yet to obtain best known solutions for all the different problem sets. We propose an efficient algorithm Bilayer Local Search-based Particle Swarm Optimization (BLS-PSO along with a novel decoding method to solve CVRP. Decoding method is important to relate the encoded particle position to a feasible CVRP solution. In bilayer local search, one layer of local search is for the whole population in any iteration whereas another one is applied only on the pool of the best particles generated in different generations. Such searching strategies help the BLS-PSO to perform better than the existing proposals by obtaining best known solutions for most of the existing benchmark problems within very reasonable computational time. Computational results also show that the performance achieved by the proposed algorithm outperforms other PSO-based approaches.

Exact methods for time constrained routing and related scheduling problems

DEFF Research Database (Denmark)

Kohl, Niklas

1995-01-01

of customers. In the VRPTW customers must be serviced within a given time period - a so called time window. The objective can be to minimize operating costs (e.g. distance travelled), fixed costs (e.g. the number of vehicles needed) or a combination of these component costs. During the last decade optimization......This dissertation presents a number of optimization methods for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP), where a fleet of vehicles based at a central depot must service a set...... of J?rnsten, Madsen and S?rensen (1986), which has been tested computationally by Halse (1992). Both methods decompose the problem into a series of time and capacity constrained shotest path problems. This yields a tight lower bound on the optimal objective, and the dual gap can often be closed...

Heterogeneous traffic flow modelling using second-order macroscopic continuum model

Science.gov (United States)

Mohan, Ranju; Ramadurai, Gitakrishnan

2017-01-01

Modelling heterogeneous traffic flow lacking in lane discipline is one of the emerging research areas in the past few years. The two main challenges in modelling are: capturing the effect of varying size of vehicles, and the lack in lane discipline, both of which together lead to the 'gap filling' behaviour of vehicles. The same section length of the road can be occupied by different types of vehicles at the same time, and the conventional measure of traffic concentration, density (vehicles per lane per unit length), is not a good measure for heterogeneous traffic modelling. First aim of this paper is to have a parsimonious model of heterogeneous traffic that can capture the unique phenomena of gap filling. Second aim is to emphasize the suitability of higher-order models for modelling heterogeneous traffic. Third, the paper aims to suggest area occupancy as concentration measure of heterogeneous traffic lacking in lane discipline. The above mentioned two main challenges of heterogeneous traffic flow are addressed by extending an existing second-order continuum model of traffic flow, using area occupancy for traffic concentration instead of density. The extended model is calibrated and validated with field data from an arterial road in Chennai city, and the results are compared with those from few existing generalized multi-class models.

Vehicle routing with cross-docking

DEFF Research Database (Denmark)

Wen, Min; Larsen, Jesper; Clausen, Jens

2009-01-01

a set of homogeneous vehicles are used to transport orders from the suppliers to the corresponding customers via a cross-dock. The orders can be consolidated at the cross-dock but cannot be stored for very long because the cross-dock does not have long-term inventory-holding capabilities. The objective...... of the VRPCD is to minimize the total travel time while respecting time window constraints at the nodes and a time horizon for the whole transportation operation. In this paper, a mixed integer programming formulation for the VRPCD is proposed. A tabu search heuristic is embedded within an adaptive memory...... values) within very short computational time....

Comparative assessment of spent nuclear fuel transportation routes using risk factors and a geographic information system

International Nuclear Information System (INIS)

Toth, D.M.

1996-01-01

The assessment of potential alternative routes was simplified through the use of six comparative risk factors evaluated using detailed, route-specific data. The route and environmental attributes varied strongly with location and were developed from national, state, and local sources. The six comparative factors were risk measures of incident-free transportation radiation exposure, radiological accident population exposure, nonradiological accidents, contamination of environmental sensitive areas, environmental justice for minority populations, and environmental justice for low-income populations. An assessment of four real North-Central Florida routes provided a sample implementation of the analysis tools and risk factors. The assessment routes, consisting of common beginning and end locations, included an interstate highway, a rural highway, a mostly urban highway, and a combination interstate highway with rural bypass. This route comparative assessment study predicted that the interstate highway, despite a higher population density, greater traffic volume, and greater number of vehicular fatality accidents, would present the lowest cumulative risk. On the contrary, the rural highway route, characterized as having the lowest population density, minimal vehicle traffic volume, and the lowest percentages of minority and low-income populations, displayed the highest cumulative risk measure. Factors contributing to the high risk for the rural highway route included greater route length, higher vehicular fatality accident rates per vehicle mile traveled, and the close proximity to environmentally sensitive areas. This route comparative assessment study predicted that the interstate highway, despite a higher population density, greater traffic volume, and greater number of vehicular fatality accidents, would present the lowest cumulative risk. On the contrary, the rural highway route, characterized as having the lowest population density, minimal vehicle traffic volume

Value-added Chemicals from Biomass by Heterogeneous Catalysis

DEFF Research Database (Denmark)

Voss, Bodil

feedstock, having retained one C-C bond originating from the biomass precursor, the aspects of utilising heterogeneous catalysis for its conversion to value added chemicals is investigated. Through a simple analysis of known, but not industrialised catalytic routes, the direct conversion of ethanol....... The results of the thesis, taking one example of biomass conversion, show that the utilisation of biomass in the production of chemicals by heterogeneous catalysis is promising from a technical point of view. But risks of market price excursions dominated by fossil based chemicals further set a criterion...... been implemented. The subject on chemical production has received less attention. This thesis describes and evaluates the quest for an alternative conversion route, based on a biomass feedstock and employing a heterogeneous catalyst capable of converting the feedstock, to a value-added chemical...

Characterizing Traffic Conditions from the Perspective of Spatial-Temporal Heterogeneity

Directory of Open Access Journals (Sweden)

Peichao Gao

2016-03-01

Full Text Available Traffic conditions are usually characterized from the perspective of travel time or the average vehicle speed in the field of transportation, reflecting the congestion degree of a road network. This article provides a method from a new perspective to characterize traffic conditions; the perspective is based on the heterogeneity of vehicle speeds. A novel measurement, the ratio of areas (RA in a rank-size plot, is included in the proposed method to capture the heterogeneity. The proposed method can be performed from the perspective of both spatial heterogeneity and temporal heterogeneity, being able to characterize traffic conditions of not only a road network but also a single road. Compared with methods from the perspective of travel time, the proposed method can characterize traffic conditions at a higher frequency. Compared to methods from the perspective of the average vehicle speed, the proposed method takes account of the heterogeneity of vehicle speeds. The effectiveness of the proposed method has been demonstrated with real-life traffic data of Shenzhen (a coastal urban city in China, and the advantage of the proposed RA has been verified by comparisons to similar measurements such as the ht-index and the CRG index.

Real-time immune-inspired optimum state-of-charge trajectory estimation using upcoming route information preview and neural networks for plug-in hybrid electric vehicles fuel economy

Science.gov (United States)

Mozaffari, Ahmad; Vajedi, Mahyar; Azad, Nasser L.

2015-06-01

The main proposition of the current investigation is to develop a computational intelligence-based framework which can be used for the real-time estimation of optimum battery state-of-charge (SOC) trajectory in plug-in hybrid electric vehicles (PHEVs). The estimated SOC trajectory can be then employed for an intelligent power management to significantly improve the fuel economy of the vehicle. The devised intelligent SOC trajectory builder takes advantage of the upcoming route information preview to achieve the lowest possible total cost of electricity and fossil fuel. To reduce the complexity of real-time optimization, the authors propose an immune system-based clustering approach which allows categorizing the route information into a predefined number of segments. The intelligent real-time optimizer is also inspired on the basis of interactions in biological immune systems, and is called artificial immune algorithm (AIA). The objective function of the optimizer is derived from a computationally efficient artificial neural network (ANN) which is trained by a database obtained from a high-fidelity model of the vehicle built in the Autonomie software. The simulation results demonstrate that the integration of immune inspired clustering tool, AIA and ANN, will result in a powerful framework which can generate a near global optimum SOC trajectory for the baseline vehicle, that is, the Toyota Prius PHEV. The outcomes of the current investigation prove that by taking advantage of intelligent approaches, it is possible to design a computationally efficient and powerful SOC trajectory builder for the intelligent power management of PHEVs.

Advanced Vehicle Testing and Evaluation

Energy Technology Data Exchange (ETDEWEB)

Garetson, Thomas [The Clarity Group, Incorporated, Chicago, IL (United States)

2013-03-31

The objective of the United States (U.S.) Department of Energy's (DOEs) Advanced Vehicle Testing and Evaluation (AVTE) project was to provide test and evaluation services for advanced technology vehicles, to establish a performance baseline, to determine vehicle reliability, and to evaluate vehicle operating costs in fleet operations.Vehicles tested include light and medium-duty vehicles in conventional, hybrid, and all-electric configurations using conventional and alternative fuels, including hydrogen in internal combustion engines. Vehicles were tested on closed tracks and chassis dynamometers, as well as operated on public roads, in fleet operations, and over prescribed routes. All testing was controlled by procedures developed specifically to support such testing.

Efficient routing of service vehicles. Publication No. 95-82, and Publication No. 1010

Energy Technology Data Exchange (ETDEWEB)

Gendreau, M.; Laporte, G.; Yelle, S.Y.

1995-12-31

GeoRoute is an arc routing software package that includes a route optimization module based on the GENIUS traveling salesman problem heuristic. The territory under study is represented by a directed graph in which arcs correspond to streets. The system also introduces artificial arcs to account for street crossings, street changes, and turns. In many applications of the package, penalties should be assigned to take into account such constraints as prohibited turns and minimization of deadheading. This report describes experiments performed using GeoRoute to determine optimal routes for garbage collection and for snow plowing operations on 30 street networks. The experiments tested various values of penalties in order to arrive at convenient packages of penalties for use in various situations. The results help GeoRoute users select sets of penalties without having to ponder a large set of possible parameters.

A Review Of Design And Control Of Automated Guided Vehicle Systems

NARCIS (Netherlands)

T. Le-Anh (Tuan); M.B.M. de Koster (René)

2004-01-01

textabstractThis paper presents a review on design and control of automated guided vehicle systems. We address most key related issues including guide-path design, estimating the number of vehicles, vehicle scheduling, idle-vehicle positioning, battery management, vehicle routing, and conflict

Modeling a four-layer location-routing problem

Directory of Open Access Journals (Sweden)

Mohsen Hamidi

2012-01-01

Full Text Available Distribution is an indispensable component of logistics and supply chain management. Location-Routing Problem (LRP is an NP-hard problem that simultaneously takes into consideration location, allocation, and vehicle routing decisions to design an optimal distribution network. Multi-layer and multi-product LRP is even more complex as it deals with the decisions at multiple layers of a distribution network where multiple products are transported within and between layers of the network. This paper focuses on modeling a complicated four-layer and multi-product LRP which has not been tackled yet. The distribution network consists of plants, central depots, regional depots, and customers. In this study, the structure, assumptions, and limitations of the distribution network are defined and the mathematical optimization programming model that can be used to obtain the optimal solution is developed. Presented by a mixed-integer programming model, the LRP considers the location problem at two layers, the allocation problem at three layers, the vehicle routing problem at three layers, and a transshipment problem. The mathematical model locates central and regional depots, allocates customers to plants, central depots, and regional depots, constructs tours from each plant or open depot to customers, and constructs transshipment paths from plants to depots and from depots to other depots. Considering realistic assumptions and limitations such as producing multiple products, limited production capacity, limited depot and vehicle capacity, and limited traveling distances enables the user to capture the real world situations.

Predictive cruise control in hybrid electric vehicles

NARCIS (Netherlands)

Keulen, T. van; Naus, M.J.G.; Jager, B. de; Molengraft, G.J.L. van de; Steinbuch, M.; Aneke, N.P.I.

2009-01-01

Deceleration rates have considerable influence on the fuel economy of hybrid electric vehicles. Given the vehicle characteristics and actual/measured operating conditions, as well as upcoming route information, optimal velocity trajectories can be constructed that maximize energy recovery. To

Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: a case study in Indonesia

Directory of Open Access Journals (Sweden)

Budi Santosa

2016-01-01

Full Text Available This paper presents a model and an algorithm for an inventory ship routing problem (ISRP. It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT, product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA, was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.

A Dynamic Travel Time Estimation Model Based on Connected Vehicles

Directory of Open Access Journals (Sweden)

Daxin Tian

2015-01-01

Full Text Available With advances in connected vehicle technology, dynamic vehicle route guidance models gradually become indispensable equipment for drivers. Traditional route guidance models are designed to direct a vehicle along the shortest path from the origin to the destination without considering the dynamic traffic information. In this paper a dynamic travel time estimation model is presented which can collect and distribute traffic data based on the connected vehicles. To estimate the real-time travel time more accurately, a road link dynamic dividing algorithm is proposed. The efficiency of the model is confirmed by simulations, and the experiment results prove the effectiveness of the travel time estimation method.

Transport spatial model for the definition of green routes for city logistics centers

Energy Technology Data Exchange (ETDEWEB)

Pamučar, Dragan, E-mail: dpamucar@gmail.com [University of Defence in Belgrade, Department of Logistics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia); Gigović, Ljubomir, E-mail: gigoviclj@gmail.com [University of Defence in Belgrade, Department of Mathematics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia); Ćirović, Goran, E-mail: cirovic@sezampro.rs [College of Civil Engineering and Geodesy, The Belgrade University, Hajduk Stankova 2, 11000 Belgrade (Serbia); Regodić, Miodrag, E-mail: mregodic62@gmail.com [University of Defence in Belgrade, Department of Mathematics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia)

2016-01-15

This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas. The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.

Transport spatial model for the definition of green routes for city logistics centers

International Nuclear Information System (INIS)

Pamučar, Dragan; Gigović, Ljubomir; Ćirović, Goran; Regodić, Miodrag

2016-01-01

This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas. The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.

Collaborative Unmanned Vehicles for Maritime Domain Awareness

National Research Council Canada - National Science Library

Healey, A. J; Horner, D. P; Kragelund, S. P

2005-01-01

Unmanned vehicles are becoming a critical component of military operations. As the vehicles develop in capability, there will be a trend for heterogeneous classes of unmanned vehicles to be able to work in a more collaborative fashion...

Predictive routing for autonomous mobility-on-demand systems with ride-sharing

NARCIS (Netherlands)

Alonso Mora, J.; Wallar, Alex; Rus, Daniela; Bicchi, A.; Maciejewski, T.

2017-01-01

Ride-sharing, or carpooling, systems with autonomous vehicles will provide efficient and reliable urban mobility on demand. In this work we present a method for dynamic vehicle routing that leverages historical data to improve the performance of a network of self-driving taxis. In particular, we

An Ultra-Low-Latency Geo-Routing Scheme for Team-Based Unmanned Vehicular Applications

KAUST Repository

Bader, Ahmed; Alouini, Mohamed-Slim

2016-01-01

Results and lessons learned from the implementation of a novel ultra low-latency geo-routing scheme are presented in this paper. The geo-routing scheme is intended for team-based mobile systems whereby a cluster of unmanned autonomous vehicles

A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

Directory of Open Access Journals (Sweden)

Jisheng Zhang

2015-06-01

Full Text Available It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks.

Multiple Attribute Decision Making Based Relay Vehicle Selection for Electric Vehicle Communication

Directory of Open Access Journals (Sweden)

Zhao Qiang

2015-01-01

Full Text Available Large-scale electric vehicle integration into power grid and charging randomly will cause serious impacts on the normal operation of power grid. Therefore, it is necessary to control the charging behavior of electric vehicle, while information transmission for electric vehicle is significant. Due to the highly mobile characteristics of vehicle, transferring information to power grid directly might be inaccessible. Relay vehicle (RV can be used for supporting multi-hop connection between SV and power grid. This paper proposes a multiple attribute decision making (MADM-based RV selection algorithm, which considers multiple attribute, including data transfer rate, delay, route duration. It takes the characteristics of electric vehicle communication into account, which can provide protection for the communication services of electric vehicle charging and discharging. Numerical results demonstrate that compared to previous algorithm, the proposed algorithm offer better performance in terms of throughput, transmission delay.

Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

OpenAIRE

Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

2017-01-01

In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

Research and application of genetic algorithm in path planning of logistics distribution vehicle

Science.gov (United States)

Wang, Yong; Zhou, Heng; Wang, Ying

2017-08-01

The core of the logistics distribution system is the vehicle routing planning, research path planning problem, provide a better solution has become an important issue. In order to provide the decision support for logistics and distribution operations, this paper studies the problem of vehicle routing with capacity constraints (CVRP). By establishing a mathematical model, the genetic algorithm is used to plan the path of the logistics vehicle to meet the minimum logistics and transportation costs.

Evaluation of connected vehicle impact on mobility and mode choice

Directory of Open Access Journals (Sweden)

Simon Minelli

2015-10-01

Full Text Available Connected vehicle is emerging as a solution to exacerbating congestion problems in urban areas. It is important to understand the impacts of connected vehicle on network and travel behavior of road users. The main objective of this paper is to evaluate the impact of connected vehicle on the mode choice and mobility of transportation networks. An iterative methodology was used in this paper where demands for various modes were modified based on the changes in travel time between each origin-destination (OD pair caused by introduction of connected vehicle. Then a traffic assignment was performed in a micro-simulation model, which was able to accurately simulate vehicle-to-vehicle communication. It is assumed that vehicles are equipped with a dynamic route guidance technology to choose their own route using real-time traffic information obtained through communication. The travel times obtained from the micro-simulation model were compared with a base scenario with no connected vehicle. The methodology was tested for a portion of Downtown Toronto, Ontario, Canada. In order to quantify changes in mode share with changes in travel time associated with each OD pair, mode choice models were developed for auto, transit, cycling and pedestrians using data mainly from the Transportation Tomorrow Survey. The impact of connected vehicle on mode choice was evaluated for different market penetrations of connected vehicle. The results of this study show that average travel times for the whole auto mode will generally increase, with the largest increase from connected vehicles. This causes an overall move away from the auto mode for high market penetrations if a dynamic route guidance algorithm is implemented.

Carbon monoxide levels in popular passenger commuting modes traversing major commuting routes in Hong Kong

International Nuclear Information System (INIS)

Chan, L.Y.; Liu, Y.M.

2001-01-01

Vehicle exhaust is a major source of air pollution in metropolitan cities. Commuters are exposed to high traffic-related pollutant concentrations. Public transportation is the most popular commuting mode in Hong Kong and there are about 10.8 million passenger trips every day. Two-thirds of them are road commuters. An extensive survey was conducted to measure carbon monoxide in three popular passenger commuting modes, bus, minibus, and taxi, which served, respectively, 3.91 million, 1.76 million and 1.31 million passenger trips per day in 1998. Three types of commuting microenvironments were selected: urban-urban, urban-suburban and urban-rural. Results indicated that in-vehicle CO level increased in the following order: bus, minibus and taxi. The overall average in-vehicle CO level in air-conditioned bus, minibus and taxi were 1.8, 2.9 and 3.3ppm, respectively. The average concentration level between air-conditioned buses (1.8ppm) and non-air-conditioned buses (1.9ppm) was insignificant. The fluctuation of in-vehicle CO level of non-air-conditioned vehicle followed the variation of out-vehicle CO concentration. Our result also showed that even in air-conditioned vehicles, the in-vehicle CO concentration was affected by the out-vehicle CO concentration although there exists a smoothing out effect. The in-vehicle CO level was the highest in urban-suburban commuting routes and was followed by urban-urban routes. The in-vehicle CO level in urban-rural routes was the lowest. The highest CO level was recorded after the vehicle traversed through tunnel.. The average CO exposure level of public road transportation commuters in Honk Kong was lower than most other cities. Factors governing the CO levels were also discussed. (Author)

RDE-based assessment of a factory bi-fuel CNG/gasoline light-duty vehicle

Science.gov (United States)

Rašić, Davor; Rodman Oprešnik, Samuel; Seljak, Tine; Vihar, Rok; Baškovič, Urban Žvar; Wechtersbach, Tomaž; Katrašnik, Tomaž

2017-10-01

On-road exhaust emissions of a Euro 5 factory bi-fuel CNG/gasoline light-duty vehicle equipped with the TWC were assessed considering the Real Driving Emissions (RDE) guidelines. The vehicle was equipped with a Portable Emission Measurement System (PEMS) that enabled the measurement of THC, CO, NOx, CO2, and CH4. With respect to the characteristics of the vehicle, the appropriate Worldwide Harmonized Light-Duty Vehicle Test Cycles (WLTC) were selected and based on the requirements of the RDE legislation a suitable route was conceived. In addition to the moderate RDE-based route, an extended RDE-based route was also determined. The vehicle was driven along each defined route twice, once with each individual fuel option and with a fully warm vehicle. RDE routes feature a multitude of new driving patterns that are significantly different to those encountered in the NEDC. However, as these driving patterns can greatly influence the cumulative emissions an insight in to local time trace phenomena is crucial to understand, reason and to possibly reduce the cumulative emissions. Original contributions of this paper comprise analyses of the RDE-LDV local time resolved driving emissions phenomena of a CNG-powered vehicle that are benchmarked against the ones measured under the use of gasoline in the same vehicle and under similar operating conditions to reason emission trends through driving patterns and powertrain parameters and exposing the strong cold-start independent interference of CO and N2O infrared absorption bands in the non-dispersive infrared (NDIR) analyzer. The paper provides experimental evidence on this interference, which significantly influences on the readings of CO emissions. The paper further provides hypotheses why CO and N2O interference is more pronounced when using CNG in LDVs and supports these hypotheses by PEMS tests. The study reveals that the vehicle's NOx real-world emission values of both conceived RDE-based routes when using both fuels are

Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles.

Science.gov (United States)

Wan, Jiafu; Liu, Jianqi; Shao, Zehui; Vasilakos, Athanasios V; Imran, Muhammad; Zhou, Keliang

2016-01-11

The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV) paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and IoV. Then, we review the traditional traffic prediction approached used by both Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. On this basis, we propose a mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Experiments were carried out to verify the proposed approaches. Finally, we discuss the outlook of reliable traffic prediction.

Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles

Directory of Open Access Journals (Sweden)

Jiafu Wan

2016-01-01

Full Text Available The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and IoV. Then, we review the traditional traffic prediction approached used by both Vehicle to Infrastructure (V2I and Vehicle to Vehicle (V2V communications. On this basis, we propose a mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Experiments were carried out to verify the proposed approaches. Finally, we discuss the outlook of reliable traffic prediction.

Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.

Science.gov (United States)

Ezugwu, Absalom E; Akutsah, Francis; Olusanya, Micheal O; Adewumi, Aderemi O

2018-01-01

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization problems. This paper presents an improved intelligent water drop algorithm for solving multi-depot vehicle routing problems. A simulated annealing algorithm was introduced into the proposed algorithm as a local search metaheuristic to prevent the intelligent water drop algorithm from getting trapped into local minima and also improve its solution quality. In addition, some of the potential problematic issues associated with using simulated annealing that include high computational runtime and exponential calculation of the probability of acceptance criteria, are investigated. The exponential calculation of the probability of acceptance criteria for the simulated annealing based techniques is computationally expensive. Therefore, in order to maximize the performance of the intelligent water drop algorithm using simulated annealing, a better way of calculating the probability of acceptance criteria is considered. The performance of the proposed hybrid algorithm is evaluated by using 33 standard test problems, with the results obtained compared with the solutions offered by four well-known techniques from the subject literature. Experimental results and statistical tests show that the new method possesses outstanding performance in terms of solution quality and runtime consumed. In addition, the proposed algorithm is suitable for solving large-scale problems.

Cooperative vehicles for robust traffic congestion reduction: An analysis based on algorithmic, environmental and agent behavioral factors.

Directory of Open Access Journals (Sweden)

Prajakta Desai

Full Text Available Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN, wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction, across variations in: (a environmental parameters such as road network topology and configuration; (b algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies.

Cooperative vehicles for robust traffic congestion reduction: An analysis based on algorithmic, environmental and agent behavioral factors.

Science.gov (United States)

Desai, Prajakta; Loke, Seng W; Desai, Aniruddha

2017-01-01

Traffic congestion continues to be a persistent problem throughout the world. As vehicle-to-vehicle communication develops, there is an opportunity of using cooperation among close proximity vehicles to tackle the congestion problem. The intuition is that if vehicles could cooperate opportunistically when they come close enough to each other, they could, in effect, spread themselves out among alternative routes so that vehicles do not all jam up on the same roads. Our previous work proposed a decentralized multiagent based vehicular congestion management algorithm entitled Congestion Avoidance and Route Allocation using Virtual Agent Negotiation (CARAVAN), wherein the vehicles acting as intelligent agents perform cooperative route allocation using inter-vehicular communication. This paper focuses on evaluating the practical applicability of this approach by testing its robustness and performance (in terms of travel time reduction), across variations in: (a) environmental parameters such as road network topology and configuration; (b) algorithmic parameters such as vehicle agent preferences and route cost/preference multipliers; and (c) agent-related parameters such as equipped/non-equipped vehicles and compliant/non-compliant agents. Overall, the results demonstrate the adaptability and robustness of the decentralized cooperative vehicles approach to providing global travel time reduction using simple local coordination strategies.

Online prediction of battery electric vehicle energy consumption

NARCIS (Netherlands)

Wang, Jiquan; Besselink, Igo; Nijmeijer, Henk

2016-01-01

The energy consumption of battery electric vehicles (BEVs) depends on a number of factors, such as vehicle characteristics, driving behavior, route information, traffic states and weather conditions. The variance of these factors and the correlation among each other make the energy consumption

Optimal solutions for routing problems with profits

NARCIS (Netherlands)

Archetti, C.; Bianchessi, N.; Speranza, M. G.

2013-01-01

In this paper, we present a branch-and-price algorithm to solve two well-known vehicle routing problems with profits, the Capacitated Team Orienteering Problem and the Capacitated Profitable Tour Problem. A restricted master heuristic is applied at each node of the branch-and-bound tree in order to

A Review Of Design And Control Of Automated Guided Vehicle Systems

OpenAIRE

Le-Anh, Tuan; Koster, René

2004-01-01

textabstractThis paper presents a review on design and control of automated guided vehicle systems. We address most key related issues including guide-path design, estimating the number of vehicles, vehicle scheduling, idle-vehicle positioning, battery management, vehicle routing, and conflict resolution. We discuss and classify important models and results from key publications in literature on automated guided vehicle systems, including often-neglected areas, such as idle-vehicle positionin...

Vehicle-class Specific Route-guidance of Freeway Traffic by Model-predictive Control

NARCIS (Netherlands)

Schreiter, T.; Landman, R.L.; Van Lint, J.W.C.; Hegyi, A.; Hoogendoorn, S.P.

2012-01-01

Few Active Traffic Management measures proposed in the past consider the distinction of different vehicle classes. Examples of vehicle-class specific measures are truck lanes and high-occupancy/toll (HOT) lanes. We propose that the distinction of different vehicle classes, with different flow

Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

Science.gov (United States)

Suthikarnnarunai, N.; Olinick, E.

2009-01-01

We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.

An analysis of generalised heuristics for vehicle routing and personnel rostering problems

OpenAIRE

Mustafa Misir; Pieter Smet; Greet Vanden Berghe

2015-01-01

The present study investigates the performance of heuristics while solving problems with routing and rostering characteristics. The target problems include scheduling and routing home care, security and maintenance personnel. In analysing the behaviour of the heuristics and determining the requirements for solving the aforementioned problems, the winning hyper-heuristic from the first International Cross-domain Heuristic Search Challenge (CHeSC 2011) is employed. The completely new applicatio...

Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte

to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. This thesis therefore aims at developing new mathematical models and solution methods...... for tramp ship routing and scheduling problems. This is done in the context of Operations Research, a research field that has achieved great success within optimisation-based planning for vehicle routing problems and in many other areas. The first part of this thesis contains a comprehensive introduction...

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

Science.gov (United States)

Baniamerian, Ali; Bashiri, Mahdi; Zabihi, Fahime

2018-03-01

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfaction. In this paper, we introduce a vehicle routing and scheduling problem with cross-docking and time windows in a three-echelon supply chain that considers customer satisfaction. A set of homogeneous vehicles collect products from suppliers and after consolidation process in the cross-dock, immediately deliver them to customers. A mixed integer linear programming model is presented for this problem to minimize transportation cost and early/tardy deliveries with scheduling of inbound and outbound vehicles to increase customer satisfaction. A two phase genetic algorithm (GA) is developed for the problem. For investigating the performance of the algorithm, it was compared with exact and lower bound solutions in small and large-size instances, respectively. Results show that there are at least 86.6% customer satisfaction by the proposed method, whereas customer satisfaction in the classical model is at most 33.3%. Numerical examples results show that the proposed two phase algorithm could achieve optimal solutions in small-size instances. Also in large-size instances, the proposed two phase algorithm could achieve better solutions with less gap from the lower bound in less computational time in comparison with the classic GA.

Challenges in the Tracking and Prediction of Scheduled-Vehicle Journeys

DEFF Research Database (Denmark)

Jensen, Christian Søndergaard; Tiesyte, Dalia

2007-01-01

this type of knowledge with minimal cost. This paper characterizes the problem of real-time vehicle tracking using wireless communication, and of predicting the future status of the vehicles when their movements are restricted to given routes and when they follow schedules with a best effort. The paper...... discusses challenges related to tracking, to the prediction of future travel times, and to historical data analysis. It also suggests approaches to addressing the challenges.......A number of applications in areas such as logistics, cargo delivery, and collective transport involve the management of fleets of vehicles that are expected to travel along known routes according to fixed schedules. Due to road construction, accidents, and other unanticipated conditions...

Modeling Stochastic Route Choice Behaviors with Equivalent Impedance

Directory of Open Access Journals (Sweden)

Jun Li

2015-01-01

Full Text Available A Logit-based route choice model is proposed to address the overlapping and scaling problems in the traditional multinomial Logit model. The nonoverlapping links are defined as a subnetwork, and its equivalent impedance is explicitly calculated in order to simply network analyzing. The overlapping links are repeatedly merged into subnetworks with Logit-based equivalent travel costs. The choice set at each intersection comprises only the virtual equivalent route without overlapping. In order to capture heterogeneity in perception errors of different sizes of networks, different scale parameters are assigned to subnetworks and they are linked to the topological relationships to avoid estimation burden. The proposed model provides an alternative method to model the stochastic route choice behaviors without the overlapping and scaling problems, and it still maintains the simple and closed-form expression from the MNL model. A link-based loading algorithm based on Dial’s algorithm is proposed to obviate route enumeration and it is suitable to be applied on large-scale networks. Finally a comparison between the proposed model and other route choice models is given by numerical examples.

Privacy preservation and authentication on secure geographical routing in VANET

Science.gov (United States)

Punitha, A.; Manickam, J. Martin Leo

2017-05-01

Vehicular Ad hoc Networks (VANETs) play an important role in vehicle-to-vehicle communication as it offers a high level of safety and convenience to drivers. In order to increase the level of security and safety in VANETs, in this paper, we propose a Privacy Preservation and Authentication on Secure Geographical Routing Protocol (PPASGR) for VANET. It provides security by detecting and preventing malicious nodes through two directional antennas such as forward (f-antenna) and backward (b-antenna). The malicious nodes are detected by direction detection, consistency detection and conflict detection. The location of the trusted neighbour is identified using TNT-based location verification scheme after the implementation of the Vehicle Tamper Proof Device (VTPD), Trusted Authority (TA) is generated that produces the anonymous credentials. Finally, VTPD generates pseudo-identity using TA which retrieves the real identity of the sender. Through this approach, the authentication, integrity and confidentiality for routing packets can be achieved. The simulation results show that the proposed approach reduces the packet drop due to attack and improves the packet delivery ratio.

50 CFR 27.31 - General provisions regarding vehicles.

Science.gov (United States)

2010-10-01

... designated routes of travel, as indicated by the appropriate traffic control signs or signals and in... wildlife refuge or portion thereof is located shall govern traffic and the operation and use of vehicles... arrives at the scene of the accident, unless such vehicle constitutes a traffic or safety hazard. (l) A...

An advanced traveler navigation system adapted to route choice preferences of the individual users

Directory of Open Access Journals (Sweden)

Mahyar Amirgholy

2017-12-01

Full Text Available The majority of existing navigation systems only account for a single aspect of the route choice, like travel time or distance, in finding the optimal route for the trips in the network. In this research, we first identify a range of diverse factors that travelers take into account in their route choice decision in the network. A stated preference survey is conducted to show the heterogeneity in the preferences of users and its dependence to the purpose of the trips over the weekdays and weekends. Interestingly, results of the survey show that road safety is the most influential factor in the route choice decision of the average participants over weekends, exceeding even the travel time, and participants give more importance to the scenic quality of the routes for their weekend trips in comparison to their weekday trips. The results of the second part of the survey also indicate that in 27% of the cases participants choose routes other than the ones suggested by navigation systems, and 33% of the times that they take the suggested routes, they modify these routes according to their own preferences. The partial inability of existing navigation systems to suggest the routes that match the preferences of users can be attributed to ignoring (1 the diversity in influential factors and (2 the heterogeneity in preferences of the users by these systems. We propose a dynamic mixed logit route choice model to include the effects of information and learning to estimate parameters of a multivariable utility function for individual users based on their own historical route choice data over time. Finally, we present the concept of a smart navigation system that can gather the required information from real-time and online sources to suggest the routes that best match the users’ own preferences.

Intratumor and Intertumor Heterogeneity in Melanoma

Directory of Open Access Journals (Sweden)

Tomasz M. Grzywa

2017-12-01

Full Text Available Melanoma is a cancer that exhibits one of the most aggressive and heterogeneous features. The incidence rate escalates. A high number of clones harboring various mutations contribute to an exceptional level of intratumor heterogeneity of melanoma. It also refers to metastases which may originate from different subclones of primary lesion. Such component of the neoplasm biology is termed intertumor and intratumor heterogeneity. These levels of tumor heterogeneity hinder accurate diagnosis and effective treatment. The increasing number of research on the topic reflects the need for understanding limitation or failure of contemporary therapies. Majority of analyses concentrate on mutations in cancer-related genes. Novel high-throughput techniques reveal even higher degree of variations within a lesion. Consolidation of theories and researches indicates new routes for treatment options such as targets for immunotherapy. The demand for personalized approach in melanoma treatment requires extensive knowledge on intratumor and intertumor heterogeneity on the level of genome, transcriptome/proteome, and epigenome. Thus, achievements in exploration of melanoma variety are described in details. Particularly, the issue of tumor heterogeneity or homogeneity given BRAF mutations is discussed.

Scheduling and location issues in transforming service fleet vehicles to electric vehicles

DEFF Research Database (Denmark)

Mirchandani, Pitu; Madsen, Oli B.G.; Adler, Jonathan

There is much reason to believe that fleets of service vehicles of many organizations will transform their vehicles that utilize alternative fuels which are more sustainable. The electric vehicle is a good candidate for this transformation, especially which “refuels” by exchanging its spent...... batteries with charged ones. This paper discusses the issues that must be addressed if a transit service were to use electric vehicles, principally the issues related to the limited driving range of each electric vehicle’s set of charged batteries and the possible detouring for battery exchanges....... In particular, the paper addresses the optimization and analysis of infrastructure design alternatives dealing with (1) the number of battery-exchange stations, (2) their locations, (3) the recharging capacity and inventory management of batteries at each facility, and (4) routing and scheduling of the fleet...

Automating Risk Assessments of Hazardous Material Shipments for Transportation Routes and Mode Selection

International Nuclear Information System (INIS)

Dolphin, Barbara H.; Richins, William D.; Novascone, Stephen R.

2010-01-01

The METEOR project at Idaho National Laboratory (INL) successfully addresses the difficult problem in risk assessment analyses of combining the results from bounding deterministic simulation results with probabilistic (Monte Carlo) risk assessment techniques. This paper describes a software suite designed to perform sensitivity and cost/benefit analyses on selected transportation routes and vehicles to minimize risk associated with the shipment of hazardous materials. METEOR uses Monte Carlo techniques to estimate the probability of an accidental release of a hazardous substance along a proposed transportation route. A METEOR user selects the mode of transportation, origin and destination points, and charts the route using interactive graphics. Inputs to METEOR (many selections built in) include crash rates for the specific aircraft, soil/rock type and population densities over the proposed route, and bounding limits for potential accident types (velocity, temperature, etc.). New vehicle, materials, and location data are added when available. If the risk estimates are unacceptable, the risks associated with alternate transportation modes or routes can be quickly evaluated and compared. Systematic optimizing methods will provide the user with the route and vehicle selection identified with the lowest risk of hazardous material release. The effects of a selected range of potential accidents such as vehicle impact, fire, fuel explosions, excessive containment pressure, flooding, etc. are evaluated primarily using hydrocodes capable of accurately simulating the material response of critical containment components. Bounding conditions that represent credible accidents (i.e; for an impact event, velocity, orientations, and soil conditions) are used as input parameters to the hydrocode models yielding correlation functions relating accident parameters to component damage. The Monte Carlo algorithms use random number generators to make selections at the various decision

Diesel supply planning for offshore platforms by a mathematical model based on the vehicle routing problem with replenishment

Energy Technology Data Exchange (ETDEWEB)

Fiorot Astoures, H.; Alvarenga Rosa, R. de; Silva Rosa, A.

2016-07-01

Oil exploration in Brazil is mainly held by offshore platforms which require the supply of several products, including diesel to maintain its engines. One strategy to supply diesel to the platforms is to keep a vessel filled with diesel nearby the exploration basin. An empty boat leaves the port and goes directly to this vessel, then it is loaded with diesel. After that, it makes a trip to supply the platforms and when the boat is empty, it returns to the vessel to be reloaded with more diesel going to another trip. Based on this description, this paper proposes a mathematical model based on the Vehicle Routing Problem with Intermediate Replenishment Facilities (VRPIRF) to solve the problem. The purpose of the model is to plan the routes for the boats to meet the diesel requests of the platform. Given the fact that in the literature, papers about the VRPIRF are scarce and papers about the VRPIRF applied to offshore platforms were not found in the published papers, this paper is important to contribute with the evolution of this class of problem, bringing also a solution for a real application that is very important for the oil and gas business. The mathematical model was tested using the CPLEX 12.6. In order to assess the mathematical model, tests were done with data from the major Brazilian oil and gas company and several strategies were tested. (Author)

THERMAL PERFORMANCE OF REFRIGERATED VEHICLES IN THE DISTRIBUTION OF PERISHABLE FOOD

Directory of Open Access Journals (Sweden)

Antônio G.N. Novaes

2015-08-01

Full Text Available The temperature of refrigerated products along the distribution process must be kept within close limits to ensure optimum food safety levels and high product quality. The variation of product temperature along the vehicle routing sequence is represented by non-linear functions. The temperature variability is also correlated with the time required for the refrigerated unit to recover after cargo unloading, due to the cargo discharging process. The vehicle routing optimization methods employed in traditional cargo distribution problems are generally based on the Travelling Salesman Problem with the objective of minimizing travelled distance or time. The thermal quality of routing alternatives is evaluated in this analysis with Process Capability Indices (PCI. Since temperature does not vary linearly with time, a Simulated Annealing algorithm was developed to get the optimal solution in which the minimum vehicle traveling distance is searched, but respecting the quality level expressed by a required minimum PCI value.

Dynamic Routing of Short Transfer Baggage

DEFF Research Database (Denmark)

Clausen, Tommy; Pisinger, David

of dispatch. Computational results are presented for real-life passenger data with stochastic bag arrival times and travel times. The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running...... that arrive continuously during the day. We present an IP model of the problem and describe the problem as a case study from a real life setting. We present a weighted greedy algorithm for dispatching vehicles that works in an dynamic context, meaning that it only considers bags available at the time......We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags...

Dynamic UAV-based traffic monitoring under uncertainty as a stochastic arc-inventory routing policy

Directory of Open Access Journals (Sweden)

Joseph Y.J. Chow

2016-10-01

Full Text Available Given the rapid advances in unmanned aerial vehicles, or drones, and increasing need to monitor at a city level, one of the current research gaps is how to systematically deploy drones over multiple periods. We propose a real-time data-driven approach: we formulate the first deterministic arc-inventory routing problem and derive its stochastic dynamic policy. The policy is expected to be of greatest value in scenarios where uncertainty is highest and costliest, such as city monitoring during major events. The Bellman equation for an approximation of the proposed inventory routing policy is formulated as a selective vehicle routing problem. We propose an approximate dynamic programming algorithm based on Least Squares Monte Carlo simulation to find that policy. The algorithm has been modified so that the least squares dependent variable is defined to be the “expected stock out cost upon the next replenishment”. The new algorithm is tested on 30 simulated instances of real time trajectories over 5 time periods of the selective vehicle routing problem to evaluate the proposed policy and algorithm. Computational results on the selected instances show that the algorithm on average outperforms the myopic policy by 23–28%, depending on the parametric design. Further tests are conducted on classic benchmark arc routing problem instances. The 11-link instance gdb19 (Golden et al., 1983 is expanded into a sequential 15-period stochastic dynamic example and used to demonstrate why a naïve static multi-period deployment plan would not be effective in real networks.

Electric vehicle recycling 2020: Key component power electronics.

Science.gov (United States)

Bulach, Winfried; Schüler, Doris; Sellin, Guido; Elwert, Tobias; Schmid, Dieter; Goldmann, Daniel; Buchert, Matthias; Kammer, Ulrich

2018-04-01

Electromobility will play a key role in order to reach the specified ambitious greenhouse gas reduction targets in the German transport sector of 42% between 1990 and 2030. Subsequently, a significant rise in the sale of electric vehicles (EVs) is to be anticipated in future. The amount of EVs to be recycled will rise correspondingly after a delay. This includes the recyclable power electronics modules which are incorporated in every EV as an important component for energy management. Current recycling methods using car shredders and subsequent post shredder technologies show high recycling rates for the bulk metals but are still associated with high losses of precious and strategic metals such as gold, silver, platinum, palladium and tantalum. For this reason, the project 'Electric vehicle recycling 2020 - key component power electronics' developed an optimised recycling route for recycling power electronics modules from EVs which is also practicable in series production and can be implemented using standardised technology. This 'WEEE recycling route' involves the disassembly of the power electronics from the vehicle and a subsequent recycling in an electronic end-of-life equipment recycling plant. The developed recycling process is economical under the current conditions and raw material prices, even though it involves considerably higher costs than recycling using the car shredder. The life cycle assessment shows basically good results, both for the traditional car shredder route and the developed WEEE recycling route: the latter provides additional benefits from some higher recovery rates and corresponding credits.

Project : transit demand and routing after autonomous vehicle availability.

Science.gov (United States)

2015-12-01

Autonomous vehicles (AVs) create the potential for improvements in traffic operations as well as : new behaviors for travelers such as car sharing among trips through driverless repositioning. Most studies : on AVs have focused on technology or traff...

Guidelines for applying criteria to designate routes for transporting hazardous materials. Final report

International Nuclear Information System (INIS)

1989-07-01

These guidelines were prepared to assist State and local officials in the analysis of alternate routes to be used by highway vehicles transportating hazardous materials. A methodology for assessing comparative risks of routing alternatives is discussed and demonstrated through a hypothetical example. Mathematical models are provided for situations in which measured local data may not be easily obtained or adequate

A Sociability-Based Routing Scheme for Delay-Tolerant Networks

Directory of Open Access Journals (Sweden)

Fabbri Flavio

2011-01-01

Full Text Available The problem of choosing the best forwarders in Delay-Tolerant Networks (DTNs is crucial for minimizing the delay in packet delivery and for keeping the amount of generated traffic under control. In this paper, we introduce sociable routing, a novel routing strategy that selects a subset of optimal forwarders among all the nodes and relies on them for an efficient delivery. The key idea is that of assigning to each network node a time-varying scalar parameter which captures its social behavior in terms of frequency and types of encounters. This sociability concept is widely discussed and mathematically formalized. Simulation results of a DTN of vehicles in urban environment, driven by real mobility traces, and employing sociable routing, is presented. Encouraging results show that sociable routing, compared to other known protocols, achieves a good compromise in terms of delay performance and amount of generated traffic.

LOTIR: A Routing Protocol for Multi-hop V-to-I Communication Using Local Traffic Information

Directory of Open Access Journals (Sweden)

Kun-chan Lan

2012-08-01

Full Text Available Vehicular Ad Hoc Network (VANET is an emerging technology that can be applied to safety, transport efficiency, or infotainment applications for roads and highways. However, due to its unique features, such as dynamic mobility patterns and uneven distributions of vehicles, VANET faces many challenging research issues for robust data dissemination in the network. Many routing protocols have been proposed for VANET in the past few years, and the idea of utilizing a navigation system to assist the routing protocol for selecting the next best forwarder has become increasingly popular. However, it might not be realistic to assume that every vehicle is equipped with a navigation system. In addition, due to privacy concerns, drivers might not want to reveal their planned routes to other cars. In this work, we propose a new routing protocol, called LOTIR (LOcal Traffic Information Routing, that relies on only local traffic information and does not require the assistance of a navigation system. LOTIR is a DTN-based routing protocol that utilizes the car-following theory and traffic light information to decide the next carrier to forward the data to. We implement LOTIR in NS-2, and our results show that it can achieve similar performance as prior work which depends on the availability of global network topology information.

Routing - a preliminary study of the use of modern information and communication technology

International Nuclear Information System (INIS)

Stjernman, G.

1992-01-01

Communication and data transfer to mobile equipment are in a very active developing face. These technologies might be useful in the work on enhancing the safety of dangerous goods transports. The risk at a certain place, when passed by a transport of dangerous goods, is not the same at every moment. Taking this into account when selecting roads for dangerous goods vehicles so that, for every vehicle, the road most suited at the time in question is selected, should give better results than todays practise. The principles of dynamic routeing of dangerous goods are discussed and the needed and available technologies for implementing dynamic routeing are outlined, as are some other aspects of the implementation. (au)

Cyclist route choice, traffic-related air pollution, and lung function: a scripted exposure study.

Science.gov (United States)

Jarjour, Sarah; Jerrett, Michael; Westerdahl, Dane; de Nazelle, Audrey; Hanning, Cooper; Daly, Laura; Lipsitt, Jonah; Balmes, John

2013-02-07

A travel mode shift to active transportation such as bicycling would help reduce traffic volume and related air pollution emissions as well as promote increased physical activity level. Cyclists, however, are at risk for exposure to vehicle-related air pollutants due to their proximity to vehicle traffic and elevated respiratory rates. To promote safe bicycle commuting, the City of Berkeley, California, has designated a network of residential streets as "Bicycle Boulevards." We hypothesized that cyclist exposure to air pollution would be lower on these Bicycle Boulevards when compared to busier roads and this elevated exposure may result in reduced lung function. We recruited 15 healthy adults to cycle on two routes - a low-traffic Bicycle Boulevard route and a high-traffic route. Each participant cycled on the low-traffic route once and the high-traffic route once. We mounted pollutant monitors and a global positioning system (GPS) on the bicycles. The monitors were all synced to GPS time so pollutant measurements could be spatially plotted. We measured lung function using spirometry before and after each bike ride. We found that fine and ultrafine particulate matter, carbon monoxide, and black carbon were all elevated on the high-traffic route compared to the low-traffic route. There were no corresponding changes in the lung function of healthy non-asthmatic study subjects. We also found that wind-speed affected pollution concentrations. These results suggest that by selecting low-traffic Bicycle Boulevards instead of heavily trafficked roads, cyclists can reduce their exposure to vehicle-related air pollution. The lung function results indicate that elevated pollutant exposure may not have acute negative effects on healthy cyclists, but further research is necessary to determine long-term effects on a more diverse population. This study and broader field of research have the potential to encourage policy-makers and city planners to expand infrastructure to

Routing helicopters for crew exchanges on off-shore locations

NARCIS (Netherlands)

Sierksma, G.; Tijssen, G.A.

This paper deals with a vehicle routing problem with split demands, namely the problem of determining a flight schedule for helicopters to off-shore platform locations for exchanging crew people employed on these platforms. The problem is formulated as an LP model and solved by means of a

Simulated annealing with restart strategy for the blood pickup routing problem

Science.gov (United States)

Yu, V. F.; Iswari, T.; Normasari, N. M. E.; Asih, A. M. S.; Ting, H.

2018-04-01

This study develops a simulated annealing heuristic with restart strategy (SA_RS) for solving the blood pickup routing problem (BPRP). BPRP minimizes the total length of the routes for blood bag collection between a blood bank and a set of donation sites, each associated with a time window constraint that must be observed. The proposed SA_RS is implemented in C++ and tested on benchmark instances of the vehicle routing problem with time windows to verify its performance. The algorithm is then tested on some newly generated BPRP instances and the results are compared with those obtained by CPLEX. Experimental results show that the proposed SA_RS heuristic effectively solves BPRP.

Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm

OpenAIRE

Gelareh , Shahin; Neamatian Monemi , Rahimeh; Semet , Frédéric

2015-01-01

International audience; In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo-hub allocations. We propose a mathematical model and a b...

Intratumor and Intertumor Heterogeneity in Melanoma.

Science.gov (United States)

Grzywa, Tomasz M; Paskal, Wiktor; Włodarski, Paweł K

2017-12-01

Melanoma is a cancer that exhibits one of the most aggressive and heterogeneous features. The incidence rate escalates. A high number of clones harboring various mutations contribute to an exceptional level of intratumor heterogeneity of melanoma. It also refers to metastases which may originate from different subclones of primary lesion. Such component of the neoplasm biology is termed intertumor and intratumor heterogeneity. These levels of tumor heterogeneity hinder accurate diagnosis and effective treatment. The increasing number of research on the topic reflects the need for understanding limitation or failure of contemporary therapies. Majority of analyses concentrate on mutations in cancer-related genes. Novel high-throughput techniques reveal even higher degree of variations within a lesion. Consolidation of theories and researches indicates new routes for treatment options such as targets for immunotherapy. The demand for personalized approach in melanoma treatment requires extensive knowledge on intratumor and intertumor heterogeneity on the level of genome, transcriptome/proteome, and epigenome. Thus, achievements in exploration of melanoma variety are described in details. Particularly, the issue of tumor heterogeneity or homogeneity given BRAF mutations is discussed. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

NREL Evaluates Performance of Hydraulic Hybrid Refuse Vehicles

Energy Technology Data Exchange (ETDEWEB)

2015-09-01

This highlight describes NREL's evaluation of the in-service performance of 10 next-generation hydraulic hybrid refuse vehicles (HHVs), 8 previous-generation (model year 2013) HHVs, and 8 comparable conventional diesel vehicles operated by Miami-Dade County's Public Works and Waste Management Department in southern Florida. Launched in March 2015, the on-road portion of this 12-month evaluation focuses on collecting and analyzing vehicle performance data - fuel economy, maintenance costs, and drive cycles - from the HHVs and the conventional diesel vehicles. The fuel economy of heavy-duty vehicles, such as refuse trucks, is largely dependent on the load carried and the drive cycles on which they operate. In the right applications, HHVs offer a potential fuel-cost advantage over their conventional counterparts. This advantage is contingent, however, on driving behavior and drive cycles with high kinetic intensity that take advantage of regenerative braking. NREL's evaluation will assess the performance of this technology in commercial operation and help Miami-Dade County determine the ideal routes for maximizing the fuel-saving potential of its HHVs. Based on the field data, NREL will develop a validated vehicle model using the Future Automotive Systems Technology Simulator, also known as FASTSim, to study the impacts of route selection and other vehicle parameters. NREL is also analyzing fueling and maintenance data to support total-cost-of-ownership estimations and forecasts. The study aims to improve understanding of the overall usage and effectiveness of HHVs in refuse operation compared to similar conventional vehicles and to provide unbiased technical information to interested stakeholders.

Issues of using Longer Heavier Vehicles on Roads

Science.gov (United States)

Matuszkova, R.; Heczko, M.; Cepil, J.; Radimsky, M.

2018-03-01

Many logistics companies aim to save on freight costs. Recently, not only on Czech roads and on motorways, longer and heavier vehicles that exceed dimensions’ limits appeared. For these vehicles, it is necessary to apply for a special permit, which is, however, much more liberal than the permit for oversized and overweight load transport. This paper informs about checking routes of these vehicles by swept path analysis and finding locations on roads that can generate both safety risks and traffic fluency problems.

Green open location-routing problem considering economic and environmental costs

Directory of Open Access Journals (Sweden)

Eliana M. Toro

2016-12-01

Full Text Available This paper introduces a new bi-objective vehicle routing problem that integrates the Open Location Routing Problem (OLRP, recently presented in the literature, coupled with the growing need for fuel consumption minimization, named Green OLRP (G-OLRP. Open routing problems (ORP are known to be NP-hard problems, in which vehicles start from the set of existing depots and are not required to return to the starting depot after completing their service. The OLRP is a strategic-level problem involving the selection of one or many depots from a set of candidate locations and the planning of delivery radial routes from the selected depots to a set of customers. The concept of radial paths allows us to use a set of constraints focused on maintaining the radiality condition of the paths, which significantly simplifies the set of constraints associated with the connectivity and capacity requirements and provides a suitable alternative when compared with the elimination problem of sub-tours traditionally addressed in the literature. The emphasis in the paper will be placed on modeling rather than solution methods. The model proposed is formulated as a bi-objective problem, considering the minimization of operational costs and the minimization of environmental effects, and it is solved by using the epsilon constraint technique. The results illustrate that the proposed model is able to generate a set of trade-off solutions leading to interesting conclusions about the relationship between operational costs and environmental impact.

Metro passengers’ route choice model and its application considering perceived transfer threshold

Science.gov (United States)

Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

2017-01-01

With the rapid development of the Metro network in China, the greatly increased route alternatives make passengers’ route choice behavior and passenger flow assignment more complicated, which presents challenges to the operation management. In this paper, a path sized logit model is adopted to analyze passengers’ route choice preferences considering such parameters as in-vehicle time, number of transfers, and transfer time. Moreover, the “perceived transfer threshold” is defined and included in the utility function to reflect the penalty difference caused by transfer time on passengers’ perceived utility under various numbers of transfers. Next, based on the revealed preference data collected in the Guangzhou Metro, the proposed model is calibrated. The appropriate perceived transfer threshold value and the route choice preferences are analyzed. Finally, the model is applied to a personalized route planning case to demonstrate the engineering practicability of route choice behavior analysis. The results show that the introduction of the perceived transfer threshold is helpful to improve the model’s explanatory abilities. In addition, personalized route planning based on route choice preferences can meet passengers’ diversified travel demands. PMID:28957376

Capacitated vehicle routing problem for PSS uses based on ubiquitous computing: An emerging markets approach

Directory of Open Access Journals (Sweden)

Alberto Ochoa-Ortíz

2015-01-01

Full Text Available El problema de ruteo de vehículos bajo las limitaciones de capacidad y basado en computación ubicua desde una perspectiva relacionada con PSS (Producto-Servicio de Sistemas para desarrollar configuraciones para el transporte urbano de mercancías es abordado. Éste trabajo considera las especificidades de la logística urbana bajo un contexto de mercados emergentes. En este caso, involucra: i bajas competencias logísticas de los tomadores de decisiones; ii la limitada disponibilidad de datos; y iii restringido acceso a tecnología de alto desempeño para calcular rutas de transporte óptimas. Por lo tanto, se propone el uso de un software libre que proporciona soluciones de bajo costo (en tiempo y recursos. El artículo muestra la aplicación de los resultados de una herramienta de software basado en la Teoría de Grafos utilizado para analizar y resolver un CVRP (Capacitated Vehicle Routing Problem. Se utilizó el caso de una empresa local de distribución de alimentos situada en una gran ciudad de México. Sobre la base de una flora de vehículos pequeños, todos con las mismas especificaciones técnicas y una capacidad de carga comparable.

System and method of vehicle operating condition management

Science.gov (United States)

Sujan, Vivek A.; Vajapeyazula, Phani; Follen, Kenneth; Wu, An; Moffett, Barty L.

2015-10-20

A vehicle operating condition profile can be determined over a given route while also considering imposed constraints such as deviation from time targets, deviation from maximum governed speed limits, etc. Given current vehicle speed, engine state and transmission state, the present disclosure optimally manages the engine map and transmission to provide a recommended vehicle operating condition that optimizes fuel consumption in transitioning from one vehicle state to a target state. Exemplary embodiments provide for offline and online optimizations relative to fuel consumption. The benefit is increased freight efficiency in transporting cargo from source to destination by minimizing fuel consumption and maintaining drivability.

An Erbium-Based Bifuctional Heterogeneous Catalyst: A Cooperative Route Towards C-C Bond Formation

Directory of Open Access Journals (Sweden)

Manuela Oliverio

2014-07-01

Full Text Available Heterogeneous bifuctional catalysts are multifunctional synthetic catalysts enabling efficient organic transformations by exploiting two opposite functionalities without mutual destruction. In this paper we report the first Er(III-based metallorganic heterogeneous catalyst, synthesized by post-calcination MW-assisted grafting and modification of the natural aminoacid L-cysteine. The natural acid–base distance between sites was maintained to assure the cooperation. The applicability of this new bifunctional heterogeneous catalyst to C-C bond formation and the supposed mechanisms of action are discussed as well.

Multipath diffuse routing over heterogeneous mesh networks of web devices and sensors

NARCIS (Netherlands)

Vitale, G.; Stassen, M.L.A.; Colak, S.B.; Pronk, V.; Macq, B.; Quisquater, J.-.J.

2002-01-01

In this paper we present a new data flow algorithm based on physical diffusion for dense device networks needed for future ubiquitous communications. This diffuse data routing concept is based on multi-path signal propagation aided with adaptive beam-forming methods. Adaptation for beam-forming at

How important is vehicle safety in the new vehicle purchase process?

Science.gov (United States)

Koppel, Sjaanie; Charlton, Judith; Fildes, Brian; Fitzharris, Michael

2008-05-01

Whilst there has been a significant increase in the amount of consumer interest in the safety performance of privately owned vehicles, the role that it plays in consumers' purchase decisions is poorly understood. The aims of the current study were to determine: how important vehicle safety is in the new vehicle purchase process; what importance consumers place on safety options/features relative to other convenience and comfort features, and how consumers conceptualise vehicle safety. In addition, the study aimed to investigate the key parameters associated with ranking 'vehicle safety' as the most important consideration in the new vehicle purchase. Participants recruited in Sweden and Spain completed a questionnaire about their new vehicle purchase. The findings from the questionnaire indicated that participants ranked safety-related factors (e.g., EuroNCAP (or other) safety ratings) as more important in the new vehicle purchase process than other vehicle factors (e.g., price, reliability etc.). Similarly, participants ranked safety-related features (e.g., advanced braking systems, front passenger airbags etc.) as more important than non-safety-related features (e.g., route navigation systems, air-conditioning etc.). Consistent with previous research, most participants equated vehicle safety with the presence of specific vehicle safety features or technologies rather than vehicle crash safety/test results or crashworthiness. The key parameters associated with ranking 'vehicle safety' as the most important consideration in the new vehicle purchase were: use of EuroNCAP, gender and education level, age, drivers' concern about crash involvement, first vehicle purchase, annual driving distance, person for whom the vehicle was purchased, and traffic infringement history. The findings from this study are important for policy makers, manufacturers and other stakeholders to assist in setting priorities with regard to the promotion and publicity of vehicle safety features

Heterogenization of Homogeneous Catalysts: the Effect of the Support

Energy Technology Data Exchange (ETDEWEB)

Earl, W.L.; Ott, K.C.; Hall, K.A.; de Rege, F.M.; Morita, D.K.; Tumas, W.; Brown, G.H.; Broene, R.D.

1999-06-29

We have studied the influence of placing a soluble, homogeneous catalyst onto a solid support. We determined that such a 'heterogenized' homogeneous catalyst can have improved activity and selectivity for the asymmetric hydrogenation of enamides to amino acid derivatives. The route of heterogenization of RhDuPhos(COD){sup +} cations occurs via electrostatic interactions with anions that are capable of strong hydrogen bonding to silica surfaces. This is a novel approach to supported catalysis. Supported RhDuPhos(COD){sup +} is a recyclable, non-leaching catalyst in non-polar media. This is one of the few heterogenized catalysts that exhibits improved catalytic performance as compared to its homogeneous analog.

Vehicle routing for the eco-efficient collection of household plastic waste

NARCIS (Netherlands)

Bing, X.; Keizer, de M.; Bloemhof, J.M.; Vorst, van der J.G.A.J.

2014-01-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of

Behavioural Models for Route Choice of Passengers in Multimodal Public Transport Networks

DEFF Research Database (Denmark)

Anderson, Marie Karen

in the estimation of route choice models of public transport users based upon observed choices. Public transport route choice models have not benefitted from the same technological enhancements as car models because of the necessity (i) to collect additional information concerning lines and transfers, and (ii...... modes, public transport modes, lines, transfers, egress modes) is large. This thesis proposes a doubly stochastic approach for generating alternative routes that are relevant to travellers, since the method allows accounting for both perceived costs of the network elements and heterogeneity......The subject of this thesis is behavioural models for route choice of passengers in multimodal public transport networks. While research in sustainable transport has dedicated much attention toward the determinants of choice between car and sustainable travel options, it has devoted less attention...

Ways to improve the environmental conditions of their buses in operation on passenger routes of cities

Directory of Open Access Journals (Sweden)

Melnychuk S.V.

2017-04-01

Full Text Available The results of studies on operational and environmental parameters buses used on bus routes Zhitomir city. It uses statistical methods for determining the intensity of traffic, passenger traffic and ecology in traffic. To assess the environmental chosen stop with the greatest intensity of traffic, which is the probability of accumulation of pollution transport emissions that exceed permissible limits. Calculation of environmental pollution emission route for vehicles made stops street «Str. Hundreds of Heaven» «CUM», «vul. Hlibna» on the main trunk street Kievska. Results obtained environmental field experiments compared with the data defined calculation methods, based on the proposed use appropriate operational vehicles. The conclusions that indicate the seriousness of the problem and the urgency to address it. The system of environmental safety and road safety in Zhitomir requires significant improvements due to the increased quantities bus vehicles plying city routes. Recommendations to improve the ecological condition of intersections can be developed through the optimization of traffic using buses with environmentally improved operating parameters. Keywords: environmental and operational parameters; ecological safety; environmental assessment; intensity of traffic; passenger traffic; environmental conditions; operation; bus choice; stop.

Full-shipload tramp ship routing and scheduling with variable speeds

DEFF Research Database (Denmark)

Wen, M.; Røpke, Stefan; Petersen, Hanne Løhmann

2016-01-01

This paper investigates the simultaneous optimization problem of routing and sailing speed in the context of full-shipload tramp shipping. In this problem, a set of cargoes can be transported from their load to discharge ports by a fleet of heterogeneous ships of different speed ranges and load......-dependent fuel consumption. The objective is to determine which orders to serve and to find the optimal route for each ship and the optimal sailing speed on each leg of the route so that the total profit is maximized. The problem originated from a real-life challenge faced by a Danish tramp shipping company....... It is shown that speed optimization can improve the total profit by 16% on average and the fuel price has a significant effect on the average sailing speed and total profit....

ANALYTICAL ESTIMATION OF MINIMUM AND MAXIMUM TIME EXPENDITURES OF PASSENGERS AT AN URBAN ROUTE STOP

Directory of Open Access Journals (Sweden)

Gorbachov, P.

2013-01-01

Full Text Available This scientific paper deals with the problem related to the definition of average time spent by passengers while waiting for transport vehicles at urban stops as well as the results of analytical modeling of this value at traffic schedule unknown to the passengers and of two options of the vehicle traffic management on the given route.

Reliable and Efficient Autonomous Driving: the Need for Heterogeneous Vehicular Networks

OpenAIRE

Zheng, Kan; Zheng, Qiang; Yang, Haojun; Zhao, Long; Hou, Lu; Chatzimisios, Periklis

2015-01-01

Autonomous driving technology has been regarded as a promising solution to reduce road accidents and traffic congestion, as well as to optimize the usage of fuel and lane. Reliable and high efficient Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communications are essential to let commercial autonomous driving vehicles be on the road before 2020. The current paper firstly presents the concept of Heterogeneous Vehicular NETworks (HetVNETs) for autonomous driving, in which an imp...

Dynamic performances analysis of a real vehicle driving

Science.gov (United States)

Abdullah, M. A.; Jamil, J. F.; Salim, M. A.

2015-12-01

Vehicle dynamic is the effects of movement of a vehicle generated from the acceleration, braking, ride and handling activities. The dynamic behaviours are determined by the forces from tire, gravity and aerodynamic which acting on the vehicle. This paper emphasizes the analysis of vehicle dynamic performance of a real vehicle. Real driving experiment on the vehicle is conducted to determine the effect of vehicle based on roll, pitch, and yaw, longitudinal, lateral and vertical acceleration. The experiment is done using the accelerometer to record the reading of the vehicle dynamic performance when the vehicle is driven on the road. The experiment starts with weighing a car model to get the center of gravity (COG) to place the accelerometer sensor for data acquisition (DAQ). The COG of the vehicle is determined by using the weight of the vehicle. A rural route is set to launch the experiment and the road conditions are determined for the test. The dynamic performance of the vehicle are depends on the road conditions and driving maneuver. The stability of a vehicle can be controlled by the dynamic performance analysis.

A variable neighborhood descent based heuristic to solve the capacitated location-routing problem

Directory of Open Access Journals (Sweden)

M. S. Jabal-Ameli

2011-01-01

Full Text Available Location-routing problem (LRP is established as a new research area in the context of location analysis. The primary concern of LRP is on locating facilities and routing of vehicles among established facilities and existing demand points. In this work, we address the capacitated LRP which arises in many practical applications within logistics and supply chain management. The objective is to minimize the overall system costs which include the fixed costs of opening depots and using vehicles at each depot site, and the variable costs associated with delivery activities. A novel heuristic is proposed which is based on variable neighborhood descent (VND algorithm to solve the resulted problem. The computational study indicates that the proposed VND based heuristic is highly competitive with the existing solution algorithms in terms of solution quality.

Heterogeneity in the response to gasoline prices: Evidence from Pennsylvania and implications for the rebound effect

International Nuclear Information System (INIS)

Gillingham, Kenneth; Jenn, Alan; Azevedo, Inês M.L.

2015-01-01

The consumer response to changing gasoline prices has long interested economists and policymakers, for it has important implications for the effects of gasoline taxation and vehicle energy efficiency policies. This study examines both the elasticity of driving with respect to changing gasoline prices and heterogeneity in this elasticity by geography, the fuel economy of the vehicle, and the age of the vehicle. We use detailed annual vehicle-level emissions inspection test data from Pennsylvania that include odometer readings, inspection zip codes, and extensive vehicle characteristics. We estimate a short-run gasoline price elasticity of driving demand of − 0.10, and find substantial heterogeneity in this responsiveness. The elasticity is largely driven by low fuel economy vehicles, as well as vehicles between 3 and 7 years old. Our findings help reconcile some of the recent literature and provide guidance on the magnitude of the direct rebound effect from light duty vehicle energy efficiency policies.

Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles

OpenAIRE

Wan, Jiafu; Liu, Jianqi; Shao, Zehui; Vasilakos, Athanasios V.; Imran, Muhammad; Zhou, Keliang

2016-01-01

The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV) paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and Io...

Dynamics of subway networks based on vehicles operation timetable

Science.gov (United States)

Xiao, Xue-mei; Jia, Li-min; Wang, Yan-hui

2017-05-01

In this paper, a subway network is represented as a dynamic, directed and weighted graph, in which vertices represent subway stations and weights of edges represent the number of vehicles passing through the edges by considering vehicles operation timetable. Meanwhile the definitions of static and dynamic metrics which can represent vertices' and edges' local and global attributes are proposed. Based on the model and metrics, standard deviation is further introduced to study the dynamic properties (heterogeneity and vulnerability) of subway networks. Through a detailed analysis of the Beijing subway network, we conclude that with the existing network structure, the heterogeneity and vulnerability of the Beijing subway network varies over time when the vehicle operation timetable is taken into consideration, and the distribution of edge weights affects the performance of the network. In other words, although the vehicles operation timetable is restrained by the physical structure of the network, it determines the performances and properties of the Beijing subway network.

An optimal control-based algorithm for hybrid electric vehicle using preview route information

NARCIS (Netherlands)

Ngo, D.V.; Hofman, T.; Steinbuch, M.; Serrarens, A.F.A.

2010-01-01

Control strategies for Hybrid Electric Vehicles (HEVs) are generally aimed at optimally choosing the power distribution between the internal combustion engine and the electric motor in order to minimize the fuel consumption and/or emissions. Using vehicle navigation systems in combination with

Optimization of location routing inventory problem with transshipment

Science.gov (United States)

Ghani, Nor Edayu Abd; Shariff, S. Sarifah Radiah; Zahari, Siti Meriam

2015-05-01

Location Routing Inventory Problem (LRIP) is a collaboration of the three components in the supply chain. It is confined by location-allocation, vehicle routing and inventory management. The aim of the study is to minimize the total system cost in the supply chain. Transshipment is introduced in order to allow the products to be shipped to a customer who experiences a shortage, either directly from the supplier or from another customer. In the study, LRIP is introduced with the transshipment (LRIPT) and customers act as the transshipment points. We select the transshipment point by using the p-center and we present the results in two divisions of cases. Based on the analysis, the results indicated that LRIPT performed well compared to LRIP.

Indoor Surveillance Security Robot with a Self-Propelled Patrolling Vehicle

Directory of Open Access Journals (Sweden)

Hou-Tsan Lee

2011-01-01

Full Text Available Self-propelled patrolling vehicles can patrol periodically in the designed area to ensure the safety like men do. The proposed vehicle cannot only save manpower, but also ensure the performance without mistakes caused by man. It is different from the traditional patrolling system which is limited by the manpower and the fixed camera positions. To improve such situation, this paper proposes a self-propelled patrolling vehicle which can move automatically to a wider range and record the monitored image by IPCAM within a predefined patrolling route. Besides, the user can use the mobile device or website to connect to the vehicle at anytime and anywhere and control it to move to the position to get the indoor image user wants. The position of self-propelled vehicles can be detected by the RFID reader as a feedback and be shown on the PC screen and smart phone. The recorded images can be also transmitted back to the server via WiFi system for face tracking and discriminating analysis. On the other hand, the self-propelled vehicle patrolling routes can be modified by the Android smart-phone remote-control module. When some defined events occur, the build-in MSN module will notice users by sending messages to PC and smart phone. Experimental results are given in the paper to validate its performance.

A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

Directory of Open Access Journals (Sweden)

Xing Zhao

2012-01-01

Full Text Available This paper establishes a dynamic stochastic route choice model for evacuation to simulate the propagation process of traffic flow and estimate the stochastic route choice under evacuation situations. The model contains a lane-group-based cell transmission model (CTM which sets different traffic capacities for links with different turning movements to flow out in an evacuation situation, an actual impedance model which is to obtain the impedance of each route in time units at each time interval and a stochastic route choice model according to the probit-based stochastic user equilibrium. In this model, vehicles loading at each origin at each time interval are assumed to choose an evacuation route under determinate road network, signal design, and OD demand. As a case study, the proposed model is validated on the network nearby Nanjing Olympic Center after the opening ceremony of the 10th National Games of the People's Republic of China. The traffic volumes and clearing time at five exit points of the evacuation zone are calculated by the model to compare with survey data. The results show that this model can appropriately simulate the dynamic route choice and evolution process of the traffic flow on the network in an evacuation situation.

Solving a multi-objective location routing problem for infectious waste disposal using hybrid goal programming and hybrid genetic algorithm

Directory of Open Access Journals (Sweden)

Narong Wichapa

2018-01-01

Full Text Available Infectious waste disposal remains one of the most serious problems in the medical, social and environmental domains of almost every country. Selection of new suitable locations and finding the optimal set of transport routes for a fleet of vehicles to transport infectious waste material, location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Determining locations for infectious waste disposal is a difficult and complex process, because it requires combining both intangible and tangible factors. Additionally, it depends on several criteria and various regulations. This facility location problem for infectious waste disposal is complicated, and it cannot be addressed using any stand-alone technique. Based on a case study, 107 hospitals and 6 candidate municipalities in Upper-Northeastern Thailand, we considered criteria such as infrastructure, geology and social & environmental criteria, evaluating global priority weights using the fuzzy analytical hierarchy process (Fuzzy AHP. After that, a new multi-objective facility location problem model which hybridizes fuzzy AHP and goal programming (GP, namely the HGP model, was tested. Finally, the vehicle routing problem (VRP for a case study was formulated, and it was tested using a hybrid genetic algorithm (HGA which hybridizes the push forward insertion heuristic (PFIH, genetic algorithm (GA and three local searches including 2-opt, insertion-move and interexchange-move. The results show that both the HGP and HGA can lead to select new suitable locations and to find the optimal set of transport routes for vehicles delivering infectious waste material. The novelty of the proposed methodologies, HGP, is the simultaneous combination of relevant factors that are difficult to interpret and cost factors in order to determine new suitable locations, and HGA can be applied to determine the transport routes which provide a minimum number of vehicles

Application Of Kalman Filter In Navigation Process Of Automated Guided Vehicles

Directory of Open Access Journals (Sweden)

Śmieszek Mirosław

2015-09-01

Full Text Available In the paper an example of application of the Kalman filtering in the navigation process of automatically guided vehicles was presented. The basis for determining the position of automatically guided vehicles is odometry – the navigation calculation. This method of determining the position of a vehicle is affected by many errors. In order to eliminate these errors, in modern vehicles additional systems to increase accuracy in determining the position of a vehicle are used. In the latest navigation systems during route and position adjustments the probabilistic methods are used. The most frequently applied are Kalman filters.

A location-routing problem model with multiple periods and fuzzy demands

Directory of Open Access Journals (Sweden)

Ali Nadizadeh

2014-08-01

Full Text Available This paper puts forward a dynamic capacitated location-routing problem with fuzzy demands (DCLRP-FD. It is given on input a set of identical vehicles (each having a capacity, a fixed cost and availability level, a set of depots with restricted capacities and opening costs, a set of customers with fuzzy demands, and a planning horizon with multiple periods. The problem consists of determining the depots to be opened only in the first period of the planning horizon, the customers and the vehicles to be assigned to each opened depot, and performing the routes that may be changed in each time period due to fuzzy demands. A fuzzy chance-constrained programming (FCCP model has been designed using credibility theory and a hybrid heuristic algorithm with four phases is presented in order to solve the problem. To obtain the best value of the fuzzy parameters of the model and show the influence of the availability level of vehicles on final solution, some computational experiments are carried out. The validity of the model is then evaluated in contrast with CLRP-FD's models in the literature. The results indicate that the model and the proposed algorithm are robust and could be used in real world problems.

Revealed Preference Methods for Studying Bicycle Route Choice—A Systematic Review

Directory of Open Access Journals (Sweden)

Ray Pritchard

2018-03-01

Full Text Available One fundamental aspect of promoting utilitarian bicycle use involves making modifications to the built environment to improve the safety, efficiency and enjoyability of cycling. Revealed preference data on bicycle route choice can assist greatly in understanding the actual behaviour of a highly heterogeneous group of users, which in turn assists the prioritisation of infrastructure or other built environment initiatives. This systematic review seeks to compare the relative strengths and weaknesses of the empirical approaches for evaluating whole journey route choices of bicyclists. Two electronic databases were systematically searched for a selection of keywords pertaining to bicycle and route choice. In total seven families of methods are identified: GPS devices, smartphone applications, crowdsourcing, participant-recalled routes, accompanied journeys, egocentric cameras and virtual reality. The study illustrates a trade-off in the quality of data obtainable and the average number of participants. Future additional methods could include dockless bikeshare, multiple camera solutions using computer vision and immersive bicycle simulator environments.

Gasoline taxes or efficiency standards? A heterogeneous household demand analysis

International Nuclear Information System (INIS)

Liu, Weiwei

2015-01-01

Using detailed consumer expenditure survey data and a flexible semiparametric dynamic demand model, this paper estimates the price elasticity and fuel efficiency elasticity of gasoline demand at the household level. The goal is to assess the effectiveness of gasoline taxes and vehicle fuel efficiency standards on fuel consumption. The results reveal substantial interaction between vehicle fuel efficiency and the price elasticity of gasoline demand: the improvement of vehicle fuel efficiency leads to lower price elasticity and weakens consumers’ sensitivity to gasoline price changes. The offsetting effect also differs across households due to demographic heterogeneity. These findings imply that when gasoline taxes are in place, tightening efficiency standards will partially offset the strength of taxes on reducing fuel consumption. - Highlights: • Model household gasoline demand using a semiparametric approach. • Estimate heterogeneous price elasticity and fuel efficiency elasticity. • Assess the effectiveness of gasoline taxes and efficiency standards. • Efficiency standards offset the impact of gasoline taxes on fuel consumption. • The offsetting effect differs by household demographics

Eco-driving : strategic, tactical, and operational decisions of the driver that improve vehicle fuel economy.

Science.gov (United States)

2011-08-01

"This report presents information about the effects of decisions that a driver can make to : influence on-road fuel economy of light-duty vehicles. These include strategic decisions : (vehicle selection and maintenance), tactical decisions (route sel...

An Ultra-Low-Latency Geo-Routing Scheme for Team-Based Unmanned Vehicular Applications

KAUST Repository

Bader, Ahmed

2016-02-26

Results and lessons learned from the implementation of a novel ultra low-latency geo-routing scheme are presented in this paper. The geo-routing scheme is intended for team-based mobile systems whereby a cluster of unmanned autonomous vehicles are deployed to accomplish a critical mission under human supervision. The contention-free nature of the developed scheme lends itself to jointly achieve lower latency and higher throughput. Implementation challenges are presented and corresponding resolutions are discussed herewith. © 2015 IEEE.

Enabling Routes as Context in Mobile Services

DEFF Research Database (Denmark)

Brilingaite, Agne; Jensen, Christian Søndergaard; Zokaite, Nora

With the continuing advances in wireless communications, geo-positioning, and portable electronics, an infrastructure is emerging that enables the delivery of on-line, location-enabled services to very large numbers of mobile users. A typical usage situation for mobile services is one characteriz...... and accumulates the routes of a user along with their usage patterns and that makes the routes available to services. Experiences from using the component on logs of GPS positions acquired from vehicles traveling within a real road network are reported....... by a small screen and no keyboard, and by the service being only a secondary focus of the user. Under such circumstances, it is particularly important to deliver the "right" information and service at the right time, with as little user interaction as possible. This may be achieved by making services context...

Determining the Effectiveness of Incorporating Geographic Information Into Vehicle Performance Algorithms

Energy Technology Data Exchange (ETDEWEB)

Sera White

2012-04-01

This thesis presents a research study using one year of driving data obtained from plug-in hybrid electric vehicles (PHEV) located in Sacramento and San Francisco, California to determine the effectiveness of incorporating geographic information into vehicle performance algorithms. Sacramento and San Francisco were chosen because of the availability of high resolution (1/9 arc second) digital elevation data. First, I present a method for obtaining instantaneous road slope, given a latitude and longitude, and introduce its use into common driving intensity algorithms. I show that for trips characterized by >40m of net elevation change (from key on to key off), the use of instantaneous road slope significantly changes the results of driving intensity calculations. For trips exhibiting elevation loss, algorithms ignoring road slope overestimated driving intensity by as much as 211 Wh/mile, while for trips exhibiting elevation gain these algorithms underestimated driving intensity by as much as 333 Wh/mile. Second, I describe and test an algorithm that incorporates vehicle route type into computations of city and highway fuel economy. Route type was determined by intersecting trip GPS points with ESRI StreetMap road types and assigning each trip as either city or highway route type according to whichever road type comprised the largest distance traveled. The fuel economy results produced by the geographic classification were compared to the fuel economy results produced by algorithms that assign route type based on average speed or driving style. Most results were within 1 mile per gallon ({approx}3%) of one another; the largest difference was 1.4 miles per gallon for charge depleting highway trips. The methods for acquiring and using geographic data introduced in this thesis will enable other vehicle technology researchers to incorporate geographic data into their research problems.

Evaluating effectiveness of real-time advanced traveler information systems using a small test vehicle fleet

Science.gov (United States)

1997-01-01

ADVANCE was an in-vehicle advanced traveler information system (ATIS) providing route guidance in real time that operated in the northwestern portion and northwest suburbs of Chicago, Illinois. It used probe vehicles to generate dynamically travel ti...

Short Term Strategies for a Dynamic Multi-Period Routing Problem

NARCIS (Netherlands)

Angelelli, E.; Bianchessi, N.; Mansini, R.; Speranza, M. G.

2009-01-01

We consider a Dynamic Multi-Period Routing Problem (DMPRP) faced by a company which deals with on-line pick-up requests and has to serve them by a fleet of uncapacitated vehicles over a finite time horizon. When a request is issued, a deadline of a given number of days d ≤ 2 is associated to it: if

Calculation of population doses with RADTRAN for route segments that have an unpopulated near-field region

International Nuclear Information System (INIS)

Kanipe, F.L.; Neuhauser, S.; Sprung, J.L.

1998-03-01

The RADTRAN code (Neuhauser and Kanipe, 1994) models the radiological consequences of the transportation of radioactive materials, both the exposures that will occur if the transport occurs without incident, and the exposures that may occur should the transport vehicle be involved in an accident while en route. Because accidents might occur at any point along a transportation route, RADTRAN divides the route into segments (links) and uses a uniform population density and constant meteorological conditions (wind speed and atmospheric stability) to represent the population and weather characteristics of each route segment. A way to perform RADTRAN calculations, that allows an unpopulated near-field region along a transportation link to be approximately modeled, is described, validated, and then illustratively applied to a coastal sailing route

Heterogeneously catalyzed reactive extraction for biomass valorization into chemicals and fuels

NARCIS (Netherlands)

Ordomskiy, V.; Khodakov, A.Y.; Nijhuis, T.A.; Schouten, J.C.

2015-01-01

This paper focuses on the heterogeneously catalyzed reactive extraction and separation in reaction steps in organic and aqueous phases during the transformation of biomass derived products. Two approaches are demonstrated for decomposing and preserving routes for biomass transformation into valuable

Development of Degree-of-Priority Based Control Strategy for Emergency Vehicle Preemption Operation

Directory of Open Access Journals (Sweden)

Jiawen Wang

2013-01-01

Full Text Available This paper proposes a degree-of-priority based control strategy for emergency vehicle preemption operation to decrease the impacts of emergency vehicles on normal traffic. The proposed model features its effectiveness to the following three aspects: (1 a multilayer fuzzy model was established to determine the degree-of-priority based on emergency vehicle preemption demand intensity and preemption influence intensity; (2 for emergency vehicles with proper classification, a travel time estimation model for emergency traffic was formulated, an optimal emergency route determines model based on the level of priority of emergency events, and the emergency vehicle travel time was developed to minimize evacuation time as well as minimize the adverse impacts of preemption on normal traffic; and (3 a conditional traffic signals priority control method at each intersection of the evacuation route was built, so that traffic queue at each intersection can be cleared before the arrival of emergency vehicles. A simulation model based on field data was developed, and the performance of the proposed strategy was compared with the conventional local detection based method under the microscopic simulation model. The results validated the efficiency of the proposed strategy in terms of minimizing the delay of emergency vehicles and reducing adverse impacts on normal traffic.

Eco-routing: More green drivers means more benefits?

Energy Technology Data Exchange (ETDEWEB)

Valdes Serrano, C.; Perez Prada, F.; Monzon de Caceres, A.

2016-07-01

Information and Communications Technology (ICT)/Information and Technology Services (ITS) can play an important role in the transport sector, helping in maintaining accessibility and contemporarily optimizing the use of the vehicles. Among these ICT measures, eco-routing seems a promising one. Drivers normally follow the route which minimizes their generalized costs, normally time and money. But environmental concern is increasing, and drivers are starting to think about the effects of their driving. This means including CO2 emissions or fuel consumption in their route choice. But is this always positive, independently of the traffic situation and the penetration level of green drivers? This articles aims to analyze what happens in terms of fuel consumption, CO2 emissions and travel time, when different penetration levels of drivers, and with different traffic situations, follow the route of minimum fuel consumption instead of the conventional generalized costs. The analysis is based on a modelling process using a transport model of the whole region of Madrid. A total of 18 scenarios are considered: 3 reference scenarios (for congested, medium and low flow traffic situations), and 5 different penetration levels of green drivers for each traffic situation. Results show how impact varies substantially with the level of traffic and, also, that the more the best is not always true. (Author)

Prospect theory based estimation of drivers' risk attitudes in route choice behaviors.

Science.gov (United States)

Zhou, Lizhen; Zhong, Shiquan; Ma, Shoufeng; Jia, Ning

2014-12-01

This paper applied prospect theory (PT) to describe drivers' route choice behavior under Variable Message Sign (VMS), which presented visual traffic information to assist them to make route choice decisions. A quite rich empirical data from questionnaire and field spot was used to estimate parameters of PT. In order to make the parameters more realistic with drivers' attitudes, they were classified into different types by significant factors influencing their behaviors. Based on the travel time distribution of alternative routes and route choice results from questionnaire, the parameterized value function of each category was figured out, which represented drivers' risk attitudes and choice characteristics. The empirical verification showed that the estimates were acceptable and effective. The result showed drivers' risk attitudes and route choice characteristics could be captured by PT under real-time information shown on VMS. For practical application, once drivers' route choice characteristics and parameters were identified, their route choice behavior under different road conditions could be predicted accurately, which was the basis of traffic guidance measures formulation and implementation for targeted traffic management. Moreover, the heterogeneous risk attitudes among drivers should be considered when releasing traffic information and regulating traffic flow. Copyright © 2014 Elsevier Ltd. All rights reserved.

Incorporating location, routing, and inventory decisions in a bi-objective supply chain design problem with risk-pooling

Science.gov (United States)

Tavakkoli-Moghaddam, Reza; Forouzanfar, Fateme; Ebrahimnejad, Sadoullah

2013-07-01

This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to customer in a stochastic supply chain system, simultaneously. This problem is formulated as a bi-objective stochastic mixed-integer nonlinear programming model. The aim of this model is to determine the number of located distribution centers, their locations, and capacity levels, and allocating customers to distribution centers and distribution centers to suppliers. It also determines the inventory control decisions on the amount of ordered products and the amount of safety stocks at each opened DC, selecting a type of vehicle for transportation. Moreover, it determines routing decisions, such as determination of vehicles' routes starting from an opened distribution center to serve its allocated customers and returning to that distribution center. All are done in a way that the total system cost and the total transportation time are minimized. The Lingo software is used to solve the presented model. The computational results are illustrated in this paper.

Catalytic acetoxylation of lactic acid to 2-acetoxypropionic acid, en route to acrylic acid

NARCIS (Netherlands)

Beerthuis, R.; Granollers, M.; Brown, D.R.; Salavagione, H.J.; Rothenberg, G.; Shiju, N.R.

2015-01-01

We present an alternative synthetic route to acrylic acid, starting from the platform chemical lactic acid and using heterogeneous catalysis. To improve selectivity, we designed an indirect dehydration reaction that proceeds via acetoxylation of lactic acid to 2-acetoxypropionic acid. This

Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time.

Science.gov (United States)

Avellar, Gustavo S C; Pereira, Guilherme A S; Pimenta, Luciano C A; Iscold, Paulo

2015-11-02

This paper presents a solution for the problem of minimum time coverage of ground areas using a group of unmanned air vehicles (UAVs) equipped with image sensors. The solution is divided into two parts: (i) the task modeling as a graph whose vertices are geographic coordinates determined in such a way that a single UAV would cover the area in minimum time; and (ii) the solution of a mixed integer linear programming problem, formulated according to the graph variables defined in the first part, to route the team of UAVs over the area. The main contribution of the proposed methodology, when compared with the traditional vehicle routing problem's (VRP) solutions, is the fact that our method solves some practical problems only encountered during the execution of the task with actual UAVs. In this line, one of the main contributions of the paper is that the number of UAVs used to cover the area is automatically selected by solving the optimization problem. The number of UAVs is influenced by the vehicles' maximum flight time and by the setup time, which is the time needed to prepare and launch a UAV. To illustrate the methodology, the paper presents experimental results obtained with two hand-launched, fixed-wing UAVs.

Network Provisioning for High Speed Vehicles Moving along Predictable Routes - Part 1: Spiderman Handover

OpenAIRE

Maureira , Juan-Carlos; Dujovne , Diego; Dalle , Olivier

2009-01-01

This report presents our on-going work on a new system designed to provide a continuous network connectivity to communicating devices located on-board a vehicle moving at ”high speed” with a predictable trajectory such as trains, subways or buses. The devices on-board the vehicle form a sub-network called the ”in-motion network”. This system we propose is composed of two parts. The mobile part, called Spiderman Device (SD), installed on the roof of the vehicle, and the fixed part is composed ...

Route planning of separate waste collection on a small settlement

Directory of Open Access Journals (Sweden)

Bogna MRÓWCZYŃSKA

2014-03-01

Full Text Available Waste collection problems are one of the most important logistic tasks to solve. The paper deals with the optimization of vehicle routes, which is one of the ways of reducing costs of waste collection. In this paper it was formulated the problem of optimization for a single vehicle. This task can be reduced to the Euler’s problem in the mathematical sense. The task was resolved using artificial immune systems. The methods have been adapted to solve real problems of selective waste collection on a small settlement. The solutions were discussed. It was described further plans for the development of methods for waste collection needs.

An Optimization Routing Algorithm for Green Communication in Underground Mines

Directory of Open Access Journals (Sweden)

Heng Xu

2018-06-01

Full Text Available With the long-term dependence of humans on ore-based energy, underground mines are utilized around the world, and underground mining is often dangerous. Therefore, many underground mines have established networks that manage and acquire information from sensor nodes deployed on miners and in other places. Since the power supplies of many mobile sensor nodes are batteries, green communication is an effective approach of reducing the energy consumption of a network and extending its longevity. To reduce the energy consumption of networks, all factors that negatively influence the lifetime should be considered. The degree constraint minimum spanning tree (DCMST is introduced in this study to consider all the heterogeneous factors and assign weights for the next step of the evaluation. Then, a genetic algorithm (GA is introduced to cluster sensor nodes in the network and balance energy consumption according to several heterogeneous factors and routing paths from DCMST. Based on a comparison of the simulation results, the optimization routing algorithm proposed in this study for use in green communication in underground mines can effectively reduce the network energy consumption and extend the lifetimes of networks.

Study of Car Acceleration and Deceleration Characteristics at Dangerous Route FT050

Science.gov (United States)

Omar, N.; Prasetijo, J.; Daniel, B. D.; Abdullah, M. A. E.; Ismail, I.

2018-04-01

Individual vehicle acceleration and deceleration are important to generate vehicles speed profile. This study covered acceleration and deceleration characteristics of passenger car in Federal Route FT050 Jalan Batu Pahat-Ayer Hitam that was the top ranking dangerous road. Global Positioning System was used to record 10 cars speed to develop speed profile with clustering zone. At the acceleration manoeuver, the acceleration rate becomes lower as the drivers get near to desired speed. While, at deceleration manoeuver, vehicles with high speed needs more time to stop compare to low speed vehicle. This is because, the drivers need to accelerate more from zero speed to achieve desired speed and drivers need more distance and time to stop their vehicles. However, it was found out that 30% to 50% are driving in dangerous condition that was proven in clustering acceleration and deceleration speed profile. As conclusion, this excessive drivers are the factor that creating high risk in rear-end collision that inline FT050 as dangerous road in Malaysia

Implementation of a Low-Latency Contention-Free Geographical Routing Scheme for Mobile Cyber-Physical Systems

KAUST Repository

Bader, Ahmed

2015-07-09

Results and lessons learned from the implementation of a novel ultra low-latency geo-routing scheme are presented in this paper. The geo-routing scheme is intended for team-based mobile cyber-physical systems whereby a cluster of unmanned vehicles (robots) are deployed to accomplish a critical mission under human supervision. The contention-free nature of the developed scheme lends itself to jointly achieve lower latency and higher throughput. Implementation challenges are presented and corresponding resolutions are discussed herewith.

Quantifying the Effects of Idle-Stop Systems on Fuel Economy in Light-Duty Passenger Vehicles

Energy Technology Data Exchange (ETDEWEB)

Jeff Wishart; Matthew Shirk

2012-12-01

Vehicles equipped with idle-stop (IS) systems are capable of engine shut down when the vehicle is stopped and rapid engine re-start for the vehicle launch. This capability reduces fuel consumption and emissions during periods when the engine is not being utilized to provide propulsion or to power accessories. IS systems are a low-cost and fast-growing technology in the industry-wide pursuit of increased vehicle efficiency, possibly becoming standard features in European vehicles in the near future. In contrast, currently there are only three non-hybrid vehicle models for sale in North America with IS systems and these models are distinctly low-volume models. As part of the United States Department of Energy’s Advanced Vehicle Testing Activity, ECOtality North America has tested the real-world effect of IS systems on fuel consumption in three vehicle models imported from Europe. These vehicles were chosen to represent three types of systems: (1) spark ignition with 12-V belt alternator starter; (2) compression ignition with 12-V belt alternator starter; and (3) direct-injection spark ignition, with 12-V belt alternator starter/combustion restart. The vehicles have undergone both dynamometer and on-road testing; the test results show somewhat conflicting data. The laboratory data and the portion of the on-road data in which driving is conducted on a prescribed route with trained drivers produced significant fuel economy improvement. However, the fleet data do not corroborate improvement, even though the data show significant engine-off time. It is possible that the effects of the varying driving styles and routes in the fleet testing overshadowed the fuel economy improvements. More testing with the same driver over routes that are similar with the IS system-enabled and disabled is recommended. There is anecdotal evidence that current Environmental Protection Agency fuel economy test procedures do not capture the fuel economy gains that IS systems produce in real

Traveling by Bus Instead of Car on Urban Major Roads: Safety Benefits for Vehicle Occupants, Pedestrians, and Cyclists.

Science.gov (United States)

Morency, Patrick; Strauss, Jillian; Pépin, Félix; Tessier, François; Grondines, Jocelyn

2018-04-01

Some studies have estimated fatality and injury rates for bus occupants, but data was aggregated at the country level and made no distinction between bus types. Also, injured pedestrians and cyclists, as a result of bus travel, were overlooked. We compared injury rates for car and city bus occupants on specific urban major roads, as well as the cyclist and pedestrian injuries associated with car and bus travel. We selected ten bus routes along major urban arterials (in Montreal, Canada). Passenger-kilometers traveled were estimated from vehicle counts at intersections (2002-2010) and from bus passenger counts (2008). Police accident reports (2001-2010) provided injury data for all modes. Injury rates associated with car and bus travel were calculated for vehicle occupants, pedestrians, and cyclists. Injury rate ratios were also computed. The safety benefits of bus travel, defined as the number of vehicle occupant, cyclist, and pedestrian injuries saved, were estimated for each route. Overall, for all ten routes, the ratio between car and bus occupant injury rates is 3.7 (95% CI [3.4, 4.0]). The rates of pedestrian and cyclist injuries per hundred million passenger-kilometers are also significantly greater for car travel than that for bus travel: 4.1 (95% CI [3.5, 4.9]) times greater for pedestrian injuries; 5.3 (95% CI [3.8, 7.6]) times greater for cyclist injuries. Similar results were observed for fatally and severely injured vehicle occupants, cyclists, and pedestrians. At the route level, the safety benefits of bus travel increase with the difference in injury rate associated with car and bus travel but also with the amount of passenger-kilometers by bus. Results show that city bus is a safer mode than car, for vehicle occupants but also for cyclists and pedestrians traveling along these bus routes. The safety benefits of bus travel greatly vary across urban routes; this spatial variation is most likely linked to environmental factors. Understanding the

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

DEFF Research Database (Denmark)

Fukasawa, R.; Longo, H.; Lysgaard, Jens

2006-01-01

with a traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints. This is equivalent to a linear program with exponentially many variables and constraints that can lead to lower bounds that are superior to those given by previous methods. The resulting branch-and-cut-and-price...

Optimization of Parking Public Transport Vehicles in Ostrava

Directory of Open Access Journals (Sweden)

Dušan Teichmann

2015-03-01

Full Text Available A typical trait of public transport is a spatially scattered demand. A route net that is operated by a carrier (or several carriers has to be adapted to the demand. Public transport vehicles that are not used during a period of a day are usually parked in defined parking lots that have a given capacity. When the vehicle goes from the place where its schedule ends (usually a terminus of the last connection served by the vehicle to the place where the vehicle should be parked, a non-productive journey occurs. The same occurs at the beginning of the vehicle schedule as well. The main goal of the paper is to present a mathematical model that enables minimization of the total length of all the non-productive journeys. Functionality of the proposed mathematical model was tested in the conditions of a real bus public transport network.

On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment.

Science.gov (United States)

Alonso-Mora, Javier; Samaranayake, Samitha; Wallar, Alex; Frazzoli, Emilio; Rus, Daniela

2017-01-17

Ride-sharing services are transforming urban mobility by providing timely and convenient transportation to anybody, anywhere, and anytime. These services present enormous potential for positive societal impacts with respect to pollution, energy consumption, congestion, etc. Current mathematical models, however, do not fully address the potential of ride-sharing. Recently, a large-scale study highlighted some of the benefits of car pooling but was limited to static routes with two riders per vehicle (optimally) or three (with heuristics). We present a more general mathematical model for real-time high-capacity ride-sharing that (i) scales to large numbers of passengers and trips and (ii) dynamically generates optimal routes with respect to online demand and vehicle locations. The algorithm starts from a greedy assignment and improves it through a constrained optimization, quickly returning solutions of good quality and converging to the optimal assignment over time. We quantify experimentally the tradeoff between fleet size, capacity, waiting time, travel delay, and operational costs for low- to medium-capacity vehicles, such as taxis and van shuttles. The algorithm is validated with ∼3 million rides extracted from the New York City taxicab public dataset. Our experimental study considers ride-sharing with rider capacity of up to 10 simultaneous passengers per vehicle. The algorithm applies to fleets of autonomous vehicles and also incorporates rebalancing of idling vehicles to areas of high demand. This framework is general and can be used for many real-time multivehicle, multitask assignment problems.

Evolving Self-Organized Behavior for Homogeneous and Heterogeneous UAV or UCAV Swarms

National Research Council Canada - National Science Library

Price, Ian C

2006-01-01

This investigation uses a self-organization (SO) approach to enable cooperative search and destruction of retaliating targets with swarms of homogeneous and heterogeneous unmanned aerial vehicles (UAVs...

Network integration modelling of feeder and BRT(bus rapid transit) to reduce the usage of private vehicles in Palembang’s suburban area

Science.gov (United States)

Nur'afalia, D.; Afifa, F.; Rubianto, L.; Handayeni, K. D. M. E.

2018-01-01

The aim of this research is to determine the optimal feeder network route that integrates with BRT (Bus Rapid Transit). Palembang, a high growing population city with unresolved transportation demand sector. BRT as main public transportation could not fulfill people’s demand in transportation, especially in Alang-Alang Lebar sub-district. As an impact, the usage of private vehicles increases along the movement toward the city center. The concept of Network Integration that integrates feeder network with BRT is expected to be a solution to suppress the rate of private vehicles’ usage and to improve public transportation service, so that the use of BRT will be increased in the suburban area of Palembang. The method used to identifying the optimal route using Route Analysis method is route analysis using Tranetsim 0.4. The best route is obtained based on 156 movement samples. The result is 58,7% from 199 mobility’s potency of private vehicle usage’s can be reduced if there is a feeder network’s route in Alang-Alang Lebar’s sub-district. From the result, the existance of integration between feeder network and BRT is potential enough to reduce the usage of private vehicles and supports the sustainability of transportation mobility in Palembang City.

Adaptive local routing strategy on a scale-free network

International Nuclear Information System (INIS)

Feng, Liu; Han, Zhao; Ming, Li; Yan-Bo, Zhu; Feng-Yuan, Ren

2010-01-01

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies. (general)

Enhanced ant colony optimization for inventory routing problem

Science.gov (United States)

Wong, Lily; Moin, Noor Hasnah

2015-10-01

The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

Reliable Freestanding Position-Based Routing in Highway Scenarios

Science.gov (United States)

Galaviz-Mosqueda, Gabriel A.; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur

2012-01-01

Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159

Multidepot UAV Routing Problem with Weapon Configuration and Time Window

Directory of Open Access Journals (Sweden)

Tianren Zhou

2018-01-01

Full Text Available In recent wars, there is an increasing trend that unmanned aerial vehicles (UAVs are utilized to conduct military attacking missions. In this paper, we investigate a novel multidepot UAV routing problem with consideration of weapon configuration in the UAV and the attacking time window of the target. A mixed-integer linear programming model is developed to jointly optimize three kinds of decisions: the weapon configuration strategy in the UAV, the routing strategy of target, and the allocation strategy of weapons to targets. An adaptive large neighborhood search (ALNS algorithm is proposed for solving the problem, which is tested by randomly generated instances covering the small, medium, and large sizes. Experimental results confirm the effectiveness and robustness of the proposed ALNS algorithm.

49 CFR 37.73 - Purchase or lease of used non-rail vehicles by public entities operating fixed route systems.

Science.gov (United States)

2010-10-01

... public entities operating fixed route systems. 37.73 Section 37.73 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system purchasing or leasing, after August 25, 1990, a used bus or other used...

Research on vehicles and cargos matching model based on virtual logistics platform

Science.gov (United States)

Zhuang, Yufeng; Lu, Jiang; Su, Zhiyuan

2018-04-01

Highway less than truckload (LTL) transportation vehicles and cargos matching problem is a joint optimization problem of typical vehicle routing and loading, which is also a hot issue of operational research. This article based on the demand of virtual logistics platform, for the problem of the highway LTL transportation, the matching model of the idle vehicle and the transportation order is set up and the corresponding genetic algorithm is designed. Then the algorithm is implemented by Java. The simulation results show that the solution is satisfactory.

String Stability of Heterogeneous Platoons with Non-connected Automated Vehicles

NARCIS (Netherlands)

Wang, M.; Li, Honghai; GAO, Jian; Huang, Zichao; li, Bin; van Arem, B.

2017-01-01

It is expected that automated vehicles will gradually penetrate on public roads, resulting in mixed traffic in the next decades. This can impact traffic flow operations, especially the roadway capacity and flow stability. It is of paramount
importance to understand and predict the implications

A Study on International Multimodal Transport Networks from Korea to Central Asia: Focus on Secondhand Vehicles

Directory of Open Access Journals (Sweden)

Ying Wang

2016-03-01

Full Text Available Currently, high-income countries use multimodal transportation to export large quantities of secondhand vehicles to low-income countries. Secondhand vehicle export has shown its highest growth in recent years, especially in Korea. The problem of transporting secondhand vehicles from Korea to Central Asia is becoming an important issue, but few researchers are interested in it. The objective of this research is to determine the optimal transport network for exporting secondhand vehicles from Korea to Central Asian countries by combining experts’ opinions and real data from existing transport networks. The fuzzy Delphi method was applied to obtain factors to evaluate alternative multimodal transport networks for moving secondhand vehicles from Korea to Central Asian countries by judgment from experts. The analysis shows that among the five factors (total cost, total time, reliability, security, and transportation capability, total cost is the most considerable factor, followed by reliability, transportation capability, total time, and security. Additionally, in the mainly three multimodal transport networks, the sea+Trans-China Railway route is ranked first, followed by the sea+Trans-Siberian Railway and sea+truck routes.

49 CFR 37.71 - Purchase or lease of new non-rail vehicles by public entities operating fixed route systems.

Science.gov (United States)

2010-10-01

... public entities operating fixed route systems. 37.71 Section 37.71 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system making a solicitation after August 25, 1990, to purchase or lease a new bus...

The influence of fixed-route taxi on road accidents and air pollution

Directory of Open Access Journals (Sweden)

V. Fedotov

2006-03-01

Full Text Available The development of market economy in Russia expands the need for movement of groups of people of large mega cities on time to a place at simultaneous reduction of the number of groups with identical purposes. Therefore for many cities a wide use of fixed-route taxis the service of passengers at a constant increase of the numbers of routes and the numbers of transport units was characteristic. At the certain intensity of the movement of fixed-route taxis on separate sites of city highways the transport stream and the changing quality of environment raises the risk of road accident and becomes ecologically unsafe. The results of the estimation of the negative influence of fixed-route taxis in comparison with other categories of vehicles are presented. The research was made on city highways running through the zones with a greater number of cultural and community places, shopping centers and administrative establishments. Perspective ways of the increase of traffic safety and the decrease of concentration of harmful emissions are offered.

New Heterogeneous Clustering Protocol for Prolonging Wireless Sensor Networks Lifetime

Directory of Open Access Journals (Sweden)

Md. Golam Rashed

2014-06-01

Full Text Available Clustering in wireless sensor networks is one of the crucial methods for increasing of network lifetime. The network characteristics of existing classical clustering protocols for wireless sensor network are homogeneous. Clustering protocols fail to maintain the stability of the system, especially when nodes are heterogeneous. We have seen that the behavior of Heterogeneous-Hierarchical Energy Aware Routing Protocol (H-HEARP becomes very unstable once the first node dies, especially in the presence of node heterogeneity. In this paper we assume a new clustering protocol whose network characteristics is heterogeneous for prolonging of network lifetime. The computer simulation results demonstrate that the proposed clustering algorithm outperforms than other clustering algorithms in terms of the time interval before the death of the first node (we refer to as stability period. The simulation results also show the high performance of the proposed clustering algorithm for higher values of extra energy brought by more powerful nodes.

In-vehicle nitrogen dioxide concentrations in road tunnels

Science.gov (United States)

Martin, Ashley N.; Boulter, Paul G.; Roddis, Damon; McDonough, Liza; Patterson, Michael; Rodriguez del Barco, Marina; Mattes, Andrew; Knibbs, Luke D.

2016-11-01

There is a lack of knowledge regarding in-vehicle concentrations of nitrogen dioxide (NO2) during transit through road tunnels in urban environments. Furthermore, previous studies have tended to involve a single vehicle and the range of in-vehicle NO2 concentrations that vehicle occupants may be exposed to is not well defined. This study describes simultaneous measurements of in-vehicle and outside-vehicle NO2 concentrations on a route through Sydney, Australia that included several major tunnels, minor tunnels and busy surface roads. Tests were conducted on nine passenger vehicles to assess how vehicle characteristics and ventilation settings affected in-vehicle NO2 concentrations and the in-vehicle-to-outside vehicle (I/O) concentration ratio. NO2 was measured directly using a cavity attenuated phase shift (CAPS) technique that gave a high temporal and spatial resolution. In the major tunnels, transit-average in-vehicle NO2 concentrations were lower than outside-vehicle concentrations for all vehicles with cabin air recirculation either on or off. However, markedly lower I/O ratios were obtained with recirculation on (0.08-0.36), suggesting that vehicle occupants can significantly lower their exposure to NO2 in tunnels by switching recirculation on. The highest mean I/O ratios for NO2 were measured in older vehicles (0.35-0.36), which is attributed to older vehicles having higher air exchange rates. The results from this study can be used to inform the design and operation of future road tunnels and modelling of personal exposure to NO2.

Effects of vehicles and enhancers on transdermal delivery of clebopride.

Science.gov (United States)

Rhee, Yun-Seok; Huh, Jai-Yong; Park, Chun-Woong; Nam, Tae-Young; Yoon, Koog-Ryul; Chi, Sang-Cheol; Park, Eun-Seok

2007-09-01

The effects of vehicles and penetration enhancers on the skin permeation of clebopride were evaluated using Franz type diffusion cells fitted with excised rat dorsal skins. The binary vehicle system, diethylene glycol monoethyl ether/isopropyl myristate (40/60, w/w), significantly enhanced the skin permeation rate of clebopride. The skin permeation enhancers, oleic acid and ethanol when used in the binary vehicle system, resulted in relatively high clebopride skin permeation rates. A gel formulation consisting of 1.5% (w/w) clebopride, 5% (w/w) oleic acid, and 7% (w/w) gelling agent with the binary vehicle system resulted in a permeation rate of 28.90 microg/cm2/h. Overall, these results highlight the potential of clebopride formulation for the transdermal route.

Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

Directory of Open Access Journals (Sweden)

Amber Israr

2016-04-01

Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

Autonomous vehicles:challenges, opportunities, and future implications for transportation policies

Institute of Scientific and Technical Information of China (English)

Saeed Asadi Bagloee; Madjid Tavana; Mohsen Asadi; Tracey Oliver

2016-01-01

This study investigates the challenges and opportunities pertaining to transportation policies that may arise as a result of emerging autonomous vehicle (AV) technologies. AV technologies can decrease the trans-portation cost and increase accessibility to low-income households and persons with mobility issues. This emerg-ing technology also has far-reaching applications and implications beyond all current expectations. This paper provides a comprehensive review of the relevant literature and explores a broad spectrum of issues from safety to machine ethics. An indispensable part of a prospective AV development is communication over cars and infrastructure (connected vehicles). A major knowledge gap exists in AV technology with respect to routing behaviors. Connected-vehicle technology provides a great opportunity to imple-ment an efficient and intelligent routing system. To this end, we propose a conceptual navigation model based on a fleet of AVs that are centrally dispatched over a network seeking system optimization. This study contributes to the literature on two fronts: (i) it attempts to shed light on future opportunities as well as possible hurdles associated with AV technology;and (ii) it conceptualizes a navigation model for the AV which leads to highly efficient traffic circulations.

Trip Energy Estimation Methodology and Model Based on Real-World Driving Data for Green Routing Applications: Preprint

Energy Technology Data Exchange (ETDEWEB)

Holden, Jacob [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Van Til, Harrison J [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Wood, Eric W [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gonder, Jeffrey D [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhu, Lei [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2018-02-09

A data-informed model to predict energy use for a proposed vehicle trip has been developed in this paper. The methodology leverages nearly 1 million miles of real-world driving data to generate the estimation model. Driving is categorized at the sub-trip level by average speed, road gradient, and road network geometry, then aggregated by category. An average energy consumption rate is determined for each category, creating an energy rates look-up table. Proposed vehicle trips are then categorized in the same manner, and estimated energy rates are appended from the look-up table. The methodology is robust and applicable to almost any type of driving data. The model has been trained on vehicle global positioning system data from the Transportation Secure Data Center at the National Renewable Energy Laboratory and validated against on-road fuel consumption data from testing in Phoenix, Arizona. The estimation model has demonstrated an error range of 8.6% to 13.8%. The model results can be used to inform control strategies in routing tools, such as change in departure time, alternate routing, and alternate destinations to reduce energy consumption. This work provides a highly extensible framework that allows the model to be tuned to a specific driver or vehicle type.

A Hybrid Genetic Algorithm for Multi-Trip Green Capacitated Arc Routing Problem in the Scope of Urban Services

Directory of Open Access Journals (Sweden)

Erfan Babaee Tirkolaee

2018-04-01

Full Text Available Greenhouse gases (GHG are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy.

Modelling Stochastic Route Choice Behaviours with a Closed-Form Mixed Logit Model

Directory of Open Access Journals (Sweden)

Xinjun Lai

2015-01-01

Full Text Available A closed-form mixed Logit approach is proposed to model the stochastic route choice behaviours. It combines both the advantages of Probit and Logit to provide a flexible form in alternatives correlation and a tractable form in expression; besides, the heterogeneity in alternative variance can also be addressed. Paths are compared by pairs where the superiority of the binary Probit can be fully used. The Probit-based aggregation is also used for a nested Logit structure. Case studies on both numerical and empirical examples demonstrate that the new method is valid and practical. This paper thus provides an operational solution to incorporate the normal distribution in route choice with an analytical expression.

Understanding the Role of Built Environment in Reducing Vehicle Miles Traveled Accounting for Spatial Heterogeneity

Directory of Open Access Journals (Sweden)

Chuan Ding

2014-01-01

Full Text Available In recent years, increasing concerns over climate change and transportation energy consumption have sparked research into the influences of urban form and land use patterns on motorized travel, notably vehicle miles traveled (VMT. However, empirical studies provide mixed evidence of the influence of the built environment on travel. In particular, the role of density after controlling for the confounding factors (e.g., land use mix, average block size, and distance from CBD still remains unclear. The object of this study is twofold. First, this research provides additional insights into the effects of built environment factors on the work-related VMT, considering urban form measurements at both the home location and workplace simultaneously. Second, a cross-classified multilevel model using Bayesian approach is applied to account for the spatial heterogeneity across spatial units. Using Washington DC as our study area, the home-based work tour in the AM peak hours is used as the analysis unit. Estimation results confirmed the important role that the built environment at both home and workplace plays in affecting work-related VMT. In particular, the results reveal that densities at the workplace have more important roles than that at home location. These findings confirm that urban planning and city design should be part of the solution in stabilizing global climate and energy consumption.

An Improved Model for Headway-Based Bus Service Unreliability Prevention with Vehicle Load Capacity Constraint at Bus Stops

Directory of Open Access Journals (Sweden)

Weiya Chen

2012-01-01

Full Text Available This paper presents an improved model for improving headway-based bus route service reliability at bus stops using real-time preventive operation control, taking into account dynamic interaction among random passenger demand, stochastic driving conditions of route segments, and vehicle load capacity constraint. In this model, the real-time information of passenger demand and vehicle operation is involved to predict the imminent unacceptable headway deviation, in the case of which some in-time preventive control strategies are deployed according to the given control rules. As a case study, a single fixed bus route with high-frequency services was simulated and different scenarios of real-time preventive operation control were performed. Headway adherence and average passenger wait time were used to measure bus service reliability. The results show that the improved model is closer to the real bus route service, and using real-time information to predict potential service unreliability and trigger in-time preventive control can reduce bus bunching and avoid big gap.

Development of an Autonomous Vehicle for Weed and Crop Registration

DEFF Research Database (Denmark)

Pedersen, Tom Søndergaard; Nielsen, Kirsten Mølgaard; Andersen, Palle

the free height of the vehicle being developed in this work has been set to 0.5 m. The size and weight of the vehicle implies a power consumption of max 1.5 kW making electrical motors suitable for propulsion and steering. To make the operation affordable the vehicle should be unmanned requiring a high......The extension of information technology and computers on farming tools results in new possibilities for crop/weed handling. In this paper a system using an autonomous field robot (vehicle) able to make images in the field is described. In the recent farming has come to rely on intensive use...... communication system between the two. The base station is the main interface to the farmer. Based on farmer information a route plan for data collection is created in the base station and send to the vehicle. The vehicle collects field data using two cameras one determinates the total weed pressure and one...

Be-safe travel, a web-based geographic application to explore safe-route in an area

Science.gov (United States)

Utamima, Amalia; Djunaidy, Arif

2017-08-01

In large cities in developing countries, the various forms of criminality are often found. For instance, the most prominent crimes in Surabaya, Indonesia is 3C, that is theft with violence (curas), theft by weighting (curat), and motor vehicle theft (curanmor). 3C case most often occurs on the highway and residential areas. Therefore, new entrants in an area should be aware of these kind of crimes. Route Planners System or route planning system such as Google Maps only consider the shortest distance in the calculation of the optimal route. The selection of the optimal path in this study not only consider the shortest distance, but also involves other factors, namely the security level. This research considers at the need for an application to recommend the safest road to be passed by the vehicle passengers while drive an area. This research propose Be-Safe Travel, a web-based application using Google API that can be accessed by people who like to drive in an area, but still lack of knowledge of the pathways which are safe from crime. Be-Safe Travel is not only useful for the new entrants, but also useful for delivery courier of valuables goods to go through the safest streets.

Cognitive Routing in Software-Defined Underwater Acoustic Networks

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2017-12-01

Full Text Available There are two different types of primary users (natural acoustic and artificial acoustic, and there is a long propagation delay for acoustic links in underwater cognitive acoustic networks (UCANs. Thus, the selection of a stable route is one of the key design factors for improving overall network stability, thereby reducing end-to-end delay. Software-defined networking (SDN is a novel approach that improves network intelligence. To this end, we propose a novel SDN-based routing protocol for UCANs in order to find a stable route between source and destination. A main controller is placed in a surface buoy that is responsible for the global view of the network, whereas local controllers are placed in different autonomous underwater vehicles (AUVs that are responsible for a localized view of the network. The AUVs have fixed trajectories, and sensor nodes within transmission range of the AUVs serve as gateways to relay the gathered information to the controllers. This is an SDN-based underwater communications scheme whereby two nodes can only communicate when they have a consensus about a common idle channel. To evaluate our proposed scheme, we perform extensive simulations and improve network performance in terms of end-to-end delay, delivery ratio, and overhead.

An Optimized, Data Distribution Service-Based Solution for Reliable Data Exchange Among Autonomous Underwater Vehicles

Directory of Open Access Journals (Sweden)

Jesús Rodríguez-Molina

2017-08-01

Full Text Available Major challenges are presented when managing a large number of heterogeneous vehicles that have to communicate underwater in order to complete a global mission in a cooperative manner. In this kind of application domain, sending data through the environment presents issues that surpass the ones found in other overwater, distributed, cyber-physical systems (i.e., low bandwidth, unreliable transport medium, data representation and hardware high heterogeneity. This manuscript presents a Publish/Subscribe-based semantic middleware solution for unreliable scenarios and vehicle interoperability across cooperative and heterogeneous autonomous vehicles. The middleware relies on different iterations of the Data Distribution Service (DDS software standard and their combined work between autonomous maritime vehicles and a control entity. It also uses several components with different functionalities deemed as mandatory for a semantic middleware architecture oriented to maritime operations (device and service registration, context awareness, access to the application layer where other technologies are also interweaved with middleware (wireless communications, acoustic networks. Implementation details and test results, both in a laboratory and a deployment scenario, have been provided as a way to assess the quality of the system and its satisfactory performance.

An Optimized, Data Distribution Service-Based Solution for Reliable Data Exchange Among Autonomous Underwater Vehicles.

Science.gov (United States)

Rodríguez-Molina, Jesús; Bilbao, Sonia; Martínez, Belén; Frasheri, Mirgita; Cürüklü, Baran

2017-08-05

Major challenges are presented when managing a large number of heterogeneous vehicles that have to communicate underwater in order to complete a global mission in a cooperative manner. In this kind of application domain, sending data through the environment presents issues that surpass the ones found in other overwater, distributed, cyber-physical systems (i.e., low bandwidth, unreliable transport medium, data representation and hardware high heterogeneity). This manuscript presents a Publish/Subscribe-based semantic middleware solution for unreliable scenarios and vehicle interoperability across cooperative and heterogeneous autonomous vehicles. The middleware relies on different iterations of the Data Distribution Service (DDS) software standard and their combined work between autonomous maritime vehicles and a control entity. It also uses several components with different functionalities deemed as mandatory for a semantic middleware architecture oriented to maritime operations (device and service registration, context awareness, access to the application layer) where other technologies are also interweaved with middleware (wireless communications, acoustic networks). Implementation details and test results, both in a laboratory and a deployment scenario, have been provided as a way to assess the quality of the system and its satisfactory performance.

Electric Vehicles in Logistics and Transportation: A Survey on Emerging Environmental, Strategic, and Operational Challenges

OpenAIRE

Juan, Angel Alejandro; Mendez, Carlos Alberto; Faulin, Javier; de Armas, Jesica; Grasman, Scott

2017-01-01

Current logistics and transportation (L&T) systems include heterogeneous fleets consisting of common internal combustion engine vehicles as well as other types of vehicles using ?green? technologies, e.g., plug-in hybrid electric vehicles and electric vehicles (EVs). However, the incorporation of EVs in L&T activities also raise some additional challenges from the strategic, planning, and operational perspectives. For instance, smart cities are required to provide recharge stations for electr...

Performance of electric and hybrid vehicles at the 1995 American Tour de Sol

Energy Technology Data Exchange (ETDEWEB)

Quong, S.; LeBlanc, N.; Buitrago, C.; Duoba, M.; Larsen, R.

1995-12-31

Energy consumption and performance data were collected on more than 40 electric and hybrid vehicles during the 1995 American Tour de Sol. At this competition, one electric vehicle drove 229 miles on one charge using nickel metalhydride batteries. The results obtained from the data show that electric vehicle efficiencies reached 9.07 mi./kWh or 70 equivalent mpg of gasoline when compared to the total energy cycle efficiency of electricity and gasoline. A gasoline-fueled 1995 Geo Metro that drove the same route attained 36.4 mpg.

Optimizing Performance of at-grade Intersection with Bus Rapid Transit Corridor and Heterogeneous Traffic

Directory of Open Access Journals (Sweden)

Hemant Kumar Sharma

2012-06-01

Full Text Available Bus Rapid Transit (BRT has emerged as a preferred mode of public transport in various countries all over the world for its cost effectiveness in construction as well as in operation and maintenance. The rapid transit feature of BRT is seen as a solution to many traffic problems in these countries. However, in developing countries like India, the right -of-way for most of the roads is restricted and traffic is heterogeneous in nature. Provision of BRT in existing right -of-way reduces the capacity available for other motorized traffic. As the buses travel with a certain frequency on dedicated bus- ways, the dedicated corridor remains unused for most of the period when other traffic on motorized vehicle (MV lanes suffers from congestion. The problem gets severe at intersections. However, if buses are operated in mixed traffic it is no more rapid transit. Hence, a solution is required to address this problem and optimize the performance of traffic as a whole. This paper presents the effect if dedicated bus-ways end at a reasonable distance before the stop line at a busy signalized at-grade intersection, and bus lanes (beyond that are made available to all the motorized vehicular traffic (heterogeneous traffic at intersection. The performance evaluation is done in terms of average queue length, maximum queue length, average delay time per vehicle, vehicle throughput, average speed in network and emission of Carbon monoxide CO, mono-nitrogen oxides NOx and Volatile organic compounds (VOC. It is observed that availability of bus lanes to other motorized traffic for a reasonable distance before intersection considerably reduces the average queue length, maximum queue length, average delay time per vehicle and emission per vehicle, while there is an increase in vehicle throughput and average speed of all the vehicles in the network. Thus it results in reduction of congestion and performance enhancement of at-grade intersections and network. Results of

Experimental Exploration of RSSI Model for the Vehicle Intelligent Position System

Directory of Open Access Journals (Sweden)

Zhichao Cao

2015-01-01

Full Text Available Vehicle intelligent position systems based on Received Signal Strength Indicator (RSSI in Wireless Sensor Networks (WSNs are efficiently utilized. The vehicle’s position accuracy is of great importance for transportation behaviors, such as dynamic vehicle routing problems and multiple pedestrian routing choice behaviors and so on. Therefore, a precise position and available optimization is necessary for total parameters of conventional RSSI model. In this papar, we investigate the experimental performance of translating the power measurements to corresponding distance between each pair of nodes. The priori knowledge about the environment interference could impact the accuracy of vehicles’s position and the reliability of paremeters greatly. Based on the real-world outdoor experiments, we compares different regression analysis of the RSSI model, in order to establish a calibration scheme on RSSI model. We showed that the average error of RSSI model is able to decrease throughout the rules of environmental factor n and shadowing factor ? respectively. Moreover, the calculation complexity is reduced. Since variation tendency of environmental factor n, shadowing factor ? with distance and signal strength could be simulated respectively, RSSI model fulfills the precision of the vehicle intelligent position system.

Prediction based Greedy Perimeter Stateless Routing Protocol for Vehicular Self-organizing Network

Science.gov (United States)

Wang, Chunlin; Fan, Quanrun; Chen, Xiaolin; Xu, Wanjin

2018-03-01

PGPSR (Prediction based Greedy Perimeter Stateless Routing) is based on and extended the GPSR protocol to adapt to the high speed mobility of the vehicle auto organization network (VANET) and the changes in the network topology. GPSR is used in the VANET network environment, the network loss rate and throughput are not ideal, even cannot work. Aiming at the problems of the GPSR, the proposed PGPSR routing protocol, it redefines the hello and query packet structure, in the structure of the new node speed and direction information, which received the next update before you can take advantage of its speed and direction to predict the position of node and new network topology, select the right the next hop routing and path. Secondly, the update of the outdated node information of the neighbor’s table is deleted in time. The simulation experiment shows the performance of PGPSR is better than that of GPSR.

Power-based electric vehicle energy consumption model: Model development and validation

International Nuclear Information System (INIS)

Fiori, Chiara; Ahn, Kyoungho; Rakha, Hesham A.

2016-01-01

Highlights: • The study developed an instantaneous energy consumption model (VT-CPEM) for EVs. • The model captures instantaneous braking energy regeneration. • The model can be used for transportation modeling and vehicle applications (e.g. eco-routing). • The proposed model can be easily calibrated using publically available EV data. • Usages of air conditioning and heating systems reduce EV energy consumption by up to 10% and 24%, respectively. - Abstract: The limited drive range (The maximum distance that an EV can travel.) of Electric Vehicles (EVs) is one of the major challenges that EV manufacturers are attempting to overcome. To this end, a simple, accurate, and efficient energy consumption model is needed to develop real-time eco-driving and eco-routing systems that can enhance the energy efficiency of EVs and thus extend their travel range. Although numerous publications have focused on the modeling of EV energy consumption levels, these studies are limited to measuring energy consumption of an EV’s control algorithm, macro-project evaluations, or simplified well-to-wheels analyses. Consequently, this paper addresses this need by developing a simple EV energy model that computes an EV’s instantaneous energy consumption using second-by-second vehicle speed, acceleration and roadway grade data as input variables. In doing so, the model estimates the instantaneous braking energy regeneration. The proposed model can be easily implemented in the following applications: in-vehicle, Smartphone eco-driving, eco-routing and transportation simulation software to quantify the network-wide energy consumption levels for a fleet of EVs. One of the main advantages of EVs is their ability to recover energy while braking using a regenerative braking system. State-of-the-art vehicle energy consumption models consider an average constant regenerative braking energy efficiency or regenerative braking factors that are mainly dependent on the vehicle’s average

Heterogeneous car buyers: a stylized fact

OpenAIRE

Ana M. Aizcorbe; Benjamin Bridgman; Jeremy J. Nalewaik

2009-01-01

Using a new dataset, we document a systematic pattern in the demographic characteristics of car buyers over the model year: as vehicle prices fall over the model year, so do buyer incomes. This pattern is consistent with price-insensitive buyers purchasing early in the year, while others wait until prices decline, and suggests price skimming (i.e. intertemporal price discrimination). Such consumer heterogeneity over the model year raises questions for measuring quality improvements in new goods.

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem

2013-01-01

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.

Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2013-07-01

This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.

Practicability of passenger vehicle driving emission tests according to new European Union procedures

Directory of Open Access Journals (Sweden)

Pielecha Jacek

2017-01-01

Full Text Available The article compares driving test data using the latest legislative proposals applicable to passenger cars. Several measurements were performed on the same test route in accordance with the RDE test guidelines, which requires a number of criteria to be met. These criteria include: the length of the measuring segments, their overall test time share, and the dynamic characteristics of the drive. A mobile device for reading the EOBD System information was used to record the engine and vehicle operating parameters during tests. This allowed for the monitoring of parameters such as: load value, engine speed and vehicle velocity. The obtained results were then analyzed for their compatibility with the RDE procedure requirements. Despite the same research route, the obtained results were not the same. The analysis also uses the two-dimensional operating time share characteristics expressed in vehicle velocity and acceleration co-ordinates. As a result it was possible to compare the dynamic properties, share of operating time and, consequently, to check the validity of conducted drive tests in terms of their practicability and emission values.

Route-external and route-internal landmarks in route descriptions : Effects of route length and map design

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

Landmarks are basic ingredients in route descriptions. They often mark choice points: locations where travellers choose from different options how to continue the route. This study focuses on one of the loose ends in the taxonomy of landmarks. In a memory-based production experiment in which

Gis-Based Route Finding Using ANT Colony Optimization and Urban Traffic Data from Different Sources

Science.gov (United States)

Davoodi, M.; Mesgari, M. S.

2015-12-01

Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD), Automatic Number Plate Recognition (ANPR), Floating Car Data (FCD), VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network) is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... popularity, which are enabled by common driving behaviors found in available trajectory data. The ability to evaluate the quality of routing services enables service providers to improve the quality of their services and enables users to identify the services that best serve their needs. The paper covers......Mobile location-based services is a very successful class of services that are being used frequently by users with GPS-enabled mobile devices such as smartphones. This paper presents a study of how to exploit GPS trajectory data, which is available in increasing volumes, for the assessment...

Developing a Distributed Consensus-Based Cooperative Adaptive Cruise Control System for Heterogeneous Vehicles with Predecessor Following Topology

Directory of Open Access Journals (Sweden)

Ziran Wang

2017-01-01

Full Text Available Connected and automated vehicle (CAV has become an increasingly popular topic recently. As an application, Cooperative Adaptive Cruise Control (CACC systems are of high interest, allowing CAVs to communicate with each other and coordinating their maneuvers to form platoons, where one vehicle follows another with a constant velocity and/or time headway. In this study, we propose a novel CACC system, where distributed consensus algorithm and protocol are designed for platoon formation, merging maneuvers, and splitting maneuvers. Predecessor following information flow topology is adopted for the system, where each vehicle only communicates with its following vehicle to reach consensus of the whole platoon, making the vehicle-to-vehicle (V2V communication fast and accurate. Moreover, different from most studies assuming the type and dynamics of all the vehicles in a platoon to be homogenous, we take into account the length, location of GPS antenna on vehicle, and braking performance of different vehicles. A simulation study has been conducted under scenarios including normal platoon formation, platoon restoration from disturbances, and merging and splitting maneuvers. We have also carried out a sensitivity analysis on the distributed consensus algorithm, investigating the effect of the damping gain on convergence rate, driving comfort, and driving safety of the system.