WorldWideScience

Sample records for dynamic vehicle routing

  1. 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...

  2. 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

  3. 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.

  4. 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...

  5. 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.

  6. 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....

  7. 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.

  8. 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.

  9. 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.

  10. 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.

  11. 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....

  12. The Pyramidal Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...

  13. The pyramidal capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2010-01-01

    This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

  14. 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....

  15. 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...

  16. Vehicle routing problem in investment fund allocation

    Science.gov (United States)

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

    2013-04-01

    Since its introduction by Dantzig and Ramser in 1959, vehicle routing problem keeps evolving in theories, applications and variability. The evolution in computing and technology are also important contributors to research in solving vehicle routing problem. The main sectors of interests among researchers and practitioners for vehicle routing problem are transportation, distribution and logistics. However, literature found that concept and benefits of vehicle routing problem are not taken advantages of by researchers in the field of investment. Other methods found used in investment include multi-objective programming, linear programming, goal programming and integer programming. Yet the application of vehicle routing problem is not fully explored. A proposal on a framework of the fund allocation optimization using vehicle routing problem is presented here. Preliminary results using FTSE Bursa Malaysia data testing the framework are also given.

  17. 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...

  18. 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

  19. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

    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...... 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....

  20. 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...

  1. 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...

  2. 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

  3. 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

  4. 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.

  5. 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

  6. 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.

  7. 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 ...

  8. 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.

  9. 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...

  10. 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...

  11. 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.

  12. 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.

  13. 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...

  14. Dynamic Weather Routes Architecture Overview

    Science.gov (United States)

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

    Dynamic Weather Routes Architecture Overview, presents the high level software architecture of DWR, based on the CTAS software framework and the Direct-To automation tool. The document also covers external and internal data flows, required dataset, changes to the Direct-To software for DWR, collection of software statistics, and the code structure.

  15. 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.

  16. 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...

  17. 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...

  18. 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...

  19. Vehicle Dynamics and Control

    CERN Document Server

    Rajamani, Rajesh

    2012-01-01

    Vehicle Dynamics and Control provides a comprehensive coverage of vehicle control systems and the dynamic models used in the development of these control systems. The control system applications covered in the book include cruise control, adaptive cruise control, ABS, automated lane keeping, automated highway systems, yaw stability control, engine control, passive, active and semi-active suspensions, tire-road friction coefficient estimation, rollover prevention, and hybrid electric vehicle. In developing the dynamic model for each application, an effort is made to both keep the model simple enough for control system design but at the same time rich enough to capture the essential features of the dynamics. A special effort has been made to explain the several different tire models commonly used in literature and to interpret them physically. In the second edition of the book, chapters on roll dynamics, rollover prevention and hybrid electric vehicles have been added, and the chapter on electronic stability co...

  20. 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.

  1. 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

  2. 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...

  3. 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.

  4. 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

  5. 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 ...

  6. Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

    Science.gov (United States)

    Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina

    2018-01-01

    The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.

  7. 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...

  8. Approximation Algorithm for a Heterogeneous Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Jungyun Bae

    2015-08-01

    Full Text Available This article addresses a fundamental path planning problem which aims to route a collection of heterogeneous vehicles such that each target location is visited by some vehicle and the sum of the travel costs of the vehicles is minimal. Vehicles are heterogeneous as the cost of traveling between any two locations depends on the type of the vehicle. Algorithms are developed for this path planning problem with bounds on the quality of the solutions produced by the algorithms. Computational results show that high quality solutions can be obtained for the path planning problem involving four vehicles and 40 targets using the proposed approach.

  9. 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...

  10. 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.

  11. Vehicle dynamics theory and application

    CERN Document Server

    Jazar, Reza N

    2017-01-01

    This intermediate textbook is appropriate for students in vehicle dynamics courses, in their last year of undergraduate study or their first year of graduate study. It is also appropriate for mechanical engineers, automotive engineers, and researchers in the area of vehicle dynamics for continuing education or as a reference. It addresses fundamental and advanced topics, and a basic knowledge of kinematics and dynamics, as well as numerical methods, is expected. The contents are kept at a theoretical-practical level, with a strong emphasis on application. This third edition has been reduced by 25%, to allow for coverage over one semester, as opposed to the previous edition that needed two semesters for coverage. The textbook is composed of four parts: Vehicle Motion: covers tire dynamics, forward vehicle dynamics, and driveline dynamics Vehicle Kinematics: covers applied kinematics, applied mechanisms, steering dynamics, and suspension mechanisms Vehicle Dynamics: covers applied dynamics, vehicle planar dynam...

  12. 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.

  13. 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.

  14. 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...

  15. Rail vehicle dynamics

    CERN Document Server

    Knothe, Klaus

    2017-01-01

    This book on the dynamics of rail vehicles is developed from the manuscripts for a class with the same name at TU Berlin. It is directed mainly to master students with pre-knowledge in mathematics and mechanics and engineers that want to learn more. The important phenomena of the running behaviour of rail vehicles are derived and explained. Also recent research results and experience from the operation of rail vehicles are included. One focus is the description of the complex wheel-rail contact phenomena that are essential to understand the concept of running stability and curving. A reader should in the end be able to understand the background of simulation tools that are used by the railway industry and universities today.

  16. 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...

  17. 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....

  18. Dynamic Escape Routes for Naval Ships

    National Research Council Canada - National Science Library

    Villalonga, Francisco J

    2005-01-01

    This thesis addresses the problem of optimal evacuation of a naval ship. We propose the use of a dynamic escape-route system which employs a signaling system to adapt the emergency egress process to the instigating contingency...

  19. 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

  20. Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

    OpenAIRE

    Wang, Qian; Ji, Qingkai; Chiu, Chun-Hung

    2014-01-01

    We present a metaheuristic called the reactive guided tabu search (RGTS) to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP), where a single vehicle is required for cotransporting multiple customer orders. MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection. In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces. To overcome this proble...

  1. Dynamic Routing during Disaster Events

    NARCIS (Netherlands)

    Fitrianie, S.; Rothkrantz, L.J.M.

    2015-01-01

    Innovations in mobile technology allow people to request route information on their smartphone to reach safe areas during emergency and disaster evacuations. In return, the affected people in the field can send their observation reports, e.g. using a dedicated icon-based disaster language. However,

  2. 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....

  3. 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.

  4. 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.

  5. 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

  6. 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...

  7. 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...

  8. 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...

  9. 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

  10. Phone Routing using the Dynamic Memory Model

    DEFF Research Database (Denmark)

    Bendtsen, Claus Nicolaj; Krink, Thiemo

    2002-01-01

    In earlier studies a genetic algorithm (GA) extended with the dynamic memory model has shown remarkable performance on real-world-like problems. In this paper we experiment with routing in communication networks and show that the dynamic memory GA performs remarkable well compared to ant colony...

  11. 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.

  12. 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.

  13. 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...

  14. 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.

  15. 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.

  16. 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.

  17. A green vehicle routing problem with customer satisfaction criteria

    Science.gov (United States)

    Afshar-Bakeshloo, M.; Mehrabi, A.; Safari, H.; Maleki, M.; Jolai, F.

    2016-12-01

    This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers' satisfaction have been taken into account. Meanwhile, the introduced model prepares an effective dashboard for decision-makers that determines appropriate routes, the best mixed fleet, speed and idle time of vehicles. Additionally, some new factors evaluate the greening of each decision based on three criteria. This model applies piecewise linear functions (PLFs) to linearize a nonlinear fuzzy interval for incorporating customers' satisfaction into other linear objectives. We have presented a mixed integer linear programming formulation for the S-GVRP. This model enriches managerial insights by providing trade-offs between customers' satisfaction, total costs and emission levels. Finally, we have provided a numerical study for showing the applicability of the model.

  18. 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.

  19. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

    Ng, Hok K.; Morando, Alex; Grabbe, Shon

    2010-01-01

    Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

  20. 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.

  1. Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

    Directory of Open Access Journals (Sweden)

    Qian Wang

    2014-01-01

    Full Text Available We present a metaheuristic called the reactive guided tabu search (RGTS to solve the heterogeneous fleet multicompartment vehicle routing problem (MCVRP, where a single vehicle is required for cotransporting multiple customer orders. MCVRP is commonly found in delivery of fashion apparel, petroleum distribution, food distribution, and waste collection. In searching the optimum solution of MCVRP, we need to handle a large amount of local optima in the solution spaces. To overcome this problem, we design three guiding mechanisms in which the search history is used to guide the search. The three mechanisms are experimentally demonstrated to be more efficient than the ones which only apply the known distance information. Armed with the guiding mechanisms and the well-known reactive mechanism, the RGTS can produce remarkable solutions in a reasonable computation time.

  2. 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.

  3. 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.

  4. 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...

  5. 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.

  6. 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...

  7. 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...

  8. 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

  9. 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.

  10. Dynamics of vehicle-road coupled system

    CERN Document Server

    Yang, Shaopu; Li, Shaohua

    2015-01-01

    Vehicle dynamics and road dynamics are usually considered to be two largely independent subjects. In vehicle dynamics, road surface roughness is generally regarded as random excitation of the vehicle, while in road dynamics, the vehicle is generally regarded as a moving load acting on the pavement. This book suggests a new research concept to integrate the vehicle and the road system with the help of a tire model, and establishes a cross-subject research framework dubbed vehicle-pavement coupled system dynamics. In this context, the dynamics of the vehicle, road and the vehicle-road coupled system are investigated by means of theoretical analysis, numerical simulations and field tests. This book will be a valuable resource for university professors, graduate students and engineers majoring in automotive design, mechanical engineering, highway engineering and other related areas. Shaopu Yang is a professor and deputy president of Shijiazhuang Tiedao University, China; Liqun Chen is a professor at Shanghai Univ...

  11. 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.

  12. 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.

  13. A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

    International Nuclear Information System (INIS)

    Onut, S; Kamber, M R; Altay, G

    2014-01-01

    Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time

  14. A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

    Science.gov (United States)

    Onut, S.; Kamber, M. R.; Altay, G.

    2014-03-01

    Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time.

  15. 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

  16. 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.

  17. 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...

  18. 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....

  19. 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...

  20. 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.

  1. Vehicle systems: coupled and interactive dynamics analysis

    Science.gov (United States)

    Vantsevich, Vladimir V.

    2014-11-01

    This article formulates a new direction in vehicle dynamics, described as coupled and interactive vehicle system dynamics. Formalised procedures and analysis of case studies are presented. An analytical consideration, which explains the physics of coupled system dynamics and its consequences for dynamics of a vehicle, is given for several sets of systems including: (i) driveline and suspension of a 6×6 truck, (ii) a brake mechanism and a limited slip differential of a drive axle and (iii) a 4×4 vehicle steering system and driveline system. The article introduces a formal procedure to turn coupled system dynamics into interactive dynamics of systems. A new research direction in interactive dynamics of an active steering and a hybrid-electric power transmitting unit is presented and analysed to control power distribution between the drive axles of a 4×4 vehicle. A control strategy integrates energy efficiency and lateral dynamics by decoupling dynamics of the two systems thus forming their interactive dynamics.

  2. 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...

  3. 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.

  4. Dynamics and Control of a Maglev Vehicle

    Directory of Open Access Journals (Sweden)

    Won ko

    2006-06-01

    Full Text Available In this paper, dynamics of a Maglev vehicle was analyzed and controls utilizing an optimized damping and an LQR algorithms were designed to stabilize the vehicle. The dynamics of magnetically levitated and propelled Maglev vehicle are complex and inherently unstable. Moreover, 6-DOF system dynamics is highly nonlinear and coupled. The proposed control schemes provide the dynamic stability and controllability, which computer simulations confirmed the effectiveness.

  5. Constraint Embedding for Vehicle Suspension Dynamics

    Directory of Open Access Journals (Sweden)

    Jain Abhinandan

    2016-06-01

    Full Text Available The goal of this research is to achieve close to real-time dynamics performance for allowing auto-pilot in-the-loop testing of unmanned ground vehicles (UGV for urban as well as off-road scenarios. The overall vehicle dynamics performance is governed by the multibody dynamics model for the vehicle, the wheel/terrain interaction dynamics and the onboard control system. The topic of this paper is the development of computationally efficient and accurate dynamics model for ground vehicles with complex suspension dynamics. A challenge is that typical vehicle suspensions involve closed-chain loops which require expensive DAE integration techniques. In this paper, we illustrate the use the alternative constraint embedding technique to reduce the cost and improve the accuracy of the dynamics model for the vehicle.

  6. Constraint Embedding for Vehicle Suspension Dynamics

    OpenAIRE

    Jain Abhinandan; Kuo Calvin; Jayakumar Paramsothy; Cameron Jonathan

    2016-01-01

    The goal of this research is to achieve close to real-time dynamics performance for allowing auto-pilot in-the-loop testing of unmanned ground vehicles (UGV) for urban as well as off-road scenarios. The overall vehicle dynamics performance is governed by the multibody dynamics model for the vehicle, the wheel/terrain interaction dynamics and the onboard control system. The topic of this paper is the development of computationally efficient and accurate dynamics model for ground vehicles with ...

  7. 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.

  8. 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.

  9. State estimation for integrated vehicle dynamics control

    NARCIS (Netherlands)

    Zuurbier, J.; Bremmer, P.

    2002-01-01

    This paper discusses a vehicle controller and a state estimator that was implemented and tested in a vehicle equipped with a combined braking and chassis control system to improve handling. The vehicle dynamics controller consists of a feed forward body roll compensation and a feedback stability

  10. 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...

  11. 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.

  12. Vehicle dynamics theory and application

    CERN Document Server

    Jazar, Reza N

    2014-01-01

    This textbook is appropriate for senior undergraduate and first year graduate students in mechanical and automotive engineering. The contents in this book are presented at a theoretical-practical level. It explains vehicle dynamics concepts in detail, concentrating on their practical use. Related theorems and formal proofs are provided, as are real-life applications. Students, researchers and practicing engineers alike will appreciate the user-friendly presentation of a wealth of topics, most notably steering, handling, ride, and related components. This book also: Illustrates all key concepts with examples Includes exercises for each chapter Covers front, rear, and four wheel steering systems, as well as the advantages and disadvantages of different steering schemes Includes an emphasis on design throughout the text, which provides a practical, hands-on approach

  13. 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...

  14. Method and System for Dynamic Automated Corrections to Weather Avoidance Routes for Aircraft in En Route Airspace

    Science.gov (United States)

    McNally, B. David (Inventor); Erzberger, Heinz (Inventor); Sheth, Kapil (Inventor)

    2015-01-01

    A dynamic weather route system automatically analyzes routes for in-flight aircraft flying in convective weather regions and attempts to find more time and fuel efficient reroutes around current and predicted weather cells. The dynamic weather route system continuously analyzes all flights and provides reroute advisories that are dynamically updated in real time while the aircraft are in flight. The dynamic weather route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

  15. 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...

  16. 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 ...

  17. Characterization of Static/Dynamic Topological Routing For Grid Networks

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir

    2009-01-01

    Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures. In addition, the high requirements of future services and applications demand more flexible...... and adaptive networks. Topological routing in grid networks is a simple and efficient alternative to traditional routing techniques, e.g. routing tables, and the paper extends this kind of routing providing a "Dynamic" attribute. This new property attempts to improve the overall network performance for future...

  18. 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.

  19. 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.

  20. 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 ...

  1. 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.

  2. 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...

  3. 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.

  4. 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.

  5. Benefits Analysis of Multi-Center Dynamic Weather Routes

    Science.gov (United States)

    Sheth, Kapil; McNally, David; Morando, Alexander; Clymer, Alexis; Lock, Jennifer; Petersen, Julien

    2014-01-01

    Dynamic weather routes are flight plan corrections that can provide airborne flights more than user-specified minutes of flying-time savings, compared to their current flight plan. These routes are computed from the aircraft's current location to a flight plan fix downstream (within a predefined limit region), while avoiding forecasted convective weather regions. The Dynamic Weather Routes automation has been continuously running with live air traffic data for a field evaluation at the American Airlines Integrated Operations Center in Fort Worth, TX since July 31, 2012, where flights within the Fort Worth Air Route Traffic Control Center are evaluated for time savings. This paper extends the methodology to all Centers in United States and presents benefits analysis of Dynamic Weather Routes automation, if it was implemented in multiple airspace Centers individually and concurrently. The current computation of dynamic weather routes requires a limit rectangle so that a downstream capture fix can be selected, preventing very large route changes spanning several Centers. In this paper, first, a method of computing a limit polygon (as opposed to a rectangle used for Fort Worth Center) is described for each of the 20 Centers in the National Airspace System. The Future ATM Concepts Evaluation Tool, a nationwide simulation and analysis tool, is used for this purpose. After a comparison of results with the Center-based Dynamic Weather Routes automation in Fort Worth Center, results are presented for 11 Centers in the contiguous United States. These Centers are generally most impacted by convective weather. A breakdown of individual Center and airline savings is presented and the results indicate an overall average savings of about 10 minutes of flying time are obtained per flight.

  6. Heavy vehicle pitch dynamics and suspension tuning

    OpenAIRE

    Cao, Dongpu; Rakheja, Subhash; Su, Chun-Yi

    2008-01-01

    The influence of suspension tuning of passenger cars on bounce and pitch ride performance has been explored in a number of studies, while only minimal efforts have been made for establishing similar rules for heavy vehicles. This study aims to explore pitch dynamics and suspension tunings of a two-axle heavy vehicle with unconnected suspension, which could also provide valuable information for heavy vehicles with coupled suspensions. Based on a generalised pitch-plane model of a two-axle heav...

  7. 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

  8. A dynamic approach to vehicle scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis); R. Freling (Richard); A.P.M. Wagelmans (Albert)

    2001-01-01

    textabstractThis paper presents a dynamic approach to the vehicle scheduling problem. We discuss the potential benefit of our approach compared to the traditional one, where the vehicle scheduling problem is solved only once for a whole period and the travel times are assumed to be fixed. In our

  9. 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.

  10. 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.

  11. 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.

  12. On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity

    Science.gov (United States)

    Hanum, F.; Hartono, A. P.; Bakhtiar, T.

    2018-03-01

    This current manuscript concerns with the optimization problem arising in a route determination of products distribution. The problem is formulated in the form of multiple depots and time windowed vehicle routing problem with heterogeneous capacity and velocity of fleet. Model includes a number of constraints such as route continuity, multiple depots availability and serving time in addition to generic constraints. In dealing with the unique feature of heterogeneous velocity, we generate a number of velocity profiles along the road segments, which then converted into traveling-time tables. An illustrative example of rice distribution among villages by bureau of logistics is provided. Exact approach is utilized to determine the optimal solution in term of vehicle routes and starting time of service.

  13. 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.

  14. Vehicle lateral dynamics stabilization using active suspension

    Directory of Open Access Journals (Sweden)

    Drobný V.

    2008-12-01

    Full Text Available The paper deals with the investigation of active nonlinear suspension control in order to stabilize the lateral vehicle motion in similar way as systems like ESP do. The lateral stabilization of vehicle based on braking forces can be alternatively provided by the different setting of suspension forces. The basis of this control is the nonlinear property of the tyres. The vehicle has at least four wheels and it gives one or more redundant vertical forces that can be used for the different distribution of vertical suspension forces in such a way that resulting lateral and/or longitudinal forces create the required correction moment for lateral dynamic vehicle stabilization.

  15. 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.

  16. 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...

  17. Lateral dynamic features of a railway vehicle

    DEFF Research Database (Denmark)

    Gao, Xue-jun; True, Hans; Li, Ying-hui

    2016-01-01

    The lateral dynamic features of a railway vehicle are investigated using two similar wheel/rail contact models: the Vermeulen-Johnson and the Shen-Hedrick-Elkins models. The symmetric/asymmetric bifurcation behaviour and chaotic motions of the railway vehicle are investigated in great detail......, resulting in problems for safe operation of the vehicle. Therefore, it should be avoided in everyday operation. Furthermore, the creation of multiple solution branches suggests that the critical speed of a vehicle should be determined from a comprehensive analysis of the various kinds of possible...... by varying the speed and using the resultant bifurcation diagram' method. It is found that multiple solution branches exist and they can lead to more steady states in the dynamic behaviour of the railway vehicle. The coexistence of multiple steady states can lead to jumps in the amplitude of oscillations...

  18. Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem

    Science.gov (United States)

    Azis, Zainal; Mawengkang, Herman

    2017-09-01

    The heterogeneous vehicle routing problem (HVRP) is a variant of vehicle routing problem (VRP) which describes various types of vehicles with different capacity to serve a set of customers with known geographical locations. This paper considers the optimal service deliveries of meals of a catering company located in Medan City, Indonesia. Due to the road condition as well as traffic, it is necessary for the company to use different type of vehicle to fulfill customers demand in time. The HVRP incorporates time dependency of travel times on the particular time of the day. The objective is to minimize the sum of the costs of travelling and elapsed time over the planning horizon. The problem can be modeled as a linear mixed integer program and we address a feasible neighbourhood search approach to solve the problem.

  19. 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.

  20. 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.

  1. 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...

  2. 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.

  3. 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

  4. 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".

  5. 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

  6. 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

  7. 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 ...

  8. 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

  9. 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.

  10. 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

  11. 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...

  12. 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

  13. 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

  14. 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.

  15. 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

  16. 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...

  17. 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.

  18. 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

  19. Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

    Directory of Open Access Journals (Sweden)

    Johan Oscar Ong

    2011-01-01

    Full Text Available Transportation planning is one of the important components to increase efficiency and effectiveness in the supply chain system. Good planning will give a saving in total cost of the supply chain. This paper develops the new VRP variants’, VRP with backhauls, multiple trips, and time window (VRPBMTTW along with its problem solving techniques by using Ant Colony Optimization (ACO and Sequential Insertion as initial solution algorithm. ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window. This algorithm is tested by using set of random data and verified as well as analyzed its parameter changing’s. The computational results for hypothetical data with 50% backhaul and mix time windows are reported.

  20. 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.

  1. 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.

  2. 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.

  3. 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...

  4. 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.

  5. 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.

  6. Congested Link Inference Algorithms in Dynamic Routing IP Network

    Directory of Open Access Journals (Sweden)

    Yu Chen

    2017-01-01

    Full Text Available The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP and Rest Bayesian Network Model (RBNM, we proposed an Improved CLINK (ICLINK algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

  7. 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. ...

  8. 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.

  9. 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

  10. 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.

  11. Dynamics of Railway Vehicles and Rail/Wheel Contact

    DEFF Research Database (Denmark)

    True, Hans

    2007-01-01

    of the most important dynamic effects on vehicle dynamic problems are described. In chapter 7 characteristic features of railway vehicle dynamics are described, and in chapter 8 recommendations are presented for the numerical handling that is necessary for the investigation of vehicle dynamic problems...

  12. Vehicle dynamics modeling and simulation

    CERN Document Server

    Schramm, Dieter; Bardini, Roberto

    2014-01-01

    The authors examine in detail the fundamentals and mathematical descriptions of the dynamics of automobiles. In this context different levels of complexity will be presented, starting with basic single-track models up to complex three-dimensional multi-body models. A particular focus is on the process of establishing mathematical models on the basis of real cars and the validation of simulation results. The methods presented are explained in detail by means of selected application scenarios.

  13. 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.

  14. 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.

  15. 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....

  16. 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.

  17. 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...

  18. 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...

  19. 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.

  20. 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.

  1. 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.

  2. Vertical dynamics of the Maglev vehicle Transrapid

    International Nuclear Information System (INIS)

    Haegele, Nora; Dignath, Florian

    2009-01-01

    The Maglev vehicle Transrapid is levitated by magnetic forces which pull the vehicles levitation frames toward the guideway from below. The magnets possess poles with alternating fluxes which are part of the synchronous long stator linear motor. Although the Transrapid glides along its guideway without mechanical contact, this alternation as well as the loading and unloading of the guideway girders excite vibrations of the ground. In order to calculate the time behavior of the vibrational emissions, a simulation of the transfer of a Transrapid vehicle over several guideway girders is proposed. The equations of motion for the vehicle and the girders are calculated separately by the MBS software NEWEUL and assembled and numerically integrated in MATLAB/SIMULINK. The control law for the magnet forces is simplified by the characteristics of linear spring-damper elements. The controlled magnet forces travel along the guideway continuously and include the dynamic component due to the alternating fluxes and the geometry of the poles and stator. Results of a complete vehicle moving along a guideway consisting of several girders can be obtained within a few minutes of computation time. Therefore, the mechanism of excitations can be analyzed by numerical time integration in the full state space. The results are validated by measurements of the forces in the joints of the guideway girders. The vibrational emission along the Transrapid guideway differs from the vibrations of contact-afflicted vehicles as no impacts and fewer stochastic effects occur

  3. Vertical dynamics of the Maglev vehicle Transrapid

    Energy Technology Data Exchange (ETDEWEB)

    Haegele, Nora [University of Stuttgart, Institute of Engineering and Computational Mechanics (Germany)], E-mail: Nora.Haegele@gmx.de; Dignath, Florian [ThyssenKrupp Transrapid, Basic Technologies (Germany)], E-mail: Florian.Dignath@ThyssenKrupp.com

    2009-04-15

    The Maglev vehicle Transrapid is levitated by magnetic forces which pull the vehicles levitation frames toward the guideway from below. The magnets possess poles with alternating fluxes which are part of the synchronous long stator linear motor. Although the Transrapid glides along its guideway without mechanical contact, this alternation as well as the loading and unloading of the guideway girders excite vibrations of the ground. In order to calculate the time behavior of the vibrational emissions, a simulation of the transfer of a Transrapid vehicle over several guideway girders is proposed. The equations of motion for the vehicle and the girders are calculated separately by the MBS software NEWEUL and assembled and numerically integrated in MATLAB/SIMULINK. The control law for the magnet forces is simplified by the characteristics of linear spring-damper elements. The controlled magnet forces travel along the guideway continuously and include the dynamic component due to the alternating fluxes and the geometry of the poles and stator. Results of a complete vehicle moving along a guideway consisting of several girders can be obtained within a few minutes of computation time. Therefore, the mechanism of excitations can be analyzed by numerical time integration in the full state space. The results are validated by measurements of the forces in the joints of the guideway girders. The vibrational emission along the Transrapid guideway differs from the vibrations of contact-afflicted vehicles as no impacts and fewer stochastic effects occur.

  4. 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

  5. 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.

  6. 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 ...

  7. 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.

  8. A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Majid Yousefikhoshbakht

    2017-07-01

    Full Text Available This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP, in which the vehicles are not required to return to the depot after completing a service. In this new problem, the demands of customers are fulfilled by a heterogeneous fixed fleet of vehicles having various capacities, fixed costs and variable costs. This problem is an important variant of the open vehicle routing problem (OVRP and can cover more practical situations in transportation and logistics. Since this problem belongs to NP-hard Problems, An approach based on column generation (CG is applied to solve the HFFOVRP. A tight integer programming model is presented and the linear programming relaxation of which is solved by the CG technique. Since there have been no existing benchmarks, this study generated 19 test problems and the results of the proposed CG algorithm is compared to the results of exact algorithm. Computational experience confirms that the proposed algorithm can provide better solutions within a comparatively shorter period of time.

  9. 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)

  10. 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...

  11. Nonlinear dynamics of biomimetic micro air vehicles

    Energy Technology Data Exchange (ETDEWEB)

    Hou, Y; Kong, J [College of Mechanical Automation, Wuhan University of Science and Technology, Wuhan, 430081 (China)], E-mail: fly_houyu@163.com.cn

    2008-02-15

    Flapping-wing micro air vehicles (FMAV) are new conceptual air vehicles that mimic the flying modes of birds and insects. They surpass the research fields of traditional airplane design and aerodynamics on application technologies, and initiate the applications of MEMS technologies on aviation fields. This paper studies a micro flapping mechanism that based upon insect thorax and actuated by electrostatic force. Because there are strong nonlinear coupling between the two physical domains, electrical and mechanical, the static and dynamic characteristics of this system are very complicated. Firstly, the nonlinear dynamic model of the electromechanical coupling system is set up according to the physical model of the flapping mechanism. The dynamic response of the system in constant voltage is studied by numerical method. Then the effect of damping and initial condition on dynamic characteristics of the system is analyzed in phase space. In addition, the dynamic responses of the system in sine voltage excitation are discussed. The results of research are helpful to the design, fabrication and application of the micro flapping mechanism of FMAV, and also to other micro electromechanical system that actuated by electrostatic force.

  12. 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

  13. Vehicle Dynamic Prediction Systems with On-Line Identification of Vehicle Parameters and Road Conditions

    Science.gov (United States)

    Hsu, Ling-Yuan; Chen, Tsung-Lin

    2012-01-01

    This paper presents a vehicle dynamics prediction system, which consists of a sensor fusion system and a vehicle parameter identification system. This sensor fusion system can obtain the six degree-of-freedom vehicle dynamics and two road angles without using a vehicle model. The vehicle parameter identification system uses the vehicle dynamics from the sensor fusion system to identify ten vehicle parameters in real time, including vehicle mass, moment of inertial, and road friction coefficients. With above two systems, the future vehicle dynamics is predicted by using a vehicle dynamics model, obtained from the parameter identification system, to propagate with time the current vehicle state values, obtained from the sensor fusion system. Comparing with most existing literatures in this field, the proposed approach improves the prediction accuracy both by incorporating more vehicle dynamics to the prediction system and by on-line identification to minimize the vehicle modeling errors. Simulation results show that the proposed method successfully predicts the vehicle dynamics in a left-hand turn event and a rollover event. The prediction inaccuracy is 0.51% in a left-hand turn event and 27.3% in a rollover event. PMID:23202231

  14. Nonlinear Dynamic Characteristics of the Railway Vehicle

    Science.gov (United States)

    Uyulan, Çağlar; Gokasan, Metin

    2017-06-01

    The nonlinear dynamic characteristics of a railway vehicle are checked into thoroughly by applying two different wheel-rail contact model: a heuristic nonlinear friction creepage model derived by using Kalker 's theory and Polach model including dead-zone clearance. This two models are matched with the quasi-static form of the LuGre model to obtain more realistic wheel-rail contact model. LuGre model parameters are determined using nonlinear optimization method, which it's objective is to minimize the error between the output of the Polach and Kalker model and quasi-static LuGre model for specific operating conditions. The symmetric/asymmetric bifurcation attitude and stable/unstable motion of the railway vehicle in the presence of nonlinearities which are yaw damping forces in the longitudinal suspension system are analyzed in great detail by changing the vehicle speed. Phase portraits of the lateral displacement of the leading wheelset of the railway vehicle are drawn below and on the critical speeds, where sub-critical Hopf bifurcation take place, for two wheel-rail contact model. Asymmetric periodic motions have been observed during the simulation in the lateral displacement of the wheelset under different vehicle speed range. The coexistence of multiple steady states cause bounces in the amplitude of vibrations, resulting instability problems of the railway vehicle. By using Lyapunov's indirect method, the critical hunting speeds are calculated with respect to the radius of the curved track parameter changes. Hunting, which is defined as the oscillation of the lateral displacement of wheelset with a large domain, is described by a limit cycle-type oscillation nature. The evaluated accuracy of the LuGre model adopted from Kalker's model results for prediction of critical speed is higher than the results of the LuGre model adopted from Polach's model. From the results of the analysis, the critical hunting speed must be resolved by investigating the track tests

  15. Reduction of CO2 emissions from road transport in cities impact of dynamic route guidance system on greenhouse gas emission

    CERN Document Server

    Markiewicz, Michal

    2017-01-01

    Michal Markiewicz presents the outcomes of his research regarding the influence of dynamic route guidance system on overall emission of carbon dioxide from road transport in rural areas. Sustainable transportation in smart cities is a big challenge of our time, but before electric vehicles replace vehicles that burn fossil fuels we have to think about traffic optimization methods that reduce the amount of greenhouse gas emissions. Contents Comparison of Travel Time Measurements Using Floating Car Data and Intelligent Infrastructure Integration of Cellular Automata Traffic Simulator with CO2 Emission Model Impact of Dynamic Route Guidance System on CO2 Emission Naxos Vehicular Traffic Simulator Target Groups Lecturers and students of computer science, transportation and logistics Traffic engineers The Author Dr. Michal Markiewicz defended his PhD thesis in computer science at the University of Bremen,TZI Technologie-Zentrum Informatik und Informationstechnik, Germany. Currently, he is working on commercializat...

  16. Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

    2012-01-01

    In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

  17. 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.

  18. 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.

  19. 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.

  20. Study on the Vehicle Dynamic Load Considering the Vehicle-Pavement Coupled Effect

    Science.gov (United States)

    Xu, H. L.; He, L.; An, D.

    2017-11-01

    The vibration of vehicle-pavement interaction system is sophisticated random vibration process and the vehicle-pavement coupled effect was not considered in the previous study. A new linear elastic model of the vehicle-pavement coupled system was established in the paper. The new model was verified with field measurement which could reflect the real vibration between vehicle and pavement. Using the new model, the study on the vehicle dynamic load considering the vehicle-pavement coupled effect showed that random forces (centralization) between vehicle and pavement were influenced largely by vehicle-pavement coupled effect. Numerical calculation indicated that the maximum of random forces in coupled model was 2.4 times than that in uncoupled model. Inquiring the reason, it was found that the main vibration frequency of the vehicle non-suspension system was similar with that of the vehicle suspension system in the coupled model and the resonance vibration lead to vehicle dynamic load increase significantly.

  1. 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.

  2. 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.

  3. 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.

  4. FPGA Dynamic Power Minimization through Placement and Routing Constraints

    Directory of Open Access Journals (Sweden)

    Deepak Agarwal

    2006-08-01

    Full Text Available Field-programmable gate arrays (FPGAs are pervasive in embedded systems requiring low-power utilization. A novel power optimization methodology for reducing the dynamic power consumed by the routing of FPGA circuits by modifying the constraints applied to existing commercial tool sets is presented. The power optimization techniques influence commercial FPGA Place and Route (PAR tools by translating power goals into standard throughput and placement-based constraints. The Low-Power Intelligent Tool Environment (LITE is presented, which was developed to support the experimentation of power models and power optimization algorithms. The generated constraints seek to implement one of four power optimization approaches: slack minimization, clock tree paring, N-terminal net colocation, and area minimization. In an experimental study, we optimize dynamic power of circuits mapped into 0.12 μm Xilinx Virtex-II FPGAs. Results show that several optimization algorithms can be combined on a single design, and power is reduced by up to 19.4%, with an average power savings of 10.2%.

  5. 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.

  6. 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.

  7. 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

  8. 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...

  9. 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...

  10. 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...

  11. Minimizing the Carbon Footprint for the Time-Dependent Heterogeneous-Fleet Vehicle Routing Problem with Alternative Paths

    Directory of Open Access Journals (Sweden)

    Wan-Yu Liu

    2014-07-01

    Full Text Available Torespondto the reduction of greenhouse gas emissions and global warming, this paper investigates the minimal-carbon-footprint time-dependent heterogeneous-fleet vehicle routing problem with alternative paths (MTHVRPP. This finds a route with the smallestcarbon footprint, instead of the shortestroute distance, which is the conventional approach, to serve a number of customers with a heterogeneous fleet of vehicles in cases wherethere may not be only one path between each pair of customers, and the vehicle speed differs at different times of the day. Inheriting from the NP-hardness of the vehicle routing problem, the MTHVRPP is also NP-hard. This paper further proposes a genetic algorithm (GA to solve this problem. The solution representedbyour GA determines the customer serving ordering of each vehicle type. Then, the capacity check is used to classify multiple routes of each vehicle type, and the path selection determines the detailed paths of each route. Additionally, this paper improves the energy consumption model used for calculating the carbon footprint amount more precisely. Compared with the results without alternative paths, our experimental results show that the alternative path in this experimenthas a significant impact on the experimental results in terms of carbon footprint.

  12. 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...

  13. 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.

  14. Multicast routing for wavelength-routed WDM networks with dynamic membership

    Science.gov (United States)

    Huang, Nen-Fu; Liu, Te-Lung; Wang, Yao-Tzung; Li, Bo

    2000-09-01

    Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work, we explore the optical link control layer on the top of optical layer that enables the possibility of bandwidth on-demand service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over the optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to joint a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as less as possible. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.

  15. 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.

  16. 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.

  17. 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%.

  18. The TNO Vehicle Dynamics Database (VDD): a tool for comparision of vehicle dynamics behaviour

    NARCIS (Netherlands)

    Kleuskens, R.J.A.

    1996-01-01

    TNO has started a database containing data of vehicle dynamics properties of passenger cars, based on the results of eight objective ISO driving tests. From this database, car manufacturers and their suppliers can get the required information for design and marketing purposes in a fast and

  19. Off-road vehicle dynamics analysis, modelling and optimization

    CERN Document Server

    Taghavifar, Hamid

    2017-01-01

    This book deals with the analysis of off-road vehicle dynamics from kinetics and kinematics perspectives and the performance of vehicle traversing over rough and irregular terrain. The authors consider the wheel performance, soil-tire interactions and their interface, tractive performance of the vehicle, ride comfort, stability over maneuvering, transient and steady state conditions of the vehicle traversing, modeling the aforementioned aspects and optimization from energetic and vehicle mobility perspectives. This book brings novel figures for the transient dynamics and original wheel terrain dynamics at on-the-go condition.

  20. 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.

  1. A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR PROTOCOL IN MOBILE AD-HOC NETWORKS

    Directory of Open Access Journals (Sweden)

    Alaa Azmi Allahham

    2017-02-01

    Full Text Available Mobile Ad-hoc networks (MANETs involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general.

  2. 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.

  3. TARDEC Ground Vehicle Robotics: Vehicle Dynamic Characterization and Research

    Science.gov (United States)

    2015-09-01

    subassemblies that would be common on ground vehicles. Powertrain Systems: Gas Powered, Diesel , Turbo Diesel , Gas Turbine, Hybrid: Gas- Electric...PROPULSE (Hybrid Diesel - Electric System with Export Power), Command Zone (integrated vehicle control and diagnostic system), and TerraMax (Unmanned... Diesel -Electric, Series, Parallel. Power Distribution: RWD, FWD, AWD, open diff, LSD, Torsen diff, differential braking (traction control), drive by

  4. The dynamic multi-period vehicle routing problem

    DEFF Research Database (Denmark)

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

    2010-01-01

    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 the proposed approach can yield high quality solutions within reasonable running times....

  5. Dynamic multicast routing scheme in WDM optical network

    Science.gov (United States)

    Zhu, Yonghua; Dong, Zhiling; Yao, Hong; Yang, Jianyong; Liu, Yibin

    2007-11-01

    During the information era, the Internet and the service of World Wide Web develop rapidly. Therefore, the wider and wider bandwidth is required with the lower and lower cost. The demand of operation turns out to be diversified. Data, images, videos and other special transmission demands share the challenge and opportunity with the service providers. Simultaneously, the electrical equipment has approached their limit. So the optical communication based on the wavelength division multiplexing (WDM) and the optical cross-connects (OXCs) shows great potentials and brilliant future to build an optical network based on the unique technical advantage and multi-wavelength characteristic. In this paper, we propose a multi-layered graph model with inter-path between layers to solve the problem of multicast routing wavelength assignment (RWA) contemporarily by employing an efficient graph theoretic formulation. And at the same time, an efficient dynamic multicast algorithm named Distributed Message Copying Multicast (DMCM) mechanism is also proposed. The multicast tree with minimum hops can be constructed dynamically according to this proposed scheme.

  6. Jerk analysis in rail vehicle dynamics

    Directory of Open Access Journals (Sweden)

    Sunil Kumar Sharma

    2016-09-01

    Full Text Available The acceleration and deceleration of trains are essential for satisfactory performance of train services and for effective utilisation of line capacity by railways for a given network. However, it increases the risk of unbalancing the passengers. Therefore, in this paper, the jerk was analysed in the vehicle in order to examine its effect on safety and comfort to the passengers. For the purpose of this analysis, a rake with 24 ICF coaches fitted with CBC (H type tight lock and low preload draft gear hauled by WDP4 locomotive was considered. It was modelled using Universal Mechanism – a multibody dynamic software. Also, in addition, the vehicle is considered to be subjected to external forces such as rolling resistance, longitudinal wheel resistance, and gravitational force. The tractive and braking efforts for the locomotives are also considered with realistic track conditions between Lucknow and Kanpur of India. The presented results suggest that the CBC with balanced type draft gear reduces the jerk in the train.

  7. Statistical models of petrol engines vehicles dynamics

    Science.gov (United States)

    Ilie, C. O.; Marinescu, M.; Alexa, O.; Vilău, R.; Grosu, D.

    2017-10-01

    This paper focuses on studying statistical models of vehicles dynamics. It was design and perform a one year testing program. There were used many same type cars with gasoline engines and different mileage. Experimental data were collected of onboard sensors and those on the engine test stand. A database containing data of 64th tests was created. Several mathematical modelling were developed using database and the system identification method. Each modelling is a SISO or a MISO linear predictive ARMAX (AutoRegressive-Moving-Average with eXogenous inputs) model. It represents a differential equation with constant coefficients. It were made 64th equations for each dependency like engine torque as output and engine’s load and intake manifold pressure, as inputs. There were obtained strings with 64 values for each type of model. The final models were obtained using average values of the coefficients. The accuracy of models was assessed.

  8. 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.

  9. 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.

  10. 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...

  11. 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.

  12. 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.

  13. 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.

  14. 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.

  15. The dynamic behaviour of a railway mine vehicle

    Energy Technology Data Exchange (ETDEWEB)

    van Manen, P.; Brickle, B.V.

    1983-06-01

    The paper describes a mathematical model of a railway mine vehicle which is capable of predicting its dynamic behaviour in response to track inputs. The predictions of the model have been compared with the results of tests carried out on a new high speed mine vehicle and the correlation shown is good. The model yields frequency response information for the vehicle and may be used to simulate dynamic behaviour in response to track irregularities. (4 refs.)

  16. 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.

  17. 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.

  18. 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

  19. Research on Dynamic Optimization for Road-friendly Vehicle Suspension

    Directory of Open Access Journals (Sweden)

    Lu Yongjie

    2014-10-01

    Full Text Available The heavy vehicle brings large dynamic loads to the road surface, which would reduce vehicle ride comfort and shorten road service life. The structure characteristic of heavy vehicle suspension has a significant impact on vehicle performance. Based on the D'Alembert principle, the dynamics models of independent and integral balanced suspension are proposed considering mass and inertia of balancing rod. The sprung mass acceleration and the tire dynamic force for two kinds of balanced suspension and the traditional quarter vehicle model are compared in frequency-domain and time-domain respectively. It is concluded that a quarter vehicle model simplified for balanced suspension could be used to evaluate the ride comfort of vehicle well, but it has some limitations in assessing the vehicle road-friendliness. Then, the sprung mass acceleration and the road damage coefficients are also analyzed under different vehicle design and running parameters at detail. Some conclusions are obtained: low suspension stiffness, high suspension damping and low tire stiffness are all favorable to improve vehicle performance; there is a saturation range of suspension damping enhancing vehicle performance; improving the road surface roughness and avoiding the no-load running are two effective methods to accomplish the better ride comfort and road-friendliness. The suspension stiffness and damping parameters are chosen for optimal parameters matching of road friendliness based on the approximation optimization method.

  20. A review of dynamic characteristics of magnetically levitated vehicle systems

    Energy Technology Data Exchange (ETDEWEB)

    Cai, Y.; Chen, S.S.

    1995-11-01

    The dynamic response of magnetically levitated (maglev) ground transportation systems has important consequences for safety and ride quality, guideway design, and system costs. Ride quality is determined by vehicle response and by environmental factors such as humidity and noise. The dynamic response of the vehicles is the key element in determining ride quality, while vehicle stability is an important safety-related element. To design a guideway that provides acceptable ride quality in the stable region, vehicle dynamics must be understood. Furthermore, the trade-off between guideway smoothness and levitation and control systems must be considered if maglev systems are to be economically feasible. The link between the guideway and the other maglev components is vehicle dynamics. For a commercial maglev system, vehicle dynamics must be analyzed and tested in detail. This report, which reviews various aspects of the dynamic characteristics, experiments and analysis, and design guidelines for maglev systems, discusses vehicle stability, motion dependent magnetic force components, guideway characteristics, vehicle/ guideway interaction, ride quality, suspension control laws, aerodynamic loads and other excitations, and research needs.

  1. Extensions to the Dynamic Aerospace Vehicle Exchange Markup Language

    Science.gov (United States)

    Brian, Geoffrey J.; Jackson, E. Bruce

    2011-01-01

    The Dynamic Aerospace Vehicle Exchange Markup Language (DAVE-ML) is a syntactical language for exchanging flight vehicle dynamic model data. It provides a framework for encoding entire flight vehicle dynamic model data packages for exchange and/or long-term archiving. Version 2.0.1 of DAVE-ML provides much of the functionality envisioned for exchanging aerospace vehicle data; however, it is limited in only supporting scalar time-independent data. Additional functionality is required to support vector and matrix data, abstracting sub-system models, detailing dynamics system models (both discrete and continuous), and defining a dynamic data format (such as time sequenced data) for validation of dynamics system models and vehicle simulation packages. Extensions to DAVE-ML have been proposed to manage data as vectors and n-dimensional matrices, and record dynamic data in a compatible form. These capabilities will improve the clarity of data being exchanged, simplify the naming of parameters, and permit static and dynamic data to be stored using a common syntax within a single file; thereby enhancing the framework provided by DAVE-ML for exchanging entire flight vehicle dynamic simulation models.

  2. Analysis of vehicle dynamics under sadden cross wind

    Science.gov (United States)

    Walczak, S.

    2016-09-01

    In this paper, the way of calculating aerodynamic forces acting on a vehicle passing in the region of sadden cross wind was presented. The CarDyn, a vehicle dynamics simulation program, developed by the author was used. The effects of the cross wind were studied with a fixed steering wheel simulation. On the base of computer simulations the car cross wind sensitivity were determined, and vehicle responses such as lateral offset, side acceleration and yaw angular velocity are presented.

  3. 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.

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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.

  9. Vehicle dynamic effects in the course of passing over turnouts

    Directory of Open Access Journals (Sweden)

    Zelenka J.

    2007-11-01

    Full Text Available For the quantification of vehicle dynamic effects at passing over turnouts at a higher speed there was developed a methodology for evaluating of acceleration measured on vehicle axle boxes in the year 2003. The methodology is based on statistical evaluation of lateral and vertical acceleration measured values at passing over both critical parts of a turnout (tongue, frog. The created methodology was used for investigation of vehicle dynamic effects by running at speed up to 230 km/h in the year 2004 in terms of high speed tests of tilting-body unit class 680 CD. There was found relatively high values of dynamic effects already at a speed 160 km/h. In terms of tilting-body unit class 680 tests at a higher speed in curves of chosen track lines of 1st and 2nd corridor of Czech Railways there was carried out also verification of curved turnouts state according to methodology mentioned above with a view to possibility of speed increasing at curved throats of chosen stations. Lateral vehicle dynamic effects at passing over a curved turnout frog area were evaluated. There were carried out simulation calculations of vehicle passing over a turnout based on measured geometric parameters of wheelset as well as chosen turnouts. Results of the calculations were compared with measurements. The increased vehicle dynamic effects found in pulsed beats character influence negatively the turnouts part (not only wheel contacting parts as well as operating life all unsuspended parts of vehicles.

  10. 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.

  11. DTN routing in body sensor networks with dynamic postural partitioning.

    Science.gov (United States)

    Quwaider, Muhannad; Biswas, Subir

    2010-11-01

    This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

  12. TIRE MODELS USED IN VEHICLE DYNAMIC APPLICATIONS AND THEIR USING IN VEHICLE ACCIDENT SIMULATIONS

    Directory of Open Access Journals (Sweden)

    Osman ELDOĞAN

    1995-01-01

    Full Text Available Wheel model is very important in vehicle modelling, it is because the contact between vehicle and road is achieved by wheel. Vehicle models can be dynamic models which are used in vehicle design, they can also be models used in accident simulations. Because of the importance of subject, many studies including theoretical, experimental and mixed type have been carried out. In this study, information is given about development of wheel modelling and research studies and also use of these modellings in traffic accident simulations.

  13. SDN-enabled dynamic WDM networks to address routing information inaccuracy

    CSIR Research Space (South Africa)

    Ravhuanzwo, Lusani

    2016-11-01

    Full Text Available Large dynamic wavelength-division multiplexed (WDM) networks based on the distributed control mechanism are susceptible to routing information inaccuracies. Factors such as non-negligible propagation delays, infrequent network state updates...

  14. 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

  15. Dynamics of a railway vehicle on a laterally disturbed track

    DEFF Research Database (Denmark)

    Christiansen, Lasse Engbo; True, Hans

    2017-01-01

    In this article a theoretical investigation of the dynamics of a railway bogie running on a tangent track with a periodic disturbance of the lateral track geometry is presented. The dynamics is computed for two values of the speed of the vehicle in combination with different values of the wavelen......In this article a theoretical investigation of the dynamics of a railway bogie running on a tangent track with a periodic disturbance of the lateral track geometry is presented. The dynamics is computed for two values of the speed of the vehicle in combination with different values...

  16. A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet

    Directory of Open Access Journals (Sweden)

    Behrouz Afshar-Nadjafi

    2017-01-01

    Full Text Available In this paper, we consider the time-dependent multi-depot vehicle routing problem. The objective is to minimize the total heterogeneous fleet cost assuming that the travel time between locations depends on the departure time. Also, hard time window constraints for the customers and limitation on maximum number of the vehicles in depots must be satisfied. The problem is formulated as a mixed integer programming model. A constructive heuristic procedure is proposed for the problem. Also, the efficiency of the proposed algorithm is evaluated on 180 test problems. The obtained computational results indicate that the procedure is capable to obtain a satisfying solution.

  17. 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.

  18. A dynamic routing strategy with limited buffer on scale-free network

    Science.gov (United States)

    Wang, Yufei; Liu, Feng

    2016-04-01

    In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

  19. 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...

  20. Vehicle Dynamics due to Magnetic Launch Propulsion

    Science.gov (United States)

    Galaboff, Zachary J.; Jacobs, William; West, Mark E.; Montenegro, Justino (Technical Monitor)

    2000-01-01

    The field of Magnetic Levitation Lind Propulsion (MagLev) has been around for over 30 years, primarily in high-speed rail service. In recent years, however, NASA has been looking closely at MagLev as a possible first stage propulsion system for spacecraft. This approach creates a variety of new problems that don't currently exist with the present MagLev trains around the world. NASA requires that a spacecraft of approximately 120,000 lbs be accelerated at two times the acceleration of gravity (2g's). This produces a greater demand on power over the normal MagLev trains that accelerate at around 0.1g. To be able to store and distribute up to 3,000 Mega Joules of energy in less than 10 seconds is a technical challenge. Another problem never addressed by the train industry and, peculiar only to NASA, is the control of a lifting body through the acceleration of and separation from the MagLev track. Very little is understood about how a lifting body will react with external forces, Such as wind gusts and ground effects, while being propelled along on soft springs such as magnetic levitators. Much study needs to be done to determine spacecraft control requirements as well as what control mechanisms and aero-surfaces should be placed on the carrier. Once the spacecraft has been propelled down the track another significant event takes place, the separation of the spacecraft from the carrier. The dynamics involved for both the carrier and the spacecraft are complex and coupled. Analysis of the reaction of the carrier after losing, a majority of its mass must be performed to insure control of the carrier is maintained and a safe separation of the spacecraft is achieved. The spacecraft angle of attack required for lift and how it will affect the carriage just prior to separation, along with the impacts of around effect and aerodynamic forces at ground level must be modeled and analyzed to define requirements on the launch vehicle design. Mechanisms, which can withstand the

  1. RELIABLE DYNAMIC SOURCE ROUTING PROTOCOL (RDSRP FOR ENERGY HARVESTING WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    B. Narasimhan

    2015-03-01

    Full Text Available Wireless sensor networks (WSNs carry noteworthy pros over traditional communication. Though, unkind and composite environments fake great challenges in the reliability of WSN communications. It is more vital to develop a reliable unipath dynamic source routing protocol (RDSRPl for WSN to provide better quality of service (QoS in energy harvesting wireless sensor networks (EH-WSN. This paper proposes a dynamic source routing approach for attaining the most reliable route in EH-WSNs. Performance evaluation is carried out using NS-2 and throughput and packet delivery ratio are chosen as the metrics.

  2. Dynamic Routing and Coordination in Multi-Agent Networks

    Science.gov (United States)

    2016-06-10

    epidemics spreading . Bibliography (J1) F. Pasqualetti, S. Zampieri, and F. Bullo. Controllability metrics, limitations and algorithms for complex networks ...controllability properties of the clusters and on their coupling strength. We validate our results with examples from power networks , social networks , and...SECURITY CLASSIFICATION OF: Supported by this project, we designed innovative routing, planning and coordination strategies for robotic networks and

  3. Trust-Based Route Selection in Dynamic Source Routin

    DEFF Research Database (Denmark)

    Jensen, Christian D.; Connell, Paul O

    2006-01-01

    in the mobile wireless network. However, blindly trusting all other nodes to respect the routing protocol exposes the local node to a wide variety of vulnerabilities. Traditional security mechanisms rely on either the authenticated identity of the requesting principal or some form of credentials that authorise...

  4. On a New Route to Chaos in Railway Dynamics

    DEFF Research Database (Denmark)

    True, Hans; Jensen, Carsten Nordstroem

    1997-01-01

    a period-doubling cascade of the secondary period in an asymptotically stable quasiperiodic oscillation at decreasing speed. Several quasiperiodic windows were found in the chaotic motion. This route to chaos was first described by Franceschini [9], who discovered it in a seven-mode truncation of the plane...

  5. 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...

  6. 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 ...

  7. 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.

  8. 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.

  9. An Improved Shuffled Frog Leaping Algorithm and Its Application in Dynamic Emergency Vehicle Dispatching

    Directory of Open Access Journals (Sweden)

    Xiaohong Duan

    2018-01-01

    Full Text Available The traditional method for solving the dynamic emergency vehicle dispatching problem can only get a local optimal strategy in each horizon. In order to obtain the dispatching strategy that can better respond to changes in road conditions during the whole dispatching process, the real-time and time-dependent link travel speeds are fused, and a time-dependent polygonal-shaped link travel speed function is set up to simulate the predictable changes in road conditions. Response times, accident severity, and accident time windows are taken as key factors to build an emergency vehicle dispatching model integrating dynamic emergency vehicle routing and selection. For the unpredictable changes in road conditions caused by accidents, the dispatching strategy is adjusted based on the real-time link travel speed. In order to solve the dynamic emergency vehicle dispatching model, an improved shuffled frog leaping algorithm (ISFLA is proposed. The global search of the improved algorithm uses the probability model of estimation of distribution algorithm to avoid the partial optimal solution. Based on the Beijing expressway network, the efficacy of the model and the improved algorithm were tested from three aspects. The results have shown the following: (1 Compared with SFLA, the optimization performance of ISFLA is getting better and better with the increase of the number of decision variables. When the possible emergency vehicle selection strategies are 815, the objective function value of optimal selection strategies obtained by the base algorithm is 210.10% larger than that of ISFLA. (2 The prediction error of the travel speed affects the accuracy of the initial emergency vehicle dispatching. The prediction error of ±10 can basically meet the requirements of the initial dispatching. (3 The adjustment of emergency vehicle dispatching strategy can successfully bypassed road sections affected by accidents and shorten the response time.

  10. A New Model of Stopping Sight Distance of Curve Braking Based on Vehicle Dynamics

    Directory of Open Access Journals (Sweden)

    Rong-xia Xia

    2016-01-01

    Full Text Available Compared with straight-line braking, cornering brake has longer braking distance and poorer stability. Therefore, drivers are more prone to making mistakes. The braking process and the dynamics of vehicles in emergency situations on curves were analyzed. A biaxial four-wheel vehicle was simplified to a single model. Considering the braking process, dynamics, force distribution, and stability, a stopping sight distance of the curve braking calculation model was built. Then a driver-vehicle-road simulation platform was built using multibody dynamic software. The vehicle test of brake-in-turn was realized in this platform. The comparison of experimental and calculated values verified the reliability of the computational model. Eventually, the experimental values and calculated values were compared with the stopping sight distance recommended by the Highway Route Design Specification (JTGD20-2006; the current specification of stopping sight distance does not apply to cornering brake sight distance requirements. In this paper, the general values and limits of the curve stopping sight distance are presented.

  11. 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.

  12. 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.

  13. 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.

  14. Dynamic force profile in hydraulic hybrid vehicles: a numerical investigation

    Science.gov (United States)

    Mohaghegh-Motlagh, Amin; Elahinia, Mohammad H.

    2010-04-01

    A hybrid hydraulic vehicle (HHV) combines a hydraulic sub-system with the conventional drivetrain in order to improve fuel economy for heavy vehicles. The added hydraulic module manages the storage and release of fluid power necessary to assist the motion of the vehicle. The power collected by a pump/motor (P/M) from the regenerative braking phase is stored in a high-pressure accumulator and then released by the P/M to the driveshaft during the acceleration phase. This technology is effective in significantly improving fuel-economy for heavy-class vehicles with frequent stop-and-go drive schedules. Despite improved fuel economy and higher vehicle acceleration, noise and vibrations are one of the main problems of these vehicles. The dual function P/Ms are the main source of noise and vibration in a HHV. This study investigates the dynamics of a P/M and particularly the profile and frequency-dependence of the dynamic forces generated by a bent-axis P/M unit. To this end, the fluid dynamics side of the problem has been simplified for investigating the system from a dynamics perspective. A mathematical model of a bent axis P/M has been developed to investigate the cause of vibration and noise in HHVs. The forces are calculated in time and frequency domains. The results of this work can be used to study the vibration response of the chassis and to design effective vibration isolation systems for HHVs.

  15. 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

  16. DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Francisco José Estévez

    2016-06-01

    Full Text Available The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

  17. Role of Distance-Based Routing in Traffic Dynamics on Mobile Networks

    Science.gov (United States)

    Yang, Han-Xin; Wang, Wen-Xu

    2013-06-01

    Despite of intensive investigations on transportation dynamics taking place on complex networks with fixed structures, a deep understanding of networks consisting of mobile nodes is challenging yet, especially the lacking of insight into the effects of routing strategies on transmission efficiency. We introduce a distance-based routing strategy for networks of mobile agents toward enhancing the network throughput and the transmission efficiency. We study the transportation capacity and delivering time of data packets associated with mobility and communication ability. Interestingly, we find that the transportation capacity is optimized at moderate moving speed, which is quite different from random routing strategy. In addition, both continuous and discontinuous transitions from free flow to congestions are observed. Degree distributions are explored in order to explain the enhancement of network throughput and other observations. Our work is valuable toward understanding complex transportation dynamics and designing effective routing protocols.

  18. 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

  19. 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.

  20. 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.

  1. Developing cross entropy genetic algorithm for solving Two-Dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP)

    Science.gov (United States)

    Paramestha, D. L.; Santosa, B.

    2018-04-01

    Two-dimensional Loading Heterogeneous Fleet Vehicle Routing Problem (2L-HFVRP) is a combination of Heterogeneous Fleet VRP and a packing problem well-known as Two-Dimensional Bin Packing Problem (BPP). 2L-HFVRP is a Heterogeneous Fleet VRP in which these costumer demands are formed by a set of two-dimensional rectangular weighted item. These demands must be served by a heterogeneous fleet of vehicles with a fix and variable cost from the depot. The objective function 2L-HFVRP is to minimize the total transportation cost. All formed routes must be consistent with the capacity and loading process of the vehicle. Sequential and unrestricted scenarios are considered in this paper. We propose a metaheuristic which is a combination of the Genetic Algorithm (GA) and the Cross Entropy (CE) named Cross Entropy Genetic Algorithm (CEGA) to solve the 2L-HFVRP. The mutation concept on GA is used to speed up the algorithm CE to find the optimal solution. The mutation mechanism was based on local improvement (2-opt, 1-1 Exchange, and 1-0 Exchange). The probability transition matrix mechanism on CE is used to avoid getting stuck in the local optimum. The effectiveness of CEGA was tested on benchmark instance based 2L-HFVRP. The result of experiments shows a competitive result compared with the other algorithm.

  2. 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

  3. Dynamic analysis of rail vehicle axle

    Indian Academy of Sciences (India)

    In the study of Yagiz & Gursel (2005), the vertical and angular vibrations of the .... Figure 6. Variation of dynamic forces versus speed related to way conditions. ... analysed due to spring stiffness and railway quality and passenger coach load.

  4. 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.

  5. Experimental study on dynamic buckling phenomena for supercavitating underwater vehicle

    Directory of Open Access Journals (Sweden)

    Minho Chung

    2012-09-01

    Full Text Available Dynamic buckling, also known as parametric resonance, is one of the dynamic instability phenomena which may lead to catastrophic failure of structures. It occurs when compressive dynamic loading is applied to the structures. Therefore it is essential to establish a reliable procedure to test and evaluate the dynamic buckling behaviors of structures, especially when the structure is designed to be utilized in compressive dynamic loading environment, such as supercavitating underwater vehicle. In the line of thought, a dynamic buckling test system is designed in this work. Using the test system, dynamic buckling tests including beam, plate, and stiffened plate are carried out, and the dynamic buckling characteristics of considered structures are investigated experimentally as well as theoretically and numerically.

  6. A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

    Directory of Open Access Journals (Sweden)

    DING Yulin

    2016-12-01

    Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

  7. 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...

  8. Nonlinear Analysis and Intelligent Control of Integrated Vehicle Dynamics

    Directory of Open Access Journals (Sweden)

    C. Huang

    2014-01-01

    Full Text Available With increasing and more stringent requirements for advanced vehicle integration, including vehicle dynamics and control, traditional control and optimization strategies may not qualify for many applications. This is because, among other factors, they do not consider the nonlinear characteristics of practical systems. Moreover, the vehicle wheel model has some inadequacies regarding the sideslip angle, road adhesion coefficient, vertical load, and velocity. In this paper, an adaptive neural wheel network is introduced, and the interaction between the lateral and vertical dynamics of the vehicle is analyzed. By means of nonlinear analyses such as the use of a bifurcation diagram and the Lyapunov exponent, the vehicle is shown to exhibit complicated motions with increasing forward speed. Furthermore, electric power steering (EPS and active suspension system (ASS, which are based on intelligent control, are used to reduce the nonlinear effect, and a negotiation algorithm is designed to manage the interdependences and conflicts among handling stability, driving smoothness, and safety. Further, a rapid control prototype was built using the hardware-in-the-loop simulation platform dSPACE and used to conduct a real vehicle test. The results of the test were consistent with those of the simulation, thereby validating the proposed control.

  9. 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.

  10. 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.

  11. 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.

  12. Electric Vehicle Smart Charging using Dynamic Price Signal

    DEFF Research Database (Denmark)

    Martinenas, Sergejus; Pedersen, Anders Bro; Marinelli, Mattia

    2014-01-01

    , however, be resolved by using intelligent EV charging strategies, commonly referred to as ”Smart Charging”. The basic approach involves modifying the default vehicle charging scheme of ”immediate charging”, to a more optimal one that is derived from insight into the current state of the grid. This work......With yearly increases in Electric Vehicle (EV) sales, the future for electric mobility continues to brighten, and with more vehicles hitting the roads every day, the energy requirements on the grid will increase, potentially causing low-voltage distribution grid congestion. This problem can...... proposed in this paper, involves a real-time control strategy for charging the EV using a dynamic price tariff, with the objective of minimizing the charging cost. Two different charging scenario are investigated, and the results are verified by experiments on a real Electric Vehicle. Finally, the costs...

  13. Nonlinear dynamics of autonomous vehicles with limits on acceleration

    Science.gov (United States)

    Davis, L. C.

    2014-07-01

    The stability of autonomous vehicle platoons with limits on acceleration and deceleration is determined. If the leading-vehicle acceleration remains within the limits, all vehicles in the platoon remain within the limits when the relative-velocity feedback coefficient is equal to the headway time constant [k=1/h]. Furthermore, if the sensitivity α>1/h, no collisions occur. String stability for small perturbations is assumed and the initial condition is taken as the equilibrium state. Other values of k and α that give stability with no collisions are found from simulations. For vehicles with non-negligible mechanical response, simulations indicate that the acceleration-feedback-control gain might have to be dynamically adjusted to obtain optimal performance as the response time changes with engine speed. Stability is demonstrated for some perturbations that cause initial acceleration or deceleration greater than the limits, yet do not cause collisions.

  14. Volume Dynamics Propulsion System Modeling for Supersonics Vehicle Research

    Science.gov (United States)

    Kopasakis, George; Connolly, Joseph W.; Paxson, Daniel E.; Ma, Peter

    2010-01-01

    Under the NASA Fundamental Aeronautics Program the Supersonics Project is working to overcome the obstacles to supersonic commercial flight. The proposed vehicles are long slim body aircraft with pronounced aero-servo-elastic modes. These modes can potentially couple with propulsion system dynamics; leading to performance challenges such as aircraft ride quality and stability. Other disturbances upstream of the engine generated from atmospheric wind gusts, angle of attack, and yaw can have similar effects. In addition, for optimal propulsion system performance, normal inlet-engine operations are required to be closer to compressor stall and inlet unstart. To study these phenomena an integrated model is needed that includes both airframe structural dynamics as well as the propulsion system dynamics. This paper covers the propulsion system component volume dynamics modeling of a turbojet engine that will be used for an integrated vehicle Aero-Propulso-Servo-Elastic model and for propulsion efficiency studies.

  15. 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

  16. Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks

    DEFF Research Database (Denmark)

    Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso

    2012-01-01

    The energy efficiency in telecommunication networks is gaining more relevance as the Internet traffic is growing. The introduction of OFDM and dynamic operation opens new horizons in the operation of optical networks, improving the network flexibility and its efficiency. In this paper, we compare...... the performance in terms of energy efficiency of a flexible-grid OFDM-based solution with a fixed-grid WDM network in a dynamic scenario with time-varying connections. We highlight the benefits that the bandwidth elasticity and the flexibility of selecting different modulation formats can offer compared...

  17. 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.

  18. 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.

  19. Recent advances in the fundamental understanding of railway vehicle dynamics

    DEFF Research Database (Denmark)

    True, Hans

    2006-01-01

    The topic of this article is the calculation of the critical speed for railway vehicles. It is emphasised that it is misleading to formulate the mathematical problem as a stability problem. It must correctly be formulated as a problem of existence of coexisting solutions to the full non-linear dy......The topic of this article is the calculation of the critical speed for railway vehicles. It is emphasised that it is misleading to formulate the mathematical problem as a stability problem. It must correctly be formulated as a problem of existence of coexisting solutions to the full non......-linear dynamical problem. The lowest speed at which there exist more critical speed in road tests. A couple of examples show applications of the method to various dynamical models of railway vehicles. Freight wagons are treated in the end of the article because the dry friction damping with stick-slip and end...

  20. 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.

  1. Integrated vehicle dynamics control using State Dependent Riccati Equations

    NARCIS (Netherlands)

    Bonsen, B.; Mansvelders, R.; Vermeer, E.

    2010-01-01

    In this paper we discuss a State Dependent Riccati Equations (SDRE) solution for Integrated Vehicle Dynamics Control (IVDC). The SDRE approach is a nonlinear variant of the well known Linear Quadratic Regulator (LQR) and implements a quadratic cost function optimization. A modified version of this

  2. Modelling the Aggregated Dynamic Response of Electric Vehicles

    DEFF Research Database (Denmark)

    Ziras, Charalampos; Hu, Junjie; You, Shi

    2017-01-01

    There is an increasing interest in the use of electric vehicles (EVs) for providing fast frequency reserves due to their large installed capacity and their very fast response. Most works focus on scheduling and optimization and usually neglect their aggregated dynamic response, which...

  3. 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.

  4. 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.

  5. 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 ...

  6. Research on Dynamic Coupled Characteristics of A Tracked Vehicle Gearbox

    Directory of Open Access Journals (Sweden)

    Hui Liu

    2011-12-01

    Full Text Available A tracked vehicle gearbox is divided into two subsystems-housing and gear train. Dynamic behaviors of the two subsystems are coupled practically. And the coupled characteristics describe the integrative dynamic behaviors of gearbox. This study proposes a coupled simulation model to investigate the interrelationship between dynamics of two subsystems. Multi-source excitations are numerically calculated to provide boundary conditions. The flexibility of transmission shafts and housing is mathematically described based on mode superposition. The coupled dynamic characteristics are analyzed with dynamics simulation computation. The flexibility of housing is one of the main causes to induce the fluctuation of dynamic responses of transmission shafts. The experimental results show that the proposed method is accurate through comparison of simulation results and test data.

  7. Dynamic Surface Control and Its Application to Lateral Vehicle Control

    Directory of Open Access Journals (Sweden)

    Bongsob Song

    2014-01-01

    Full Text Available This paper extends the design and analysis methodology of dynamic surface control (DSC in Song and Hedrick, 2011, for a more general class of nonlinear systems. When rotational mechanical systems such as lateral vehicle control and robot control are considered for applications, sinusoidal functions are easily included in the equation of motions. If such a sinusoidal function is used as a forcing term for DSC, the stability analysis faces the difficulty due to highly nonlinear functions resulting from the low-pass filter dynamics. With modification of input variables to the filter dynamics, the burden of mathematical analysis can be reduced and stability conditions in linear matrix inequality form to guarantee the quadratic stability via DSC are derived for the given class of nonlinear systems. Finally, the proposed design and analysis approach are applied to lateral vehicle control for forward automated driving and backward parallel parking at a low speed as well as an illustrative example.

  8. Dynamic Response of Railway Bridges Subjected to Passing Vehicles

    Directory of Open Access Journals (Sweden)

    Moravčík Milan

    2017-12-01

    Full Text Available This paper discusses some issues related to dynamic effects in railway bridges focussed on the dynamic behaviour of the small and medium span simply supported railway bridges subjected to a series of moving vehicle. Presented parametric study is focused on the dynamic deflection of the simply supported railway bridge of the span Lb = 38 m, due to the series moving loads representing a conventional train with the IC-coaches, with the impact to the speed up to 160 km/h applied in Slovakia.

  9. Cone Algorithm of Spinning Vehicles under Dynamic Coning Environment

    Directory of Open Access Journals (Sweden)

    Shuang-biao Zhang

    2015-01-01

    Full Text Available Due to the fact that attitude error of vehicles has an intense trend of divergence when vehicles undergo worsening coning environment, in this paper, the model of dynamic coning environment is derived firstly. Then, through investigation of the effect on Euler attitude algorithm for the equivalency of traditional attitude algorithm, it is found that attitude error is actually the roll angle error including drifting error and oscillating error, which is induced directly by dynamic coning environment and further affects the pitch angle and yaw angle through transferring. Based on definition of the cone frame and cone attitude, a cone algorithm is proposed by rotation relationship to calculate cone attitude, and the relationship between cone attitude and Euler attitude of spinning vehicle is established. Through numerical simulations with different conditions of dynamic coning environment, it is shown that the induced error of Euler attitude fluctuates by the variation of precession and nutation, especially by that of nutation, and the oscillating frequency of roll angle error is twice that of pitch angle error and yaw angle error. In addition, the rotation angle is more competent to describe the spinning process of vehicles under coning environment than Euler angle gamma, and the real pitch angle and yaw angle are calculated finally.

  10. 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

  11. 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...

  12. Influences of braking system faults on the vehicle dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Straky, H.; Kochem, M.; Schmitt, J.; Hild, R.; Isermann, R. [Technische Univ., Darmstadt (Germany). Inst. of Automatic Control

    2001-07-01

    From a safety point of view the braking system is, besides the driver, one of the key subsystems in a car. The driver, as an adaptive control system, might not notice small faults in the hydraulic part of the braking system and sooner or later critical braking situations, e.g. due to a brake-circuit failure, may occur. Most of the drivers are not capable to deal with such critical situations. Therefore this paper investigates the influence of faults in the braking system on the dynamic vehicle behavior and the steering inputs of the driver to keep the vehicle on the desired course. (orig.)

  13. Energy Efficient Routing Algorithms in Dynamic Optical Core Networks with Dual Energy Sources

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée

    2013-01-01

    This paper proposes new energy efficient routing algorithms in optical core networks, with the application of solar energy sources and bundled links. A comprehensive solar energy model is described in the proposed network scenarios. Network performance in energy savings, connection blocking...... probability, resource utilization and bundled link usage are evaluated with dynamic network simulations. Results show that algorithms proposed aiming for reducing the dynamic part of the energy consumption of the network may raise the fixed part of the energy consumption meanwhile....

  14. Diagrammatic routes to nonlocal correlations beyond dynamical mean field theory

    Science.gov (United States)

    Rohringer, G.; Hafermann, H.; Toschi, A.; Katanin, A. A.; Antipov, A. E.; Katsnelson, M. I.; Lichtenstein, A. I.; Rubtsov, A. N.; Held, K.

    2018-04-01

    Strong electronic correlations pose one of the biggest challenges to solid state theory. Recently developed methods that address this problem by starting with the local, eminently important correlations of dynamical mean field theory (DMFT) are reviewed. In addition, nonlocal correlations on all length scales are generated through Feynman diagrams, with a local two-particle vertex instead of the bare Coulomb interaction as a building block. With these diagrammatic extensions of DMFT long-range charge, magnetic, and superconducting fluctuations as well as (quantum) criticality can be addressed in strongly correlated electron systems. An overview is provided of the successes and results achieved, mainly for model Hamiltonians, and an outline is given of future prospects for realistic material calculations.

  15. Optimal Route Searching with Multiple Dynamical Constraints—A Geometric Algebra Approach

    Directory of Open Access Journals (Sweden)

    Dongshuang Li

    2018-05-01

    Full Text Available The process of searching for a dynamic constrained optimal path has received increasing attention in traffic planning, evacuation, and personalized or collaborative traffic service. As most existing multiple constrained optimal path (MCOP methods cannot search for a path given various types of constraints that dynamically change during the search, few approaches for dynamic multiple constrained optimal path (DMCOP with type II dynamics are available for practical use. In this study, we develop a method to solve the DMCOP problem with type II dynamics based on the unification of various types of constraints under a geometric algebra (GA framework. In our method, the network topology and three different types of constraints are represented by using algebraic base coding. With a parameterized optimization of the MCOP algorithm based on a greedy search strategy under the generation-refinement paradigm, this algorithm is found to accurately support the discovery of optimal paths as the constraints of numerical values, nodes, and route structure types are dynamically added to the network. The algorithm was tested with simulated cases of optimal tourism route searches in China’s road networks with various combinations of constraints. The case study indicates that our algorithm can not only solve the DMCOP with different types of constraints but also use constraints to speed up the route filtering.

  16. Improving the road network performance with dynamic route guidance by considering the indifference band of road users

    NARCIS (Netherlands)

    Vreeswijk, J.D.; Landman, R.L.; Van Berkum, E.C.; Hegyi, A.; Hoogendoorn, S.P.; Van Arem, B.

    2012-01-01

    When applying dynamic route guidance to improve the network performance, it is important to balance the interests of the road authorities and the road users. In this paper we will illustrate how bounded rationality and indifference bands can be taken into account in dynamic route guidance to improve

  17. Vehicle Unsteady Dynamics Characteristics Based on Tire and Road Features

    Directory of Open Access Journals (Sweden)

    Bin Ma

    2013-01-01

    Full Text Available During automotive related accidents, tire and road play an important role in vehicle unsteady dynamics as they have a significant impact on the sliding friction. The calculation of the rubber viscoelastic energy loss modulus and the true contact area model is improved based on the true contact area and the rubber viscoelastic theory. A 10 DOF full vehicle dynamic model in consideration of the kinetic sliding friction coefficient which has good accuracy and reality is developed. The stability test is carried out to evaluate the effectiveness of the model, and the simulation test is done in MATLAB to analyze the impact of tire feature and road self-affine characteristics on the sport utility vehicle (SUV unsteady dynamics under different weights. The findings show that it is a great significance to analyze the SUV dynamics equipped with different tire on different roads, which may provide useful insights into solving the explicit-implicit features of tire prints in systematically and designing active safety systems.

  18. Dynamic Vehicle Scheduling for Working Service Network with Dual Demands

    Directory of Open Access Journals (Sweden)

    Bing Li

    2017-01-01

    Full Text Available This study aims to develop some models to aid in making decisions on the combined fleet size and vehicle assignment in working service network where the demands include two types (minimum demands and maximum demands, and vehicles themselves can act like a facility to provide services when they are stationary at one location. This type of problem is named as the dynamic working vehicle scheduling with dual demands (DWVS-DD and formulated as a mixed integer programming (MIP. Instead of a large integer program, the problem is decomposed into small local problems that are guided by preset control parameters. The approach for preset control parameters is given. By introducing them into the MIP formulation, the model is reformulated as a piecewise form. Further, a piecewise method by updating preset control parameters is proposed for solving the reformulated model. Numerical experiments show that the proposed method produces better solution within reasonable computing time.

  19. Dynamic tensegrity based cooperative control of uninhabited vehicles

    Energy Technology Data Exchange (ETDEWEB)

    Lau, Sook Yen; Naeem, Wasif [Queen' s Univ., Belfast (United Kingdom). School of Electronics, Electrical Engineering and Computer Science

    2013-07-01

    A new formation control methodology is presented in this paper. The proposed technique is modelled by using the concept of cross-tensegrity structures. The main task is to regulate the desired formation of a group of vehicles and to perform point-to-point manoeuvring in the plane. The position of the controlled vehicles in the formation changes with respect to the admissible tendon forces by varying the lengths of bars in the dynamic tensegrity structure modelling. This change of bars' dimensions for geometric transformation is not possible in the application of tensegrity concept in the physical structural engineering. It has been demonstrated that this control method allows more flexibility over a wide range of different shape switching tasks using the predictable tendon control forces under the limited communication's range. The proposed approach is also scalable to any number of pairs of autonomous vehicles in the formation.

  20. Research on consumable distribution mode of shipbuilder’s shop based on vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Xiang Su

    2017-02-01

    Full Text Available A distribution vehicle optimization is established with considerations for the problem of long period of requisition and high shop costs due to the existing consumable requisition mode in shipbuilder’s shops for the requirements of shops for consumables. The shortest traveling distance of distribution vehicles are calculated with the genetic algorithm (GA. Explorations are made into a shop consumable distribution mode for shipbuilders to help them to effectively save their production logistics costs, enhance their internal material management level and provide reference for shipbuilder’s change in traditional ways and realization of just-in-time (JIT production.

  1. Modern techniques for condition monitoring of railway vehicle dynamics

    International Nuclear Information System (INIS)

    Ngigi, R W; Pislaru, C; Ball, A; Gu, F

    2012-01-01

    A modern railway system relies on sophisticated monitoring systems for maintenance and renewal activities. Some of the existing conditions monitoring techniques perform fault detection using advanced filtering, system identification and signal analysis methods. These theoretical approaches do not require complex mathematical models of the system and can overcome potential difficulties associated with nonlinearities and parameter variations in the system. Practical applications of condition monitoring tools use sensors which are mounted either on the track or rolling stock. For instance, monitoring wheelset dynamics could be done through the use of track-mounted sensors, while vehicle-based sensors are preferred for monitoring the train infrastructure. This paper attempts to collate and critically appraise the modern techniques used for condition monitoring of railway vehicle dynamics by analysing the advantages and shortcomings of these methods.

  2. Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sunil Kumar

    2013-01-01

    Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

  3. Dynamic Routing for Delay-Tolerant Networking in Space Flight Operations

    Science.gov (United States)

    Burleigh, Scott C.

    2008-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology composed of scheduled, bounded communication contacts in a network built on the Delay-Tolerant Networking (DTN) architecture. It is designed to support operations in a space network based on DTN, but it also could be used in terrestrial applications where operation according to a predefined schedule is preferable to opportunistic communication, as in a low-power sensor network. This paper will describe the operation of the CGR system and explain how it can enable data delivery over scheduled transmission opportunities, fully utilizing the available transmission capacity, without knowing the current state of any bundle protocol node (other than the local node itself) and without exhausting processing resources at any bundle router.

  4. Dynamic flow control strategies of vehicle SCR Urea Dosing System

    Science.gov (United States)

    Lin, Wei; Zhang, Youtong; Asif, Malik

    2015-03-01

    Selective Catalyst Reduction(SCR) Urea Dosing System(UDS) directly affects the system accuracy and the dynamic response performance of a vehicle. However, the UDS dynamic response is hard to keep up with the changes of the engine's operating conditions. That will lead to low NO X conversion efficiency or NH3 slip. In order to optimize the injection accuracy and the response speed of the UDS in dynamic conditions, an advanced control strategy based on an air-assisted volumetric UDS is presented. It covers the methods of flow compensation and switching working conditions. The strategy is authenticated on an UDS and tested in different dynamic conditions. The result shows that the control strategy discussed results in higher dynamic accuracy and faster dynamic response speed of UDS. The inject deviation range is improved from being between -8% and 10% to -4% and 2% and became more stable than before, and the dynamic response time was shortened from 200 ms to 150 ms. The ETC cycle result shows that after using the new strategy the NH3 emission is reduced by 60%, and the NO X emission remains almost unchanged. The trade-off between NO X conversion efficiency and NH3 slip is mitigated. The studied flow compensation and switching working conditions can improve the dynamic performance of the UDS significantly and make the UDS dynamic response keep up with the changes of the engine's operating conditions quickly.

  5. Dynamics and Control of Non-Smooth Systems with Applications to Supercavitating Vehicles

    Science.gov (United States)

    2011-01-01

    ABSTRACT Title of dissertation: Dynamics and Control of Non-Smooth Systems with Applications to Supercavitating Vehicles Vincent Nguyen, Doctor of...relates to the dynamics of non-smooth vehicle systems, and in particular, supercavitating vehicles. These high-speed under- water vehicles are...Applications to Supercavitating Vehicles 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) 5d. PROJECT NUMBER 5e. TASK

  6. Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes

    Science.gov (United States)

    Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

    2015-01-01

    Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes. PMID:26294903

  7. Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes.

    Science.gov (United States)

    Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

    2015-01-01

    Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes.

  8. Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing.

    Directory of Open Access Journals (Sweden)

    Maksim Kitsak

    Full Text Available Data transfer is one of the main functions of the Internet. The Internet consists of a large number of interconnected subnetworks or domains, known as Autonomous Systems (ASes. Due to privacy and other reasons the information about what route to use to reach devices within other ASes is not readily available to any given AS. The Border Gateway Protocol (BGP is responsible for discovering and distributing this reachability information to all ASes. Since the topology of the Internet is highly dynamic, all ASes constantly exchange and update this reachability information in small chunks, known as routing control packets or BGP updates. In the view of the quick growth of the Internet there are significant concerns with the scalability of the BGP updates and the efficiency of the BGP routing in general. Motivated by these issues we conduct a systematic time series analysis of BGP update rates. We find that BGP update time series are extremely volatile, exhibit long-term correlations and memory effects, similar to seismic time series, or temperature and stock market price fluctuations. The presented statistical characterization of BGP update dynamics could serve as a basis for validation of existing and developing better models of Internet interdomain routing.

  9. Dynamic interaction of monowheel inclined vehicle-vibration platform coupled system with quadratic and cubic nonlinearities

    Science.gov (United States)

    Zhou, Shihua; Song, Guiqiu; Sun, Maojun; Ren, Zhaohui; Wen, Bangchun

    2018-01-01

    In order to analyze the nonlinear dynamics and stability of a novel design for the monowheel inclined vehicle-vibration platform coupled system (MIV-VPCS) with intermediate nonlinearity support subjected to a harmonic excitation, a multi-degree of freedom lumped parameter dynamic model taking into account the dynamic interaction of the MIV-VPCS with quadratic and cubic nonlinearities is presented. The dynamical equations of the coupled system are derived by applying the displacement relationship, interaction force relationship at the contact position and Lagrange's equation, which are further discretized into a set of nonlinear ordinary differential equations with coupled terms by Galerkin's truncation. Based on the mathematical model, the coupled multi-body nonlinear dynamics of the vibration system is investigated by numerical method, and the parameters influences of excitation amplitude, mass ratio and inclined angle on the dynamic characteristics are precisely analyzed and discussed by bifurcation diagram, Largest Lyapunov exponent and 3-D frequency spectrum. Depending on different ranges of system parameters, the results show that the different motions and jump discontinuity appear, and the coupled system enters into chaotic behavior through different routes (period-doubling bifurcation, inverse period-doubling bifurcation, saddle-node bifurcation and Hopf bifurcation), which are strongly attributed to the dynamic interaction of the MIV-VPCS. The decreasing excitation amplitude and inclined angle could reduce the higher order bifurcations, and effectively control the complicated nonlinear dynamic behaviors under the perturbation of low rotational speed. The first bifurcation and chaotic motion occur at lower value of inclined angle, and the chaotic behavior lasts for larger intervals with higher rotational speed. The investigation results could provide a better understanding of the nonlinear dynamic behaviors for the dynamic interaction of the MIV-VPCS.

  10. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Energy Technology Data Exchange (ETDEWEB)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-07-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  11. A granular t abu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    International Nuclear Information System (INIS)

    Bernal, Jose; Escobar, John Willmer; Linfati, Rodrigo

    2017-01-01

    We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW) for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase), a granular tabu search is applied during the improvement phase (second phase). Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  12. A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems

    Energy Technology Data Exchange (ETDEWEB)

    Hope Forsmann; Robert Hiromoto; John Svoboda

    2007-04-01

    The popularity of UAVs has increased dramatically because of their successful deployment in military operations, their ability to preserve human life, and the continual improvements in wireless communication that serves to increase their capabilities. We believe the usefulness of UAVs would be dramatically increased if formation flight were added to the list of capabilities. Currently, sustained formation flight with a cluster of UAVs has only been achieved with two nodes by the Multi-UAV Testbed at the Massachusetts Institute of Technology. (Park, 2004) Formation flight is a complex operation requiring the ability to adjust the flight patterns on the fly and correct for wind gusts, terrain, and differences in node equipment. All of which increases the amount of inner node communication. Since one of the problems with MANET communication is network congestion, we believe a first step towards formation flight can be made through improved inner node communication. We have investigated current communication routing protocols and developed an altered hybrid routing protocol in order to provide communication with less network congestion.

  13. 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)

  14. 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.

  15. 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.

  16. On the Theory of Nonlinear Dynamics and its Applications in Vehicle Systems Dynamics

    DEFF Research Database (Denmark)

    True, Hans

    1999-01-01

    We present a brief outline of nonlinear dynamics and its applications to vehicle systems dynamics problems. The concept of a phase space is introduced in order to illustrate the dynamics of nonlinear systems in a way that is easy to perceive. Various equilibrium states are defined...... of nonlinear dynamics in vehicle simulations is discussed, and it is argued that it is necessary to know the equilibrium states of the full nonlinear system before the simulation calculations are performed......., and the important case of multiple equilibrium states and their dependence on a parameter is discussed. It is argued that the analysis of nonlinear dynamic problems always should start with an analysis of the equilibrium states of the full nonlinear problem whereby great care must be taken in the choice...

  17. A dynamic continental runoff routing model applied to the last Northern Hemisphere deglaciation

    Directory of Open Access Journals (Sweden)

    H. Goelzer

    2012-05-01

    Full Text Available We describe and evaluate a dynamical continental runoff routing model for the Northern Hemisphere that calculates the runoff pathways in response to topographic modifications due to changes in ice thickness and isostatic adjustment. The algorithm is based on the steepest gradient method and takes as simplifying assumption that depressions are filled at all times and water drains through the lowest outlet points. It also considers changes in water storage and lake drainage in post-processing mode that become important in the presence of large ice dammed proglacial lakes. Although applicable to other scenarios as well, the model was conceived to study the routing of freshwater fluxes during the last Northern Hemisphere deglaciation. For that specific application we simulated the Northern Hemisphere ice sheets with an existing 3-D thermomechanical ice sheet model, which calculates changes in topography due to changes in ice cover and isostatic adjustment, as well as the evolution of freshwater fluxes resulting from surface ablation, iceberg calving and basal melt. The continental runoff model takes this input, calculates the drainage pathways and routes the freshwater fluxes to the surface grid points of an existing ocean model. This results in a chronology of temporally and spatially varying freshwater fluxes from the Last Glacial Maximum to the present day. We analyse the dependence of the runoff routing to grid resolution and parameters of the isostatic adjustment module of the ice sheet model.

  18. Safety of railroad passenger vehicle dynamics : OMNISIM simulation and test correlations for passenger rail cars

    Science.gov (United States)

    2002-07-01

    The purpose of the work is to validate the safety assessment methodology previously developed for passenger rail vehicle dynamics, which requires the application of simulation tools as well as testing of vehicles under different track scenarios. This...

  19. Reentry Vehicle Flight Controls Design Guidelines: Dynamic Inversion

    Science.gov (United States)

    Ito, Daigoro; Georgie, Jennifer; Valasek, John; Ward, Donald T.

    2002-01-01

    This report addresses issues in developing a flight control design for vehicles operating across a broad flight regime and with highly nonlinear physical descriptions of motion. Specifically it addresses the need for reentry vehicles that could operate through reentry from space to controlled touchdown on Earth. The latter part of controlled descent is achieved by parachute or paraglider - or by all automatic or a human-controlled landing similar to that of the Orbiter. Since this report addresses the specific needs of human-carrying (not necessarily piloted) reentry vehicles, it deals with highly nonlinear equations of motion, and then-generated control systems must be robust across a very wide range of physics. Thus, this report deals almost exclusively with some form of dynamic inversion (DI). Two vital aspects of control theory - noninteracting control laws and the transformation of nonlinear systems into equivalent linear systems - are embodied in DI. Though there is no doubt that the mathematical tools and underlying theory are widely available, there are open issues as to the practicality of using DI as the only or primary design approach for reentry articles. This report provides a set of guidelines that can be used to determine the practical usefulness of the technique.

  20. Spectral encoded optical label detection for dynamic routing of impulse radio ultra-wideband signals in metro-access networks

    DEFF Research Database (Denmark)

    Osadchiy, Alexey Vladimirovich; Yu, Xianbin; Yin, Xiaoli

    2010-01-01

    In this paper we propose and experimentally demonstrate the principle of coherent label detection for dynamic routing of wavelength division multiplexed impulse radio ultra-wideband signals by using four-tone spectral amplitude coded labels.......In this paper we propose and experimentally demonstrate the principle of coherent label detection for dynamic routing of wavelength division multiplexed impulse radio ultra-wideband signals by using four-tone spectral amplitude coded labels....

  1. Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

    International Nuclear Information System (INIS)

    Xie Wei-Hao; Zhou Bin; Liu En-Xiao; Lu Wei-Dang; Zhou Ting

    2015-01-01

    Many real communication networks, such as oceanic monitoring network and land environment observation network, can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue (HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue (HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity. (paper)

  2. Vehicle Dynamics Control of In-wheel Electric Motor Drive Vehicles Based on Averaging of Tire Force Usage

    Science.gov (United States)

    Masaki, Nobuo; Iwano, Haruo; Kamada, Takayoshi; Nagai, Masao

    For in-wheel electric motor drive vehicles, a new vehicle dynamics control which is based on the tire force usage rate is proposed. The new controller adopts non-linear optimal control could manage the interference between direct yaw-moment control and the tire force usage rate. The new control is considered total longitudinal and transverse tire force. Therefore the controller can prevent tire force saturation near tire force limit during cornering. Simulations and test runs by the custom made four wheel drive in-wheel motor electric vehicle show that higher driving stability performance compared to the performance of the same vehicle without control.

  3. 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.

  4. Tourist activated networks: Implications for dynamic bundling and en-route recommendations

    DEFF Research Database (Denmark)

    Zach, Florian; Gretzel, Ulrike

    2011-01-01

    This article discusses tourist-activated networks as a concept to inform technological applications supporting dynamic bundling and en route recommendations. Empirical data were collected from travelers who visited a regional destination in the US and then analyzed with respect to its network...... structure. The results indicate that the tourist-activated network for the destination is rather sparse and that there are clearly differences in core and peripheral nodes. The findings illustrate the structure of a tourist-activated network and provide implications for technology design and tourism...

  5. A Proposal for IoT Dynamic Routes Selection Based on Contextual Information.

    Science.gov (United States)

    Araújo, Harilton da Silva; Filho, Raimir Holanda; Rodrigues, Joel J P C; Rabelo, Ricardo de A L; Sousa, Natanael de C; Filho, José C C L S; Sobral, José V V

    2018-01-26

    The Internet of Things (IoT) is based on interconnection of intelligent and addressable devices, allowing their autonomy and proactive behavior with Internet connectivity. Data dissemination in IoT usually depends on the application and requires context-aware routing protocols that must include auto-configuration features (which adapt the behavior of the network at runtime, based on context information). This paper proposes an approach for IoT route selection using fuzzy logic in order to attain the requirements of specific applications. In this case, fuzzy logic is used to translate in math terms the imprecise information expressed by a set of linguistic rules. For this purpose, four Objective Functions (OFs) are proposed for the Routing Protocol for Low Power and Loss Networks (RPL); such OFs are dynamically selected based on context information. The aforementioned OFs are generated from the fusion of the following metrics: Expected Transmission Count (ETX), Number of Hops (NH) and Energy Consumed (EC). The experiments performed through simulation, associated with the statistical data analysis, conclude that this proposal provides high reliability by successfully delivering nearly 100% of data packets, low delay for data delivery and increase in QoS. In addition, an 30% improvement is attained in the network life time when using one of proposed objective function, keeping the devices alive for longer duration.

  6. The effect of dynamic scheduling and routing in a solid waste management system

    International Nuclear Information System (INIS)

    Johansson, Ola M.

    2006-01-01

    Solid waste collection and hauling account for the greater part of the total cost in modern solid waste management systems. In a recent initiative, 3300 Swedish recycling containers have been fitted with level sensors and wireless communication equipment, thereby giving waste collection operators access to real-time information on the status of each container. In this study, analytical modeling and discrete-event simulation have been used to evaluate different scheduling and routing policies utilizing the real-time data. In addition to the general models developed, an empirical simulation study has been performed on the downtown recycling station system in Malmoe, Sweden. From the study, it can be concluded that dynamic scheduling and routing policies exist that have lower operating costs, shorter collection and hauling distances, and reduced labor hours compared to the static policy with fixed routes and pre-determined pick-up frequencies employed by many waste collection operators today. The results of the analytical model and the simulation models are coherent, and consistent with experiences of the waste collection operators

  7. A Proposal for IoT Dynamic Routes Selection Based on Contextual Information

    Directory of Open Access Journals (Sweden)

    Harilton da Silva Araújo

    2018-01-01

    Full Text Available The Internet of Things (IoT is based on interconnection of intelligent and addressable devices, allowing their autonomy and proactive behavior with Internet connectivity. Data dissemination in IoT usually depends on the application and requires context-aware routing protocols that must include auto-configuration features (which adapt the behavior of the network at runtime, based on context information. This paper proposes an approach for IoT route selection using fuzzy logic in order to attain the requirements of specific applications. In this case, fuzzy logic is used to translate in math terms the imprecise information expressed by a set of linguistic rules. For this purpose, four Objective Functions (OFs are proposed for the Routing Protocol for Low Power and Loss Networks (RPL; such OFs are dynamically selected based on context information. The aforementioned OFs are generated from the fusion of the following metrics: Expected Transmission Count (ETX, Number of Hops (NH and Energy Consumed (EC. The experiments performed through simulation, associated with the statistical data analysis, conclude that this proposal provides high reliability by successfully delivering nearly 100% of data packets, low delay for data delivery and increase in QoS. In addition, an 30% improvement is attained in the network life time when using one of proposed objective function, keeping the devices alive for longer duration.

  8. 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...

  9. A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

    Directory of Open Access Journals (Sweden)

    Jose Bernal

    2017-10-01

    Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

  10. Modal and Dynamic Analysis of a Vehicle with Kinetic Dynamic Suspension System

    Directory of Open Access Journals (Sweden)

    Bangji Zhang

    2016-01-01

    Full Text Available A novel kinetic dynamic suspension (KDS system is presented for the cooperative control of the roll and warp motion modes of off-road vehicles. The proposed KDS system consists of two hydraulic cylinders acting on the antiroll bars. Hence, the antiroll bars are not completely replaced by the hydraulic system, but both systems are installed. In this paper, the vibration analysis in terms of natural frequencies of different motion modes in frequency domain for an off-road vehicle equipped with different configurable suspension systems is studied by using the modal analysis method. The dynamic responses of the vehicle with different configurable suspension systems are investigated under different road excitations and maneuvers. The results of the modal and dynamic analysis prove that the KDS system can reduce the roll and articulation motions of the off-road vehicle without adding extra bounce stiffness and deteriorating the ride comfort. Furthermore, the roll stiffness is increased and the warp stiffness is decreased by the KDS system, which could significantly enhance handing performance and off-road capability.

  11. 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.

  12. Dynamic electricity pricing for electric vehicles using stochastic programming

    International Nuclear Information System (INIS)

    Soares, João; Ghazvini, Mohammad Ali Fotouhi; Borges, Nuno; Vale, Zita

    2017-01-01

    Electric Vehicles (EVs) are an important source of uncertainty, due to their variable demand, departure time and location. In smart grids, the electricity demand can be controlled via Demand Response (DR) programs. Smart charging and vehicle-to-grid seem highly promising methods for EVs control. However, high capital costs remain a barrier to implementation. Meanwhile, incentive and price-based schemes that do not require high level of control can be implemented to influence the EVs' demand. Having effective tools to deal with the increasing level of uncertainty is increasingly important for players, such as energy aggregators. This paper formulates a stochastic model for day-ahead energy resource scheduling, integrated with the dynamic electricity pricing for EVs, to address the challenges brought by the demand and renewable sources uncertainty. The two-stage stochastic programming approach is used to obtain the optimal electricity pricing for EVs. A realistic case study projected for 2030 is presented based on Zaragoza network. The results demonstrate that it is more effective than the deterministic model and that the optimal pricing is preferable. This study indicates that adequate DR schemes like the proposed one are promising to increase the customers' satisfaction in addition to improve the profitability of the energy aggregation business. - Highlights: • A stochastic model for energy scheduling tackling several uncertainty sources. • A two-stage stochastic programming is used to tackle the developed model. • Optimal EV electricity pricing seems to improve the profits. • The propose results suggest to increase the customers' satisfaction.

  13. 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

  14. 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.

  15. Dynamic Axle Load of an Automotive Vehicle When Driven on a Mobile Measurement Platform

    OpenAIRE

    Jagiełowicz-Ryznar C.

    2014-01-01

    An analysis of the dynamic axle load of an automotive vehicle (AV) when it is driven on a mobile measurement platform is presented in this paper. During the ride, the time characteristic of the dynamic force N(t), acting on the axle, was recorded. The effect of the vehicle axle mass on the maximum dynamic force value and the dynamic coefficient were studied. On this basis it was attempted to calculate the total vehicle’s weight. Conclusions concerning the dynamic loads of the vehicle axles in...

  16. 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.

  17. Sliding mode-based lateral vehicle dynamics control using tyre force measurements

    Science.gov (United States)

    Kunnappillil Madhusudhanan, Anil; Corno, Matteo; Holweg, Edward

    2015-11-01

    In this work, a lateral vehicle dynamics control based on tyre force measurements is proposed. Most of the lateral vehicle dynamics control schemes are based on yaw rate whereas tyre forces are the most important variables in vehicle dynamics as tyres are the only contact points between the vehicle and road. In the proposed method, active front steering is employed to uniformly distribute the required lateral force among the front left and right tyres. The force distribution is quantified through the tyre utilisation coefficients. In order to address the nonlinearities and uncertainties of the vehicle model, a gain scheduling sliding-mode control technique is used. In addition to stabilising the lateral dynamics, the proposed controller is able to maintain maximum lateral acceleration. The proposed method is tested and validated on a multi-body vehicle simulator.

  18. 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.

  19. A reliability-based approach of fastest routes planning in dynamic traffic network under emergency management situation

    Directory of Open Access Journals (Sweden)

    Ye Sun

    2011-12-01

    Full Text Available In order to establish an available emergency management system, it is important to conduct effective evacuation with reliable and real time optimal route plans. This paper aims at creating a route finding strategy by considering the time dependent factors as well as uncertainties that may be encountered during the emergency management system. To combine dynamic features with the level of reliability in the process of fastest route planning, the speed distribution of typical intercity roads is studied in depth, and the strategy of modifying real time speed to a more reliable value based on speed distribution is proposed. Two algorithms of route planning have been developed to find three optimal routes with the shortest travel time and the reliability of 0.9. In order to validate the new strategy, experimental implementation of the route planning method is conducted based on road speed information acquired by field study. The results show that the proposed strategy might provide more reliable routes in dynamic traffic networks by conservatively treating roads with large speed discretion or with relative extreme real speed value.

  20. Solving Algebraic Riccati Equation Real Time for Integrated Vehicle Dynamics Control

    NARCIS (Netherlands)

    Kunnappillil Madhusudhanan, A; Corno, M.; Bonsen, B.; Holweg, E.

    2012-01-01

    In this paper we present a comparison study of different computational methods to implement State Dependent Riccati Equation (SDRE) based control in real time for a vehicle dynamics control application. Vehicles are mechatronic systems with nonlinear dynamics. One of the promising nonlinear control

  1. Occupant-vehicle dynamics and the role of the internal model

    Science.gov (United States)

    Cole, David J.

    2018-05-01

    With the increasing need to reduce time and cost of vehicle development there is increasing advantage in simulating mathematically the dynamic interaction of a vehicle and its occupant. The larger design space arising from the introduction of automated vehicles further increases the potential advantage. The aim of the paper is to outline the role of the internal model hypothesis in understanding and modelling occupant-vehicle dynamics, specifically the dynamics associated with direction and speed control of the vehicle. The internal model is the driver's or passenger's understanding of the vehicle dynamics and is thought to be employed in the perception, cognition and action processes of the brain. The internal model aids the estimation of the states of the vehicle from noisy sensory measurements. It can also be used to optimise cognitive control action by predicting the consequence of the action; thus model predictive control (MPC) theory provides a foundation for modelling the cognition process. The stretch reflex of the neuromuscular system also makes use of the prediction of the internal model. Extensions to the MPC approach are described which account for: interaction with an automated vehicle; robust control; intermittent control; and cognitive workload. Further work to extend understanding of occupant-vehicle dynamic interaction is outlined. This paper is based on a keynote presentation given by the author to the 13th International Symposium on Advanced Vehicle Control (AVEC) conference held in Munich, September 2016.

  2. Advanced vehicle dynamics of heavy trucks with the perspective of road safety

    Science.gov (United States)

    Trigell, Annika Stensson; Rothhämel, Malte; Pauwelussen, Joop; Kural, Karel

    2017-10-01

    This paper presents state-of-the art within advanced vehicle dynamics of heavy trucks with the perspective of road safety. The most common accidents with heavy trucks involved are truck against passenger cars. Safety critical situations are for example loss of control (such as rollover and lateral stability) and a majority of these occur during speed when cornering. Other critical situations are avoidance manoeuvre and road edge recovery. The dynamic behaviour of heavy trucks have significant differences compared to passenger cars and as a consequence, successful application of vehicle dynamic functions for enhanced safety of trucks might differ from the functions in passenger cars. Here, the differences between vehicle dynamics of heavy trucks and passenger cars are clarified. Advanced vehicle dynamics solutions with the perspective of road safety of trucks are presented, beginning with the topic vehicle stability, followed by the steering system, the braking system and driver assistance systems that differ in some way from that of passenger cars as well.

  3. 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.

  4. Airspace Technology Demonstration 3 (ATD-3): Dynamic Weather Routes (DWR) Technology Transfer Document Summary Version 1.0

    Science.gov (United States)

    Sheth, Kapil; Wang, Easter Mayan Chan

    2016-01-01

    Airspace Technology Demonstration #3 (ATD-3) is part of NASA's Airspace Operations and Safety Program (AOSP) - specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multiyear research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the first of three Research Transition Products (RTPs) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA's legacy Dynamic Weather Routes (DWR) work for efficient routing for en-route weather avoidance. DWR is a ground-based trajectory automation system that continuously and automatically analyzes active airborne aircraft in en route airspace to identify opportunities for simple corrections to flight plan routes that can save significant flying time, at least five minutes wind-corrected, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. The key benefit of the DWR concept is to let automation continuously and automatically analyze active flights to find those where simple route corrections can save significant time and fuel. Operators are busy during weather events. It is more effective to let automation find the opportunities for high-value route corrections.

  5. A polynomial chaos approach to the analysis of vehicle dynamics under uncertainty

    Science.gov (United States)

    Kewlani, Gaurav; Crawford, Justin; Iagnemma, Karl

    2012-05-01

    The ability of ground vehicles to quickly and accurately analyse their dynamic response to a given input is critical to their safety and efficient autonomous operation. In field conditions, significant uncertainty is associated with terrain and/or vehicle parameter estimates, and this uncertainty must be considered in the analysis of vehicle motion dynamics. Here, polynomial chaos approaches that explicitly consider parametric uncertainty during modelling of vehicle dynamics are presented. They are shown to be computationally more efficient than the standard Monte Carlo scheme, and experimental results compared with the simulation results performed on ANVEL (a vehicle simulator) indicate that the method can be utilised for efficient and accurate prediction of vehicle motion in realistic scenarios.

  6. Routes, dynamics, and correlates of cochlear inflammation in terminal and recovering experimental meningitis

    DEFF Research Database (Denmark)

    Cayé-Thomasen, Per; Worsøe, Lise; Brandt, Christian Thomas

    2009-01-01

    OBJECTIVES/HYPOTHESIS: To examine the routes, dynamics and correlates of cochlear inflammation in meningitis to provide information on the pathogenesis of the associated hearing loss and indications for rational pharmacotherapeutical intervention. STUDY DESIGN: A well-established rat model...... with inflammatory cells via cochlear aqueduct, whereas the endolymphatic space was infiltrated from the spiral ligament. Rosenthal's canal was infiltrated through osseous spiral lamina canaliculi. In the untreated group, the degree of inflammation correlated with time of death, whereas antibiotic treatment reversed...... this development. Perilymphatic inflammation correlated significantly with the CSF leukocyte count, whereas endolymphatic inflammation correlated with spiral ligament inflammation. CONCLUSIONS: Meningogenic inflammation of the rat cochlea occurs via the cochlear aqueduct and the spiral ligament capillary bed...

  7. 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.

  8. 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...

  9. New route for uranium concentrate production from Caetite ore, Bahia State, Brazil; dynamic leaching - direct precipitation

    Energy Technology Data Exchange (ETDEWEB)

    Morais, Carlos A. [Centro de Desenvolvimento da Tecnologia Nuclear (CDTN/CNEN-MG), Belo Horizonte, MG (Brazil)]. E-mail: cmorais@cdtn.br; Gomiero, Luiz A.; Scassiotti Filho, Walter [Industrias Nucleares do Brasil S.A. (INB), Caetite, BA (Brazil)]. E-mails: gomiero@inb.gov.br; scassiotti@inb.gov.br

    2007-07-01

    The common uranium concentrate production consists of ore leaching, uranium purification/concentration by solvent extraction and uranium precipitation as ammonium diuranate steps. In the present work, a new route of uranium concentrate production from Caetite, BA-Brazil ore was investigated. The following steps were investigated: dynamic leaching of the ground ore with sulfuric acid; sulfuric liquor pre-neutralization until pH 3.7; uranium peroxide precipitation. The study was carried out in bath and continuous circuits. In the dynamic leaching of ground ore in agitated tanks the uranium content in the leached ore may be as low as 100 {mu}g/g U{sub 3}O{sub 8}, depending on grinding size. In the pre-neutralization step, the iron content in the liquor is decreased in 99 wt.%, dropping from 3.62 g/L to 0.030 g/L. The sulfate content in the liquor reduces from 46 g/L to 22 g/L. A calcinated final product assaying 99.7 wt.% U{sub 3}O{sub 8} was obtained. The full process recovery was over 94%. (author)

  10. Influence of Road Excitation and Steering Wheel Input on Vehicle System Dynamic Responses

    OpenAIRE

    Zhen-Feng Wang; Ming-Ming Dong; Liang Gu; Jagat-Jyoti Rath; Ye-Chen Qin; Bin Bai

    2017-01-01

    Considering the importance of increasing driving safety, the study of safety is a popular and critical topic of research in the vehicle industry. Vehicle roll behavior with sudden steering input is a main source of untripped rollover. However, previous research has seldom considered road excitation and its coupled effect on vehicle lateral response when focusing on lateral and vertical dynamics. To address this issue, a novel method was used to evaluate effects of varying road level and steer...

  11. Optimal Charging of Electric Drive Vehicles: A Dynamic Programming Approach

    DEFF Research Database (Denmark)

    Delikaraoglou, Stefanos; Capion, Karsten Emil; Juul, Nina

    2013-01-01

    , therefore, we propose an ex ante vehicle aggregation approach. We illustrate the results in a Danish case study and find that, although optimal management of the vehicles does not allow for storage and day-to-day flexibility in the electricity system, the market provides incentive for intra-day flexibility....

  12. Evaluation of the lateral dynamics of complex articulated commercial vehicles

    NARCIS (Netherlands)

    Besselink, I.J.M.; Isiklar, G.; Pinxteren, van T.E.L.; Nijmeijer, H.

    2008-01-01

    By increasing the overall length and weight of commercial vehicles, the transport efficiency and road utilization will be improved and the C02 emissions can be reduced by some 30%. Over the past years experiments are carried out in the Netherlands with special vehicle combinations having an overall

  13. Plug-in hybrid electric vehicles in dynamical energy markets

    NARCIS (Netherlands)

    Kessels, J.T.B.A.; Bosch, P.P.J. van den

    2008-01-01

    The plug-in hybrid electric vehicle allows vehicle propulsion from multiple internal power sources. Electric energy from the grid can be utilized by means of the plug-in connection. An on-line energy management (EM) strategy is proposed to minimize the costs for taking energy from each power source.

  14. Dynamics of Braking Vehicles: From Coulomb Friction to Anti-Lock Braking Systems

    Science.gov (United States)

    Tavares, J. M.

    2009-01-01

    The dynamics of braking of wheeled vehicles is studied using the Coulomb approximation for the friction between road and wheels. The dependence of the stopping distance on the mass of the vehicle, on the number of its wheels and on the intensity of the braking torque is established. It is shown that there are two regimes of braking, with and…

  15. Experimental evaluation of optimal Vehicle Dynamic Control based on the State Dependent Riccati Equation technique

    NARCIS (Netherlands)

    Alirezaei, M.; Kanarachos, S.A.; Scheepers, B.T.M.; Maurice, J.P.

    2013-01-01

    Development and experimentally evaluation of an optimal Vehicle Dynamic Control (VDC) strategy based on the State Dependent Riccati Equation (SDRE) control technique is presented. The proposed nonlinear controller is based on a nonlinear vehicle model with nonlinear tire characteristics. A novel

  16. 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.

  17. Frequency Domain Computer Programs for Prediction and Analysis of Rail Vehicle Dynamics : Volume 1. Technical Report

    Science.gov (United States)

    1975-12-01

    Frequency domain computer programs developed or acquired by TSC for the analysis of rail vehicle dynamics are described in two volumes. Volume I defines the general analytical capabilities required for computer programs applicable to single rail vehi...

  18. 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.

  19. Dynamic Modeling and Simulation of a Switched Reluctance Motor in a Series Hybrid Electric Vehicle

    OpenAIRE

    Siavash Sadeghi; Mojtaba Mirsalim; Arash Hassanpour Isfahani

    2010-01-01

    Dynamic behavior analysis of electric motors is required in order to accuratelyevaluate the performance, energy consumption and pollution level of hybrid electricvehicles. Simulation tools for hybrid electric vehicles are divided into steady state anddynamic models. Tools with steady-state models are useful for system-level analysiswhereas tools that utilize dynamic models give in-depth information about the behavior ofsublevel components. For the accurate prediction of hybrid electric vehicl...

  20. An automotive vehicle dynamics prototyping platform based on a remote control model car

    OpenAIRE

    SOLMAZ, Selim; COŞKUN, Türker

    2013-01-01

    The use of a modified remote control (RC) model car as a vehicle dynamics testing and development platform is detailed. Vehicle dynamics testing is an important aspect of automotive engineering and it plays a key role during the design and tuning of active safety control systems. Considering the fact that such tests are conductedi at great expense, scaled model cars can potentially be used to help with the process to reduce the costs. With this view, we instrument and develop a stand...

  1. Central Vehicle Dynamics Control of the Robotic Research Platform ROboMObil

    OpenAIRE

    Bünte, Tilman; Ho, Lok Man; Satzger, Clemens; Brembeck, Jonathan

    2014-01-01

    The ROboMObil is DLR’s space-robotics driven by-wire electro-mobile research platform for mechatronic actuators, vehicle dynamics control, human machine interfaces, and autonomous driving (DLR = German Aerospace Center). Due to its four highly integrated identical Wheel Robots it exhibits an extraordinary manoeuvrability even allowing for driving sideward or rotating on the spot. Topics related to vehicle dynamics control are addressed in this article.

  2. Dynamic simulation of urban hybrid electric vehicles; Dynamische Simulation von Stadthybridfahrzeugen

    Energy Technology Data Exchange (ETDEWEB)

    Winke, Florian; Bargende, Michael [Stuttgart Univ. (Germany). Inst. fuer Verbrennungsmotoren und Kraftfahrwesen (IVK)

    2013-09-15

    As a result of the rising requirements on the development process of modern vehicles, simulation models for the prediction of fuel efficiency have become an irreplaceable tool in the automotive industry. Especially for the design of hybrid electric drivetrains, the increasingly short development cycles can only be met by the use of efficient simulation models. At the IVK of the University of Stuttgart, different approaches to simulating the longitudinal dynamics of hybrid electric vehicles were analysed and compared within the presented project. The focus of the investigations was on urban operation. The objective was to develop a hybrid vehicle concept that allows an equitable comparison with pure battery electric vehicles. (orig.)

  3. Neural Dynamic Trajectory Design for Reentry Vehicles (Preprint)

    National Research Council Canada - National Science Library

    Verma, Ajay; Xu, Peng; Vadakkeveedu, Kalyan; Mayer, Rick

    2007-01-01

    The next generation of reentry vehicles is envisioned to have onboard autonomous capability of real-time trajectory planning to provide capability of responsive launch and delivering payload anywhere...

  4. Dynamic Carpooling in Urban Areas: Design and Experimentation with a Multi-Objective Route Matching Algorith

    Directory of Open Access Journals (Sweden)

    Matteo Mallus

    2017-02-01

    Full Text Available This paper focuses on dynamic carpooling services in urban areas to address the needs of mobility in real-time by proposing a two-fold contribution: a solution with novel features with respect to the current state-of-the-art, which is named CLACSOON and is available on the market; the analysis of the carpooling services performance in the urban area of the city of Cagliari through emulations. Two new features characterize the proposed solution: partial ridesharing, according to which the riders can walk to reach the driver along his/her route when driving to the destination; the possibility to share the ride when the driver has already started the ride by modelling the mobility to reach the driver destination. To analyse which features of the population bring better performance to changing the characteristics of the users, we also conducted emulations. When compared with current solutions, CLACSOON allows for achieving a decrease in the waiting time of around 55% and an increase in the driver and passenger success rates of around 4% and 10%,respectively. Additionally, the proposed features allowed for having an increase in the reduction of the CO2 emission by more than 10% with respect to the traditional carpooling service.

  5. Diverse range dynamics and dispersal routes of plants on the Tibetan Plateau during the late Quaternary.

    Directory of Open Access Journals (Sweden)

    Haibin Yu

    Full Text Available Phylogeographical studies have suggested that several plant species on the Tibetan Plateau (TP underwent recolonization during the Quaternary and may have had distinct range dynamics in response to the last glacial. To further test this hypothesis and locate the possible historical dispersal routes, we selected 20 plant species from different parts of the TP and modeled their geographical distributions over four time periods using species distribution models (SDMs. Furthermore, we applied the least-cost path method together with SDMs and shared haplotypes to estimate their historical dispersal corridors. We identified three general scenarios of species distribution change during the late Quaternary: the 'contraction-expansion' scenario for species in the northeastern TP, the 'expansion-contraction' scenario for species in the southeast and the 'stable' scenario for widespread species. During the Quaternary, we identified that these species were likely to recolonize along the low-elevation valleys, huge mountain ranges and flat plateau platform (e.g. the Yarlung Zangbo Valley and the Himalaya. We inferred that Quaternary cyclic glaciations along with the various topographic and climatic conditions of the TP could have resulted in the diverse patterns of range shift and dispersal of Tibetan plant species. Finally, we believe that this study would provide valuable insights for the conservation of alpine species under future climate change.

  6. A dynamic simulation tool for the battery-hybrid hydrogen fuel cell vehicle

    Energy Technology Data Exchange (ETDEWEB)

    Moore, R.M. [Hawaii Natural Energy Institute, University of Hawaii, Manoa (United States); Ramaswamy, S.; Cunningham, J.M. [California Univ., Berkeley, CA (United States); Hauer, K.H. [xcellvision, Major-Hirst-Strasse 11, 38422 Wolfsburg (Germany)

    2006-10-15

    This paper describes a dynamic fuel cell vehicle simulation tool for the battery-hybrid direct-hydrogen fuel cell vehicle. The emphasis is on simulation of the hybridized hydrogen fuel cell system within an existing fuel cell vehicle simulation tool. The discussion is focused on the simulation of the sub-systems that are unique to the hybridized direct-hydrogen vehicle, and builds on a previous paper that described a simulation tool for the load-following direct-hydrogen vehicle. The configuration of the general fuel cell vehicle simulation tool has been previously presented in detail, and is only briefly reviewed in the introduction to this paper. Strictly speaking, the results provided in this paper only serve as an example that is valid for the specific fuel cell vehicle design configuration analyzed. Different design choices may lead to different results, depending strongly on the parameters used and choices taken during the detailed design process required for this highly non-linear and n-dimensional system. The primary purpose of this paper is not to provide a dynamic simulation tool that is the ''final word'' for the ''optimal'' hybrid fuel cell vehicle design. The primary purpose is to provide an explanation of a simulation method for analyzing the energetic aspects of a hybrid fuel cell vehicle. (Abstract Copyright [2006], Wiley Periodicals, Inc.)

  7. Modelling and analysis of the dynamics of a tilting three-wheeled vehicle

    International Nuclear Information System (INIS)

    Edelmann, Johannes; Plöchl, Manfred; Lugner, Peter

    2011-01-01

    To understand the handling behaviour of a three-wheeled tilting vehicle, models of the vehicle with different level of detail, corresponding to specific fields of investigation, have been developed. Then the proposed kinematics of the three-wheeler are assessed and optimized with respect to desired dynamic properties by applying a detailed multibody system model. The partially unstable nature of the motion of the vehicle suggests the application of an analytically derived, simplified model, to allow for focusing on stability aspects and steady-state handling properties. These investigations reveal the necessity of employing a steer-by-wire control system to support the driver by stabilizing the motion of the vehicle. Thus, an additional basic vehicle model is derived for control design, and an energy-efficient control strategy is presented. Numerical simulation results demonstrate the dynamic properties of the optimized kinematics and the control system, approved by successful test runs of a prototype.

  8. Simulation modeling of wheeled vehicle dynamics on the stand "Roller"

    Directory of Open Access Journals (Sweden)

    G. O. Kotiev

    2014-01-01

    Full Text Available The tests are an integral part of the wheeled vehicle design, manufacturing, and operation. The need for their conducting arises from the research and experimental activities to assess the qualitative and quantitative characteristics of the vehicles in general, as well as the individual components and assemblies. It is obvious that a variety of design features of wheeled vehicles request a development of methods both for experimental studies and for creating the original bench equipment for these purposes.The main positive feature of bench tests of automotive engineering is a broad capability to control the combinations of traction loads, speed rates, and external input conditions. Here, the steady state conditions can be used for a long time, allowing all the necessary measurements to be made, including those with video and photo recording experiment.It is known that the benefits of test "M" type (using a roller dynamometer include a wide range of test modes, which do not depend on the climatic conditions, as well as a capability to use a computer-aided testing programs. At the same time, it is known that the main drawback of bench tests of full-size vehicle is that the tire rolling conditions on the drum mismatch to the real road pavements, which are difficult to simulate on the drum surface. This problem can be solved owing to wheeled vehicle tests at the benches "Roller" to be, in efficiency, the most preferable research method. The article gives a detailed presentation of developed at BMSTU approach to its solving.Problem of simulation mathematical modeling has been solved for the vehicle with the wheel formula 8 × 8, and individual wheel-drive.The simulation results have led to the conclusion that the proposed principle to simulate a vehicle rolling on a smooth non-deformable support base using a bench " Roller " by simulation modeling is efficient.

  9. Dynamic call center routing policies using call waiting and agent idle times

    NARCIS (Netherlands)

    Chan, W.; Koole, G.M.; L'Ecuyer, P.

    2014-01-01

    We study call routing policies for call centers with multiple call types and multiple agent groups. We introduce new weight-based routing policies where each pair (call type, agent group) is given a matching priority defined as an affine combination of the longest waiting time for that call type and

  10. Application of theoretical vehicle dynamic results for experimental validation of vehicle characteristics in autonomous vehicle guidance; Aehnlichkeitstheoretische Modelluebertragung zur experimentellen Eigenschaftsabsicherung in der autonomen Fahrzeugfuehrung

    Energy Technology Data Exchange (ETDEWEB)

    Hilgert, J.; Bertram, T. [Univ. Duisburg (Germany). Fachbereich Maschinenbau

    2002-07-01

    The validation and verification of theoretical vehicle dynamic results for autonomous driving can be seen as a major challenge. The main reasons are the high cost of driving tests and the risk of damaging or destroying the test vehicle and the involved persons. One possibility for avoiding these problems and simultaneously to ensure good experimental results lies in the use of scaled model vehicles. Of special relevance is the transfer of relevant parameters to the full size vehicle. In this paper a method based on similitude analysis is developed for validation and verification of driving tests for autonomous vehicles. This method is described for a lane change manoeuvre for a 1:5 scaled vehicle belonging to the Institute of Mechatronics and System Dynamics at the Gerhard-Mercator-Universitaet Duisburg. (orig.) [German] In der autonomen Fahrzeugfuehrung stellt die experimentelle Verifikation und Validierung von theoretischen Ergebnissen hinsichtlich fahrdynamischer Eigenschaften eine grosse Herausforderung dar. Die Ursachen hierfuer liegen zum einen in den hohen Kosten, welche bei Fahrversuchen entstehen, und zum anderen im Unfallrisiko fuer den Versuchstraeger und die am Versuch beteiligten Personen. Eine Moeglichkeit diese Nachteile zu umgehen und gleichzeitig experimentelle Ergebnisse zu bekommen, besteht in der Verwendung massstabgetreuer Modellfahrzeuge. Von besonderer Bedeutung ist hier die Uebertragung relevanter Parameter auf das reale Fahrzeug. In diesem Beitrag wird daher mit Hilfe von aehnlichkeitstheoretischen Ueberlegungen ein Konzept zur experimentellen Verifikation und Validierung von Fahrversuchen auf Basis eines am Institut fuer Mechatronik und Systemdynamik der Gerhard-Mercator-Universitaet Duisburg vorhandenen Fahrzeugmodells (Massstab 1:5) anhand eines Spurwechselmanoevers vorgestellt. (orig.)

  11. [Dynamic road vehicle emission inventory simulation study based on real time traffic information].

    Science.gov (United States)

    Huang, Cheng; Liu, Juan; Chen, Chang-Hong; Zhang, Jian; Liu, Deng-Guo; Zhu, Jing-Yu; Huang, Wei-Ming; Chao, Yuan

    2012-11-01

    The vehicle activity survey, including traffic flow distribution, driving condition, and vehicle technologies, were conducted in Shanghai. The databases of vehicle flow, VSP distribution and vehicle categories were established according to the surveyed data. Based on this, a dynamic vehicle emission inventory simulation method was designed by using the real time traffic information data, such as traffic flow and average speed. Some roads in Shanghai city were selected to conduct the hourly vehicle emission simulation as a case study. The survey results show that light duty passenger car and taxi are major vehicles on the roads of Shanghai city, accounting for 48% - 72% and 15% - 43% of the total flow in each hour, respectively. VSP distribution has a good relationship with the average speed. The peak of VSP distribution tends to move to high load section and become lower with the increase of average speed. Vehicles achieved Euro 2 and Euro 3 standards are majorities of current vehicle population in Shanghai. Based on the calibration of vehicle travel mileage data, the proportions of Euro 2 and Euro 3 standard vehicles take up 11% - 70% and 17% - 51% in the real-world situation, respectively. The emission simulation results indicate that the ratios of emission peak and valley for the pollutants of CO, VOC, NO(x) and PM are 3.7, 4.6, 9.6 and 19.8, respectively. CO and VOC emissions mainly come from light-duty passenger car and taxi, which has a good relationship with the traffic flow. NO(x) and PM emissions are mainly from heavy-duty bus and public buses and mainly concentrate in the morning and evening peak hours. The established dynamic vehicle emission simulation method can reflect the change of actual road emission and output high emission road sectors and hours in real time. The method can provide an important technical means and decision-making basis for transportation environment management.

  12. An Adaptive Large Neighborhood Search-based Three-Stage Matheuristic for the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Christensen, Jonas Mark; Røpke, Stefan

    that serves all the customers. The second stage usesan Adaptive Large Neighborhood Search (ALNS) algorithm to minimise the travel distance, during the second phase all of the generated routes are considered by solving a set cover problem. The ALNS algorithm uses 4 destroy operators, 2 repair operators...

  13. Dynamic Vehicle Detection via the Use of Magnetic Field Sensors

    Directory of Open Access Journals (Sweden)

    Vytautas Markevicius

    2016-01-01

    Full Text Available The vehicle detection process plays the key role in determining the success of intelligent transport management system solutions. The measurement of distortions of the Earth’s magnetic field using magnetic field sensors served as the basis for designing a solution aimed at vehicle detection. In accordance with the results obtained from research into process modeling and experimentally testing all the relevant hypotheses an algorithm for vehicle detection using the state criteria was proposed. Aiming to evaluate all of the possibilities, as well as pros and cons of the use of anisotropic magnetoresistance (AMR sensors in the transport flow control process, we have performed a series of experiments with various vehicles (or different series from several car manufacturers. A comparison of 12 selected methods, based on either the process of determining the peak signal values and their concurrence in time whilst calculating the delay, or by measuring the cross-correlation of these signals, was carried out. It was established that the relative error can be minimized via the Z component cross-correlation and Kz criterion cross-correlation methods. The average relative error of vehicle speed determination in the best case did not exceed 1.5% when the distance between sensors was set to 2 m.

  14. Optimization of hydrogen vehicle refueling via dynamic simulation

    DEFF Research Database (Denmark)

    Rothuizen, Erasmus Damgaard; Mérida, W.; Rokni, Masoud

    2013-01-01

    loss in the vehicle's storage system is one of the main factors determining the mass flow and peak cooling requirements of the refueling process. The design of the refueling station does not influence the refueling of the vehicle when the requirements of the technical information report J2601 from...... Society of Automotive Engineers are met. However, by using multiple pressure stages in the tanks at the refueling station (instead of a single high-pressure tank), the total energy demand for cooling can be reduced by 12%, and the compressor power consumption can be reduced by 17%. The time between...

  15. Modular Estimation Strategy of Vehicle Dynamic Parameters for Motion Control Applications

    Directory of Open Access Journals (Sweden)

    Rawash Mustafa

    2018-01-01

    Full Text Available The presence of motion control or active safety systems in vehicles have become increasingly important for improving vehicle performance and handling and negotiating dangerous driving situations. The performance of such systems would be improved if combined with knowledge of vehicle dynamic parameters. Since some of these parameters are difficult to measure, due to technical or economic reasons, estimation of those parameters might be the only practical alternative. In this paper, an estimation strategy of important vehicle dynamic parameters, pertaining to motion control applications, is presented. The estimation strategy is of a modular structure such that each module is concerned with estimating a single vehicle parameter. Parameters estimated include: longitudinal, lateral, and vertical tire forces – longitudinal velocity – vehicle mass. The advantage of this strategy is its independence of tire parameters or wear, road surface condition, and vehicle mass variation. Also, because of its modular structure, each module could be later updated or exchanged for a more effective one. Results from simulations on a 14-DOF vehicle model are provided here to validate the strategy and show its robustness and accuracy.

  16. Total dynamic response of a PSS vehicle negotiating asymmetric road excitations

    Science.gov (United States)

    Zhu, Jian Jun; Khajepour, Amir; Esmailzadeh, Ebrahim

    2012-12-01

    A planar suspension system (PSS) is a novel automobile suspension system in which an individual spring-damper strut is implemented in both the vertical and longitudinal directions, respectively. The wheels in a vehicle with such a suspension system can move back and forth relative to the chassis. When a PSS vehicle experiences asymmetric road excitations, the relative longitudinal motion of wheels with respect to the chassis in two sides of the same axle are not identical, and thus the two wheels at one axle will not be aligned in the same axis. The total dynamic responses, including those of the bounce, pitch and the roll of the PSS vehicle, to the asymmetric road excitation may exhibit different characteristics from those of a conventional vehicle. This paper presents an investigation into the comprehensive dynamic behaviour of a vehicle with the PSS, in such a road condition, on both the straight and curved roads. The study was carried out using an 18 DOF full-car model incorporating a radial-spring tyre-ground contact model and a 2D tyre-ground dynamic friction model. Results demonstrate that the total dynamic behaviour of a PSS vehicle is generally comparable with that of the conventional vehicle, while PSS exhibits significant improvement in absorbing the impact forces along the longitudinal direction when compared to the conventional suspension system. The PSS vehicle is found to be more stable than the conventional vehicle in terms of the directional performance against the disturbance of the road potholes on a straight line manoeuvre, while exhibiting a very similar handling performance on a curved line.

  17. Thirteenth Workshop for Computational Fluid Dynamic Applications in Rocket Propulsion and Launch Vehicle Technology. Volume 1

    Science.gov (United States)

    Williams, R. W. (Compiler)

    1996-01-01

    The purpose of the workshop was to discuss experimental and computational fluid dynamic activities in rocket propulsion and launch vehicles. The workshop was an open meeting for government, industry, and academia. A broad number of topics were discussed including computational fluid dynamic methodology, liquid and solid rocket propulsion, turbomachinery, combustion, heat transfer, and grid generation.

  18. Thirteenth Workshop for Computational Fluid Dynamic Applications in Rocket Propulsion and Launch Vehicle Technology. Volume 2

    Science.gov (United States)

    Williams, R. W. (Compiler)

    1996-01-01

    This conference publication includes various abstracts and presentations given at the 13th Workshop for Computational Fluid Dynamic Applications in Rocket Propulsion and Launch Vehicle Technology held at the George C. Marshall Space Flight Center April 25-27 1995. The purpose of the workshop was to discuss experimental and computational fluid dynamic activities in rocket propulsion and launch vehicles. The workshop was an open meeting for government, industry, and academia. A broad number of topics were discussed including computational fluid dynamic methodology, liquid and solid rocket propulsion, turbomachinery, combustion, heat transfer, and grid generation.

  19. An energy management for series hybrid electric vehicle using improved dynamic programming

    Science.gov (United States)

    Peng, Hao; Yang, Yaoquan; Liu, Chunyu

    2018-02-01

    With the increasing numbers of hybrid electric vehicle (HEV), management for two energy sources, engine and battery, is more and more important to achieve the minimum fuel consumption. This paper introduces several working modes of series hybrid electric vehicle (SHEV) firstly and then describes the mathematical model of main relative components in SHEV. On the foundation of this model, dynamic programming is applied to distribute energy of engine and battery on the platform of matlab and acquires less fuel consumption compared with traditional control strategy. Besides, control rule recovering energy in brake profiles is added into dynamic programming, so shorter computing time is realized by improved dynamic programming and optimization on algorithm.

  20. Dynamics control of autonomous vehicle at driving limits and experiment on an autonomous formula racing car

    Science.gov (United States)

    Ni, Jun; Hu, Jibin

    2017-06-01

    In this paper, a novel dynamics controller for autonomous vehicle to simultaneously control it to the driving limits and follow the desired path is proposed. The dynamics controller consists of longitudinal and lateral controllers. In longitudinal controller, the G-G diagram is utilized to describe the driving and handling limits of the vehicle. The accurate G-G diagram is obtained based on phase plane approach and a nonlinear vehicle dynamic model with accurate tyre model. In lateral controller, the tyre cornering stiffness is estimated to improve the robustness of the controller. The stability analysis of the closed-looped error dynamics shows that the controller remains stable against parameters uncertainties in extreme condition such as tyre saturation. Finally, an electric autonomous Formula race car developed by the authors is used to validate the proposed controller. The autonomous driving experiment on an oval race track shows the efficiency and robustness of the proposed controller.

  1. Dynamic behavior of gasoline fuel cell electric vehicles

    Science.gov (United States)

    Mitchell, William; Bowers, Brian J.; Garnier, Christophe; Boudjemaa, Fabien

    As we begin the 21st century, society is continuing efforts towards finding clean power sources and alternative forms of energy. In the automotive sector, reduction of pollutants and greenhouse gas emissions from the power plant is one of the main objectives of car manufacturers and innovative technologies are under active consideration to achieve this goal. One technology that has been proposed and vigorously pursued in the past decade is the proton exchange membrane (PEM) fuel cell, an electrochemical device that reacts hydrogen with oxygen to produce water, electricity and heat. Since today there is no existing extensive hydrogen infrastructure and no commercially viable hydrogen storage technology for vehicles, there is a continuing debate as to how the hydrogen for these advanced vehicles will be supplied. In order to circumvent the above issues, power systems based on PEM fuel cells can employ an on-board fuel processor that has the ability to convert conventional fuels such as gasoline into hydrogen for the fuel cell. This option could thereby remove the fuel infrastructure and storage issues. However, for these fuel processor/fuel cell vehicles to be commercially successful, issues such as start time and transient response must be addressed. This paper discusses the role of transient response of the fuel processor power plant and how it relates to the battery sizing for a gasoline fuel cell vehicle. In addition, results of fuel processor testing from a current Renault/Nuvera Fuel Cells project are presented to show the progress in transient performance.

  2. Nonlinear dynamics modeling and simulation of two-wheeled self-balancing vehicle

    Directory of Open Access Journals (Sweden)

    Yunping Liu

    2016-11-01

    Full Text Available Two-wheeled self-balancing vehicle system is a kind of naturally unstable underactuated system with high-rank unstable multivariable strongly coupling complicated dynamic nonlinear property. Nonlinear dynamics modeling and simulation, as a basis of two-wheeled self-balancing vehicle dynamics research, has the guiding effect for system design of the project demonstration and design phase. Dynamics model of the two-wheeled self-balancing vehicle is established by importing a TSi ProPac package to the Mathematica software (version 8.0, which analyzes the stability and calculates the Lyapunov exponents of the system. The relationship between external force and stability of the system is analyzed by the phase trajectory. Proportional–integral–derivative control is added to the system in order to improve the stability of the two-wheeled self-balancing vehicle. From the research, Lyapunov exponent can be used to research the stability of hyperchaos system. The stability of the two-wheeled self-balancing vehicle is better by inputting the proportional–integral–derivative control. The Lyapunov exponent and phase trajectory can help us analyze the stability of a system better and lay the foundation for the analysis and control of the two-wheeled self-balancing vehicle system.

  3. 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...

  4. An insight into airline dynamic pricing practices in emerging markets: Effects of low cost carriers' presence on routes from Belgrade 'Nikola Tesla' airport

    Directory of Open Access Journals (Sweden)

    Ivanov Nikola V.

    2016-01-01

    Full Text Available Dynamic pricing and revenue management in airline industry have been the subject of research for more than twenty years now. Building upon that massive body of research, in this paper we investigate actual dynamic pricing patterns in new and emerging markets. We specifically focus on the impact that recent entry of low cost carriers on a number of routes from Belgrade Nikola Tesla Airport might have had on pricing practices of legacy incumbents. Unlike with most of previous contributions in the field, we analyse the market characterised by relatively low frequencies and predominantly short-to-medium haul flights. In this paper, we observe and analyse pricing dynamics on two types of routes: routes where only legacy carriers operate and routes where legacy carriers face competition from low cost carriers. The effects of route competition on offered airline fares are estimated and conclusions derived.

  5. Influence of wheel-rail contact modelling on vehicle dynamic simulation

    Science.gov (United States)

    Burgelman, Nico; Sichani, Matin Sh.; Enblom, Roger; Berg, Mats; Li, Zili; Dollevoet, Rolf

    2015-08-01

    This paper presents a comparison of four models of rolling contact used for online contact force evaluation in rail vehicle dynamics. Until now only a few wheel-rail contact models have been used for online simulation in multibody software (MBS). Many more models exist and their behaviour has been studied offline, but a comparative study of the mutual influence between the calculation of the creep forces and the simulated vehicle dynamics seems to be missing. Such a comparison would help researchers with the assessment of accuracy and calculation time. The contact methods investigated in this paper are FASTSIM, Linder, Kik-Piotrowski and Stripes. They are compared through a coupling between an MBS for the vehicle simulation and Matlab for the contact models. This way the influence of the creep force calculation on the vehicle simulation is investigated. More specifically this study focuses on the influence of the contact model on the simulation of the hunting motion and on the curving behaviour.

  6. A Saturation Balancing Control Method for Enhancing Dynamic Vehicle Stability (PREPRINT)

    Science.gov (United States)

    2011-03-01

    braking torques (with regenerative braking ) at the individual wheels or axles of the vehicle with independent drive or torque-biasing systems ...VSC (also referred to as vehicle dynamics control (VDC)) systems available on the market today are brake -based systems which extend the functionality...of mature hardware technology available for anti-lock braking (ABS) and traction control systems . These systems Report Documentation Page Form

  7. Launch Vehicle Failure Dynamics and Abort Triggering Analysis

    Science.gov (United States)

    Hanson, John M.; Hill, Ashely D.; Beard, Bernard B.

    2011-01-01

    Launch vehicle ascent is a time of high risk for an on-board crew. There are many types of failures that can kill the crew if the crew is still on-board when the failure becomes catastrophic. For some failure scenarios, there is plenty of time for the crew to be warned and to depart, whereas in some there is insufficient time for the crew to escape. There is a large fraction of possible failures for which time is of the essence and a successful abort is possible if the detection and action happens quickly enough. This paper focuses on abort determination based primarily on data already available from the GN&C system. This work is the result of failure analysis efforts performed during the Ares I launch vehicle development program. Derivation of attitude and attitude rate abort triggers to ensure that abort occurs as quickly as possible when needed, but that false positives are avoided, forms a major portion of the paper. Some of the potential failure modes requiring use of these triggers are described, along with analysis used to determine the success rate of getting the crew off prior to vehicle demise.

  8. Investigation on dynamical interaction between a heavy vehicle and road pavement

    Science.gov (United States)

    Yang, Shaopu; Li, Shaohua; Lu, Yongjie

    2010-08-01

    This paper presents a model for three-dimensional, heavy vehicle-pavement-foundation coupled system, which is modelled as a seven-DOF vehicle moving along a simply supported double-layer rectangular thin plate on a linear viscoelastic foundation. The vertical tyre force is described by a single point-contact model, while the pavement-foundation is modelled as a double-layer plate on a linear viscoelastic foundation. Using the Galerkin method and quick direct integral method, the dynamical behaviour of the vehicle-pavement-foundation coupled system is investigated numerically and compared with that of traditional vehicle system and pavement system. The effects of coupling action on vehicle body vertical acceleration, suspension deformations, tyre forces and pavement displacements are also obtained. The investigation shows that the coupling action could not be neglected even on a smooth road surface, such as highway. Thus, it is necessary to investigate the dynamics of vehicle and pavement simultaneously based on the vehicle-pavement-foundation coupled system.

  9. Vehicle-pedestrian collisions - Aspects regarding pedestrian kinematics, dynamics and biomechanics

    Science.gov (United States)

    Petrescu, L.; Petrescu, Al

    2017-10-01

    Vehicle-pedestrian collisions result in a substantial number of pedestrian fatalities and injuries worldwide. Concern continues to limit and reduce the tragic consequences suffered by pedestrians involved in road accidents, caused the vehicle-pedestrian accident reconstruction become an important area and distinctly outlined in the reconstruction of road incidents involving vehicle. This paper analyzes the dynamics of vehicle-pedestrian impact influence over pedestrian biomechanics, which is directly connected with the severity of injury after contact with the vehicle profile and with the place where the pedestrian is projected. The main goal of this paper is to highlight some features of reconstruction of road accidents involving pedestrian, looking at the kinematics and dynamics of pedestrian impact for a better understanding of the phenomena that occur. The study on the dynamics and biomechanics of the pedestrian hit by the vehicle is useful in order to understand how the injuries, including the lethal ones, are generated in the collision, what is essential in road accidents reconstruction.

  10. Influence of Road Excitation and Steering Wheel Input on Vehicle System Dynamic Responses

    Directory of Open Access Journals (Sweden)

    Zhen-Feng Wang

    2017-06-01

    Full Text Available Considering the importance of increasing driving safety, the study of safety is a popular and critical topic of research in the vehicle industry. Vehicle roll behavior with sudden steering input is a main source of untripped rollover. However, previous research has seldom considered road excitation and its coupled effect on vehicle lateral response when focusing on lateral and vertical dynamics. To address this issue, a novel method was used to evaluate effects of varying road level and steering wheel input on vehicle roll behavior. Then, a 9 degree of freedom (9-DOF full-car roll nonlinear model including vertical and lateral dynamics was developed to study vehicle roll dynamics with or without of road excitation. Based on a 6-DOF half-car roll model and 9-DOF full-car nonlinear model, relationship between three-dimensional (3-D road excitation and various steering wheel inputs on vehicle roll performance was studied. Finally, an E-Class (SUV level car model in CARSIM® was used, as a benchmark, with and without road input conditions. Both half-car and full-car models were analyzed under steering wheel inputs of 5°, 10° and 15°. Simulation results showed that the half-car model considering road input was found to have a maximum accuracy of 65%. Whereas, the full-car model had a minimum accuracy of 85%, which was significantly higher compared to the half-car model under the same scenario.

  11. Development and demonstration of a validation methodology for vehicle lateral dynamics simulation models

    Energy Technology Data Exchange (ETDEWEB)

    Kutluay, Emir

    2013-02-01

    In this thesis a validation methodology to be used in the assessment of the vehicle dynamics simulation models is presented. Simulation of vehicle dynamics is used to estimate the dynamic responses of existing or proposed vehicles and has a wide array of applications in the development of vehicle technologies. Although simulation environments, measurement tools and mathematical theories on vehicle dynamics are well established, the methodical link between the experimental test data and validity analysis of the simulation model is still lacking. The developed validation paradigm has a top-down approach to the problem. It is ascertained that vehicle dynamics simulation models can only be validated using test maneuvers although they are aimed for real world maneuvers. Test maneuvers are determined according to the requirements of the real event at the start of the model development project and data handling techniques, validation metrics and criteria are declared for each of the selected maneuvers. If the simulation results satisfy these criteria, then the simulation is deemed ''not invalid''. If the simulation model fails to meet the criteria, the model is deemed invalid, and model iteration should be performed. The results are analyzed to determine if the results indicate a modeling error or a modeling inadequacy; and if a conditional validity in terms of system variables can be defined. Three test cases are used to demonstrate the application of the methodology. The developed methodology successfully identified the shortcomings of the tested simulation model, and defined the limits of application. The tested simulation model is found to be acceptable but valid only in a certain dynamical range. Several insights for the deficiencies of the model are reported in the analysis but the iteration step of the methodology is not demonstrated. Utilizing the proposed methodology will help to achieve more time and cost efficient simulation projects with

  12. Creation and Reliability Analysis of Vehicle Dynamic Weighing Model

    Directory of Open Access Journals (Sweden)

    Zhi-Ling XU

    2014-08-01

    Full Text Available In this paper, it is modeled by using ADAMS to portable axle load meter of dynamic weighing system, controlling a single variable simulation weighing process, getting the simulation weighing data under the different speed and weight; simultaneously using portable weighing system with the same parameters to achieve the actual measurement, comparative analysis the simulation results under the same conditions, at 30 km/h or less, the simulation value and the measured value do not differ by more than 5 %, it is not only to verify the reliability of dynamic weighing model, but also to create possible for improving algorithm study efficiency by using dynamic weighing model simulation.

  13. 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

  14. Augmenting static and dynamic mechanical strength of carbon nanotube/epoxy soft nanocomposites via modulation of purification and functionalization routes.

    Science.gov (United States)

    Billing, Beant Kaur; Dhar, Purbarun; Singh, Narinder; Agnihotri, Prabhat K

    2018-01-03

    A detailed experimental investigation was carried out to establish the relationship between CNT purification and functionalization routes and the average response of CNT/epoxy nanocomposites under static and dynamic loading. It was shown that the relative improvement in the mechanical properties of the epoxy matrix due to the addition of CNTs depends on the choice of purification and functionalization steps. A better dispersion of CNTs was recorded for the functionalized CNTs as compared to the oxidized and CVD grown CNTs. Moreover, tensile, 3-point bending and nanoDMA testing performed on nanocomposites processed with CVD-grown, oxidized and functionalized CNTs revealed that COOH functionalization after the oxidation of CNTs at 350 °C is the optimized processing route to harness the excellent properties of CNTs in CNT/epoxy nanocomposites.

  15. Dynamic Weather Routes: A Weather Avoidance Concept for Trajectory-Based Operations

    Science.gov (United States)

    McNally, B. David; Love, John

    2011-01-01

    The integration of convective weather modeling with trajectory automation for conflict detection, trial planning, direct routing, and auto resolution has uncovered a concept that could help controllers, dispatchers, and pilots identify improved weather routes that result in significant savings in flying time and fuel burn. Trajectory automation continuously and automatically monitors aircraft in flight to find those that could potentially benefit from improved weather reroutes. Controllers, dispatchers, and pilots then evaluate reroute options to assess their suitability given current weather and traffic. In today's operations aircraft fly convective weather avoidance routes that were implemented often hours before aircraft approach the weather and automation does not exist to automatically monitor traffic to find improved weather routes that open up due to changing weather conditions. The automation concept runs in real-time and employs two keysteps. First, a direct routing algorithm automatically identifies flights with large dog legs in their routes and therefore potentially large savings in flying time. These are common - and usually necessary - during convective weather operations and analysis of Fort Worth Center traffic shows many aircraft with short cuts that indicate savings on the order of 10 flying minutes. The second and most critical step is to apply trajectory automation with weather modeling to determine what savings could be achieved by modifying the direct route such that it avoids weather and traffic and is acceptable to controllers and flight crews. Initial analysis of Fort Worth Center traffic suggests a savings of roughly 50% of the direct route savings could be achievable.The core concept is to apply trajectory automation with convective weather modeling in real time to identify a reroute that is free of weather and traffic conflicts and indicates enough time and fuel savings to be considered. The concept is interoperable with today

  16. Estimation of light commercial vehicles dynamics by means of HIL-testbench simulation

    Science.gov (United States)

    Groshev, A.; Tumasov, A.; Toropov, E.; Sereda, P.

    2018-02-01

    The high level of active safety of vehicles is impossible without driver assistance electronic systems. Electronic stability control (ESC) system is one of them. Nowadays such systems are obligatory for installation on vehicles of different categories. The approval of active safety level of vehicles with ESC is possible by means of high speed road tests. The most frequently implemented tests are “fish hook” and “sine with dwell” tests. Such kind of tests provided by The Global technical regulation No. 8 are published by the United Nations Economic Commission for Europe as well as by ECE 13-11. At the same time, not only road tests could be used for estimation of vehicles dynamics. Modern software and hardware technologies allow imitating real tests with acceptable reliability and good convergence between real test data and simulation results. ECE 13-11 Annex 21 - Appendix 1 “Use Of The Dynamic Stability Simulation” regulates demands for special Simulation Test bench that could be used not only for preliminary estimation of vehicles dynamics, but also for official vehicles homologation. This paper describes the approach, proposed by the researchers from Nizhny Novgorod State Technical University n.a. R.E. Alekseev (NNSTU, Russia) with support of engineers of United Engineering Center GAZ Group, as well as specialists of Gorky Automobile Plant. The idea of approach is to use the special HIL (hardware in the loop) -test bench, that consists of Real Time PC with Real Time Software and braking system components including electronic control unit (ECU) of ESC system. The HIL-test bench allows imitating vehicle dynamics in condition of “fish hook” and “sine with dwell” tests. The paper describes the scheme and structure of HIL-test bench and some peculiarities that should be taken into account during HIL-simulation.

  17. Workload Model Based Dynamic Adaptation of Social Internet of Vehicles

    Directory of Open Access Journals (Sweden)

    Kazi Masudul Alam

    2015-09-01

    Full Text Available Social Internet of Things (SIoT has gained much interest among different research groups in recent times. As a key member of a smart city, the vehicular domain of SIoT (SIoV is also undergoing steep development. In the SIoV, vehicles work as sensor-hub to capture surrounding information using the in-vehicle and Smartphone sensors and later publish them for the consumers. A cloud centric cyber-physical system better describes the SIoV model where physical sensing-actuation process affects the cloud based service sharing or computation in a feedback loop or vice versa. The cyber based social relationship abstraction enables distributed, easily navigable and scalable peer-to-peer communication among the SIoV subsystems. These cyber-physical interactions involve a huge amount of data and it is difficult to form a real instance of the system to test the feasibility of SIoV applications. In this paper, we propose an analytical model to measure the workloads of various subsystems involved in the SIoV process. We present the basic model which is further extended to incorporate complex scenarios. We provide extensive simulation results for different parameter settings of the SIoV system. The findings of the analyses are further used to design example adaptation strategies for the SIoV subsystems which would foster deployment of intelligent transport systems.

  18. Workload Model Based Dynamic Adaptation of Social Internet of Vehicles

    Science.gov (United States)

    Alam, Kazi Masudul; Saini, Mukesh; El Saddik, Abdulmotaleb

    2015-01-01

    Social Internet of Things (SIoT) has gained much interest among different research groups in recent times. As a key member of a smart city, the vehicular domain of SIoT (SIoV) is also undergoing steep development. In the SIoV, vehicles work as sensor-hub to capture surrounding information using the in-vehicle and Smartphone sensors and later publish them for the consumers. A cloud centric cyber-physical system better describes the SIoV model where physical sensing-actuation process affects the cloud based service sharing or computation in a feedback loop or vice versa. The cyber based social relationship abstraction enables distributed, easily navigable and scalable peer-to-peer communication among the SIoV subsystems. These cyber-physical interactions involve a huge amount of data and it is difficult to form a real instance of the system to test the feasibility of SIoV applications. In this paper, we propose an analytical model to measure the workloads of various subsystems involved in the SIoV process. We present the basic model which is further extended to incorporate complex scenarios. We provide extensive simulation results for different parameter settings of the SIoV system. The findings of the analyses are further used to design example adaptation strategies for the SIoV subsystems which would foster deployment of intelligent transport systems. PMID:26389905

  19. 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.

  20. Dynamic Route Choice Modelling of the Effects of Travel Information using RP Data

    NARCIS (Netherlands)

    De Moraes Ramos, G.

    2015-01-01

    Traffic congestion is experienced by a great number of travellers during peak hours and is directly influenced by travel-related decisions, such as route choice decisions. In order to minimize problems that arise from congestion, such as delays, uncertainty and environmental effects, there has been

  1. The 'neighbor effect'. Simulating dynamics in consumer preferences for new vehicle technologies

    International Nuclear Information System (INIS)

    Mau, Paulus; Eyzaguirre, Jimena; Jaccard, Mark; Tiedemann, Kenneth; Collins-Dodd, Colleen

    2008-01-01

    Understanding consumer behaviour is essential in designing policies that efficiently increase the uptake of clean technologies over the long-run. Expert opinion or qualitative market analyses have tended to be the sources of this information. However, greater scrutiny on governments increasingly demands the use of reliable and credible evidence to support policy decisions. While discrete choice research and modeling techniques have been applied to estimate consumer preferences for technologies, these methods often assume static preferences. This study builds on the application of discrete choice research and modeling to capture dynamics in consumer preferences. We estimate Canadians' preferences for new vehicle technologies under different market assumptions, using responses from two national surveys focused on hybrid gas-electric vehicles and hydrogen fuel cell vehicles. The results support the relevance of a range of vehicle attributes beyond the purchase price in shaping consumer preferences towards clean vehicle technologies. They also corroborate our hypothesis that the degree of market penetration of clean vehicle technologies is an influence on people's preferences ('the neighbor effect'). Finally, our results provide behavioural parameters for the energy-economy model CIMS, which we use here to show the importance of including consumer preference dynamics when setting policies to encourage the uptake of clean technologies. (author)

  2. Robust control and linear parameter varying approaches application to vehicle dynamics

    CERN Document Server

    Gaspar, Peter; Bokor, József

    2013-01-01

    Vehicles are complex systems (non-linear, multi-variable) where the abundance of embedded controllers should ensure better security. This book aims at emphasizing the interest and potential of Linear Parameter Varying methods within the framework of vehicle dynamics, e.g.   ·          proposed control-oriented model, complex enough to handle some system non linearities but still simple for control or observer design,   ·          take into account the adaptability of the vehicle's response to driving situations, to the driver request and/or to the road sollicitations,   ·          manage interactions between various actuators to optimize the dynamic behavior of vehicles.   This book results from the 32th International Summer School in Automatic that held in Grenoble, France, in September 2011, where recent methods (based on robust control and LPV technics), then applied to the control of vehicle dynamics, have been presented. After some theoretical background and a view on so...

  3. Kineto-dynamic design optimisation for vehicle-specific seat-suspension systems

    Science.gov (United States)

    Shangguan, Wen-Bin; Shui, Yijie; Rakheja, Subhash

    2017-11-01

    Designs and analyses of seat-suspension systems are invariably performed considering effective vertical spring rate and damping properties, while neglecting important contributions due to kinematics of the widely used cross-linkage mechanism. In this study, a kineto-dynamic model of a seat-suspension is formulated to obtain relations for effective vertical suspension stiffness and damping characteristics as functions of those of the air spring and the hydraulic damper, respectively. The proposed relations are verified through simulations of the multi-body dynamic model of the cross-linkage seat-suspension in the ADAMS platform. The validity of the kineto-dynamic model is also demonstrated through comparisons of its vibration transmission response with the experimental data. The model is used to identify optimal air spring coordinates to attain nearly constant natural frequency of the suspension, irrespective of the seated body mass and seated height. A methodology is further proposed to identify optimal damping requirements for vehicle-specific suspension designs to achieve minimal seat effective amplitude transmissibility (SEAT) and vibration dose value (VDV) considering vibration spectra of different classes of earthmoving vehicles. The shock and vibration isolation performance potentials of the optimal designs are evaluated under selected vehicle vibration superimposed with shock motions. Results show that the vehicle-specific optimal designs could provide substantial reductions in the SEAT and VDV values for the vehicle classes considered.

  4. Review on dynamics control of 4WID-4WIS electric vehicle

    Directory of Open Access Journals (Sweden)

    Xin LAI

    2016-08-01

    Full Text Available The four-wheel independent drive and four-wheel independent steering (4WID-4WIS vehicle has the advantages of short transmission chain, high efficiency, compact structure, and high maneuverability. The kinematics and dynamic control of the 4WID-4WIS vehicle are discussed, then key and difficult problems are refined. The distributed network control system is widely used in the vehicle control system, so that real-time and reliable control under non-ideal network is the research challenges, and hierarchical control method is a hot research topic. For the vehicle dynamics control method, the main research focuses on torque distribution method under one or more optimization objectives, and integrated control which harmonizes multi control subjects has become an important research direction. In order to solve the problem of steering mode static switching of the 4WID-4WIS vehicle, the study on the dynamic switching method based on redundant control degree of freedom is a new research direction.

  5. CFD Based Added Mass Prediction in Cruise Condition of Underwater Vehicle Dynamic

    Science.gov (United States)

    Agoes Moelyadi, Mochammad; Bambang Riswandi, Bagus

    2018-04-01

    One of the unsteady flow behavior on the hydrodynamic characteristics of underwater vehicle is the presence of added mass. In cruising conditions, the underwater vehicle may require the addition of speed or experience the disturbance in the form of unsteady flow so that cause the hydrodynamic interaction between the surface of the vehicle with the surrounding fluid. This leads to the rise of local velocity of flow and the great changes of hydrodynamic forces which are very influential on the stability of the underwater vehicle. One of the result is an additional force called added mass. It is very useful parameter to control underwater vehicle dynamic.This paper reports the research on the added mass coefficient of underwater vehicles obtained through the Computational Fluid Dynmaic (CFD) simulation method using CFX software. Added mass coefficient is calculated by performing an unsteady simulation or known as transient simulation. Computational simulations are based on the Reynold Average Navier- Stokes (RANS) equation solution. The simulated vehicle moves forward and backward according to the sinus function, with a frequency of 0.25 Hz, a 2 m amplitude, a cruising depth of 10 m below sea level, and Vcruise 1.54 m / s (Re = 9.000.000). Simulation result data includes velocity contour, variation of force and acceleration to frequency, and added mass coefficient.

  6. Dynamic motion stabilization for front-wheel drive in-wheel motor electric vehicles

    Directory of Open Access Journals (Sweden)

    Jia-Sheng Hu

    2015-12-01

    Full Text Available This article presents a new dynamic motion stabilization approach to front-wheel drive in-wheel motor electric vehicles. The approach includes functions such as traction control system, electronic differential system, and electronic stability control. The presented electric vehicle was endowed with anti-skid performance in longitudinal accelerated start; smooth turning with less tire scrubbing; and safe driving experience in two-dimensional steering. The analysis of the presented system is given in numerical derivations. For practical verifications, this article employed a hands-on electric vehicle named Corsa-electric vehicle to carry out the tests. The presented approach contains an integrated scheme which can achieve the mentioned functions in a single microprocessor. The experimental results demonstrated the effectiveness and feasibility of the presented methodology.

  7. Development of Matlab Simulink model for dynamics analysis of passive suspension system for lightweight vehicle

    Science.gov (United States)

    Jamali, M. S.; Ismail, K. A.; Taha, Z.; Aiman, M. F.

    2017-10-01

    In designing suitable isolators to reduce unwanted vibration in vehicles, the response from a mathematical model which characterizes the transmissibility ratio of the input and output of the vehicle is required. In this study, a Matlab Simulink model is developed to study the dynamic behaviour performance of passive suspension system for a lightweight electric vehicle. The Simulink model is based on the two degrees of freedom system quarter car model. The model is compared to the theoretical plots of the transmissibility ratios between the amplitudes of the displacements and accelerations of the sprung and unsprung masses to the amplitudes of the ground, against the frequencies at different damping values. It was found that the frequency responses obtained from the theoretical calculations and from the Simulink simulation is comparable to each other. Hence, the model may be extended to a full vehicle model.

  8. Experiential Learning in Vehicle Dynamics Education via Motion Simulation and Interactive Gaming

    Directory of Open Access Journals (Sweden)

    Kevin Hulme

    2009-01-01

    Full Text Available Creating active, student-centered learning situations in postsecondary education is an ongoing challenge for engineering educators. Contemporary students familiar with visually engaging and fast-paced games can find traditional classroom methods of lecture and guided laboratory experiments limiting. This paper presents a methodology that incorporates driving simulation, motion simulation, and educational practices into an engaging, gaming-inspired simulation framework for a vehicle dynamics curriculum. The approach is designed to promote active student participation in authentic engineering experiences that enhance learning about road vehicle dynamics. The paper presents the student use of physical simulation and large-scale visualization to discover the impact that design decisions have on vehicle design using a gaming interface. The approach is evaluated using two experiments incorporated into a sequence of two upper level mechanical engineering courses.

  9. Real time control of the flexible dynamics of orbital launch vehicles

    NARCIS (Netherlands)

    Bos, van den J.; Steinbuch, M.; Gutierrez, H.M.

    2011-01-01

    During this traineeship the flexible dynamics of orbital launch vehicles are estimated and controlled in real time, using distributed fiber-Bragg sensor arrays for motion estimation and cold gas thrusters for control. The use of these cold-gas thrusters to actively control flexible modes is the main

  10. Fine particles and NO{sub 2}. Development and validation of a method for the immission-relevant, dynamic re-routing of traffic; Feinstaub und NO{sub 2}. Entwicklung und Validierung einer Methode zur immissionsabhaengigen dynamischen Verkehrssteuerung

    Energy Technology Data Exchange (ETDEWEB)

    Ludes, G.; Siebers, B. [simuPlan, Dorsten (Germany); Kuhlbusch, T.; Quass, U.; Beyer, M. [Institut fuer Energie- und Umwelttechnik, Duisburg (Germany); Weber, F. [Stadt Hagen (Germany)

    2010-05-15

    Due to the coming into effect of the twenty-second BImSchV comprehensive investigations on the ambient air quality have been carried out in the city of Hagen in recent years by means of measurement and modelling. High concentrations of nitrogen dioxide and respirable dust have been found along the main streets and the roads belonging to the city ring road system. Main cause of the present situation is road traffic, esp. heavy duty vehicles (HDV). Therefore the concept of measures for the implementation of the air monitoring plan and the action plan set up by the project group includes a HDV-routing system and dynamic, immission-relevant re-routing of traffic. Through this research project the practicability and the effects on air quality of the dynamic, immission-relevant re-routing of HDV-traffic will especially be examined within the highly polluted area of the ''Maerkischer Ring''. By making use of the control programme simDRIVE this innovative concept allows temporary closures of the ''Maerkischer Ring'' for HDV-traffic if transgression of critical limit values is prognosticated due to traffic volume and meteorological circumstances. During these closure periods HDV-traffic will be diverted to alternative and previously determined routes by dynamic and static traffic signs in order to guarantee that intended destinations can be reached. With the help of this research project it should be demonstrated in addition (a) if and how this particular method for NO{sub 2} can also be applied on the reduction of respirable dust, (b) how this measure affects the situation of air pollution regarding respirable dust in other parts of Hagen and (c) if the transfer of methods for the use in other cities is possible. (orig.)

  11. On the required complexity of vehicle dynamic models for use in simulation-based highway design.

    Science.gov (United States)

    Brown, Alexander; Brennan, Sean

    2014-06-01

    This paper presents the results of a comprehensive project whose goal is to identify roadway design practices that maximize the margin of safety between the friction supply and friction demand. This study is motivated by the concern for increased accident rates on curves with steep downgrades, geometries that contain features that interact in all three dimensions - planar curves, grade, and superelevation. This complexity makes the prediction of vehicle skidding quite difficult, particularly for simple simulation models that have historically been used for road geometry design guidance. To obtain estimates of friction margin, this study considers a range of vehicle models, including: a point-mass model used by the American Association of State Highway Transportation Officials (AASHTO) design policy, a steady-state "bicycle model" formulation that considers only per-axle forces, a transient formulation of the bicycle model commonly used in vehicle stability control systems, and finally, a full multi-body simulation (CarSim and TruckSim) regularly used in the automotive industry for high-fidelity vehicle behavior prediction. The presence of skidding--the friction demand exceeding supply--was calculated for each model considering a wide range of vehicles and road situations. The results indicate that the most complicated vehicle models are generally unnecessary for predicting skidding events. However, there are specific maneuvers, namely braking events within lane changes and curves, which consistently predict the worst-case friction margins across all models. This suggests that any vehicle model used for roadway safety analysis should include the effects of combined cornering and braking. The point-mass model typically used by highway design professionals may not be appropriate to predict vehicle behavior on high-speed curves during braking in low-friction situations. However, engineers can use the results of this study to help select the appropriate vehicle dynamic

  12. Hybrid neural network bushing model for vehicle dynamics simulation

    International Nuclear Information System (INIS)

    Sohn, Jeong Hyun; Lee, Seung Kyu; Yoo, Wan Suk

    2008-01-01

    Although the linear model was widely used for the bushing model in vehicle suspension systems, it could not express the nonlinear characteristics of bushing in terms of the amplitude and the frequency. An artificial neural network model was suggested to consider the hysteretic responses of bushings. This model, however, often diverges due to the uncertainties of the neural network under the unexpected excitation inputs. In this paper, a hybrid neural network bushing model combining linear and neural network is suggested. A linear model was employed to represent linear stiffness and damping effects, and the artificial neural network algorithm was adopted to take into account the hysteretic responses. A rubber test was performed to capture bushing characteristics, where sine excitation with different frequencies and amplitudes is applied. Random test results were used to update the weighting factors of the neural network model. It is proven that the proposed model has more robust characteristics than a simple neural network model under step excitation input. A full car simulation was carried out to verify the proposed bushing models. It was shown that the hybrid model results are almost identical to the linear model under several maneuvers

  13. Two Chaotic Patterns of Dynamic Risk Definition for Solving Hazardous Materials Routing Problem

    Directory of Open Access Journals (Sweden)

    Abbas Mahmoudabadi

    2015-01-01

    Full Text Available In the case of determining routes for hazardous material transportation, risk is considered as a main attribute. Transport risk, which is usually combined with other attributes such as cost or travel time, plays a significant role in determining paths for hazardous materials transportation. Since, risk is chaotically affected by road incidents, decision makers are dealing with selecting a method for defining chaotic risk factors in hazmat transportation. In this paper, transport risk has been defined as a chaotic variable using two different methods of generating chaotic patterns. In an experimental road network, which consists of eighty-nine nodes and one hundred and one two-way links, two different methods of generating chaotic variables have been used for applying the proposed procedure. In addition, results for different amounts of risk and cost have also been analyzed in case study. Results revealed that different cost and risk priorities change the frequencies of selected paths determined for hazmat transportation, but the route convergence of the route to chaos method is better than that of the logistic map equation.

  14. The science of vehicle dynamics handling, braking, and ride of road and race cars

    CERN Document Server

    Guiggiani, Massimo

    2014-01-01

    Vehicle dynamics is often perceived as a quite intuitive subject. As a matter of fact, lots of people are able to drive a car. Nevertheless, without a rigorous mathematical formulation it is very difficult to truly understand the physical phenomena involved in the motion of a road vehicle. In this book, mathematical models of vehicles are developed, always paying attention to state the relevant assumptions and to provide explanations for each step. This approach allows for a deep, yet simple, analysis of the dynamics of vehicles, without having to resort to foggy concepts. The reader will soon achieve a clear understanding of the subject, which will be of great help both in dealing with the challenges of designing and testing new vehicles and in tackling new research topics. The book covers handling and performance of both road and race cars. A new approach, called MAP (Map of Achievable Performance), is presented and thoroughly discussed. It provides a global and intuitive picture of the handling features of...

  15. Development of a highly maneuverable unmanned underwater vehicle on the basis of quad-copter dynamics

    Science.gov (United States)

    Amin, Osman Md; Karim, Md. Arshadul; Saad, Abdullah His

    2017-12-01

    At present, research on unmanned underwater vehicle (UUV) has become a significant & familiar topic for researchers from various engineering fields. UUV is of mainly two types - AUV (Autonomous Underwater vehicle) & ROV (Remotely Operated Vehicle). There exist a significant number of published research papers on UUV, where very few researchers emphasize on the ease of maneuvering and control of UUV. Maneuvering is important for underwater vehicle in avoiding obstacles, installing underwater piping system, searching undersea resources, underwater mine disposal operations, oceanographic surveys etc. A team from Dept. of Naval Architecture & Marine Engineering of MIST has taken a project to design a highly maneuverable unmanned underwater vehicle on the basis of quad-copter dynamics. The main objective of the research is to develop a control system for UUV which would be able to maneuver the vehicle in six DOF (Degrees of Freedom) with great ease. For this purpose we are not only focusing on controllability but also designing an efficient hull with minimal drag force & optimized propeller using CFD technique. Motors were selected on the basis of the simulated thrust generated by propellers in ANSYS Fluent software module. Settings for control parameters to carry out different types of maneuvering such as hovering, spiral, one point rotation about its centroid, gliding, rolling, drifting and zigzag motions were explained in short at the end.

  16. Near Space Hypersonic Unmanned Aerial Vehicle Dynamic Surface Backstepping Control Design

    Directory of Open Access Journals (Sweden)

    Jinyong YU

    2014-07-01

    Full Text Available Compared with traditional aircraft, the near space hypersonic unmanned aerial vehicle control system design must deal with the extra prominent dynamics characters, which are differ from the traditional aircrafts control system design. A new robust adaptive control design method is proposed for one hypersonic unmanned aerial vehicle (HSUAV uncertain MIMO nonaffine block control system by using multilayer neural networks, feedback linearization technology, and dynamic surface backstepping. Multilayer neural networks are used to compensate the influence from the uncertain, which designs the robust terms to solve the problem from approach error. Adaptive backstepping is adopted designed to ensure control law, the dynamic surface control strategy to eliminate “the explosion of terms” by introducing a series of first order filters to obtain the differentiation of the virtual control inputs. Finally, nonlinear six-degree-of-freedom (6-DOF numerical simulation results for a HSUAV model are presented to demonstrate the effectiveness of the proposed method.

  17. Condition-based dynamic maintenance operations planning and grouping. Application to commercial heavy vehicles

    Energy Technology Data Exchange (ETDEWEB)

    Bouvard, K., E-mail: keomany.bouvard@volvo.co [Volvo Technology, 99 route de Lyon, 69806 Saint Priest cedex (France); Laboratoire d' Automatique de Genie Informatique et Signal - FRE3303 - Polytech' Lille, 59655 Villeneuve d' Ascq (France); Artus, S., E-mail: samuel.artus@volvo.co [Volvo Technology, 99 route de Lyon, 69806 Saint Priest cedex (France); Berenguer, C., E-mail: christophe.berenguer@utt.f [Universite de technologie de Troyes - Institut Charles Delaunay and UMR CNRS 6279 - 12, rue Marie Curie, BP2060, 10010 Troyes cedex (France); Cocquempot, V., E-mail: vincent.cocquempot@univ-lille1.f [Laboratoire d' Automatique de Genie Informatique et Signal - FRE3303 - Polytech' Lille, 59655 Villeneuve d' Ascq (France)

    2011-06-15

    This paper aims at presenting a method to optimize the maintenance planning for a commercial heavy vehicle. Such a vehicle may be considered as a multi-components system. Grouping maintenance operations related to each component reduces the global maintenance cost of the system. Classically, the optimization problem is solved using a priori reliability characteristics of components. Two types of methods may be used, i.e. static or dynamic methods. Static methods provide a fixed maintenance planning, whereas dynamic methods redefine the groups of maintenance operations at each decision time. Dynamic procedures can incorporate component information such as component states or detected failures. For deteriorating systems, reliability characteristics of each component may be estimated thanks to deterioration models and may be updated when a degradation measure is available. This additional information on degradation features allows to better follow the real state of each component and to improve the maintenance planning.

  18. Cost-Effectiveness Comparison of Coupler Designs of Wireless Power Transfer for Electric Vehicle Dynamic Charging

    Directory of Open Access Journals (Sweden)

    Weitong Chen

    2016-11-01

    Full Text Available This paper presents a cost-effectiveness comparison of coupler designs for wireless power transfer (WPT, meant for electric vehicle (EV dynamic charging. The design comparison of three common types of couplers is first based on the raw material cost, output power, transfer efficiency, tolerance of horizontal offset, and flux density. Then, the optimal cost-effectiveness combination is selected for EV dynamic charging. The corresponding performances of the proposed charging system are compared and analyzed by both simulation and experimentation. The results verify the validity of the proposed dynamic charging system for EVs.

  19. Vehicle Sliding Mode Control with Adaptive Upper Bounds: Static versus Dynamic Allocation to Saturated Tire Forces

    Directory of Open Access Journals (Sweden)

    Ali Tavasoli

    2012-01-01

    Full Text Available Nonlinear vehicle control allocation is achieved through distributing the task of vehicle control among individual tire forces, which are constrained to nonlinear saturation conditions. A high-level sliding mode control with adaptive upper bounds is considered to assess the body yaw moment and lateral force for the vehicle motion. The proposed controller only requires the online adaptation of control gains without acquiring the knowledge of upper bounds on system uncertainties. Static and dynamic control allocation approaches have been formulated to distribute high-level control objectives among the system inputs. For static control allocation, the interior-point method is applied to solve the formulated nonlinear optimization problem. Based on the dynamic control allocation method, a dynamic update law is derived to allocate vehicle control to tire forces. The allocated tire forces are fed into a low-level control module, where the applied torque and active steering angle at each wheel are determined through a slip-ratio controller and an inverse tire model. Computer simulations are used to prove the significant effects of the proposed control allocation methods on improving the stability and handling performance. The advantages and limitations of each method have been discussed, and conclusions have been derived.

  20. Flex-fuel vehicle adoption and dynamics of ethanol prices: lessons from Brazil

    International Nuclear Information System (INIS)

    Du, Xiaodong; Carriquiry, Miguel A.

    2013-01-01

    Focusing on dynamics of the relative prices of substitute fuels, namely ethanol and gasoline, this study quantifies the impact of the increase in shares of flex-fuel vehicles (FFVs) in the vehicle fleet on the domestic ethanol prices in Brazil. A modified partial adjustment model is employed. Estimation results provide strong support for our research hypotheses: (i) when consumers can choose between the fuels the relative ethanol and gasoline prices converge to a long-run equilibrium level, which is determined by the fuel economy, and (ii) price dynamics are largely determined by market supply and demand factors including the price of sugar, ethanol exports, and composition of vehicle fleet. Furthermore, the impacts of demand factors such as ethanol exports are strengthened by the increasing proportion of FFVs in the vehicle fleet. - Highlights: • The relative prices of ethanol and gasoline in Brazil exhibit strong mean-reversion. • The fuel price dynamics are mainly influenced by supply and demand factors. • The impacts of demand factors are strengthened by the increasing proportion of FFVs

  1. CFD based aerodynamic modeling to study flight dynamics of a flapping wing micro air vehicle

    Science.gov (United States)

    Rege, Alok Ashok

    The demand for small unmanned air vehicles, commonly termed micro air vehicles or MAV's, is rapidly increasing. Driven by applications ranging from civil search-and-rescue missions to military surveillance missions, there is a rising level of interest and investment in better vehicle designs, and miniaturized components are enabling many rapid advances. The need to better understand fundamental aspects of flight for small vehicles has spawned a surge in high quality research in the area of micro air vehicles. These aircraft have a set of constraints which are, in many ways, considerably different from that of traditional aircraft and are often best addressed by a multidisciplinary approach. Fast-response non-linear controls, nano-structures, integrated propulsion and lift mechanisms, highly flexible structures, and low Reynolds aerodynamics are just a few of the important considerations which may be combined in the execution of MAV research. The main objective of this thesis is to derive a consistent nonlinear dynamic model to study the flight dynamics of micro air vehicles with a reasonably accurate representation of aerodynamic forces and moments. The research is divided into two sections. In the first section, derivation of the nonlinear dynamics of flapping wing micro air vehicles is presented. The flapping wing micro air vehicle (MAV) used in this research is modeled as a system of three rigid bodies: a body and two wings. The design is based on an insect called Drosophila Melanogaster, commonly known as fruit-fly. The mass and inertial effects of the wing on the body are neglected for the present work. The nonlinear dynamics is simulated with the aerodynamic data published in the open literature. The flapping frequency is used as the control input. Simulations are run for different cases of wing positions and the chosen parameters are studied for boundedness. Results show a qualitative inconsistency in boundedness for some cases, and demand a better

  2. Dynamics of braking vehicles: from Coulomb friction to anti-lock braking systems

    International Nuclear Information System (INIS)

    Tavares, J M

    2009-01-01

    The dynamics of braking of wheeled vehicles is studied using the Coulomb approximation for the friction between road and wheels. The dependence of the stopping distance on the mass of the vehicle, on the number of its wheels and on the intensity of the braking torque is established. It is shown that there are two regimes of braking, with and without sliding. The advantage of using an anti-lock braking system (ABS) is put in evidence, and a quantitative estimate of its efficiency is proposed and discussed

  3. Compaction-Based Deformable Terrain Model as an Interface for Real-Time Vehicle Dynamics Simulations

    Science.gov (United States)

    2013-04-16

    N.Y. [20] Wulfsohn, D., and Upadhyaya, S. K., 1992, "Prediction of traction and soil compaction using three-dimensional soil- tyre contact profile," Journal of Terramechanics, 29(6), pp. 541-564. ...the relative speedup of utilizing GPUs for computational acceleration. INTRODUCTION In order to enable off- road vehicle dynamics analysis...ANSI Std Z39-18 Page 2 of 8 Figure 2. Tire geometry used to determine collision points with the terrain In the context of off- road vehicle

  4. The Dynamics of a Railway Vehicle on a Disturbed Track

    DEFF Research Database (Denmark)

    Christiansen, Lasse Engbo

    This work studies a mathematical model of a bogie, the aim being to investigate the correlation between the lateral motion of the bogie and lateral irregularities of the track that the bogie is running along. When modelling the wheel-rail forces real wheel and rail profiles are used. One...... describing how the wheel-rail interaction is modelled. The fourth chapter gives a presentation of the numerical algorithms used in this work. The fifth chapter presents the results obtained during this work, it begins with an brief investigation of the dynamics when running on a straight track. The second...... section introduces some statistical measures and treats centerline irregularities when running with a fixed speed of 30 m/s. The following section investigates the behaviour of the model when the track possesses gauge irregularities. The fourth and fifth sections describe the changes observed when...

  5. Heterogeneous beliefs and routes to complex dynamics in asset pricing models with price contingent contracts

    NARCIS (Netherlands)

    Brock, W.A.; Hommes, C.H.

    2001-01-01

    This paper discusses dynamic evolutionary multi-agent systems, as introduced by Brock and Hommes (1997). In particular the heterogeneous agent dynamic asset pricing model of Brock and Hommes (1998) is extended by introducing derivative securities by means of price contingent contracts. Numerical

  6. Probabilistic Sensitivity Analysis for Launch Vehicles with Varying Payloads and Adapters for Structural Dynamics and Loads

    Science.gov (United States)

    McGhee, David S.; Peck, Jeff A.; McDonald, Emmett J.

    2012-01-01

    This paper examines Probabilistic Sensitivity Analysis (PSA) methods and tools in an effort to understand their utility in vehicle loads and dynamic analysis. Specifically, this study addresses how these methods may be used to establish limits on payload mass and cg location and requirements on adaptor stiffnesses while maintaining vehicle loads and frequencies within established bounds. To this end, PSA methods and tools are applied to a realistic, but manageable, integrated launch vehicle analysis where payload and payload adaptor parameters are modeled as random variables. This analysis is used to study both Regional Response PSA (RRPSA) and Global Response PSA (GRPSA) methods, with a primary focus on sampling based techniques. For contrast, some MPP based approaches are also examined.

  7. Propulsion System Dynamic Modeling of the NASA Supersonic Concept Vehicle for AeroPropulsoServoElasticity

    Science.gov (United States)

    Kopasakis, George; Connolly, Joseph W.; Seiel, Jonathan

    2016-01-01

    A summary of the propulsion system modeling under NASA's High Speed Project (HSP) AeroPropulsoServoElasticity (APSE) task is provided with a focus on the propulsion system for the low-boom supersonic configuration developed by Lockheed Martin and referred to as the N+2 configuration. This summary includes details on the effort to date to develop computational models for the various propulsion system components. The objective of this paper is to summarize the model development effort in this task, while providing more detail in the modeling areas that have not been previously published. The purpose of the propulsion system modeling and the overall APSE effort is to develop an integrated dynamic vehicle model to conduct appropriate unsteady analysis of supersonic vehicle performance. This integrated APSE system model concept includes the propulsion system model, and the vehicle structural aerodynamics model. The development to date of such a preliminary integrated model will also be summarized in this report

  8. Routes to chaos in continuous mechanical systems: Part 2. Modelling transitions from regular to chaotic dynamics

    International Nuclear Information System (INIS)

    Krysko, A.V.; Awrejcewicz, J.; Papkova, I.V.; Krysko, V.A.

    2012-01-01

    In second part of the paper both classical and novel scenarios of transition from regular to chaotic dynamics of dissipative continuous mechanical systems are studied. A detailed analysis allowed us to detect the already known classical scenarios of transition from periodic to chaotic dynamics, and in particular the Feigenbaum scenario. The Feigenbaum constant was computed for all continuous mechanical objects studied in the first part of the paper. In addition, we illustrate and discuss different and novel scenarios of transition of the analysed systems from regular to chaotic dynamics, and we show that the type of scenario depends essentially on excitation parameters.

  9. Dynamic Routing of Aircraft in the Presence of Adverse Weather Using a POMDP Framework

    Science.gov (United States)

    Balaban, Edward; Roychoudhury, Indranil; Spirkovska, Lilly; Sankararaman, Shankar; Kulkarni, Chetan; Arnon, Tomer

    2017-01-01

    Each year weather-related airline delays result in hundreds of millions of dollars in additional fuel burn, maintenance, and lost revenue, not to mention passenger inconvenience. The current approaches for aircraft route planning in the presence of adverse weather still mainly rely on deterministic methods. In contrast, this work aims to deal with the problem using a Partially Observable Markov Decision Processes (POMDPs) framework, which allows for reasoning over uncertainty (including uncertainty in weather evolution over time) and results in solutions that are more robust to disruptions. The POMDP-based decision support system is demonstrated on several scenarios involving convective weather cells and is benchmarked against a deterministic planning system with functionality similar to those currently in use or under development.

  10. Dynamic Request Routing for Online Video-on-Demand Service: A Markov Decision Process Approach

    Directory of Open Access Journals (Sweden)

    Jianxiong Wan

    2014-01-01

    Full Text Available We investigate the request routing problem in the CDN-based Video-on-Demand system. We model the system as a controlled queueing system including a dispatcher and several edge servers. The system is formulated as a Markov decision process (MDP. Since the MDP formulation suffers from the so-called “the curse of dimensionality” problem, we then develop a greedy heuristic algorithm, which is simple and can be implemented online, to approximately solve the MDP model. However, we do not know how far it deviates from the optimal solution. To address this problem, we further aggregate the state space of the original MDP model and use the bounded-parameter MDP (BMDP to reformulate the system. This allows us to obtain a suboptimal solution with a known performance bound. The effectiveness of two approaches is evaluated in a simulation study.

  11. Full drive-by-wire dynamic control for four-wheel-steer all-wheel-drive vehicles

    Science.gov (United States)

    Fahimi, Farbod

    2013-03-01

    Most of the controllers introduced for four-wheel-steer (4WS) vehicles are derived with the assumption that the longitudinal speed of the vehicle is constant. However, in real applications, the longitudinal speed varies, and the longitudinal, lateral, and yaw dynamics are coupled. In this paper, the longitudinal dynamics of the vehicle as well as its lateral and yaw motions are controlled simultaneously. This way, the effect of driving/braking forces of the tires on the lateral and yaw motions of the vehicle are automatically included in the control laws. To address the dynamic parameter uncertainty of the vehicle, a chatter-free variable structure controller is introduced. Elimination of chatter is achieved by introducing a dynamically adaptive boundary layer thickness. It is shown via simulations that the proposed control approach performs more robustly than the controllers developed based on dynamic models, in which longitudinal speed is assumed to be constant, and only lateral speed and yaw rate are used as system states. Furthermore, this approach supports all-wheel-drive vehicles. Front-wheel-drive or rear-wheel-drive vehicles are also supported as special cases of an all-wheel-drive vehicle.

  12. The vehicle dynamics control system of Bosch; Die Fahrdynamikregelung von Bosch

    Energy Technology Data Exchange (ETDEWEB)

    Zanten, A.T. van [Robert Bosch GmbH, Stuttgart (Germany); Erhardt, R. [Robert Bosch GmbH, Stuttgart (Germany); Pfaff, G. [Robert Bosch GmbH, Stuttgart (Germany)

    1996-11-01

    Vehicle handling at the physical limit of adhesion between the tires and the road is extremely difficult. In such situations the driver may be supported by controlling the longitudinal and the lateral forces on the tires. The Vehicle Dynamics Control System of Bosch (VDC) does that by controlled braking of individual wheels which makes the vehicle motion approach the nomial motion intended by the driver. It uses signals to derive the driver`s intent (steering wheel angle, brake pressure, engine torque) and signals to dervie the actual motion of the vehicle (yaw rate, lateral acceleration). The support of the driver is not limited to coasting conditions. Also during full braking (ABS), partial braking, engine drag, free rolling and acceleration (ASR) of the vehicle the system supports the driver in all safety critical situations. In this paper an overview of the VDC is given. The goal of the development of VDC, the physical background, the concept of the system, the control and the controller algorithm are described. The benefit of VDC is demonstrated by an experimental test. (orig.) [Deutsch] Fahrdynamikregelsysteme FDR sind Regelsysteme im Bremssystem und Antriebsstrang, die das seitliche Ausbrechen des Fahrzeugs verhindern. Waehrend ABS das Blockieren der Raeder beim Bremsen und ASR das Durchdrehen der Raeder beim Antrieb verhindert, verhindert FDR das Schleudern und das Schieben des Fahrzeugs. (orig.)

  13. Generalized dynamic model and control of ambiguous mono axial vehicle robot

    Directory of Open Access Journals (Sweden)

    Frantisek Duchon

    2016-09-01

    Full Text Available This article deals with the novel concept of ambiguous mono axial vehicle robot. Such robot is a combination of Segway and dicycle, which utilizes the advantages of each chassis. The advantage of dicycle is lower energy consumption during the movement and the higher safety of carried payload. The movable platform inside the ambiguous mono axial vehicle allows using the various sensors or devices. This will change the ambiguous mono axial vehicle to the Segway type robot. Both these modes are necessary to control in the stable mode to ensure the safety of the ambiguous mono axial vehicle’s movement. The main contents of the article contain description of generalized dynamic model of ambiguous mono axial vehicle and related control of ambiguous mono axial vehicle. The proposal is unique in that the same controller is used for both modes. Several simulations verify proposed control schemes and identified parameters. Moreover, the dicycle type of platform has never been used in robotics and that is another novelty.

  14. Adaptive real-time models of vehicle dynamics; Adaptive Echtzeitmodelle fuer die Kraftfahrzeugdynamik

    Energy Technology Data Exchange (ETDEWEB)

    Halfmann, C.; Holzmann, H.; Isermann, R. [Technische Univ. Darmstadt (Germany). Inst. fuer Automatisierungstechnik; Hamann, C.D.; Simm, N. [Opel (A.) AG, Ruesselsheim (Germany). Gruppe Chassis und Fahrerassistenzsysteme

    1999-12-01

    The application of modern simulation tools offering additional support during the vehicle development process is accepted to a large extent by most car manufacturers. Just like new model-based control strategies, these simulation investigations require very accurate - and thus very complex - models of vehicle dynamics, which can be processed in real time. As an example of such a vehicle model, this article describes a real-time vehicle simulation model which was developed at the Institute of Automatic Control at Darmstadt University of Technology, in co-operation with the ITDC of the Adam OPEL AG. By applying modern adaptation techniques, this vehicle model is able to calculate onboard the important variables describing the actual driving state even if the environmental conditions change. (orig.) [German] Der Einsatz von Simulationswerkzeugen zur Unterstuetzung der Fahrzeugentwicklung hat sich bei den meisten Automobilherstellern weitgehend durchgesetzt. Ebenso wie neuartige modellbasierte Regelstrategien verlangen diese Simulationsuntersuchungen nach immer exakteren - und damit komplexeren - fahrdynamischen Modellen, die in Echtzeit ausgewertet werden. Als Beispiel fuer ein solches Gesamtfahrzeugmodell beschreibt dieser Beitrag ein echtzeitfaehiges Modell fuer die Bewegung des Fahrzeugs um alle drei Hauptachsen, das am Institut fuer Automatisierungstechnik der TU Darmstadt in Kooperation mit dem Internationalen Technischen Entwicklungszentrum (ITEZ) der Adam Opel AG entwickelt wurde. Es ist durch den Einsatz von Adaptionsmethoden in der Lage, wichtige fahrdynamische Zustandsgroessen im Fahrzeug auch unter veraenderlichen Umgebungsbedingungen zu ermitteln. (orig.)

  15. Dynamic simulation of a fuel cell hybrid vehicle during the federal test procedure-75 driving cycle

    International Nuclear Information System (INIS)

    Kang, Sanggyu; Min, Kyoungdoug

    2016-01-01

    Highlights: • Development of a FCHV dynamic model. • Integration of a PEMFC system dynamic model with the electric vehicle model. • Investigation of the dynamic behavior of the FCEV and PEMFC system during FTP-75. • Capturing the dynamic correlation among components in PEMFC system during FTP-75. - Abstract: The dynamic behavior of a proton exchange membrane fuel cell (PEMFC) system is a crucial factor to ensure the safe and effective operation of fuel cell hybrid vehicles (FCHVs). Specifically, water and thermal management are critical to stabilize the performance of the PEMFC during severe load changes. In the present study, the FCHV dynamic model is developed. The dynamic model of the PEMFC system developed by Matlab–Simulink® is integrated into the electric vehicle model embedded in the Amesim®. The dynamic model of the PEMFC system is composed of a PEMFC stack, an air feeding system, and a thermal management system (TMS). The component models of PEMFC, a shell-and-tube gas-to-gas membrane humidifier, and a heat exchanger are validated via a comparison with the experimental data. The FCHV model is simulated during a federal test procedure (FTP)-75 driving cycle. One system configuration and control strategy is adopted to attain optimal water and thermal management in the PEMFC system. The vehicle speed obtained from the FCHV model aptly tracks the target velocity profile of the FTP-75 cycle within an error of ±0.5%. The dynamic behavior and correlation of each component in the PEMFC system is investigated. The mass and heat transfer in the PEMFC, a humidifier, and a heat exchanger are resolved to determine the species concentration and the temperature more accurately with discretization in the flow’s perpendicular direction. Discretization in the flow parallel direction of humidifier and heat exchanger model makes it possible to capture the distribution of the characteristics. The present model can be used to attain the optimization of the system

  16. Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery

    Science.gov (United States)

    2015-03-26

    Appendix C. Computational Example: 3-COP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94 Appendix D. Storyboard ...COP myopic policy. 105 Appendix D. Storyboard 106 Bibliography 1. Barnes-Schuster, Dawn, & Bassok, Yehuda. 1997. Direct shipping and the dynamic

  17. Continuous monitoring the vehicle dynamics and driver behavior using navigation systems

    Science.gov (United States)

    Ene, George

    2017-10-01

    In all fields cost is very important and the increasing amount of data that are needed for active safety systems, like ADAS, lead to implementation of some complex and powerful unit for processing raw data. In this manner is necessary a cost-effective method to estimate the maximum available tire road friction during acceleration and braking by continuous monitoring the vehicle dynamics and driver behavior. The method is based on the hypothesis that short acceleration and braking periods can indicate vehicle dynamics, and thus the available tire road friction coefficient, and also human behavior and his limits. Support for this hypothesis is found in the literature and is supported by the result of experiments conducted under different conditions and seasons.

  18. Motion Planning in Dynamic Environments with Application to Self-Driving Vehicles

    OpenAIRE

    Schwesinger, Ulrich

    2017-01-01

    This thesis is concerned with the development of trajectory planning approaches targeting autonomous driving applications in dynamic environments shared with other traffic participants. The goal is to enable mobile robots to operate in challenging environments, characterized by narrow spaces and close proximity of other agents. With their broad range of private and commercial applications reaching from logistics to valet parking to name a few, driverless vehicles have gained increasing at...

  19. Experiential Learning in Vehicle Dynamics Education via Motion Simulation and Interactive Gaming

    OpenAIRE

    Hulme, Kevin; Kasprzak, Edward; English, Ken; Moore-Russo, Deborah; Lewis, Kemper

    2009-01-01

    Creating active, student-centered learning situations in postsecondary education is an ongoing challenge for engineering educators. Contemporary students familiar with visually engaging and fast-paced games can find traditional classroom methods of lecture and guided laboratory experiments limiting. This paper presents a methodology that incorporates driving simulation, motion simulation, and educational practices into an engaging, gaming-inspired simulation framework for a vehicle dynamics c...

  20. 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...

  1. 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...

  2. Propulsion System Dynamic Modeling for the NASA Supersonic Concept Vehicle: AeroPropulsoServoElasticity

    Science.gov (United States)

    Kopasakis, George; Connolly, Joseph; Seidel, Jonathan

    2014-01-01

    A summary of the propulsion system modeling under NASA's High Speed Project (HSP) AeroPropulsoServoElasticity (APSE) task is provided with a focus on the propulsion system for the low-boom supersonic configuration developed by Lockheed Martin and referred to as the N+2 configuration. This summary includes details on the effort to date to develop computational models for the various propulsion system components. The objective of this paper is to summarize the model development effort in this task, while providing more detail in the modeling areas that have not been previously published. The purpose of the propulsion system modeling and the overall APSE effort is to develop an integrated dynamic vehicle model to conduct appropriate unsteady analysis of supersonic vehicle performance. This integrated APSE system model concept includes the propulsion system model, and the vehicle structural-aerodynamics model. The development to date of such a preliminary integrated model will also be summarized in this report.propulsion system dynamics, the structural dynamics, and aerodynamics.

  3. Hardware-in-the-loop vehicle system including dynamic fuel cell model

    Energy Technology Data Exchange (ETDEWEB)

    Lemes, Z.; Lenhart, T.; Braun, M.; Maencher, H. [MAGNUM Automatisierungstechnik GmbH, Darmstadt (Germany)

    2005-07-01

    In order to reduce costs and accelerate the development of fuel cells and systems the usage of hardware-in-the-loop (HIL) testing and dynamic modelling opens new possibilities. The dynamic model of a proton exchange membrane fuel cell (PEMFC) together with a vehicle model is used to carry out a comprehensive system investigation, which allows designing and optimising the behaviour of the components and the entire fuel cell system. The set-up of a HIL system enables real time interaction between the selected hardware and the model. (orig.)

  4. Dynamic Surface Adaptive Robust Control of Unmanned Marine Vehicles with Disturbance Observer

    Directory of Open Access Journals (Sweden)

    Pengchao Zhang

    2018-01-01

    Full Text Available This paper presents a dynamic surface adaptive robust control method with disturbance observer for unmanned marine vehicles (UMV. It uses adaptive law to estimate and compensate the disturbance observer error. Dynamic surface is introduced to solve the “differential explosion” caused by the virtual control derivation in traditional backstepping method. The final controlled system is proved to be globally uniformly bounded based on Lyapunov stability theory. Simulation results illustrate the effectiveness of the proposed controller, which can realize the three-dimensional trajectory tracking for UMV with the systematic uncertainty and time-varying disturbances.

  5. Dynamic simulation of road vehicle door window regulator mechanism of cross arm type

    Science.gov (United States)

    Miklos, I. Zs; Miklos, C.; Alic, C.

    2017-01-01

    The paper presents issues related to the dynamic simulation of a motor-drive operating mechanism of cross arm type, for the manipulation of road vehicle door windows, using Autodesk Inventor Professional software. The dynamic simulation of the mechanism involves a 3D modelling, kinematic coupling, drive motion parameters and external loads, as well as the graphically view of the kinematic and kinetostatic results for the various elements and kinematic couplings of the mechanism, under real operating conditions. Also, based on the results, the analysis of the mechanism components has been carried out using the finite element method.

  6. Dynamic modeling and ascent flight control of Ares-I Crew Launch Vehicle

    Science.gov (United States)

    Du, Wei

    This research focuses on dynamic modeling and ascent flight control of large flexible launch vehicles such as the Ares-I Crew Launch Vehicle (CLV). A complete set of six-degrees-of-freedom dynamic models of the Ares-I, incorporating its propulsion, aerodynamics, guidance and control, and structural flexibility, is developed. NASA's Ares-I reference model and the SAVANT Simulink-based program are utilized to develop a Matlab-based simulation and linearization tool for an independent validation of the performance and stability of the ascent flight control system of large flexible launch vehicles. A linearized state-space model as well as a non-minimum-phase transfer function model (which is typical for flexible vehicles with non-collocated actuators and sensors) are validated for ascent flight control design and analysis. This research also investigates fundamental principles of flight control analysis and design for launch vehicles, in particular the classical "drift-minimum" and "load-minimum" control principles. It is shown that an additional feedback of angle-of-attack can significantly improve overall performance and stability, especially in the presence of unexpected large wind disturbances. For a typical "non-collocated actuator and sensor" control problem for large flexible launch vehicles, non-minimum-phase filtering of "unstably interacting" bending modes is also shown to be effective. The uncertainty model of a flexible launch vehicle is derived. The robust stability of an ascent flight control system design, which directly controls the inertial attitude-error quaternion and also employs the non-minimum-phase filters, is verified by the framework of structured singular value (mu) analysis. Furthermore, nonlinear coupled dynamic simulation results are presented for a reference model of the Ares-I CLV as another validation of the feasibility of the ascent flight control system design. Another important issue for a single main engine launch vehicle is

  7. Exploration of the Growing Trend of Electric Vehicles in Beijing with System Dynamics method and Vensim model

    NARCIS (Netherlands)

    Zhang, C.; Qin, C.

    2014-01-01

    This research is conducted to explore the growing trend of private vehicles in Beijing, China, in the coming 25 years using the system dynamics (SD) method. The vensim software is used to build the SD model and do simulations. First, the paper introduces the background of the private vehicles in

  8. Toward personalised and dynamic cultural routing: a three-level approach

    NARCIS (Netherlands)

    Aksenov, P.; Kemperman, A.D.A.M.; Arentze, T.A.

    2014-01-01

    This paper introduces the concept of “smart routing” as a recommender system for tourists that takes into account the dynamics of their personal user profiles. The concept relies on three levels of support: 1) programming the tour, i.e. selecting a set of relevant points of interests (POIs) to be

  9. Reducing the Amount of Data for Creating Routes in a Dynamic DTN via Wi-Fi on the Basis of Static Data

    Directory of Open Access Journals (Sweden)

    Yulia Shichkina

    2017-01-01

    Full Text Available This article presents the results of research on the acceleration of data processing in the construction routing in dynamic DTN, realized through the devices established in moving objects and connected by means of Wi-Fi. The routes are constructed based on the prehistory of the movement of objects, which is stored in the database in the csv format. This database has a large volume and contains unnecessary and incorrect information. The article shows the possibility of speeding up the process of constructing routes using data precleaning. Reducing data volume is proposed by constructing an enlarged grid on the object movement map. This article also demonstrates the use of fuzzy logic and graph theory for constructing routes.

  10. Experimental study of the vehicle dynamics behavior during lane changing in different speeds

    Science.gov (United States)

    Heerwan, P. M.; Asyraf, S. M.; Efistein, A. N.; Seah, C. H.; Zikri, J. M.; Syawahieda, J. N.

    2017-10-01

    During lane changing, the speed of the vehicle is related to the stability of the vehicle. If the driver changes the lane at a high speed, the vehicle will lose its stability and it can increase the possibility of an accident. In this study, the experiment has been developed to analyse how the speed of the vehicle can affect the vehicle dynamics behavior. To achieve this objective, the UMP Test Car which employed with global positioning system (GPS), steering torque and angle sensor, displacement sensor and gyro sensor is used in the experiment. The experiment is run at the UMP test track and the track has 2 lanes which can allows the vehicle to change the position from the left to the right. In the experiment, when the GPS monitor shows 30 km/h, the driver will maintain the speed and start to turn the steering just after the test car reaches to the first skittle. Then, the driver will turn again the steering when the test car reaches to the second skittle. This method is repeated two times and the same methods is used for the speed 50 km/h. The data from the sensors is recorded in the Dewetron software and the graph is plotted. From the experimental results, the steering angle, steering torque, yaw rate and displacement for the speed 30 km/h is smaller than 50 km/h. It means that during lane changing, the speed 30 km/h is more stable compared with 50 km/h.

  11. Coupled Simulation of Vehicle Dynamics and Tank Slosh. Phase 1 Report. Testing and Validation of Tank Slosh Analysis

    National Research Council Canada - National Science Library

    Wendel, Glenn

    2002-01-01

    .... Computational Fluid Dynamics (CFD) analysis software is available that can predict fluid slosh, however, the use of this software in accurately predicting fluid slosh for a military vehicle application has not been...

  12. Facile Route to Vertically Aligned High-Aspect Ratio Block Copolymer Films via Dynamic Zone Annealing

    Science.gov (United States)

    Singh, Gurpreet; Kulkarni, Manish; Yager, Kevin; Smilgies, Detlef; Bucknall, David; Karim, Alamgir

    2012-02-01

    Directed assembly of block copolymers (BCP) can be used to fabricate a diversity of nanostructures useful for nanotech applications. The ability to vertically orient etchable high aspect ratio (˜30) ordered BCP domains on flexible substrates via continuous processing methods are particularly attractive for nanomanufacturing. We apply sharp dynamic cold zone annealing (CZA-S) to create etchable, and predominantly vertically oriented 30nm cylindrical domains in 1 μm thick poly(styrene-b-methylmethacrylate) films on low thermal conductivity rigid (quartz) and flexible (PDMS & Kapton) substrates. Under similar static conditions, temporally stable vertical cylinders form within a narrow zone above a critical temperature gradient. Primary ordering mechanism of CZA-S involves sweeping this vertically orienting zone created at maximum thermal gradient. An optimal speed is needed since the process competes with preferential surface wetting dynamics that favors parallel orientation. GISAXS of etched BCP films confirms internal morphology.

  13. The excitonic insulator route through a dynamical phase transition induced by an optical pulse

    Energy Technology Data Exchange (ETDEWEB)

    Brazovskii, S., E-mail: brazov@lptms.u-psud.fr [Université Paris-Saclay, LPTMS, CNRS, Univ. Paris-sud (France); Kirova, N. [Université Paris-Saclay, LPS, CNRS, Univ. Paris-sud (France)

    2016-03-15

    We consider a dynamical phase transition induced by a short optical pulse in a system prone to thermodynamical instability. We address the case of pumping to excitons whose density contributes directly to the order parameter. To describe both thermodynamic and dynamic effects on equal footing, we adopt a view of the excitonic insulator for the phase transition and suggest a formation of the Bose condensate for the pumped excitons. The work is motivated by experiments in donor–acceptor organic compounds with a neutral- ionic phase transition coupled to the spontaneous lattice dimerization and to charge transfer excitons. The double nature of the ensemble of excitons leads to an intricate time evolution, in particular, to macroscopic quantum oscillations from the interference between the Bose condensate of excitons and the ground state of the excitonic insulator. The coupling of excitons and the order parameter also leads to self-trapping of their wave function, akin to self-focusing in optics. The locally enhanced density of excitons can surpass a critical value to trigger the phase transformation, even if the mean density is below the required threshold. The system is stratified in domains that evolve through dynamical phase transitions and sequences of merging. The new circumstances in experiments and theory bring to life, once again, some remarkable inventions made by L.V. Keldysh.

  14. An Online Energy Management Control for Hybrid Electric Vehicles Based on Neuro-Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Feiyan Qin

    2018-03-01

    Full Text Available Hybrid electric vehicles are a compromise between traditional vehicles and pure electric vehicles and can be part of the solution to the energy shortage problem. Energy management strategies (EMSs are highly related to energy utilization in HEVs’ fuel economy. In this research, we have employed a neuro-dynamic programming (NDP method to simultaneously optimize fuel economy and battery state of charge (SOC. In this NDP method, the critic network is a multi-resolution wavelet neural network based on the Meyer wavelet function, and the action network is a conventional wavelet neural network based on the Morlet function. The weights and parameters of both networks are obtained by an algorithm of backpropagation type. The NDP-based EMS has been applied to a parallel HEV and compared with a previously reported NDP EMS and a stochastic dynamic programing-based method. Simulation results under ADVISOR2002 have shown that the proposed NDP approach achieves better performance than both the methods. These indicate that the proposed NDP EMS, and the CWNN and MRWNN, are effective in approximating a nonlinear system.

  15. Incorporating a Wheeled Vehicle Model in a New Monocular Visual Odometry Algorithm for Dynamic Outdoor Environments

    Science.gov (United States)

    Jiang, Yanhua; Xiong, Guangming; Chen, Huiyan; Lee, Dah-Jye

    2014-01-01

    This paper presents a monocular visual odometry algorithm that incorporates a wheeled vehicle model for ground vehicles. The main innovation of this algorithm is to use the single-track bicycle model to interpret the relationship between the yaw rate and side slip angle, which are the two most important parameters that describe the motion of a wheeled vehicle. Additionally, the pitch angle is also considered since the planar-motion hypothesis often fails due to the dynamic characteristics of wheel suspensions and tires in real-world environments. Linearization is used to calculate a closed-form solution of the motion parameters that works as a hypothesis generator in a RAndom SAmple Consensus (RANSAC) scheme to reduce the complexity in solving equations involving trigonometric. All inliers found are used to refine the winner solution through minimizing the reprojection error. Finally, the algorithm is applied to real-time on-board visual localization applications. Its performance is evaluated by comparing against the state-of-the-art monocular visual odometry methods using both synthetic data and publicly available datasets over several kilometers in dynamic outdoor environments. PMID:25256109

  16. Dynamic Gas Flow Effects on the ESD of Aerospace Vehicle Surfaces

    Science.gov (United States)

    Hogue, Michael D.; Kapat, Jayanta; Ahmed, Kareem; Cox, Rachel E.; Wilson, Jennifer G.; Calle, Luz M.; Mulligan, Jaysen

    2016-01-01

    The purpose of this work is to develop a dynamic version of Paschen's Law that takes into account the flow of ambient gas past aerospace vehicle surfaces. However, the classic Paschen's Law does not take into account the flow of gas of an aerospace vehicle, whose surfaces may be triboelectrically charged by dust or ice crystal impingement, traversing the atmosphere. The basic hypothesis of this work is that the number of electron-ion pairs created per unit distance by the electric field between the electrodes is mitigated by the electron-ion pairs removed per unit distance by the flow of gas. The revised Paschen equation must be a function of the mean velocity, v(sub xm), of the ambient gas and reduces to the classical version of Paschen's law when the gas mean velocity, v(sub xm) = 0. New formulations of Paschen's Law, taking into account Mach number and dynamic pressure, derived by the authors, will be discussed. These equations will be evaluated by wind tunnel experimentation later this year. Based on the results of this work, it is hoped that the safety of aerospace vehicles will be enhanced with a redefinition of electrostatic launch commit criteria. It is also possible that new products, such as new anti-static coatings, may be formulated from this data.

  17. Navigation of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments

    Science.gov (United States)

    Jin, Xin; Ray, Asok

    2014-04-01

    In the context of oil spill cleaning by autonomous vehicles in dynamic and uncertain environments, this paper presents a multi-resolution algorithm that seamlessly integrates the concepts of local navigation and global navigation based on the sensory information; the objective here is to enable adaptive decision making and online replanning of vehicle paths. The proposed algorithm provides a complete coverage of the search area for clean-up of the oil spills and does not suffer from the problem of having local minima, which is commonly encountered in potential-field-based methods. The efficacy of the algorithm is tested on a high-fidelity player/stage simulator for oil spill cleaning in a harbour, where the underlying oil weathering process is modelled as 2D random-walk particle tracking. A preliminary version of this paper was presented by X. Jin and A. Ray as 'Coverage Control of Autonomous Vehicles for Oil Spill Cleaning in Dynamic and Uncertain Environments', Proceedings of the American Control Conference, Washington, DC, June 2013, pp. 2600-2605.

  18. Incorporating a Wheeled Vehicle Model in a New Monocular Visual Odometry Algorithm for Dynamic Outdoor Environments

    Directory of Open Access Journals (Sweden)

    Yanhua Jiang

    2014-09-01

    Full Text Available This paper presents a monocular visual odometry algorithm that incorporates a wheeled vehicle model for ground vehicles. The main innovation of this algorithm is to use the single-track bicycle model to interpret the relationship between the yaw rate and side slip angle, which are the two most important parameters that describe the motion of a wheeled vehicle. Additionally, the pitch angle is also considered since the planar-motion hypothesis often fails due to the dynamic characteristics of wheel suspensions and tires in real-world environments. Linearization is used to calculate a closed-form solution of the motion parameters that works as a hypothesis generator in a RAndom SAmple Consensus (RANSAC scheme to reduce the complexity in solving equations involving trigonometric. All inliers found are used to refine the winner solution through minimizing the reprojection error. Finally, the algorithm is applied to real-time on-board visual localization applications. Its performance is evaluated by comparing against the state-of-the-art monocular visual odometry methods using both synthetic data and publicly available datasets over several kilometers in dynamic outdoor environments.

  19. Analysis of the Dynamic Response in the Railway Vehicles to the Track Vertical Irregularities. Part I: The Theoretical Model and the Vehicle Response Functions

    Directory of Open Access Journals (Sweden)

    M. Dumitriu

    2015-11-01

    Full Text Available The paper herein focuses on the dynamic response of a two-bogie vehicle to the excitations derived from the track vertical irregularities. The symmetrical and antisymmetrical modes due from the bounce and pitch motions of the axles’ planes in the two bogies are being considered. The analysis of the dynamic response in the vehicle relies on the response functions in three reference points of the carbody, composed by means of these response functions to the symmetrical and antisymmetrical excitation modes. Similarly, the dynamic response of the vehicle to the track stochastic irregularities is examined and expressed as a power spectral density of the carbody vertical acceleration and the root mean square of the acceleration and the index of the partial comfort to the vertical vibrations is calculated. The paper is structured into two parts. The Part I includes all the theoretical elements required for the analysis of the dynamic response in the vehicle, while Part II introduces the results of the numerical analysis.

  20. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification.

    Science.gov (United States)

    Vikeved, Elisabet; Backlund, Anders; Alsmark, Cecilia

    2016-01-01

    The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT). Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania. To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species. LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets.

  1. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification.

    Directory of Open Access Journals (Sweden)

    Elisabet Vikeved

    2016-01-01

    Full Text Available The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT. Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania.To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species.LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets.

  2. The Dynamics of Lateral Gene Transfer in Genus Leishmania - A Route for Adaptation and Species Diversification

    Science.gov (United States)

    Vikeved, Elisabet; Backlund, Anders; Alsmark, Cecilia

    2016-01-01

    Background The genome of Leishmania major harbours a comparably high proportion of genes of prokaryote origin, acquired by lateral gene transfer (LGT). Some of these are present in closely related trypanosomatids, while some are detected in Leishmania only. We have evaluated the impact and destiny of LGT in genus Leishmania. Methodology/Principal Findings To study the dynamics and fate of LGTs we have performed phylogenetic, as well as nucleotide and amino acid composition analyses within orthologous groups of LGTs detected in Leishmania. A set of universal trypanosomatid LGTs was added as a reference group. Both groups of LGTs have, to some extent, ameliorated to resemble the recipient genomes. However, while virtually all of the universal trypanosomatid LGTs are distributed and conserved in the entire genus Leishmania, the LGTs uniquely present in genus Leishmania are more prone to gene loss and display faster rates of evolution. Furthermore, a PCR based approach has been employed to ascertain the presence of a set of twenty LGTs uniquely present in genus Leishmania, and three universal trypanosomatid LGTs, in ten additional strains of Leishmania. Evolutionary rates and predicted expression levels of these LGTs have also been estimated. Ten of the twenty LGTs are distributed and conserved in all species investigated, while the remainder have been subjected to modifications, or undergone pseudogenization, degradation or loss in one or more species. Conclusions/Significance LGTs unique to the genus Leishmania have been acquired after the divergence of Leishmania from the other trypanosomatids, and are evolving faster than their recipient genomes. This implies that LGT in genus Leishmania is a continuous and dynamic process contributing to species differentiation and speciation. This study also highlights the importance of carefully evaluating these dynamic genes, e.g. as LGTs have been suggested as potential drug targets. PMID:26730948

  3. Dynamics of the Uranian and Saturnian satellite systems - a chaotic route to melting Miranda?

    International Nuclear Information System (INIS)

    Dermott, S.F.; Malhotra, R.B; Murray, C.D.

    1988-01-01

    Miranda's anomalously large inclination, in conjunction with the postaccretional resurfacing of both Miranda and Ariel and anomalously large eccentricities characterizing the inner Uranian satellites, are presently held to suggest the disruption of resonant configurations that once existed in this satellite system. Classical analytical methods for the dynamics of resonance are here used to demonstrate how temporary capture into a second- or higher-order resonance can generate large increases in eccentricity and inclination on comparatively short time-scales. Such capture into resonance may result in chaotic motion. 66 references

  4. Dynamic Modeling and Simulation on a Hybrid Power System for Electric Vehicle Applications

    Directory of Open Access Journals (Sweden)

    Hong-Wen He

    2010-11-01

    Full Text Available Hybrid power systems, formed by combining high-energy-density batteries and high-power-density ultracapacitors in appropriate ways, provide high-performance and high-efficiency power systems for electric vehicle applications. This paper first establishes dynamic models for the ultracapacitor, the battery and a passive hybrid power system, and then based on the dynamic models a comparative simulation between a battery only power system and the proposed hybrid power system was done under the UDDS (Urban Dynamometer Driving Schedule. The simulation results showed that the hybrid power system could greatly optimize and improve the efficiency of the batteries and their dynamic current was also decreased due to the participation of the ultracapacitors, which would have a good influence on batteries’ cycle life. Finally, the parameter matching for the passive hybrid power system was studied by simulation and comparisons.

  5. Nonlinear Dynamic Modeling of a Fixed-Wing Unmanned Aerial Vehicle: a Case Study of Wulung

    Directory of Open Access Journals (Sweden)

    Fadjar Rahino Triputra

    2015-07-01

    Full Text Available Developing a nonlinear adaptive control system for a fixed-wing unmanned aerial vehicle (UAV requires a mathematical representation of the system dynamics analytically as a set of differential equations in the form of a strict-feedback systems. This paper presents a method for modeling a nonlinear flight dynamics of the fixed-wing UAV of BPPT Wulung in any conditions of the flight altitude and airspeed for the first step into designing a nonlinear adaptive controller. The model was formed into 10-DOF differential equations in the form of strict-feedback systems which separates the terms of elevator, aileron, rudder and throttle from the model. The model simulation results show the behavior of the flight dynamics of the Wulung UAV and also prove the compliance with the actual flight test results.

  6. Sliding Mode Control for Mass Moment Aerospace Vehicles Using Dynamic Inversion Approach

    Directory of Open Access Journals (Sweden)

    Xiao-Yu Zhang

    2013-01-01

    Full Text Available The moving mass actuation technique offers significant advantages over conventional aerodynamic control surfaces and reaction control systems, because the actuators are contained entirely within the airframe geometrical envelope. Modeling, control, and simulation of Mass Moment Aerospace Vehicles (MMAV utilizing moving mass actuators are discussed. Dynamics of the MMAV are separated into two parts on the basis of the two time-scale separation theory: the dynamics of fast state and the dynamics of slow state. And then, in order to restrain the system chattering and keep the track performance of the system by considering aerodynamic parameter perturbation, the flight control system is designed for the two subsystems, respectively, utilizing fuzzy sliding mode control approach. The simulation results describe the effectiveness of the proposed autopilot design approach. Meanwhile, the chattering phenomenon that frequently appears in the conventional variable structure systems is also eliminated without deteriorating the system robustness.

  7. Dynamic Forces between the Rails and the Wheels of Railway Vehicle

    Directory of Open Access Journals (Sweden)

    Zdravko Peran

    2016-02-01

    Full Text Available The process of acquisition of the measured dynamic values of forces between the rails and the wheels on the real measurement train and the train tracks. The conversion of the measured values into the matrices and vectors enables numerous exact qualitative and quantitative studies of the dynamic phenomena behaviour. The paper shows the possibilities of using MATLAB computer tool. All the commands in the software are given and explained. Calculating of the empirical, normal and cumulative distribution on an example of the lateral force is given in detail. The new software is exactly verified mathematically and qualified for any further use. The developed software is the tool for the development of other two phases: software for the exact automatic evaluation of the maximum values of the dynamic values and software for the automatic approval of vehicles and railway due to the driving safety, loading tracks and driving comfort compared to the limited values regarding UI C CODE 518.

  8. Air-Breathing Hypersonic Vehicle Tracking Control Based on Adaptive Dynamic Programming.

    Science.gov (United States)

    Mu, Chaoxu; Ni, Zhen; Sun, Changyin; He, Haibo

    2017-03-01

    In this paper, we propose a data-driven supplementary control approach with adaptive learning capability for air-breathing hypersonic vehicle tracking control based on action-dependent heuristic dynamic programming (ADHDP). The control action is generated by the combination of sliding mode control (SMC) and the ADHDP controller to track the desired velocity and the desired altitude. In particular, the ADHDP controller observes the differences between the actual velocity/altitude and the desired velocity/altitude, and then provides a supplementary control action accordingly. The ADHDP controller does not rely on the accurate mathematical model function and is data driven. Meanwhile, it is capable to adjust its parameters online over time under various working conditions, which is very suitable for hypersonic vehicle system with parameter uncertainties and disturbances. We verify the adaptive supplementary control approach versus the traditional SMC in the cruising flight, and provide three simulation studies to illustrate the improved performance with the proposed approach.

  9. Dynamic modelling of a De Nora fuel cell intended for the electric vehicle

    International Nuclear Information System (INIS)

    Poirot-Crouvezier, J.-P.; Baurens, P.; Levrard, D.

    2000-01-01

    Recent progress in fuel cells (proton membrane exchange) has gained interest in the electricity generation in particular for electric vehicles. So far the vehicles demonstrate the feasibility of the technique. After a limited number of demonstrations, the energy source will be indispensable. In general, one cannot speak about a single cell, but a stacking of cells. The system must be able to be supplied with reactants, evacuate products, and produce heat and usable electricity. A fuel cell is inevitably a system of many components that interact with one another. The overall operation of the assembly depends on the associated sub-systems. In the case of the application to automobiles, the driving behaviour must be analysed to ensure the system function can be simulated to obtain the correct characteristics. For instance, an essential study would be the dynamic function of successive accelerations and decelerations

  10. Influence of Housing Wall Compliance on Shock Absorbers in the Context of Vehicle Dynamics

    Science.gov (United States)

    Pulvirenti, G.; Faria, C.

    2017-10-01

    Shock absorbers play a key role in vehicle dynamics. Researchers have spent significant effort in order to understand phenomena associated with this component, but there are still several issues to address, in part because new technology development and design trends continually lead to new challenges, among which weight reduction is crucial. For shock absorbers, weight reduction is related to the use of new materials (e.g. composite) or new design paradigms (e.g. more complex geometry, wall thickness, etc.). All of them are directly linked to wall compliance values higher than the actual ones. The present article proposes a first analysis of the phenomena introduced by a high wall compliance, through a modelling approach and various simulations in order to understand the vehicle behaviour changes. It is shown that high values of wall compliance lead to increased hysteresis in the force-velocity curve. However, comfort, handling and ride performances are not significantly affected by this designing parameter.

  11. Prediction of dynamics of bellows in exhaust system of vehicle using equivalent beam modeling

    Energy Technology Data Exchange (ETDEWEB)

    Hong, Jin Ho; Kim, Yong Dae; Lee, Nam Young; Lee, Sang Woo [Noise and vibration CAE Team, Hyundai Motor Company, Ulsan (Korea, Republic of)

    2015-11-15

    The exhaust system is one of the major sources of vibrations, along with the suspension system and engine. When the exhaust system is connected directly to the engine, it transfers vibrations to the vehicle body through the body mounts. Therefore, in order to reduce the vibrations transmitted from the exhaust system, the vibration characteristics of the exhaust system should be predicted. Thus, the dynamic characteristics of the bellows, which form a key component of the exhaust system, must be modeled accurately. However, it is difficult to model the bellows because of the complicated geometry. Though the equivalent beam modeling technique has been applied in the design stage, it is not sufficiently accurate in the case of the bellows which have complicated geometries. In this paper, we present an improved technique for modeling the bellows in a vehicle. The accuracy of the modeling method is verified by comparison with the experimental results.

  12. Towards transparent all-optical label-swapped networks: 40 Gbit/s ultra-fast dynamic wavelength routing using integrated devices

    DEFF Research Database (Denmark)

    Seoane, Jorge; Holm-Nielsen, Pablo Villanueva; Jeppesen, Palle

    2006-01-01

    All-optical routing of 40 Gbit/s 1.6 ns packets is demonstrated employing integrated devices based on SOA-MZIs. The scheme allows wavelength transparent operation and sub-nanosecond dynamic wavelength selection for future packet/label switched networks....

  13. A tri-objective, dynamic weapon assignment model for surface ...

    African Journals Online (AJOL)

    2015-05-11

    May 11, 2015 ... metaheuristic for solving the vehicle routing problem with time .... them the dynamic programming formulation by Bradford [3] in 1961, the nonlinear pro- ..... The concept of multi-objective optimisation naturally gives rise to the ...

  14. Rail vehicle dynamic response to a nonlinear physical 'in-service' model of its secondary suspension hydraulic dampers

    Science.gov (United States)

    Wang, W. L.; Zhou, Z. R.; Yu, D. S.; Qin, Q. H.; Iwnicki, S.

    2017-10-01

    A full nonlinear physical 'in-service' model was built for a rail vehicle secondary suspension hydraulic damper with shim-pack-type valves. In the modelling process, a shim pack deflection theory with an equivalent-pressure correction factor was proposed, and a Finite Element Analysis (FEA) approach was applied. Bench test results validated the damper model over its full velocity range and thus also proved that the proposed shim pack deflection theory and the FEA-based parameter identification approach are effective. The validated full damper model was subsequently incorporated into a detailed vehicle dynamics simulation to study how its key in-service parameter variations influence the secondary-suspension-related vehicle system dynamics. The obtained nonlinear physical in-service damper model and the vehicle dynamic response characteristics in this study could be used in the product design optimization and nonlinear optimal specifications of high-speed rail hydraulic dampers.

  15. 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.

  16. 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.

  17. Predictive display design for the vehicles with time delay in dynamic response

    Science.gov (United States)

    Efremov, A. V.; Tiaglik, M. S.; Irgaleev, I. H.; Efremov, E. V.

    2018-02-01

    The two ways for the improvement of flying qualities are considered: the predictive display (PD) and the predictive display integrated with the flight control system (FCS). The both ways allow to transforming the controlled element dynamics in the crossover frequency range, to improve the accuracy of tracking and to suppress the effect of time delay in the vehicle response too. The technique for optimization of the predictive law is applied to the landing task. The results of the mathematical modeling and experimental investigations carried out for this task are considered in the paper.

  18. A Dynamic Behaviour Analysis on the Frequency Control Capability of Electric Vehicles

    DEFF Research Database (Denmark)

    Zarogiannis, Athanasios; Marinelli, Mattia; Træholt, Chresten

    2014-01-01

    The paper presents results of a study on the dynamic response of Electric Vehicle’s (EV) when participating in frequency control of an islanded system. The following cases were considered: when there is no EV performing frequency control, when the EV participates in primary frequency control...... and when the EV participates in both primary and secondary frequency control. Different parameters are tested in various combinations, and their influence on frequency deviation as well as power and energy provided by the EV with vehicle-to-grid (V2G) capability is shown....

  19. Performance Improvement of Inertial Navigation System by Using Magnetometer with Vehicle Dynamic Constraints

    Directory of Open Access Journals (Sweden)

    Daehee Won

    2015-01-01

    Full Text Available A navigation algorithm is proposed to increase the inertial navigation performance of a ground vehicle using magnetic measurements and dynamic constraints. The navigation solutions are estimated based on inertial measurements such as acceleration and angular velocity measurements. To improve the inertial navigation performance, a three-axis magnetometer is used to provide the heading angle, and nonholonomic constraints (NHCs are introduced to increase the correlation between the velocity and the attitude equation. The NHCs provide a velocity feedback to the attitude, which makes the navigation solution more robust. Additionally, an acceleration-based roll and pitch estimation is applied to decrease the drift when the acceleration is within certain boundaries. The magnetometer and NHCs are combined with an extended Kalman filter. An experimental test was conducted to verify the proposed method, and a comprehensive analysis of the performance in terms of the position, velocity, and attitude showed that the navigation performance could be improved by using the magnetometer and NHCs. Moreover, the proposed method could improve the estimation performance for the position, velocity, and attitude without any additional hardware except an inertial sensor and magnetometer. Therefore, this method would be effective for ground vehicles, indoor navigation, mobile robots, vehicle navigation in urban canyons, or navigation in any global navigation satellite system-denied environment.

  20. A study on the role of powertrain system dynamics on vehicle driveability

    Science.gov (United States)

    Castellazzi, Luca; Tonoli, Andrea; Amati, Nicola; Galliera, Enrico

    2017-07-01

    Vehicle driveability describes the complex interactions between the driver and the vehicle, mainly related to longitudinal vibrations. Today, a relevant part of the driveability process optimisation is realised by means of track tests, which require a considerable effort due to the number of parameters (such as stiffness and damping components) affecting this behaviour. The drawback of this approach is that it is carried on at a stage when a design iteration becomes very expensive in terms of time and cost. The objective of this work is to propose a light and accurate tool to represent the relevant quantities involved in the driveability analysis, and to understand which are the main vehicle parameters that influence the torsional vibrations transmitted to the driver. Particular attention is devoted to the role of the tyre, the engine mount, the dual mass flywheel and their possible interactions. The presented nonlinear dynamic model has been validated in time and frequency domain and, through linearisation of its nonlinear components, allows to exploit modal and energy analysis. Objective indexes regarding the driving comfort are additionally considered in order to evaluate possible driveability improvements related to the sensitivity of powertrain parameters.