WorldWideScience

Sample records for multi-period vehicle routing

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

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

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

  4. A new hybrid GA-PSO method for solving multi-period inventory routing problem with considering financial decisions

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2013-09-01

    Full Text Available Integration of various logistical components in supply chain management, such as transportation, inventory control and facility location are becoming common practice to avoid sub-optimization in nowadays’ competitive environment. The integration of transportation and inventory decisions is known as inventory routing problem (IRP in the literature. The problem aims to determine the delivery quantity for each customer and the network routes to be used in each period, so that the total inventory and transportation costs are to be minimized. On the contrary of conventional IRP that each retailer can only provide its demand from the supplier, in this paper, a new multi-period, multi-item IRP model with considering lateral trans-shipment, back-log and financial decisions is proposed as a business model in a distinct organization. The main purpose of this paper is applying an applicable inventory routing model with considering real world setting and solving it with an appropriate method.

  5. New mathematical modeling for a location-routing-inventory problem in a multi-period closed-loop supply chain in a car industry

    Science.gov (United States)

    Forouzanfar, F.; Tavakkoli-Moghaddam, R.; Bashiri, M.; Baboli, A.; Hadji Molana, S. M.

    2017-11-01

    This paper studies a location-routing-inventory problem in a multi-period closed-loop supply chain with multiple suppliers, producers, distribution centers, customers, collection centers, recovery, and recycling centers. In this supply chain, centers are multiple levels, a price increase factor is considered for operational costs at centers, inventory and shortage (including lost sales and backlog) are allowed at production centers, arrival time of vehicles of each plant to its dedicated distribution centers and also departure from them are considered, in such a way that the sum of system costs and the sum of maximum time at each level should be minimized. The aforementioned problem is formulated in the form of a bi-objective nonlinear integer programming model. Due to the NP-hard nature of the problem, two meta-heuristics, namely, non-dominated sorting genetic algorithm (NSGA-II) and multi-objective particle swarm optimization (MOPSO), are used in large sizes. In addition, a Taguchi method is used to set the parameters of these algorithms to enhance their performance. To evaluate the efficiency of the proposed algorithms, the results for small-sized problems are compared with the results of the ɛ-constraint method. Finally, four measuring metrics, namely, the number of Pareto solutions, mean ideal distance, spacing metric, and quality metric, are used to compare NSGA-II and MOPSO.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  3. Multi-Period Optimization Model for Electricity Generation Planning Considering Plug-in Hybrid Electric Vehicle Penetration

    Directory of Open Access Journals (Sweden)

    Lena Ahmadi

    2015-05-01

    Full Text Available One of the main challenges for widespread penetration of plug-in hybrid electric vehicles (PHEVs is their impact on the electricity grid. The energy sector must anticipate and prepare for this extra demand and implement long-term planning for electricity production. In this paper, the additional electricity demand on the Ontario electricity grid from charging PHEVs is incorporated into an electricity production planning model. A case study pertaining to Ontario energy planning is considered to optimize the value of the cost of the electricity over sixteen years (2014–2030. The objective function consists of the fuel costs, fixed and variable operating and maintenance costs, capital costs for new power plants, and the retrofit costs of existing power plants. Five different case studies are performed with different PHEVs penetration rates, types of new power plants, and CO2 emission constraints. Among all the cases studied, the one requiring the most new capacity, (~8748 MW, is assuming the base case with 6% reduction in CO2 in year 2018 and high PHEV penetration. The next highest one is the base case, plus considering doubled NG prices, PHEV medium penetration rate and no CO2 emissions reduction target with an increase of 34.78% in the total installed capacity in 2030. Furthermore, optimization results indicate that by not utilizing coal power stations the CO2 emissions are the lowest: ~500 tonnes compared to ~900 tonnes when coal is permitted.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  19. Multi-periodic nanostructures for photon control

    DEFF Research Database (Denmark)

    Kluge, Christian; Adam, Jost; Barié, Nicole

    2014-01-01

    We propose multi-periodic nanostructures yielded by superposition of multiple binary gratings for wide control over photon emission in thin-film devices. We present wavelength- and angle-resolved photoluminescence measurements of multi-periodically nanostructured organic light-emitting layers...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  9. Multi-Period Trading via Convex Optimization

    DEFF Research Database (Denmark)

    Boyd, Stephen; Busseti, Enzo; Diamond, Steve

    2017-01-01

    We consider a basic model of multi-period trading, which can be used to evaluate the performance of a trading strategy. We describe a framework for single-period optimization, where the trades in each period are found by solving a convex optimization problem that trades off expected return, risk......, transaction cost and holding cost such as the borrowing cost for shorting assets. We then describe a multi-period version of the trading method, where optimization is used to plan a sequence of trades, with only the first one executed, using estimates of future quantities that are unknown when the trades....... In this paper, we do not address a critical component in a trading algorithm, the predictions or forecasts of future quantities. The methods we describe in this paper can be thought of as good ways to exploit predictions, no matter how they are made. We have also developed a companion open-source software...

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  16. An inventory location routing model with environmental considerations

    Directory of Open Access Journals (Sweden)

    Lerhlaly Sanaa

    2017-01-01

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  10. Energy integration on multi-periods and multi-usages for hybrid electric and thermal powertrains

    International Nuclear Information System (INIS)

    Dimitrova, Zlatina; Maréchal, François

    2015-01-01

    The improvement of the efficiency of vehicle energy systems promotes an active search to find innovative solutions during the design process. This requires more accurate modeling of complex systems, which offers new ways to improve the design efficiency of energy systems. The vehicle is a highly dynamic system. The size and the efficiency of the convertors are dependent on the dynamic driving profile. In order to increase the energy efficiency, using energy integration techniques, an adapted methodology is required to choose the best points for the integrated system design. The idea is to clusterize the dynamic profile on typical multi-periods of the vehicle use. The energy system design is then optimized for these typical multi-periods. In this article a new methodology is applied on hybrid electric vehicles, in order to define the energy integrated powertrain configuration of the vehicle. The energy recovery potential of a single stage Organic Rankine Cycle for a thermal engine in combination with a hybrid electric powertrain is assessed for different drive cycles profiles and comfort situations. After the energy integration, a multi-objective optimization is applied to define the optimal design of a hybrid electric vehicle with a waste heat recovery system. - Highlights: • K-means algorithm transforms the dynamic driving profile on static multi-periods. • The clusters represent the typical powertrain use and size the heat recovery utility. • The maximal heat recovery potential on thermal powertrains is 11% for urban driving. • The maximal heat recovery potential on hybrid electric powertrains is 5%. • Engine downsizing increases heat recovery potential on hybrid electric powertrains

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

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

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

  14. MULTI PERIOD SHOCKS ROLES ON GOVERNMENT SPENDING IN INDONESIA

    Directory of Open Access Journals (Sweden)

    Jaka Sriyana

    2011-09-01

    Full Text Available This paper proposes an alternative dynamic model of government spending in Indonesia. The model is based on short term disequilibrium assumption, in which multi period of shocks variables may play an important role. This research applies a loss function approach and uses optimum shock variables as the determinant for government spending during 1970-2010. The result shows that real GDP, population, and multi period shock of government spending are statistically significant. It provides evidence of the impact of multi period shocks to the realization of government spending. It implies that government faces a serious disequilibrium in determining their spending both in short and long terms.Keywords: Fiscal, government spending, deficit budget, shockJEL classification numbers: H53, H62, C22

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

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

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

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

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

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

  1. Multi-period risk sharing under financial fairness

    NARCIS (Netherlands)

    Bao, Hailong; Ponds, Eduard; Schumacher, Hans

    We work with a multi-period system where a finite number of agents need to share multiple monetary risks. We look for the solutions that are both Pareto efficient utility-wise and financially fair value-wise. A buffer enables the inter-temporal capital transfer. Expected utility is used to evaluate

  2. Multi-Period Risk Sharing under Financial Fairness

    NARCIS (Netherlands)

    Bao, Hailong; Ponds, Eduard; Schumacher, Hans

    2015-01-01

    We work with a multi-period system where a finite number of agents need to share multiple monetary risks. We look for the solutions that are both Pareto efficient utility-wise and financially fair value-wise. A buffer enables the inter-temporal capital transfer. Expected utility is used to evaluate

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  8. Credibilistic multi-period portfolio optimization based on scenario tree

    Science.gov (United States)

    Mohebbi, Negin; Najafi, Amir Abbas

    2018-02-01

    In this paper, we consider a multi-period fuzzy portfolio optimization model with considering transaction costs and the possibility of risk-free investment. We formulate a bi-objective mean-VaR portfolio selection model based on the integration of fuzzy credibility theory and scenario tree in order to dealing with the markets uncertainty. The scenario tree is also a proper method for modeling multi-period portfolio problems since the length and continuity of their horizon. We take the return and risk as well cardinality, threshold, class, and liquidity constraints into consideration for further compliance of the model with reality. Then, an interactive dynamic programming method, which is based on a two-phase fuzzy interactive approach, is employed to solve the proposed model. In order to verify the proposed model, we present an empirical application in NYSE under different circumstances. The results show that the consideration of data uncertainty and other real-world assumptions lead to more practical and efficient solutions.

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

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

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

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

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

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

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

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

  17. Multi-Period Portfolio Optimization of Power Generation Assets

    Directory of Open Access Journals (Sweden)

    Barbara Glensk

    2013-01-01

    Full Text Available The liberalization and deregulation of the energy industry in the past decades have been significantly affected by changes in the strategies of energy firms. The traditionally used approach of cost minimization was no longer sufficient, risk and market behavior could no longer be ignored and the need for more appropriate optimization methods for uncertain environments was increased. Meanvariance portfolio (MVP theory is one of the more advanced financial methods that has been successfully applied to the energy sector. Unfortunately, this static approach is inadequate for studying multi-stage investment decision problems. The methodology proposed in this paper considering power generation assets is based on the model introduced by Mulvey, who suggests a reallocation approach using the analysis of various scenarios. The adoption of this methodology to power generation assets allows us to capture the impact of variations in the economic and technical parameters considered. The results of our study show that the application of a model for selection of multi-period portfolio can indeed improve the decision making process. Especially for the case of adding new investments to the portfolio mix, this rebalancing model captures new entries very well. (original abstract

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

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

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

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

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

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

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

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

  6. Multi-Periodic Photonic Hyper-Crystals: Volume Plasmon Polaritons and the Purcell Effect

    DEFF Research Database (Denmark)

    Babicheva, Viktoriia; Iorsh, I. V.; Orlov, A. A.

    2014-01-01

    We theoretically demonstrate superior degree of control over volume plasmon polariton propagation and the Purcell effect in multi-period (4-layer unit cell) plasmonic multilayers, which can be viewed as multiscale hyperbolic metamaterials or multi-periodic photonic hyper-crystals. © 2014 OSA....

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

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

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

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

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

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

  13. A class of multi-period semi-variance portfolio for petroleum exploration and development

    Science.gov (United States)

    Guo, Qiulin; Li, Jianzhong; Zou, Caineng; Guo, Yujuan; Yan, Wei

    2012-10-01

    Variance is substituted by semi-variance in Markowitz's portfolio selection model. For dynamic valuation on exploration and development projects, one period portfolio selection is extended to multi-period. In this article, a class of multi-period semi-variance exploration and development portfolio model is formulated originally. Besides, a hybrid genetic algorithm, which makes use of the position displacement strategy of the particle swarm optimiser as a mutation operation, is applied to solve the multi-period semi-variance model. For this class of portfolio model, numerical results show that the mode is effective and feasible.

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

  15. Multi-Periodic Photonic Crystal Out-Coupling Layers for Flexible OLEDs

    DEFF Research Database (Denmark)

    Kluge, Christian; Pradana, Arfat; Adam, Jost

    2014-01-01

    Waveguide mode extraction with multi-periodic photonic crystals is studied in experiment and finite-difference time-domain (FDTD) simulations. Flexible nanostructured organic light-emitting diodes (OLEDs) are fabricated by UV nanoimprint lithography.......Waveguide mode extraction with multi-periodic photonic crystals is studied in experiment and finite-difference time-domain (FDTD) simulations. Flexible nanostructured organic light-emitting diodes (OLEDs) are fabricated by UV nanoimprint lithography....

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

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

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

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

  1. Coexisting chaotic and multi-periodic dynamics in a model of cardiac alternans

    Energy Technology Data Exchange (ETDEWEB)

    Skardal, Per Sebastian, E-mail: skardals@gmail.com [Departament d' Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, 43007 Tarragona (Spain); Restrepo, Juan G., E-mail: juanga@colorado.edu [Department of Applied Mathematics, University of Colorado, Boulder, Colorado 80309 (United States)

    2014-12-15

    The spatiotemporal dynamics of cardiac tissue is an active area of research for biologists, physicists, and mathematicians. Of particular interest is the study of period-doubling bifurcations and chaos due to their link with cardiac arrhythmogenesis. In this paper, we study the spatiotemporal dynamics of a recently developed model for calcium-driven alternans in a one dimensional cable of tissue. In particular, we observe in the cable coexistence of regions with chaotic and multi-periodic dynamics over wide ranges of parameters. We study these dynamics using global and local Lyapunov exponents and spatial trajectory correlations. Interestingly, near nodes—or phase reversals—low-periodic dynamics prevail, while away from the nodes, the dynamics tend to be higher-periodic and eventually chaotic. Finally, we show that similar coexisting multi-periodic and chaotic dynamics can also be observed in a detailed ionic model.

  2. Abatement Costs vs. Compliance Costs in Multi-Period Emissions Trading - The Firms' Perspective

    OpenAIRE

    Bode, Sven

    2003-01-01

    Greenhouse gas emission trading has become more and more important in the context of climate change. Recently, a discussion on trading on entity (i.e. company) level has started. Emitters likely to be obliged to participate have argued for an initial allocation of the emission rights free of charge. I analyse the implication of such an allocation based on historical emissions and on benchmarks in multi-period emission trading. Different allocation rules for successive periods are applied, nam...

  3. Promoting Affordability in Defense Acquisitions: A Multi-Period Portfolio Approach

    Science.gov (United States)

    2014-04-30

    has evolved out of many areas of research, ranging from economics to modern control theory (Powell, 2011). The general form of a dynamic programming...states 5 School of Aeronautics & Astronautics A Portfolio Approach: Background • Balance expected profit (performance) against risk ( variance ) in...investments (Markowitz 1952) • Efficiency frontier of optimal portfolios given investor risk averseness • Extends to multi-period case with various

  4. The Probability of Default Under IFRS 9: Multi-period Estimation and Macroeconomic Forecast

    Directory of Open Access Journals (Sweden)

    Tomáš Vaněk

    2017-01-01

    Full Text Available In this paper we propose a straightforward, flexible and intuitive computational framework for the multi-period probability of default estimation incorporating macroeconomic forecasts. The concept is based on Markov models, the estimated economic adjustment coefficient and the official economic forecasts of the Czech National Bank. The economic forecasts are taken into account in a separate step to better distinguish between idiosyncratic and systemic risk. This approach is also attractive from the interpretational point of view. The proposed framework can be used especially when calculating lifetime expected credit losses under IFRS 9.

  5. On the Relation between Tax Rates and Evasion in a Multi-period Economy

    OpenAIRE

    Jordi Caball?Author-Email:; Judith Panad?

    2001-01-01

    We extend the basic tax evasion model to a multi-period economy exhibiting sustained growth. When individuals conceal part of their true income from the tax authority, they face the risk of being audited and hence of paying the corresponding fine. Both taxes and fines determine individual saving and the rate of capital accumulation. In this context we show that the sign of the relation between the level of the tax rate and the amount of evaded income is the same as that obtained in static set...

  6. Tax Rates, Tax Evasion, and Growth in a Multi-period Economy

    OpenAIRE

    Jordi Caballé; Judith Panadés

    2007-01-01

    We extend the basic tax evasion model to a multi-period economy exhibiting sustained growth. When individuals conceal part of their true income from the tax authority, they face the risk of being audited and hence of paying the corresponding fine. Both taxes and fines determine individual saving and the rate of capital accumulation. We show that, if the penalty imposed on tax evaders is proportional to the amount of evaded taxes, then the growth rate is decreasing in the tax rate. However, th...

  7. On the relation between tax rates and evasion in a multi-period economy

    OpenAIRE

    Caballé, Jordi

    2006-01-01

    We extend the basic tax evasion model to a multi-period economy exhibiting sustained growth. When individuals conceal part of their true income from the tax authority, they face the risk of being audited and hence of paying the corresponding fine. Both taxes and fines determine individual saving and the rate of capital accumulation. In this context we show that the sign of the relation between the level of the tax rate and the amount of evaded income is the same as that obtained in static set...

  8. Dynamic supply chain network design with capacity planning and multi-period pricing

    DEFF Research Database (Denmark)

    Fattahi, Mohammad; Mahootchi, Masoud; Govindan, Kannan

    2015-01-01

    This paper addresses a new problem in designing and planning a multi-echelon and multi-product supply chain network over a multi-period horizon in which customer zones have price-sensitive demands. Based on price-demand relationships, a generic method is presented to obtain price levels...... for products and then, a mixed-integer linear programming model is developed. Due to the problem intractability, a simulated annealing algorithm that uses some developed linear relaxation-based heuristics for capacity planning and pricing is presented. Numerical results demonstrate the significance...

  9. Using genetic algorithm to solve a new multi-period stochastic optimization model

    Science.gov (United States)

    Zhang, Xin-Li; Zhang, Ke-Cun

    2009-09-01

    This paper presents a new asset allocation model based on the CVaR risk measure and transaction costs. Institutional investors manage their strategic asset mix over time to achieve favorable returns subject to various uncertainties, policy and legal constraints, and other requirements. One may use a multi-period portfolio optimization model in order to determine an optimal asset mix. Recently, an alternative stochastic programming model with simulated paths was proposed by Hibiki [N. Hibiki, A hybrid simulation/tree multi-period stochastic programming model for optimal asset allocation, in: H. Takahashi, (Ed.) The Japanese Association of Financial Econometrics and Engineering, JAFFE Journal (2001) 89-119 (in Japanese); N. Hibiki A hybrid simulation/tree stochastic optimization model for dynamic asset allocation, in: B. Scherer (Ed.), Asset and Liability Management Tools: A Handbook for Best Practice, Risk Books, 2003, pp. 269-294], which was called a hybrid model. However, the transaction costs weren't considered in that paper. In this paper, we improve Hibiki's model in the following aspects: (1) The risk measure CVaR is introduced to control the wealth loss risk while maximizing the expected utility; (2) Typical market imperfections such as short sale constraints, proportional transaction costs are considered simultaneously. (3) Applying a genetic algorithm to solve the resulting model is discussed in detail. Numerical results show the suitability and feasibility of our methodology.

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

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

  13. Beliefs and social behavior in a multi-period ultimatum game

    Science.gov (United States)

    Azar, Ofer H.; Lahav, Yaron; Voslinsky, Alisa

    2015-01-01

    We conduct a multi-period ultimatum game in which we elicit players' beliefs. Responders do not predict accurately the amount that will be offered to them, and do not get better in their predictions over time. At the individual level we see some effect of the mistake in expectations in the previous period on the responder's expectation about the offer in the current period, but this effect is relatively small. The proposers' beliefs about the minimum amount that responders will accept is significantly higher than the minimum amount responders believe will be accepted by other responders. The proposer's belief about the minimal acceptable offer does not change following a rejection. Nevertheless, the proposer's offer in the next period does increase following a rejection. The probability of rejection increases when the responder has higher expectations about the amount that will be offered to him or higher beliefs about the minimal amount that other responders will accept. PMID:25762909

  14. Multi-period equilibrium/near-equilibrium in electricity markets based on locational marginal prices

    Science.gov (United States)

    Garcia Bertrand, Raquel

    In this dissertation we propose an equilibrium procedure that coordinates the point of view of every market agent resulting in an equilibrium that simultaneously maximizes the independent objective of every market agent and satisfies network constraints. Therefore, the activities of the generating companies, consumers and an independent system operator are modeled: (1) The generating companies seek to maximize profits by specifying hourly step functions of productions and minimum selling prices, and bounds on productions. (2) The goals of the consumers are to maximize their economic utilities by specifying hourly step functions of demands and maximum buying prices, and bounds on demands. (3) The independent system operator then clears the market taking into account consistency conditions as well as capacity and line losses so as to achieve maximum social welfare. Then, we approach this equilibrium problem using complementarity theory in order to have the capability of imposing constraints on dual variables, i.e., on prices, such as minimum profit conditions for the generating units or maximum cost conditions for the consumers. In this way, given the form of the individual optimization problems, the Karush-Kuhn-Tucker conditions for the generating companies, the consumers and the independent system operator are both necessary and sufficient. The simultaneous solution to all these conditions constitutes a mixed linear complementarity problem. We include minimum profit constraints imposed by the units in the market equilibrium model. These constraints are added as additional constraints to the equivalent quadratic programming problem of the mixed linear complementarity problem previously described. For the sake of clarity, the proposed equilibrium or near-equilibrium is first developed for the particular case considering only one time period. Afterwards, we consider an equilibrium or near-equilibrium applied to a multi-period framework. This model embodies binary

  15. Multi-period natural gas market modeling Applications, stochastic extensions and solution approaches

    Science.gov (United States)

    Egging, Rudolf Gerardus

    This dissertation develops deterministic and stochastic multi-period mixed complementarity problems (MCP) for the global natural gas market, as well as solution approaches for large-scale stochastic MCP. The deterministic model is unique in the combination of the level of detail of the actors in the natural gas markets and the transport options, the detailed regional and global coverage, the multi-period approach with endogenous capacity expansions for transportation and storage infrastructure, the seasonal variation in demand and the representation of market power according to Nash-Cournot theory. The model is applied to several scenarios for the natural gas market that cover the formation of a cartel by the members of the Gas Exporting Countries Forum, a low availability of unconventional gas in the United States, and cost reductions in long-distance gas transportation. 1 The results provide insights in how different regions are affected by various developments, in terms of production, consumption, traded volumes, prices and profits of market participants. The stochastic MCP is developed and applied to a global natural gas market problem with four scenarios for a time horizon until 2050 with nineteen regions and containing 78,768 variables. The scenarios vary in the possibility of a gas market cartel formation and varying depletion rates of gas reserves in the major gas importing regions. Outcomes for hedging decisions of market participants show some significant shifts in the timing and location of infrastructure investments, thereby affecting local market situations. A first application of Benders decomposition (BD) is presented to solve a large-scale stochastic MCP for the global gas market with many hundreds of first-stage capacity expansion variables and market players exerting various levels of market power. The largest problem solved successfully using BD contained 47,373 variables of which 763 first-stage variables, however using BD did not result in

  16. Multi-Period Natural Gas Market Modeling. Applications, Stochastic Extensions and Solution Approaches

    International Nuclear Information System (INIS)

    Egging, R.G.

    2010-11-01

    This dissertation develops deterministic and stochastic multi-period mixed complementarity problems (MCP) for the global natural gas market, as well as solution approaches for large-scale stochastic MCP. The deterministic model is unique in the combination of the level of detail of the actors in the natural gas markets and the transport options, the detailed regional and global coverage, the multi-period approach with endogenous capacity expansions for transportation and storage infrastructure, the seasonal variation in demand and the representation of market power according to Nash-Cournot theory. The model is applied to several scenarios for the natural gas market that cover the formation of a cartel by the members of the Gas Exporting Countries Forum, a low availability of unconventional gas in the United States, and cost reductions in long-distance gas transportation. The results provide insights in how different regions are affected by various developments, in terms of production, consumption, traded volumes, prices and profits of market participants. The stochastic MCP is developed and applied to a global natural gas market problem with four scenarios for a time horizon until 2050 with nineteen regions and containing 78,768 variables. The scenarios vary in the possibility of a gas market cartel formation and varying depletion rates of gas reserves in the major gas importing regions. Outcomes for hedging decisions of market participants show some significant shifts in the timing and location of infrastructure investments, thereby affecting local market situations. A first application of Benders decomposition (BD) is presented to solve a large-scale stochastic MCP for the global gas market with many hundreds of first-stage capacity expansion variables and market players exerting various levels of market power. The largest problem solved successfully using BD contained 47,373 variables of which 763 first-stage variables, however using BD did not result in

  17. Analysis of a yearly multi-round, multi-period, multi-product transmission rights auction

    International Nuclear Information System (INIS)

    Ziogos, N.P.; Bakirtzis, A.G.

    2008-01-01

    A yearly multi-round, multi-period, multi-product transmission rights (TR) auction issuing both point-to-point Financial Transmission Rights (FTRs) and Flow-Gate Rights (FGRs) is studied in this paper. In each round the TR market participants (buyers or sellers) submit their bid or offer prices based on past energy market performance. A Locational Marginal Pricing (LMP) based energy market is assumed. The TR market participants' bid or offer prices reflect their expectation of the average annual LMP differences between withdrawal and injections points for FTRs and of the transmission link capacity prices for FGRs. The TR auction is performed in four rounds; in each round 25% of the entire system capability is awarded. TRs that are awarded in one round are modeled as fixed injections in subsequent rounds. Market participants that have acquired TRs in one round can sell them in subsequent rounds. A market participant can submit bids or offers for on-peak, off-peak or 24-h TRs. A three-area, nine-bus test system with six TR market participants is used for the analysis of the TR auction. (author)

  18. Multi-period emissions trading in the electricity sector-winners and losers

    International Nuclear Information System (INIS)

    Bode, Sven

    2006-01-01

    In the context of controlling greenhouse gas emissions, the directive on a Europe-wide trading scheme may be perceived as one of the most important milestones in recent years. Prior to its start, however, a number of very specific design features have to be agreed upon. Regarding the allocation of allowances, a distribution (almost) free of charge seems to be the most likely choice. An aspect that has interestingly attracted little attention in the past is the question of how to allocate emission rights over time. The following paper analyses different allocation options in multi-period emissions trading that are currently discussed in the European context. The options are applied for the electricity sector which is simulated over two periods. The paper distinguishes between a market effect of emissions trading and compliance costs for meeting the emission reduction obligation. The market effect results from a price increase which is due to the fact that opportunity costs for using allowances must be considered. It turns out that the electricity sector as a whole gains from the introduction of the instrument due to the increase of the electricity price. With regard to the different allocation options, it is found that utilities have different preferences depending on the fuel used

  19. Multi-period project portfolio selection under risk considerations and stochastic income

    Science.gov (United States)

    Tofighian, Ali Asghar; Moezzi, Hamid; Khakzar Barfuei, Morteza; Shafiee, Mahmood

    2018-02-01

    This paper deals with multi-period project portfolio selection problem. In this problem, the available budget is invested on the best portfolio of projects in each period such that the net profit is maximized. We also consider more realistic assumptions to cover wider range of applications than those reported in previous studies. A novel mathematical model is presented to solve the problem, considering risks, stochastic incomes, and possibility of investing extra budget in each time period. Due to the complexity of the problem, an effective meta-heuristic method hybridized with a local search procedure is presented to solve the problem. The algorithm is based on genetic algorithm (GA), which is a prominent method to solve this type of problems. The GA is enhanced by a new solution representation and well selected operators. It also is hybridized with a local search mechanism to gain better solution in shorter time. The performance of the proposed algorithm is then compared with well-known algorithms, like basic genetic algorithm (GA), particle swarm optimization (PSO), and electromagnetism-like algorithm (EM-like) by means of some prominent indicators. The computation results show the superiority of the proposed algorithm in terms of accuracy, robustness and computation time. At last, the proposed algorithm is wisely combined with PSO to improve the computing time considerably.

  20. A multi-period distribution network design model under demand uncertainty

    Science.gov (United States)

    Tabrizi, Babak H.; Razmi, Jafar

    2013-05-01

    Supply chain management is taken into account as an inseparable component in satisfying customers' requirements. This paper deals with the distribution network design (DND) problem which is a critical issue in achieving supply chain accomplishments. A capable DND can guarantee the success of the entire network performance. However, there are many factors that can cause fluctuations in input data determining market treatment, with respect to short-term planning, on the one hand. On the other hand, network performance may be threatened by the changes that take place within practicing periods, with respect to long-term planning. Thus, in order to bring both kinds of changes under control, we considered a new multi-period, multi-commodity, multi-source DND problem in circumstances where the network encounters uncertain demands. The fuzzy logic is applied here as an efficient tool for controlling the potential customers' demand risk. The defuzzifying framework leads the practitioners and decision-makers to interact with the solution procedure continuously. The fuzzy model is then validated by a sensitivity analysis test, and a typical problem is solved in order to illustrate the implementation steps. Finally, the formulation is tested by some different-sized problems to show its total performance.

  1. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

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

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

    Science.gov (United States)

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

    2015-06-01

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

  3. Developing an eco-routing application.

    Science.gov (United States)

    2014-01-01

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

  4. Coordinated Platoon Routing in a Metropolitan Network

    Energy Technology Data Exchange (ETDEWEB)

    Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

    2016-10-10

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

  5. Multi-Period Mean-Variance Portfolio Selection with Uncertain Time Horizon When Returns Are Serially Correlated

    Directory of Open Access Journals (Sweden)

    Ling Zhang

    2012-01-01

    Full Text Available We study a multi-period mean-variance portfolio selection problem with an uncertain time horizon and serial correlations. Firstly, we embed the nonseparable multi-period optimization problem into a separable quadratic optimization problem with uncertain exit time by employing the embedding technique of Li and Ng (2000. Then we convert the later into an optimization problem with deterministic exit time. Finally, using the dynamic programming approach, we explicitly derive the optimal strategy and the efficient frontier for the dynamic mean-variance optimization problem. A numerical example with AR(1 return process is also presented, which shows that both the uncertainty of exit time and the serial correlations of returns have significant impacts on the optimal strategy and the efficient frontier.

  6. A Multi-Period Optimization Model for Service Providers Using Online Reservation Systems: An Application to Hotels.

    Science.gov (United States)

    Xu, Ming; Jiao, Yan; Li, Xiaoming; Cao, Qingfeng; Wang, Xiaoyang

    2015-01-01

    This paper presents a multi-period optimization model for high margin and zero salvage products in online distribution channels with classifying customers based on number of products required. Taking hotel customers as an example, one is regular customers who reserve rooms for one day, and the other is long term stay (LTS) customers who reserve rooms for a number of days. LTS may guarantee a specific amount of demand and generate opportunity income for a certain number of periods, meanwhile with risk of punishment incurred by overselling. By developing an operational optimization model and exploring the effects of parameters on optimal decisions, we suggest that service providers should make decisions based on the types of customers, number of products required, and duration of multi-period to reduce the loss of reputation and obtain more profit; at the same time, multi-period buying customers should buy products early. Finally, the paper conducts a numerical experiment, and the results are consistent with prevailing situations.

  7. A Multi-Period Optimization Model for Service Providers Using Online Reservation Systems: An Application to Hotels

    Science.gov (United States)

    Xu, Ming; Jiao, Yan; Li, Xiaoming; Cao, Qingfeng; Wang, Xiaoyang

    2015-01-01

    This paper presents a multi-period optimization model for high margin and zero salvage products in online distribution channels with classifying customers based on number of products required. Taking hotel customers as an example, one is regular customers who reserve rooms for one day, and the other is long term stay (LTS) customers who reserve rooms for a number of days. LTS may guarantee a specific amount of demand and generate opportunity income for a certain number of periods, meanwhile with risk of punishment incurred by overselling. By developing an operational optimization model and exploring the effects of parameters on optimal decisions, we suggest that service providers should make decisions based on the types of customers, number of products required, and duration of multi-period to reduce the loss of reputation and obtain more profit; at the same time, multi-period buying customers should buy products early. Finally, the paper conducts a numerical experiment, and the results are consistent with prevailing situations. PMID:26147663

  8. Variability in operation-based NO(x) emission factors with different test routes, and its effects on the real-driving emissions of light diesel vehicles.

    Science.gov (United States)

    Lee, Taewoo; Park, Junhong; Kwon, Sangil; Lee, Jongtae; Kim, Jeongsoo

    2013-09-01

    The objective of this study is to quantify the differences in NO(x) emissions between standard and non-standard driving and vehicle operating conditions, and to estimate by how much NO(x) emissions exceed the legislative emission limits under typical Korean road traffic conditions. Twelve Euro 3-5 light-duty diesel vehicles (LDDVs) manufactured in Korea were driven on a chassis dynamometer over the standard New European Driving Cycle (NEDC) and a representative Korean on-road driving cycle (KDC). NO(x) emissions, average speeds and accelerations were calculated for each 1-km trip segment, so called averaging windows. The results suggest that the NO(x) emissions of the tested vehicles are more susceptible to variations in the driving cycles than to those in the operating conditions. Even under comparable operating conditions, the NO(x) control capabilities of vehicles differ from each other, i.e., NO(x) control is weaker for the KDC than for the NEDC. The NO(x) emissions over the KDC for given vehicle operating conditions exceed those over the NEDC by more than a factor of 8. Consequently, on-road NO(x) emission factors are estimated here to exceed the Euro 5 emission limit by up to a factor of 8, 4 and 3 for typical Korean urban, rural, and motorway road traffic conditions, respectively. Our findings support the development of technical regulations for supplementary real-world emission tests for emission certification and the corresponding research actions taken by automotive industries. Copyright © 2013 Elsevier B.V. All rights reserved.

  9. A Genetic Algorithm on Inventory Routing Problem

    Directory of Open Access Journals (Sweden)

    Nevin Aydın

    2014-03-01

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

  10. The influence of global benchmark oil prices on the regional oil spot market in multi-period evolution

    International Nuclear Information System (INIS)

    Jiang, Meihui; An, Haizhong; Jia, Xiaoliang; Sun, Xiaoqi

    2017-01-01

    Crude benchmark oil prices play a crucial role in energy policy and investment management. Previous research confined itself to studying the static, uncertain, short- or long-term relationship between global benchmark oil prices, ignoring the time-varying, quantitative, dynamic nature of the relationship during various stages of oil price volatility. This paper proposes a novel approach combining grey relation analysis, optimization wavelet analysis, and Bayesian network modeling to explore the multi-period evolution of the dynamic relationship between global benchmark oil prices and regional oil spot price. We analyze the evolution of the most significant decision-making risk periods, as well as the combined strategy-making reference oil prices and the corresponding periods during various stages of volatility. Furthermore, we determine that the network evolution of the quantitative lead/lag relationship between different influences of global benchmark oil prices shows a multi-period evolution phenomenon. For policy makers and market investors, our combined model can provide decision-making periods with the lowest expected risk and decision-making target reference oil prices and corresponding weights for strategy adjustment and market arbitrage. This study provides further information regarding period weights of target reference oil prices, facilitating efforts to perform multi-agent energy policy and intertemporal market arbitrage. - Highlights: • Multi-period evolution of the influence of different oil prices is discovered. • We combined grey relation analysis, optimization wavelet and Bayesian network. • The intensity of volatility, synchronization, and lead/lag effects are analyzed. • The target reference oil prices and corresponding period weights are determined.

  11. Planejamento do transporte de empregados por uma frota de ônibus fretada por meio de um modelo matemático baseado no Open Vehicle Routing Problem (OVRP

    Directory of Open Access Journals (Sweden)

    Rayane Florentina Scárdua

    2016-12-01

    Full Text Available Several transportation problems like traffic jam, crowded public transportation, parking shortage and pollution is caused by the actual scenario of urban mobility. The transport of passengers by charter is an alternative to improve the quality of urban mobility avoiding traffic jam and reducing pollution. Several companies offer as a benefit to their employees this type of transport to carry them to the company from their home and vice versa. Thus, it is proposed in this paper an adaptation of a mathematical model based on Open Vehicle Routing Problem (OVRP for planning the transport of employees by a chartered bus fleet in order to reduce the total cost spent by the company. The model was applied to a company located in Vitória-ES and the results obtained by the model indicated a reduction in the cost of transportation when compared to the currently paid by the company.

  12. Optimal Sizing of Energy Storage Systems for the Energy Procurement Problem in Multi-Period Markets under Uncertainties

    Directory of Open Access Journals (Sweden)

    Ryusuke Konishi

    2018-01-01

    Full Text Available In deregulated electricity markets, minimizing the procurement costs of electricity is a critical problem for procurement agencies (PAs. However, uncertainty is inevitable for PAs and includes multiple factors such as market prices, photovoltaic system (PV output and demand. This study focuses on settlements in multi-period markets (a day-ahead market and a real-time market and the installation of energy storage systems (ESSs. ESSs can be utilized for time arbitrage in the day-ahead market and to reduce the purchasing/selling of electricity in the real-time market. However, the high costs of an ESS mean the size of the system needs to be minimized. In addition, when determining the size of an ESS, it is important to identify the size appropriate for each role. Therefore, we employ the concept of a “slow” and a “fast” ESS to quantify the size of a system’s role, based on the values associated with the various uncertainties. Because the problem includes nonlinearity and non-convexity, we solve it within a realistic computational burden by reformulating the problem using reasonable assumptions. Therefore, this study identifies the optimal sizes of ESSs and procurement, taking into account the uncertainties of prices in multi-period markets, PV output and demand.

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

    National Research Council Canada - National Science Library

    Burks, Jr, Robert E

    2006-01-01

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

  14. Application of the NSGA-II algorithm to a multi-period inventory-redundancy allocation problem in a series-parallel system

    International Nuclear Information System (INIS)

    Alikar, Najmeh; Mousavi, Seyed Mohsen; Raja Ghazilla, Raja Ariffin; Tavana, Madjid; Olugu, Ezutah Udoncy

    2017-01-01

    In this paper, we formulate a mixed-integer binary non-linear programming model to study a series-parallel multi-component multi-periodic inventory-redundancy allocation problem (IRAP). This IRAP is a novel redundancy allocation problem (RAP) because components (products) are purchased under an all unit discount (AUD) policy and then installed on a series-parallel system. The total budget available for purchasing the components, the storage space, the vehicle capacities, and the total weight of the system are limited. Moreover, a penalty function is used to penalize infeasible solutions, generated randomly. The overall goal is to find the optimal number of the components purchased for each subsystem so that the total costs including ordering cost, holding costs, and purchasing cost are minimized while the system reliability is maximized, simultaneously. A non-dominated sorting genetic algorithm-II (NSGA-II), a multi-objective particle swarm optimization (MOPSO), and a multi-objective harmony search (MOHS) algorithm are applied to obtain the optimal Pareto solutions. While no benchmark is available in the literature, some numerical examples are generated randomly to evaluate the results of NSGA-II on the proposed IRAP. The results are in favor of NSGA-II. - Highlights: • An inventory control system employing an all-unit discount policy is considered in the proposed model. • The proposed model considers limited total budget, storage space, transportation capacity, and total weight. Moreover, a penalty function is used to penalize infeasible solutions. • The overall goal is to find the optimal number components purchased for each subsystem so that the total costs including ordering cost, holding cost and purchasing cost are minimized and the system reliability are maximized, simultaneously. • A NSGA-II algorithm is derived where a multi-objective particle swarm optimization and a multi-objective harmony search algorithm are used to evaluate the NSGA-II results.

  15. Period-dependent source rupture behavior of the 2011 Tohoku earthquake estimated by multi period-band Bayesian waveform inversion

    Science.gov (United States)

    Kubo, H.; Asano, K.; Iwata, T.; Aoi, S.

    2014-12-01

    Previous studies for the period-dependent source characteristics of the 2011 Tohoku earthquake (e.g., Koper et al., 2011; Lay et al., 2012) were based on the short and long period source models using different method. Kubo et al. (2013) obtained source models of the 2011 Tohoku earthquake using multi period-bands waveform data by a common inversion method and discussed its period-dependent source characteristics. In this study, to achieve more in detail spatiotemporal source rupture behavior of this event, we introduce a new fault surface model having finer sub-fault size and estimate the source models in multi period-bands using a Bayesian inversion method combined with a multi-time-window method. Three components of velocity waveforms at 25 stations of K-NET, KiK-net, and F-net of NIED are used in this analysis. The target period band is 10-100 s. We divide this period band into three period bands (10-25 s, 25-50 s, and 50-100 s) and estimate a kinematic source model in each period band using a Bayesian inversion method with MCMC sampling (e.g., Fukuda & Johnson, 2008; Minson et al., 2013, 2014). The parameterization of spatiotemporal slip distribution follows the multi-time-window method (Hartzell & Heaton, 1983). The Green's functions are calculated by the 3D FDM (GMS; Aoi & Fujiwara, 1999) using a 3D velocity structure model (JIVSM; Koketsu et al., 2012). The assumed fault surface model is based on the Pacific plate boundary of JIVSM and is divided into 384 subfaults of about 16 * 16 km^2. The estimated source models in multi period-bands show the following source image: (1) First deep rupture off Miyagi at 0-60 s toward down-dip mostly radiating relatively short period (10-25 s) seismic waves. (2) Shallow rupture off Miyagi at 45-90 s toward up-dip with long duration radiating long period (50-100 s) seismic wave. (3) Second deep rupture off Miyagi at 60-105 s toward down-dip radiating longer period seismic waves then that of the first deep rupture. (4) Deep

  16. Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

    Directory of Open Access Journals (Sweden)

    Baozhen Yao

    2014-02-01

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

  17. Optimizing decentralized production-distribution planning problem in a multi-period supply chain network under uncertainty

    Science.gov (United States)

    Nourifar, Raheleh; Mahdavi, Iraj; Mahdavi-Amiri, Nezam; Paydar, Mohammad Mahdi

    2017-09-01

    Decentralized supply chain management is found to be significantly relevant in today's competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final product is appropriated with stochastic and fuzzy numbers. We provide mathematical formulation of the problem as a bi-level mixed integer linear programming model. Due to problem's convolution, a structure to solve is developed that incorporates a novel heuristic algorithm based on Kth-best algorithm, fuzzy approach and chance constraint approach. Ultimately, a numerical example is constructed and worked through to demonstrate applicability of the optimization model. A sensitivity analysis is also made.

  18. Stochastic multi-period multi-product multi-objective Aggregate Production Planning model in multi-echelon supply chain

    Directory of Open Access Journals (Sweden)

    Kaveh Khalili-Damghani

    2017-07-01

    Full Text Available In this paper a multi-period multi-product multi-objective aggregate production planning (APP model is proposed for an uncertain multi-echelon supply chain considering financial risk, customer satisfaction, and human resource training. Three conflictive objective functions and several sets of real constraints are considered concurrently in the proposed APP model. Some parameters of the proposed model are assumed to be uncertain and handled through a two-stage stochastic programming (TSSP approach. The proposed TSSP is solved using three multi-objective solution procedures, i.e., the goal attainment technique, the modified ε-constraint method, and STEM method. The whole procedure is applied in an automotive resin and oil supply chain as a real case study wherein the efficacy and applicability of the proposed approaches are illustrated in comparison with existing experimental production planning method.

  19. An adversarial queueing model for online server routing

    NARCIS (Netherlands)

    Bonifaci, V.

    2007-01-01

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

  20. High-order fuzzy time-series based on multi-period adaptation model for forecasting stock markets

    Science.gov (United States)

    Chen, Tai-Liang; Cheng, Ching-Hsue; Teoh, Hia-Jong

    2008-02-01

    Stock investors usually make their short-term investment decisions according to recent stock information such as the late market news, technical analysis reports, and price fluctuations. To reflect these short-term factors which impact stock price, this paper proposes a comprehensive fuzzy time-series, which factors linear relationships between recent periods of stock prices and fuzzy logical relationships (nonlinear relationships) mined from time-series into forecasting processes. In empirical analysis, the TAIEX (Taiwan Stock Exchange Capitalization Weighted Stock Index) and HSI (Heng Seng Index) are employed as experimental datasets, and four recent fuzzy time-series models, Chen’s (1996), Yu’s (2005), Cheng’s (2006) and Chen’s (2007), are used as comparison models. Besides, to compare with conventional statistic method, the method of least squares is utilized to estimate the auto-regressive models of the testing periods within the databases. From analysis results, the performance comparisons indicate that the multi-period adaptation model, proposed in this paper, can effectively improve the forecasting performance of conventional fuzzy time-series models which only factor fuzzy logical relationships in forecasting processes. From the empirical study, the traditional statistic method and the proposed model both reveal that stock price patterns in the Taiwan stock and Hong Kong stock markets are short-term.

  1. The World gas model. A multi-period mixed complementarity model for the global natural gas market

    International Nuclear Information System (INIS)

    Egging, Ruud; Holz, Franziska; Gabriel, Steven A.

    2010-01-01

    We provide the description, mathematical formulation and illustrative results of the World Gas Model, a multi-period complementarity model for the global natural gas market with explicit consideration of market power in the upstream market. Market players include producers, traders, pipeline and storage operators, LNG (liquefied natural gas) liquefiers and regasifiers as well as marketers. The model data set contains more than 80 countries and regions and covers 98% of world wide natural gas production and consumption. We also include a detailed representation of cross-border natural gas pipelines and constraints imposed by long-term contracts in the LNG market. The model is calibrated to match production and consumption projections from the PRIMES [EC. European energy and transport: trends to 2030-update 2007. Brussels: European Commission; 2008] and POLES models [EC. World energy technology outlook - 2050 (WETO-H2). Brussels: European Commission; 2006] up to 2030. The results of our numerical simulations illustrate how the supply shares of pipeline and LNG in various regions in the world develop very differently over time. LNG will continue to play a major role in the Asian market, also for new importers like China and India. Europe will expand its pipeline import capacities benefiting from its relative proximity to major gas suppliers. (author)

  2. Systems and methods for vehicle speed management

    Science.gov (United States)

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

    2016-03-01

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

  3. A new algorithm for solving the inventory routing problem with direct shipment

    Directory of Open Access Journals (Sweden)

    Ali Hossein Mirzaei

    2012-02-01

    Full Text Available   In this paper a multi-commodity multi-period inventory routing problem in a two-echelon supply chain consisting of a manufacturer and a set of retailers has been studied. In addition to inventory management and distribution planning, production planning has also been considered in the above problem. The objective is to minimize total system cost that consists of production setup, inventory holding and distribution costs. The commodities are delivered to the retailers by an identical fleet of limited capacity vehicles through direct shipment strategy. Also it is assumed that production and storage capacity is limited and stockout is not allowed. Since similar problems without distribution planning are known as NP-hard, this is also an NP-hard problem. Therefore, in this paper, a new improved particle swarm optimization algorithm has been developed consisting of two distinguished phases for problem solving. First, the values of binary variables are determined using the proposed algorithm and then, the continuous variables are calculated by solving a linear programming model. Performance of the proposed algorithm has been compared with genetic and original particle swarm optimization algorithms using various samples of random problems. The findings imply significant performance of the proposed algorithm.         

  4. Predictive cruise control in hybrid electric vehicles

    NARCIS (Netherlands)

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

    2009-01-01

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

  5. Low-mass Pre-He White Dwarf Stars in Kepler Eclipsing Binaries with Multi-periodic Pulsations

    Science.gov (United States)

    Zhang, X. B.; Fu, J. N.; Liu, N.; Luo, C. Q.; Ren, A. B.

    2017-12-01

    We report the discovery of two thermally bloated low-mass pre-He white dwarfs (WDs) in two eclipsing binaries, KIC 10989032 and KIC 8087799. Based on the Kepler long-cadence photometry, we determined comprehensive photometric solutions of the two binary systems. The light curve analysis reveals that KIC 10989032 is a partially eclipsed detached binary system containing a probable low-mass WD with the temperature of about 10,300 K. Having a WD with the temperature of about 13,300, KKIC 8087799 is typical of an EL CVn system. By utilizing radial velocity measurements available for the A-type primary star of KIC 10989032, the mass and radius of the WD component are determined to be 0.24+/- 0.02 {M}⊙ and 0.50+/- 0.01 {R}⊙ , respectively. The values of mass and radius of the WD in KIC 8087799 are estimated as 0.16 ± 0.02 M ⊙ and 0.21 ± 0.01 R ⊙, respectively, according to the effective temperature and mean density of the A-type star derived from the photometric solution. We therefore introduce KIC 10989032 and KIC 8087799 as the eleventh and twelfth dA+WD eclipsing binaries in the Kepler field. Moreover, both binaries display marked multi-periodic pulsations superimposed on binary effects. A preliminary frequency analysis is applied to the light residuals when subtracting the synthetic eclipsing light curves from the observations, revealing that the light pulsations of the two systems are both due to the δ Sct-type primaries. We hence classify KIC 10989032 and KIC 8087799 as two WD+δ Sct binaries.

  6. A Quasi-Feed-In-Tariff policy formulation in micro-grids: A bi-level multi-period approach

    International Nuclear Information System (INIS)

    Taha, Ahmad F.; Hachem, Nadim A.; Panchal, Jitesh H.

    2014-01-01

    A Quasi-Feed-In-Tariff (QFIT) policy formulation is presented for micro-grids that integrates renewable energy generation considering Policy Makers' and Generation Companies' (GENCOs) objectives assuming a bi-level multi-period formulation that integrates physical characteristics of the power-grid. The upper-level problem corresponds to the PM, whereas the lower-level decisions are made by GENCOs. We consider that some GENCOs are green energy producers, while others are black energy producers. Policy makers incentivize green energy producers to generate energy through the payment of optimal time-varying subsidy price. The policy maker's main objective is to maximize an overall social welfare that includes factors such as demand surplus, energy cost, renewable energy subsidy price, and environmental standards. The lower-level problem corresponding to the GENCOs is based on maximizing the players' profits. The proposed QFIT policy differs from the FIT policy in the sense that the subsidy price-based contracts offered to green energy producers dynamically change over time, depending on the physical properties of the grid, demand, and energy price fluctuations. The integrated problem solves for time-varying subsidy price and equilibrium energy quantities that optimize the system welfare under different grid and system conditions. - Highlights: • We present a bi-level optimization problem formulation for Quasi-Feed-In-Tariff (QFIT) policy. • QFIT dictates that subsidy prices dynamically vary over time depending on conditions. • Power grid's physical characteristics affect optimal subsidy prices and energy generation. • To maximize welfare, policy makers ought to increase subsidy prices during the peak-load

  7. Capacitated Vehicle Routing with Nonuniform Speeds

    DEFF Research Database (Denmark)

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

    2016-01-01

    is the distance traveled divided by its speed.Our algorithm relies on a new approximate minimum spanning tree construction called Level-Prim, which is related to but different from Light Approximate Shortest-path Trees. We also extend the widely used tour-splitting technique to nonuniform speeds, using ideas from...

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

  9. Hurricane Evacuation Routes

    Data.gov (United States)

    Department of Homeland Security — Hurricane Evacuation Routes in the United States A hurricane evacuation route is a designated route used to direct traffic inland in case of a hurricane threat. This...

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

    DEFF Research Database (Denmark)

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

    2016-01-01

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

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

  12. Disruption management of the vehicle routing problem with vehicle breakdown

    DEFF Research Database (Denmark)

    Mu, Q; Fu, Z; Lysgaard, Jens

    2011-01-01

    solution needs to be quickly generated to minimise the costs. Two Tabu Search algorithms are developed to solve the problem and are assessed in relation to an exact algorithm. A set of test problems has been generated and computational results from experiments using the heuristic algorithms are presented....

  13. VINE ROUTES IN BULGARIA

    Directory of Open Access Journals (Sweden)

    Lyuben Hristov

    2015-03-01

    Full Text Available The article deals with a scheme for the modern vine route in Bulgaria. Five basic vine routes and one international, between Bulgaria, Macedonia and Greece are defined. All routes consider characteristic varieties of grapes and kinds of vine products. Vine tourist products combined with visits of important natural and anthropological object are in the bases of the defined routes. The described routes are an important contribution to development of alternative tourist products in the country.

  14. Operational validation of a multi-period and multi-criteria model conditioning approach for the prediction of rainfall-runoff processes in small forest catchments

    Science.gov (United States)

    Choi, H.; Kim, S.

    2012-12-01

    Most of hydrologic models have generally been used to describe and represent the spatio-temporal variability of hydrological processes in the watershed scale. Though it is an obvious fact that hydrological responses have the time varying nature, optimal values of model parameters were normally considered as time invariants or constants in most cases. The recent paper of Choi and Beven (2007) presents a multi-period and multi-criteria model conditioning approach. The approach is based on the equifinality thesis within the Generalised Likelihood Uncertainty Estimation (GLUE) framework. In their application, the behavioural TOPMODEL parameter sets are determined by several performance measures for global (annual) and short (30-days) periods, clustered using a Fuzzy C-means algorithm, into 15 types representing different hydrological conditions. Their study shows a good performance on the calibration of a rainfall-runoff model in a forest catchment, and also gives strong indications that it is uncommon to find model realizations that were behavioural over all multi-periods and all performance measures, and multi-period model conditioning approach may become new effective tool for predictions of hydrological processes in ungauged catchments. This study is a follow-up study on the Choi and Beven's (2007) model conditioning approach to test how the approach is effective for the prediction of rainfall-runoff responses in ungauged catchments. To achieve this purpose, 6 small forest catchments are selected among the several hydrological experimental catchments operated by Korea Forest Research Institute. In each catchment, long-term hydrological time series data varying from 10 to 30 years were available. The areas of the selected catchments range from 13.6 to 37.8 ha, and all areas are covered by coniferous or broad-leaves forests. The selected catchments locate in the southern coastal area to the northern part of South Korea. The bed rocks are Granite gneiss, Granite or

  15. Optimal solutions for routing problems with profits

    NARCIS (Netherlands)

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

    2013-01-01

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

  16. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

    This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

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

    African Journals Online (AJOL)

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

  18. Introducing radiality constraints in capacitated location-routing problems

    Directory of Open Access Journals (Sweden)

    Eliana Mirledy Toro Ocampo

    2017-03-01

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

  19. Hazmat Routes (National)

    Data.gov (United States)

    Department of Transportation — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes (NTAD) were developed using the 2004 First Edition TIGER/Line files. The routes are...

  20. State alternative route designations

    International Nuclear Information System (INIS)

    1989-07-01

    Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select alternative routes. First,the state must establish a ''state routing agency,'' defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice of DOT of any alternative route designation before the routes are deemed effective

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

    Science.gov (United States)

    2010-07-01

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

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

    Science.gov (United States)

    2010-07-01

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

  3. Advanced Vehicle Testing and Evaluation

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-03-31

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

  4. Multi-period fuzzy mean-semi variance portfolio selection problem with transaction cost and minimum transaction lots using genetic algorithm

    Directory of Open Access Journals (Sweden)

    Mohammad Ali Barati

    2016-04-01

    Full Text Available Multi-period models of portfolio selection have been developed in the literature with respect to certain assumptions. In this study, for the first time, the portfolio selection problem has been modeled based on mean-semi variance with transaction cost and minimum transaction lots considering functional constraints and fuzzy parameters. Functional constraints such as transaction cost and minimum transaction lots were included. In addition, the returns on assets parameters were considered as trapezoidal fuzzy numbers. An efficient genetic algorithm (GA was designed, results were analyzed using numerical instances and sensitivity analysis were executed. In the numerical study, the problem was solved based on the presence or absence of each mode of constraints including transaction costs and minimum transaction lots. In addition, with the use of sensitivity analysis, the results of the model were presented with the variations of minimum expected rate of programming periods.

  5. Gully incision rates on the bedrock of a large dip-slope landslide revealed by multi-period LiDAR DEMs

    Science.gov (United States)

    Chan, Y. C.; Hsieh, Y. C.

    2017-12-01

    Recent advances in airborne laser scanning (ALS) technology have provided a great opportunity for characterizing surface erosion through developing improved methods in multi-period DEM differencing and geomorphometry. This study uses three periods of ALS digital elevation model (DEM) data to analyze the short-term erosional features of the Tsaoling landslide triggered by the 1999 Chi-Chi earthquake in Taiwan. Two methods for calculating the bedrock incision rate, the equal-interval cross section selection method and the continuous swath profiles selection method, were used in the study after nearly ten years of gully incision following the earthquake-triggered dip-slope landslide. Multi-temporal gully incision rates were obtained using the continuous swath profiles selection method, which is considered a practical and convenient approach in terrain change studies. After error estimation and comparison of the multi-period ALS DEMs, the terrain change in different periods can be directly calculated, reducing time-consuming fieldwork such as installation of erosion pins and measurement of topographic cross sections on site. In this study, the gully bedrock incision rates ranged between 0.23 and 3.98 m/year, remarkably higher than the typical results from the previous studies. By comparing the DEM data, aerial photos, and precipitation records of this area, the effects of erosion could be observed from the retreat of the Chunqiu Cliff outline during August 2011 to September 2012. It was inferred that the change in the topographic elevation during 2011-2012 was mainly due to the torrential rain brought by Typhoon Soula, which occurred on 30 July 2012. The local gully incision rate in the lower part of the landslide surface was remarkably faster than that of the other regions, suggesting that the fast incision of the toe area possibly contributes to the occurrence of repeated landslides in the Tsaoling area.

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

  7. Vehicle to Vehicle Services

    DEFF Research Database (Denmark)

    Brønsted, Jeppe Rørbæk

    2008-01-01

    location aware infotainment, increase safety, and lessen environmental strain. This dissertation is about service oriented architecture for pervasive computing with an emphasis on vehicle to vehicle applications. If devices are exposed as services, applications can be created by composing a set of services...... be evaluated. Service composition mechanisms for pervasive computing are categorized and we discuss how the characteristics of pervasive computing can be supported by service composition mechanisms. Finally, we investigate how to make pervasive computing systems capable of being noticed and understood...

  8. Evaluation of cyclic battery ageing for railway vehicle application

    OpenAIRE

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

    2017-01-01

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

  9. An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

    Directory of Open Access Journals (Sweden)

    Ji Ung Sun

    2015-01-01

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

  10. A Review Of Design And Control Of Automated Guided Vehicle Systems

    NARCIS (Netherlands)

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

    2004-01-01

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

  11. Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

    Science.gov (United States)

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

    2017-10-01

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

  12. Understanding individual routing behaviour.

    Science.gov (United States)

    Lima, Antonio; Stanojevic, Rade; Papagiannaki, Dina; Rodriguez, Pablo; González, Marta C

    2016-03-01

    Knowing how individuals move between places is fundamental to advance our understanding of human mobility (González et al. 2008 Nature 453, 779-782. (doi:10.1038/nature06958)), improve our urban infrastructure (Prato 2009 J. Choice Model. 2, 65-100. (doi:10.1016/S1755-5345(13)70005-8)) and drive the development of transportation systems. Current route-choice models that are used in transportation planning are based on the widely accepted assumption that people follow the minimum cost path (Wardrop 1952 Proc. Inst. Civ. Eng. 1, 325-362. (doi:10.1680/ipeds.1952.11362)), despite little empirical support. Fine-grained location traces collected by smart devices give us today an unprecedented opportunity to learn how citizens organize their travel plans into a set of routes, and how similar behaviour patterns emerge among distinct individual choices. Here we study 92 419 anonymized GPS trajectories describing the movement of personal cars over an 18-month period. We group user trips by origin-destination and we find that most drivers use a small number of routes for their routine journeys, and tend to have a preferred route for frequent trips. In contrast to the cost minimization assumption, we also find that a significant fraction of drivers' routes are not optimal. We present a spatial probability distribution that bounds the route selection space within an ellipse, having the origin and the destination as focal points, characterized by high eccentricity independent of the scale. While individual routing choices are not captured by path optimization, their spatial bounds are similar, even for trips performed by distinct individuals and at various scales. These basic discoveries can inform realistic route-choice models that are not based on optimization, having an impact on several applications, such as infrastructure planning, routing recommendation systems and new mobility solutions. © 2016 The Author(s).

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

  14. Capacitated arc routing problem and its extensions in waste collection

    International Nuclear Information System (INIS)

    Fadzli, Mohammad; Najwa, Nurul; Luis, Martino

    2015-01-01

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

  15. Inventory slack routing application in emergency logistics and relief distributions.

    Science.gov (United States)

    Yang, Xianfeng; Hao, Wei; Lu, Yang

    2018-01-01

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

  16. Capacitated arc routing problem and its extensions in waste collection

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-05-15

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

  17. Class network routing

    Science.gov (United States)

    Bhanot, Gyan [Princeton, NJ; Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Heidelberger, Philip [Cortlandt Manor, NY; Steinmacher-Burow, Burkhard D [Mount Kisco, NY; Takken, Todd E [Mount Kisco, NY; Vranas, Pavlos M [Bedford Hills, NY

    2009-09-08

    Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

  18. Proxies for Anonymous Routing

    National Research Council Canada - National Science Library

    Reed, Michael G; Syverson, Paul F; Goldschlag, David M

    1996-01-01

    ...), and file transfers (FTP) have been implemented. Onion routing provides application independent, real-time, and bi-directional anonymous connections that are resistant to both eavesdropping and traffic analysis...

  19. Routes and Stations

    Data.gov (United States)

    Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

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

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  1. Routed planar networks

    Directory of Open Access Journals (Sweden)

    David J. Aldous

    2016-04-01

    Full Text Available Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\\em routes} rather than {\\em edges} as primitives. This article is intended to introduce the relevant (discrete setting notion of {\\em routed network} to graph theorists. We give a naive classification of all 71 topologically different such networks on 4 leaves, and pose a variety of challenging research questions.

  2. A Review Of Design And Control Of Automated Guided Vehicle Systems

    OpenAIRE

    Le-Anh, Tuan; Koster, René

    2004-01-01

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

  3. Exact methods for time constrained routing and related scheduling problems

    DEFF Research Database (Denmark)

    Kohl, Niklas

    1995-01-01

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

  4. Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

    OpenAIRE

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

    2017-01-01

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

  5. A multi-period optimization model for planning of China's power sector with consideration of carbon dioxide mitigation—The importance of continuous and stable carbon mitigation policy

    International Nuclear Information System (INIS)

    Zhang, Dongjie; Liu, Pei; Ma, Linwei; LI, Zheng

    2013-01-01

    A great challenge China's power sector faces is to mitigate its carbon emissions whilst satisfying the ever-increasing power demand. Optimal planning of the power sector with consideration of carbon mitigation for a long-term future remains a complex task, involving many technical alternatives and an infinite number of possible plants installations, retrofitting, and decommissioning over the planning horizon. Previously the authors built a multi-period optimization model for the planning of China's power sector during 2010–2050. Based on that model, this paper executed calculations on the optimal pathways of China's power sector with two typical decision-making modes, which are based on “full-information” and “limited-information” hypothesis, and analyzed the impacts on the optimal planning results by two typical types of carbon tax policies including a “continuous and stable” one and a “loose first and tight later” one. The results showed that making carbon tax policy for long-term future, and improving the continuity and stability in policy execution can effectively help reduce the accumulated total carbon emissions, and also the cost for carbon mitigation of the power sector. The conclusion of this study is of great significance for the policy makers to make carbon mitigation policies in China and other countries as well. - Highlights: • A multi-stage optimization model for planning the power sector is applied as basis. • Difference of ideal and actual decision making processes are proposed and analyzed. • A “continuous and stable” policy and a “loose first and tight later” one are designed. • 4 policy scenarios are studied applying the optimal planning model and compared. • The importance of “continuous and stable” policy for long term is well demonstrated

  6. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

    Disclosed are a unified method and apparatus to classify, route, and process injected data packets into a network so as to belong to a plurality of logical networks, each implementing a specific flow of data on top of a common physical network. The method allows to locally identify collectives of packets for local processing, such as the computation of the sum, difference, maximum, minimum, or other logical operations among the identified packet collective. Packets are injected together with a class-attribute and an opcode attribute. Network routers, employing the described method, use the packet attributes to look-up the class-specific route information from a local route table, which contains the local incoming and outgoing directions as part of the specifically implemented global data flow of the particular virtual network.

  7. Optimizing well intervention routes

    Energy Technology Data Exchange (ETDEWEB)

    Paiva, Ronaldo O. [PETROBRAS S.A., Vitoria, ES (Brazil); Schiozer, Denis J.; Bordalo, Sergio N. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica. Centro de Estudo do Petroleo (CEPETRO)]. E-mail: denis@dep.fem.unicamp.br; bordalo@dep.fem.unicamp.br

    2000-07-01

    This work presents a method for optimizing the itinerary of work over rigs, i.e., the search for the route of minimum total cost, and demonstrates the importance of the dynamics of reservoir behaviour. The total cost of a route includes the rig expenses (transport, assembly and operation), which are functions of time and distances, plus the losses of revenue in wells waiting for the rig, which are also dependent of time. A reservoir simulator is used to evaluate the monetary influence of the well shutdown on the present value of the production curve. Finally, search algorithms are employed to determine the route of minimal cost. The Simulated Annealing algorithm was also successful in optimizing the distribution of a list of wells among different work over rigs. The rational approach presented here is recommended for management teams as a standard procedure to define the priority of wells scheduled for work over. (author)

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

    International Nuclear Information System (INIS)

    Toth, D.M.

    1996-01-01

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

  9. Multihop Wireless Networks Opportunistic Routing

    CERN Document Server

    Zeng, Kai; Li, Ming

    2011-01-01

    This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

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

    Science.gov (United States)

    2011-08-01

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

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

  12. Enabling Routes as Context in Mobile Services

    DEFF Research Database (Denmark)

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

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

  13. Routing helicopters for crew exchanges on off-shore locations

    NARCIS (Netherlands)

    Sierksma, G.; Tijssen, G.A.

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

  14. Inspection vehicle

    International Nuclear Information System (INIS)

    Takahashi, Masaki; Omote, Tatsuyuki; Yoneya, Yutaka; Tanaka, Keiji; Waki, Tetsuro; Yoshida, Tomiji; Kido, Tsuyoshi.

    1993-01-01

    An inspection vehicle comprises a small-sized battery directly connected with a power motor or a direct power source from trolly lines and a switching circuit operated by external signals. The switch judges advance or retreat by two kinds of signals and the inspection vehicle is recovered by self-running. In order to recover the abnormally stopped inspection vehicle to the targeted place, the inspection vehicle is made in a free-running state by using a clutch mechanism and is pushed by an other vehicle. (T.M.)

  15. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

    We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

  16. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

    Dr Sabine Hentze, specialist in human genetics, giving an Insight Lecture entitled "Human Genetics – Diagnostics, Indications and Ethical Issues" on 23 September 2008 at EMBL Heidelberg. Activities in a achool in Budapest during a visit of Angela Bekesi, Ambassadors for the SET-Routes programme.

  17. A BACTERIA FORAGING ALGORITHM FOR SOLVING INTEGRATED MULTI-PERIOD CELL FORMATION AND SUBCONTRACTING PRODUCTION PLANNING IN A DYNAMIC CELLULAR MANUFACTURING SYSTEM

    Directory of Open Access Journals (Sweden)

    S.H. Tang

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT: The bacteria foraging algorithm (BFA is a new computation technique inspired by the social foraging behaviour of Escherichia coli (E. coli bacteria. Since the introduction of the BFA by Kevin M. Passino, there have been many challenges in employing this algorithm to problems other than those for which the algorithm was proposed. This research aims to apply this emerging optimisation algorithm to develop a mixed-integer programming model for designing cellular manufacturing systems (CMSs, and production planning in dynamic environments. In dynamic environments, product mix and part demand vary under multi-period planning horizons. Thus the best-designed cells for one period may not be adequate for subsequent periods, requiring their reconstruction. The advantages of the proposed model are as follows: consideration of batch inter-cell and intra-cell material handling by assuming the sequence of operations, allowing for alternative process plans for part types, and consideration of machine copying, with an emphasis on the effect of trade-offs between production and outsourcing costs. The goal is to minimise the sum of the machines’ constant and variable costs, inter-cell and intra-cell material handling costs, reconstruction costs, partial subcontracting costs, and inventory carrying costs. In addition, a newly-developed BFA-based optimisation algorithm has been compared with the branch and bound algorithm. The results suggest that the proposed algorithm performs better than related works.

    AFRIKAANSE OPSOMMING: Die ‘bacteria foraging algorithm’ (BFA is ‘n berekeningstegniek gebaseeer op die sosiale soekgedrag van Escherichia coli (E. coli bakterieë. Sedert die bekendstelling van BFA was daar talle uitdagings oor toepassings van die algoritme op ander probleme as dié waarvoor dit ontwikkel is. Dié navorsing poog om deur toepassing van die algoritme ‘n gemengde heelgetalprogrammeringmodel te ontwikkel vir die

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

    KAUST Repository

    Bader, Ahmed; Alouini, Mohamed-Slim

    2016-01-01

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

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

    International Nuclear Information System (INIS)

    1989-07-01

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

  20. Electric vehicles

    Science.gov (United States)

    1990-03-01

    Quiet, clean, and efficient, electric vehicles (EVs) may someday become a practical mode of transportation for the general public. Electric vehicles can provide many advantages for the nation's environment and energy supply because they run on electricity, which can be produced from many sources of energy such as coal, natural gas, uranium, and hydropower. These vehicles offer fuel versatility to the transportation sector, which depends almost solely on oil for its energy needs. Electric vehicles are any mode of transportation operated by a motor that receives electricity from a battery or fuel cell. EVs come in all shapes and sizes and may be used for different tasks. Some EVs are small and simple, such as golf carts and electric wheel chairs. Others are larger and more complex, such as automobile and vans. Some EVs, such as fork lifts, are used in industries. In this fact sheet, we will discuss mostly automobiles and vans. There are also variations on electric vehicles, such as hybrid vehicles and solar-powered vehicles. Hybrid vehicles use electricity as their primary source of energy, however, they also use a backup source of energy, such as gasoline, methanol or ethanol. Solar-powered vehicles are electric vehicles that use photovoltaic cells (cells that convert solar energy to electricity) rather than utility-supplied electricity to recharge the batteries. These concepts are discussed.

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

  2. British Dance: Black Routes

    OpenAIRE

    Adair, C.; Burt, Ramsay, 1953-

    2016-01-01

    British Dance: Black Routes re-examines the distinctive contributions made to British dance by dancers who are Black. Covering the period 1946 to the present, it presents a radical re-reading of dancers and their companies, placing their achievements within a broader historical, cultural and artistic context. The result of a two year research project, British Dance and the African Diaspora, led by editors Christy Adair and Ramsay Burt, the collection looks at artists working with contempor...

  3. Adaptive powertrain control for plugin hybrid electric vehicles

    Science.gov (United States)

    Kedar-Dongarkar, Gurunath; Weslati, Feisel

    2013-10-15

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

  4. The multi-period solution of a linear system of equations with the operator of differentiation along the main diagonal of the space of independent variables and delayed arguments

    Science.gov (United States)

    Sartabanov, Zhaishylyk A.

    2017-09-01

    A new approach to the study of periodic by all independent variables system of equations with a differentiation operator solutions along the direction of the main diagonal and with delayed arguments is proposed. The essence of the approach is to reduce the study of the multi-periodic solution of a linear inhomogeneous system to the construction of a solution of a simpler linear differential-difference system on the basis of the method of variating arbitrary constants of the complete integral of a homogeneous system. An integral representation of the unique multiperiodic solution of an inhomogeneous system is presented, expressed by a functional series of terms given by multiple repeated integrals. An estimate is given for the norm of a multi-periodic solution.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2014-09-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Gorbachov, P.

    2013-01-01

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

  8. Neighboring and Connectivity-Aware Routing in VANETs

    Directory of Open Access Journals (Sweden)

    Huma Ghafoor

    2014-01-01

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

  9. Robustness of airline route networks

    Science.gov (United States)

    Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

    2016-03-01

    Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

  10. Vehicle regulations.

    NARCIS (Netherlands)

    2006-01-01

    In the Netherlands, all vehicles using public roads must meet so-called permanent requirements. This is enforced by the police and, for some categories, also during the MOT. In the Netherlands, most types of motor vehicle1 can only be introduced to the market if they meet the entry requirements. For

  11. Personal continuous route pattern mining

    Institute of Scientific and Technical Information of China (English)

    Qian YE; Ling CHEN; Gen-cai CHEN

    2009-01-01

    In the daily life, people often repeat regular routes in certain periods. In this paper, a mining system is developed to find the continuous route patterns of personal past trips. In order to count the diversity of personal moving status, the mining system employs the adaptive GPS data recording and five data filters to guarantee the clean trips data. The mining system uses a client/server architecture to protect personal privacy and to reduce the computational load. The server conducts the main mining procedure but with insufficient information to recover real personal routes. In order to improve the scalability of sequential pattern mining, a novel pattern mining algorithm, continuous route pattern mining (CRPM), is proposed. This algorithm can tolerate the different disturbances in real routes and extract the frequent patterns. Experimental results based on nine persons' trips show that CRPM can extract more than two times longer route patterns than the traditional route pattern mining algorithms.

  12. Algoritmos genéticos e computação paralela para problemas de roteirização de veículos com janelas de tempo e entregas fracionadas Genetic algorithms and parallel computing for a vehicle routing problem with time windows and split deliveries

    Directory of Open Access Journals (Sweden)

    Guilherme Guidolin de Campos

    2006-05-01

    Full Text Available O presente trabalho propõe a utilização de metaheurísticas e computação paralela para a resolução de um problema real de roteirização de veículos com frota heterogênea, janelas de tempo e entregas fracionadas, no qual a demanda dos clientes pode ser maior que a capacidade dos veículos. O problema consiste na determinação de um conjunto de rotas econômicas que devem atender à necessidade de cada cliente respeitando todas as restrições. A estratégia adotada para a resolução do problema consiste na utilização de uma adaptação da heurística construtiva proposta por Clarke e Wright (1964 como solução inicial. Posteriormente, implementa-se um algoritmo genético paralelo que é resolvido com o auxílio de um cluster de computadores, com o objetivo de explorar novos espaços de soluções. Os resultados obtidos demonstram que a heurística construtiva básica apresenta resultados satisfatórios para o problema, mas pode ser melhorada substancialmente com o uso de técnicas mais sofisticadas. A aplicação do algoritmo genético paralelo de múltiplas populações com solução inicial, que apresentou os melhores resultados, proporciona redução no custo total da operação da ordem de 10%, em relação à heurística construtiva, e 13%, quando comparada às soluções utilizadas originalmente pela empresa.The present work considers the use of metaheuristics and parallel computing to solve a real problem of vehicle routing involving a heterogeneous fleet, time windows and split deliveries, in which customer demand can exceed vehicle capacity. The problem consists of determining a set of economical routes that meet each customer's needs while still being subject to all the constraints. The strategy adopted to solve the problem consists of an adaptation of the constructive heuristics proposed by Clarke & Wright (1964 as the initial solution. More sophisticated algorithms are then applied to achieve improvements, such as

  13. Elisabeth Badinter, Fausse route

    OpenAIRE

    Martin-Juchat, Fabienne

    2013-01-01

    Elisabeth Badinter, philosophe de formation, est l’auteure de nombreux ouvrages sur la condition féminine et les rapports hommes/femmes dans la société. Avec Fausse route, elle signe une vision polémique du féminisme occidental. Son ouvrage a suscité de nombreuses critiques de femmes dans diverses revues destinées au grand public. Hélène Strohl, recenseur de la revue Culture en mouvement, conclut que cet ouvrage est peu scientifique, sujet à caution : « Argument contre argument, amalgame cont...

  14. Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

    DEFF Research Database (Denmark)

    Vilhelmsen, Charlotte

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

  15. A multi-objective location routing problem using imperialist competitive algorithm

    Directory of Open Access Journals (Sweden)

    Amir Mohammad Golmohammadi

    2016-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Zhao Qiang

    2015-01-01

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

  17. Routing Service Quality—Local Driver Behavior Versus Routing Services

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

    of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... popularity, which are enabled by common driving behaviors found in available trajectory data. The ability to evaluate the quality of routing services enables service providers to improve the quality of their services and enables users to identify the services that best serve their needs. The paper covers......Mobile location-based services is a very successful class of services that are being used frequently by users with GPS-enabled mobile devices such as smartphones. This paper presents a study of how to exploit GPS trajectory data, which is available in increasing volumes, for the assessment...

  18. Solving stochastic multiobjective vehicle routing problem using probabilistic metaheuristic

    Directory of Open Access Journals (Sweden)

    Gannouni Asmae

    2017-01-01

    closed form expression. This novel approach is based on combinatorial probability and can be incorporated in a multiobjective evolutionary algorithm. (iiProvide probabilistic approaches to elitism and diversification in multiobjective evolutionary algorithms. Finally, The behavior of the resulting Probabilistic Multi-objective Evolutionary Algorithms (PrMOEAs is empirically investigated on the multi-objective stochastic VRP problem.

  19. Solving Vehicle Routing with Full Container Load and Time Windows

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander; Spoorendonk, Simon; Pisinger, David

    2012-01-01

    A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import...

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

    Indian Academy of Sciences (India)

    Pinar Kirci

    PINAR KIRCI. Engineering Sciences Department, Istanbul University, Istanbul, Turkey .... In VRP solution methods, tabu search algorithm belongs to ..... systems which are considered in statistical mechanics is ..... Procedia-Social Behav. Sci.

  1. Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

    Science.gov (United States)

    2015-09-03

    similar mathematical foundation to enable gradient descent methods for discrete combinatorial optimization problems. We are also generalizing our prior...research has exploited statistical and mathematical properties of elementary landscapes to develop new gradient methods for combinatorial optimization... mathematically methods to more automatically identify elementary landscapes. If a combinatorial optimization problem is a superposition of elemen

  2. Capacitated Vehicle Routing with Non-Uniform Speeds

    DEFF Research Database (Denmark)

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

    2011-01-01

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

  3. An overview of smart grid routing algorithms

    Science.gov (United States)

    Wang, Junsheng; OU, Qinghai; Shen, Haijuan

    2017-08-01

    This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

  4. Abandoned vehicles

    CERN Multimedia

    Relations with the Host States Service

    2004-01-01

    The services in charge of managing the CERN site have recently noted an increase in the number of abandoned vehicles. This poses a risk from the point of view of safety and security and, on the eve of several important events in honour of CERN's fiftieth anniversary, is detrimental to the Organization's image. Owners of vehicles that have been left immobile for some time on the CERN site, including on the external car park by the flags, are therefore invited to contact the Reception and Access Control Service (service-parking-longterm@cern.ch) before 1st October 2004 and, where appropriate, move their vehicle to a designated long-term parking area. After this date, any vehicle whose owner has failed to respond to this request and which is without a number plate, has been stationary for several weeks or is out of service, may be impounded at the owner's risk and expense. Relations with the Host States Service Tel. 72848

  5. Vertex routing models

    International Nuclear Information System (INIS)

    Markovic, D; Gros, C

    2009-01-01

    A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed by cyclic attractors, allowing to define a measure for the information centrality of a vertex given by the number of attractors passing through this vertex. We find the number of vertices having a nonzero information centrality to be extensive/subextensive for models with/without a memory trace in the thermodynamic limit. We evaluate the distribution of the number of cycles, of the cycle length and of the maximal basins of attraction, finding a complete scaling collapse in the thermodynamic limit for the latter. Possible implications of our results for the information flow in social networks are discussed.

  6. 50 CFR 27.31 - General provisions regarding vehicles.

    Science.gov (United States)

    2010-10-01

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

  7. Online prediction of battery electric vehicle energy consumption

    NARCIS (Netherlands)

    Wang, Jiquan; Besselink, Igo; Nijmeijer, Henk

    2016-01-01

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

  8. Route planning of separate waste collection on a small settlement

    Directory of Open Access Journals (Sweden)

    Bogna MRÓWCZYŃSKA

    2014-03-01

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

  9. Southern states' routing agency report

    International Nuclear Information System (INIS)

    1989-02-01

    The Southern states' routing agency report is a compendium of 16-southern states' routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

  10. Southern States' Routing Agency Report

    International Nuclear Information System (INIS)

    1990-03-01

    The Southern States' Routing Agency Report is a compendium of 16-southern states' routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

  11. Connected vehicle applications : safety.

    Science.gov (United States)

    2016-01-01

    Connected vehicle safety applications are designed to increase situational awareness : and reduce or eliminate crashes through vehicle-to-infrastructure, vehicle-to-vehicle, : and vehicle-to-pedestrian data transmissions. Applications support advisor...

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

    Science.gov (United States)

    Wang, Yong; Zhou, Heng; Wang, Ying

    2017-08-01

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

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

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

  15. Issues of using Longer Heavier Vehicles on Roads

    Science.gov (United States)

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

    2018-03-01

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

  16. Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles

    OpenAIRE

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

    2016-01-01

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

  17. RESOLUCIÓN DEL PROBLEMA DE ENRUTAMIENTO DE VEHÍCULOS CON LIMITACIONES DE CAPACIDAD UTILIZANDO UN PROCEDIMIENTO METAHEURÍSTICO DE DOS FASES RESOLUÇÃO DO PROBLEMA DE ROTEAMENTO DE VEÍCULOS COM LIMITAÇÕES DE CAPACIDADE UTILIZANDO UM PROCEDIMENTO METAHEURÍSTICO DE DUAS FASES SOLVING THE CAPACITATED VEHICLE ROUTING PROBLEM USING A TWOPHASE METAHEURISTIC PROCEDURE

    Directory of Open Access Journals (Sweden)

    Julio Mario Daza

    2009-12-01

    significativos ao se comparar com as heurísticas avaliadas.This paper presents an alternative procedure to solve the Capacitated Vehicle Routing Problem (CVRP with homogeneous fleet. The paper proposes a two-phase metaheuristic algorithm: routes design and fleet scheduling. The first phase is based on heuristics and metaheuristics procedures in order to build an initial solution that is then improved using tabu search to obtain non-dominated solutions in polynomial computational time. For the second phase, corresponding to fleet scheduling, the problem is approached using an analogy with the identical parallel machine scheduling problem. This procedure looks for the minimization of the fixed cost of using installed capacity as the objective function. The proposed procedure was tested using both a random-generated instance and real data, giving competitive results in comparison with other heuristics tested.

  18. Route-external and route-internal landmarks in route descriptions : Effects of route length and map design

    NARCIS (Netherlands)

    Westerbeek, Hans; Maes, Alfons

    2013-01-01

    Landmarks are basic ingredients in route descriptions. They often mark choice points: locations where travellers choose from different options how to continue the route. This study focuses on one of the loose ends in the taxonomy of landmarks. In a memory-based production experiment in which

  19. Perception bias in route choice

    NARCIS (Netherlands)

    Vreeswijk, Jacob Dirk; Thomas, Tom; van Berkum, Eric C.; van Arem, Bart

    2014-01-01

    Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against

  20. Modeling a four-layer location-routing problem

    Directory of Open Access Journals (Sweden)

    Mohsen Hamidi

    2012-01-01

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

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

    International Nuclear Information System (INIS)

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

    2001-01-01

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

  2. electric vehicle

    Directory of Open Access Journals (Sweden)

    W. R. Lee

    1999-01-01

    Full Text Available A major problem facing battery-powered electric vehicles is in their batteries: weight and charge capacity. Thus, a battery-powered electric vehicle only has a short driving range. To travel for a longer distance, the batteries are required to be recharged frequently. In this paper, we construct a model for a battery-powered electric vehicle, in which driving strategy is to be obtained such that the total travelling time between two locations is minimized. The problem is formulated as an optimization problem with switching times and speed as decision variables. This is an unconventional optimization problem. However, by using the control parametrization enhancing technique (CPET, it is shown that this unconventional optimization is equivalent to a conventional optimal parameter selection problem. Numerical examples are solved using the proposed method.

  3. Electric-Drive Vehicles

    Energy Technology Data Exchange (ETDEWEB)

    Septon, Kendall K [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

    2017-09-11

    Electric-drive vehicles use electricity as their primary fuel or to improve the efficiency of conventional vehicle designs. These vehicles can be divided into three categories: Hybrid electric vehicles (HEVs), Plug-in hybrid electric vehicles (PHEVs), All-electric vehicles (EVs). Together, PHEVs and EVs can also be referred to as plug-in electric vehicles (PEVs).

  4. Electric-Drive Vehicles

    Energy Technology Data Exchange (ETDEWEB)

    None

    2017-09-01

    Electric-drive vehicles use electricity as their primary fuel or to improve the efficiency of conventional vehicle designs. These vehicles can be divided into three categories: Hybrid electric vehicles (HEVs), Plug-in hybrid electric vehicles (PHEVs), All-electric vehicles (EVs). Together, PHEVs and EVs can also be referred to as plug-in electric vehicles (PEVs).

  5. Location-routing Problem with Fuzzy time windows and Traffic time

    Directory of Open Access Journals (Sweden)

    Shima Teimoori

    2014-05-01

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

  6. Road Routes for Waste Disposal - MDC_RecyclingRoute

    Data.gov (United States)

    NSGIC Local Govt | GIS Inventory — This CURBSIDE RECYCLING ROUTES BOUNDARIES LAYER IS A polygon feature class created for the Miami-Dade Department of Solid Waste Management (DSWM). It contains the...

  7. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    National Research Council Canada - National Science Library

    Lu, Qingsong; George, Betsy; Shekhar, Shashi

    2006-01-01

    .... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

  8. Pheromone based alternative route planning

    Directory of Open Access Journals (Sweden)

    Liangbing Feng

    2016-08-01

    Full Text Available In this work, we propose an improved alternative route calculation based on alternative figures, which is suitable for practical environments. The improvement is based on the fact that the main traffic route is the road network skeleton in a city. Our approach using nodes may generate a higher possibility of overlapping. We employ a bidirectional Dijkstra algorithm to search the route. To measure the quality of an Alternative Figures (AG, three quotas are proposed. The experiment results indicate that the improved algorithm proposed in this paper is more effective than others.

  9. Route planning algorithms: Planific@ Project

    Directory of Open Access Journals (Sweden)

    Gonzalo Martín Ortega

    2009-12-01

    Full Text Available Planific@ is a route planning project for the city of Madrid (Spain. Its main aim is to develop an intelligence system capable of routing people from one place in the city to any other using the public transport. In order to do this, it is necessary to take into account such things as: time, traffic, user preferences, etc. Before beginning to design the project is necessary to make a comprehensive study of the variety of main known route planning algorithms suitable to be used in this project.

  10. Port Authority of Allegheny County Transit Routes

    Data.gov (United States)

    Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Shapefile of Transit Routes - Please refer to each resource for active dates of the route information. Routes change over time,

  11. VT Route Log Points 2017

    Data.gov (United States)

    Vermont Center for Geographic Information — This data layer is used with VTrans' Integrated Route Log System (IRA). It is also used to calibrate the linear referencing systems, including the End-to-End and...

  12. Predicting Catastrophic BGP Routing Instabilities

    National Research Council Canada - National Science Library

    Nguyen, Lien

    2004-01-01

    .... Currently, this critical function is performed by the Border Gateway Protocol (BGP) version 4 RF01771. Like all routing protocols, BGP is vulnerable to instabilities that reduce its effectiveness...

  13. New TPG bus route 28

    CERN Multimedia

    2003-01-01

    Geneva's Public Transport services (TPG) have recently inaugurated a new bus line 28, connecting the La Tour Hospital in Meyrin to the international organisations in Geneva, via the airport. All signs associated with this route will be yellow in colour. Timetables and route details can be found at http://www.tpg.ch. Relations with the Host States Service http://www.cern.ch/relations/ Tel. 72848

  14. In-Vehicle Information Systems

    Directory of Open Access Journals (Sweden)

    Gordana Štefančić

    2012-10-01

    Full Text Available The work considers different information systems, includingthe infonnation ~ystems with autonomous units, whichcany all their intelligence around with them, and those withcommunicating units, which infonn the motorist about the currentsituation of the road system by radio or other means. Thesymbols of various messages have three main objectives: to provideinstruction, to warn of oncoming dange1~ or to give adviceregarding parking or looking for altemative routes. When notused for these pwposes, they are used to provide general informationabout the weathe1~ temperature or possible attractions.The in-vehicle information systems fly to assist the motorist indriving, and they are promoted as part of the comprehensive intelligenttransport system.

  15. Vehicle Controller

    Science.gov (United States)

    1985-01-01

    UNISTICK is an airplane-like joystick being developed by Johnson Engineering under NASA and VA sponsorship. It allows a driver to control a vehicle with one hand, and is based upon technology developed for the Apollo Lunar Landings of the 1970's. It allows severely handicapped drivers to operate an automobile or van easily. The system is expected to be in production by March 1986.

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

    OpenAIRE

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

    2015-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-07-31

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-07-13

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

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

  20. System and method of vehicle operating condition management

    Science.gov (United States)

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

    2015-10-20

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

  1. Privacy preservation and authentication on secure geographical routing in VANET

    Science.gov (United States)

    Punitha, A.; Manickam, J. Martin Leo

    2017-05-01

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

  2. Solving Inventory Routing Problems Using Location Based Heuristics

    Directory of Open Access Journals (Sweden)

    Paweł Hanczar

    2014-01-01

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

  3. Evaluation of connected vehicle impact on mobility and mode choice

    Directory of Open Access Journals (Sweden)

    Simon Minelli

    2015-10-01

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

  4. Route Flap Damping Made Usable

    Science.gov (United States)

    Pelsser, Cristel; Maennel, Olaf; Mohapatra, Pradosh; Bush, Randy; Patel, Keyur

    The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

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

    Science.gov (United States)

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

    2008-05-01

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

  6. Eco-routing: More green drivers means more benefits?

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-07-01

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

  7. Optimization of location routing inventory problem with transshipment

    Science.gov (United States)

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

    2015-05-01

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

  8. Multidepot UAV Routing Problem with Weapon Configuration and Time Window

    Directory of Open Access Journals (Sweden)

    Tianren Zhou

    2018-01-01

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

  9. In-vehicle nitrogen dioxide concentrations in road tunnels

    Science.gov (United States)

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

    2016-11-01

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

  10. Connected vehicle application : safety.

    Science.gov (United States)

    2015-01-01

    Connected vehicle safety applications are designed to increase situational awareness : and reduce or eliminate crashes through vehicle-to-infrastructure (V2I), vehicle-to-vehicle (V2V), and vehicle-to-pedestrian (V2P) data transmissions. Applications...

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

    Science.gov (United States)

    Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

    2017-01-01

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

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

  13. Overview: Routes to Open Access

    OpenAIRE

    Tullney, Marco; van Wezenbeek, Wilma

    2017-01-01

    Slides of an overview presentation given at a CESAER workshop on Open Access, February 2nd, 2017, in Brussels Cover major routes to more open access as discussed in the Task Force Open Science of CESAER: (national) open access strategies open access mandates open access incentives open access awareness open access publishing open access infrastructure

  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. Emissions allocation in transportation routes

    NARCIS (Netherlands)

    Leenders, B.P.J.; Velázquez Martínez, J.; Fransoo, J.C.

    2017-01-01

    This article studies the allocation of CO2 emissions to a specific shipment in routing transportation. The authors show that this problem differs from a cost allocation problem specifically because the concavity condition does not hold necessarily in the CO2 allocation problem. This implies that a

  16. Roots/Routes: Part I

    Science.gov (United States)

    Swanson, Dalene M.

    2009-01-01

    This narrative and poetic rendering acts as an articulation of a journey of many routes. It is a storying of critical research issues and events as performances of lived experience. It is a metissage of hybrid, but interrelated, themes that find cohesion through fragmentation and coalescence, severance, and regrowth. These themes are invoked by…

  17. Roots/Routes: Part II

    Science.gov (United States)

    Swanson, Dalene M.

    2009-01-01

    This narrative acts as an articulation of a journey of many routes. Following Part I of the same research journey of rootedness/routedness, it debates the nature of transformation and transcendence beyond personal and political paradoxes informed by neoliberalism and related repressive globalizing discourses. Through a more personal, descriptive,…

  18. On The Problem of Constructing Routes, Part I: Preface

    Directory of Open Access Journals (Sweden)

    Gertsbakh Ilya B.

    2017-09-01

    Full Text Available This is a preface of the translation of the 1967 paper by Linis and Maksim, “On the problem of constructing routes” (in Russian (in the Proceedings of the Institute of Civil Aviation Engineering, Issue 102, pp. 36-45. It marks 50-year to the deficit function (DF model initially developed in this 1967 work; the DF model then paved the way to further research of vehicle-fleet management in terms of optimal routing and scheduling. The merit of this translation is to describe the roots of the DF modelling to enable further studies to emerge with more contributions.

  19. Performance Evaluation of AODV Routing Protocol in VANET with NS2

    Directory of Open Access Journals (Sweden)

    Divya Rathi

    2017-03-01

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

  20. Connected vehicles and cybersecurity.

    Science.gov (United States)

    2016-01-01

    Connected vehicles are a next-generation technology in vehicles and in infrastructure that will make travel safer, cleaner, and more efficient. The advanced wireless technology enables vehicles to share and communicate information with each other and...

  1. Route Optimization for the Distribution Network of a Confectionary Chain

    Directory of Open Access Journals (Sweden)

    Anıl İnanlı

    2015-12-01

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

  2. Development of an Autonomous Vehicle for Weed and Crop Registration

    DEFF Research Database (Denmark)

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

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

  3. Intelligent Shuttle Management and Routing Algorithm

    Science.gov (United States)

    Thomas, Toshen M.; Subashanthini, S.

    2017-11-01

    Nowadays, most of the big Universities and campuses have Shuttle cabs running in them to cater the transportational needs of the students and faculties. While some shuttle services ask for a meagre sum to be paid for the usage, no digital payment system is onboard these vehicles to go truly cashless. Even more troublesome is the fact that sometimes during the day, some of these cabs run with bare number of passengers, which can result in unwanted budget loss to the shuttle operator. The main purpose of this paper is to create a system with two types of applications: A web portal and an Android app, to digitize the Shuttle cab industry. This system can be used for digital cashless payment feature, tracking passengers, tracking cabs and more importantly, manage the number of shuttle cabs in every route to maximize profit. This project is built upon an ASP.NET website connected to a cloud service along with an Android app that tracks and reads the passengers ID using an attached barcode reader along with the current GPS coordinates, and sends these data to the cloud for processing using the phone’s internet connectivity.

  4. Distribution Route Planning of Clean Coal Based on Nearest Insertion Method

    Science.gov (United States)

    Wang, Yunrui

    2018-01-01

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

  5. Technical Report: Sleep-Route - Routing through Sleeping Sensors

    OpenAIRE

    Sarkar, Chayan; Rao, Vijay S.; Prasad, R. Venkatesha

    2014-01-01

    In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among ...

  6. Route Scherrer and Route Einstein closed for construction work

    CERN Multimedia

    2015-01-01

    Please note that Route Scherrer will be inaccessible for two and a half months from the beginning of March and that part of Route Einstein will be closed for two weeks from the end of February.   Figure 1. The part of Route Scherrer between Building 510 and Building 53 (see Figure 1) will be closed from the beginning of March until mid-May for civil engineering works.   The superheated water pipes supplying the buildings in this area date back to 1959 and therefore present a significant risk of leakage. In order to ensure the reliable supply of superheated water, and, by extension, heating, to all premises near the Main Building (i.e. Buildings 500, 501, 503, 60, 62, 63 and 64), a new buried service duct will be installed between the basements of Buildings 53 and 61 to house a new superheated water pipe. Figure 2. The following car parks will, however, remain accessible for the duration of the works: the Cèdres car park, the car park for Buildings 4 and 5, and the ca...

  7. Highway route controlled quantity shipment routing reports - An overview

    International Nuclear Information System (INIS)

    Cashwell, J.W.; Welles, B.W.; Welch, M.J.

    1989-01-01

    US Department of Transportation (DOT) regulations require a postnotification report from the shipper for all shipments of radioactive materials categorized as a Highway Route Controlled Quantity. These postnotification reports, filed in compliance with 49 CFR 172.203(d), have been compiled by the DOT in a database known as the Radioactive Materials Routing Report (RAMRT) since 1982. The data were sorted by each of its elements to establish historical records and trends of Highway Route Controlled Quantity shipments from 1982 through 1987. Approximately 1520 records in the RAMRT database were compiled for this analysis. Approximately half of the shipments reported for the study period were from the US Department of Energy (DOE) and its contractors, with the others being commercial movements. Two DOE installations, EG and G Idaho and Oak Ridge, accounted for nearly half of the DOE activities. Similarly, almost half of the commercial movements were reported by two vendors, Nuclear Assurance Corporation and Transnuclear, Incorporated. Spent fuel from power and research reactors accounted for approximately half of all shipments

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

    Science.gov (United States)

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

    2013-02-07

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

  9. Vehicle Development Laboratory

    Data.gov (United States)

    Federal Laboratory Consortium — FUNCTION: Supports the development of prototype deployment platform vehicles for offboard countermeasure systems.DESCRIPTION: The Vehicle Development Laboratory is...

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

    DEFF Research Database (Denmark)

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

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

  11. Mobility in Turkey. Electric Vehicles

    Energy Technology Data Exchange (ETDEWEB)

    Yazgan, M. [Embassy of the Kingdom of the Netherlands, Turan Gunes Bulvari, Hollanda Caddesi, No.5,06550 Yildiz-Ankara (Turkey)

    2013-01-15

    The purpose of this report is to provide information about electric vehicles (EVs) and e-mobility as an emerging market in Turkey. EVs receive attention from the Turkish government for a number of reasons: Turkey has a strong automotive industry and needs to follow the technological developments taking place regarding intelligent vehicles and intelligent transport systems, as well as electric transportation technologies. Secondly, a considerable amount of carbon emissions from motor vehicles is of great concern in relation to climate change. EVs might be an alternative which can break the dependence of Turkey on imported fuel that has a negative influence on its current account deficit (CAD). On top of these factors, the Prime Minister of Turkey has a desire to have a 'Local Brand Vehicle' before the 100th year of the establishment of the Republic in 2023 and preferably an 'EV'. EVs are included in the strategy documents and action plans of almost all ministries and public institutions. Among all ministries, the Ministry of Science, Industry and Technology (MoSI and T) takes a leading position. It holds bi-annual meetings with stakeholders to monitor and evaluate progress about the level of actualization of the identified policies on e-mobility. MoSI and T's related institution of the Scientific and Technological Research Council of Turkey (TUBITAK) co-ordinates the R and D activities and provides generous R and D incentives. EVs have been put on sale in Turkey in 2012 and are still very limited in number. Public institutions are taking the lead by converting their vehicle fleet to EVs. EVs are also more suitable for businesses/ duties with a fixed/short route; therefore it is expected that the growth of the sector will mainly come from the vehicle fleet of the public organisations and institutions, followed by the private vehicle fleet of companies, e.g. freight companies. Although there are some on-going test drives, it is not yet proven

  12. A Sociability-Based Routing Scheme for Delay-Tolerant Networks

    Directory of Open Access Journals (Sweden)

    Fabbri Flavio

    2011-01-01

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

  13. New routes of allergen immunotherapy.

    Science.gov (United States)

    Aricigil, Mitat; Muluk, Nuray Bayar; Sakarya, Engin Umut; Sakalar, Emine Güven; Senturk, Mehmet; Reisacher, William R; Cingi, Cemal

    2016-11-01

    Allergen immunotherapy is the only cure for immunoglobulin E mediated type I respiratory allergies. Subcutaneous immunotherapy (SCIT) and sublingual immunotherapy (SLIT) are the most common treatments. In this article, we reviewed new routes of allergen immunotherapy. Data on alternative routes to allow intralymphatic immunotherapy (ILIT), epicutaneous immunotherapy (EPIT), local nasal immunotherapy (LNIT), oral immunotherapy (OIT), and oral mucosal immunotherapy (OMIT) were gathered from the literature and were discussed. ILIT features direct injection of allergens into lymph nodes. ILIT may be clinically effective after only a few injections and induces allergen-specific immunoglobulin G, similarly to SCIT. A limitation of ILIT is that intralymphatic injections are required. EPIT features allergen administration by using patches mounted on the skin. EPIT seeks to target epidermal antigen-presenting Langerhans cells rather than mast cells or the vasculature; this should reduce both local and systemic adverse effects. LNIT involves the spraying of allergen extracts into the nasal cavity. Natural or chemically modified allergens (the latter, termed allergoids, lack immunoglobulin E reactivity) are prepared in a soluble form. OIT involves the regular administration of small amounts of a food allergen by mouth and commences with low oral doses, which are then increased as tolerance develops. OMIT seeks to deliver allergenic proteins to an expanded population of Langerhans cells in the mucosa of the oral cavity. ILIT, EPIT, LNIT, OIT, and OMIT are new routes for allergen immunotherapy. They are safe and effective.

  14. Cultural Routes and Intangible Heritage

    Directory of Open Access Journals (Sweden)

    Enza Zabbini

    2012-08-01

    Full Text Available The theoretical interpretation of thematic routes helps to predict the effects on the territories visited by cultured tourists who want to enrich their cultural and emotional baggage. After the analysis of some interpretations, this paper will examine how the practical implementation of an itinerary approved by the Council of Europe has evolved over the years. And it will also reflect on the practical results in the areas involved in that project. "The Hannibal Pathway ", the main overland walk on the "Phoenician Route - Cultural Route recognized by the Council of Europe" – represents a case of study that allows to reflect over the impact of cultural tourism based on immaterial heritage. In fact, in the areas where the battle of 21 June 217 BC took place, nothing tangible is left, except the landscape that has kept its conformation intact. In these areas, thanks to the foresight of the local governments in the last three decades, the landscape of the plain has been preserved. This makes possible today to propose an historical path precisely based on the landscape and on the new techniques for the valorization of the heritage. In the Tuoro plain it is possible to see the battlefields, thus retracing the various stages of the battle, supported by the Documentation Centre of the Capra Palace and virtual reconstructions of high technical quality.

  15. Routing Data Authentication in Wireless Networks; TOPICAL

    International Nuclear Information System (INIS)

    TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

    2001-01-01

    In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures

  16. Is Entrepreneurship a Route Out of Deprivation?

    DEFF Research Database (Denmark)

    Frankish, Julian S.; Roberts, Richard G.; Coad, Alexander Jean-Luc

    2014-01-01

    Frankish J. S., Roberts R. G., Coad A. and Storey D. J. Is entrepreneurship a route out of deprivation?, Regional Studies. This paper investigates whether entrepreneurship constitutes a route out of deprivation for those living in deprived areas. The measure of income/wealth used is based...... the wealth distribution. Hence, entrepreneurship can be a route out of deprivation....

  17. Electric and hybrid vehicles

    Science.gov (United States)

    1979-01-01

    Report characterizes state-of-the-art electric and hybrid (combined electric and heat engine) vehicles. Performance data for representative number of these vehicles were obtained from track and dynamometer tests. User experience information was obtained from fleet operators and individual owners of electric vehicles. Data on performance and physical characteristics of large number of vehicles were obtained from manufacturers and available literature.

  18. Maglev guideway route alignment and right-of-way requirements

    Science.gov (United States)

    Carlton, S.; Andriola, T.

    1992-12-01

    The use of existing rights-of-way (ROW) is assessed for maglev systems by estimating trip times and land acquisition requirements for potential maglev corridors while meeting passenger comfort limits. Right-of-way excursions improve trip time but incur a cost for purchasing land. The final report documents findings of the eight tasks in establishing right-of-way feasibility by examining three city-pair corridors in detail and developing an approximation method for estimating route length and travel times in 20 additional city-pair corridor portions and 21 new corridors. The use of routes independent of existing railroad or highway right-of-way have trip time advantages and significantly reduce the need for aggressive guideway geometries on intercity corridors. Selection of the appropriate alignment is determined by many corridor specific issues. Use of existing intercity rights-of-way may be appropriate for parts of routes on a corridor-specific basis and for urban penetration where vehicle speeds are likely to be reduced by policy due to noise and safety considerations, and where land acquisition costs are high. Detailed aspects of available rights-of-way, land acquisition costs, geotechnical issues, land use, and population centers must be examined in more detail on a specific corridor basis before the proper or best maglev alignment can be chosen.

  19. Enhanced ant colony optimization for inventory routing problem

    Science.gov (United States)

    Wong, Lily; Moin, Noor Hasnah

    2015-10-01

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

  20. Cognitive Routing in Software-Defined Underwater Acoustic Networks

    Directory of Open Access Journals (Sweden)

    Huma Ghafoor

    2017-12-01

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

  1. Reliable Freestanding Position-Based Routing in Highway Scenarios

    Science.gov (United States)

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

    2012-01-01

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

  2. The Silk Route from Land to Sea

    Directory of Open Access Journals (Sweden)

    Jack Weatherford

    2018-04-01

    Full Text Available The Silk Route reached its historic and economic apogee under the Mongol Empire (1207–1368, as a direct result of the policies of Chinggis Khan (Genghis Khan and his successors. Because the land network proved inefficient for the amount of goods needing transport from one part of the empire to another, the Mongols expanded the Silk Route to ocean shipping and thus created the first Maritime Silk Route. The sea traffic initially expanded the land routes but soon strangled them. With the expansion of the Maritime Silk Route through the fourteenth century, the land connections reverted to local networks and lost their global importance.

  3. Vehicle Based Vector Sensor

    Science.gov (United States)

    2015-09-28

    buoyant underwater vehicle with an interior space in which a length of said underwater vehicle is equal to one tenth of the acoustic wavelength...underwater vehicle with an interior space in which a length of said underwater vehicle is equal to one tenth of the acoustic wavelength; an...unmanned underwater vehicle that can function as an acoustic vector sensor. (2) Description of the Prior Art [0004] It is known that a propagating

  4. Application Of Kalman Filter In Navigation Process Of Automated Guided Vehicles

    Directory of Open Access Journals (Sweden)

    Śmieszek Mirosław

    2015-09-01

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

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

    International Nuclear Information System (INIS)

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

    1998-03-01

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

  6. Optimization of Parking Public Transport Vehicles in Ostrava

    Directory of Open Access Journals (Sweden)

    Dušan Teichmann

    2015-03-01

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-01-15

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

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

    KAUST Repository

    Bader, Ahmed

    2016-02-26

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

  10. GIS-BASED ROUTE FINDING USING ANT COLONY OPTIMIZATION AND URBAN TRAFFIC DATA FROM DIFFERENT SOURCES

    Directory of Open Access Journals (Sweden)

    M. Davoodi

    2015-12-01

    Full Text Available Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD, Automatic Number Plate Recognition (ANPR, Floating Car Data (FCD, VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

  11. Gis-Based Route Finding Using ANT Colony Optimization and Urban Traffic Data from Different Sources

    Science.gov (United States)

    Davoodi, M.; Mesgari, M. S.

    2015-12-01

    Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD), Automatic Number Plate Recognition (ANPR), Floating Car Data (FCD), VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network) is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

  12. Novel routes to nanodispersed semiconductors

    International Nuclear Information System (INIS)

    Green, M.A.

    1999-01-01

    Novel synthetic routes to nanodispersed compound semiconductors using organometallic precursors have been developed. The quantum dots have been studied by optical absorption spectroscopy, photoluminescence spectroscopy, transmission electron microscopy, high resolution transmission electron microscopy, infra red spectroscopy and nuclear magnetic resonance. Polar Lewis base solvents such as tri-n-octylphosphine oxide and 4-ethylpyridine were utilized as both passivating agent and dispersing medium. In the the search for new solvent systems and passivating agents, and investigation was also made into the use of dimethyl sulfoxide as a reaction solvent and capping agent in the preparation of nanocrystalline CdS. Existing routes using metal alkyls and silylated precursors in hot TOPO were improved by substituting the metal alkyl with an metal alkyl adduct. Cadmium monothiocarbamate and a related precursor, cadmium thioacetate were investigated as possible single source precursors to nanometer sized CdS. The thermolysis of diorganophosphides in the Lewis bases coordinating solvent (4-ethylpridine) has been investigated, including studies of decompositon mechanisms, and quantum dots of Cd 3 P 2 , Zn 3 P 2 , Inp and GaP have been prepared. The synthesis of InAs using the metal chloride and an aminoarsenide precursor in 4-ethylpridine has also been developed. A simple method for the organization of III-V materials into glass like aggregates has been described. (author)

  13. Load Balancing Routing with Bounded Stretch

    Directory of Open Access Journals (Sweden)

    Chen Siyuan

    2010-01-01

    Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

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

    Directory of Open Access Journals (Sweden)

    Prajakta Desai

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

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

    Science.gov (United States)

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

    2017-01-01

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

  16. Zone routing in a torus network

    Science.gov (United States)

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

    A system for routing data in a network comprising a network logic device at a sending node for determining a path between the sending node and a receiving node, wherein the network logic device sets one or more selection bits and one or more hint bits within the data packet, a control register for storing one or more masks, wherein the network logic device uses the one or more selection bits to select a mask from the control register and the network logic device applies the selected mask to the hint bits to restrict routing of the data packet to one or more routing directions for the data packet within the network and selects one of the restricted routing directions from the one or more routing directions and sends the data packet along a link in the selected routing direction toward the receiving node.

  17. Predicting transportation routes for radioactive wastes

    International Nuclear Information System (INIS)

    Joy, D.S.; Johnson, P.E.; Clarke, D.B.; McGuire, S.C.

    1981-01-01

    Oak Ridge National Laboratory (ORNL) has been involved in transportation logistics of radioactive wastes as part of the overall waste transportation program. A Spent Fuel Logistics Model (SFLM), was developed to predict overall material balances representing the flow of spent fuel assemblies from reactors to away-from-reactor storage facilities and/or to federal repositories. The transportation requirements to make these shipments are also itemized. The next logical step in the overall transportation project was the development of a set of computer codes which would predict likely transportation routes for waste shipments. Two separate routing models are now operational at ORNL. Routes for truck transport can be estimated with the HIGHWAY program, and rail and barge routes can be predicted with the INTERLINE model. This paper discusses examples of the route estimates and applications of the routing models

  18. Risk assessment of alternative proliferation routes

    International Nuclear Information System (INIS)

    Ahmed, S.; Husseiny, A.A.

    1982-01-01

    Multi-Attribute Decision Theory is applied to rank II alternative routes to nuclear proliferation in order of difficulty in acquiring nuclear weapons by nonnuclear countries. The method is based on reducing the various variables affecting the decision to a single function providing a measure for the proliferation route. The results indicate that the most difficult route to obtain atomic weapons is through nuclear power reactors, specifically the liquid-metal fast breeder reactor, heavy water Canada deuterium uranium reactor, and light water reactors such as boiling water and pressurized water reactors. The easiest routes are supercritical centrifuge isotope separation, laser isotope separation, and research reactor. However, nonnuclear routes available that result in substantial damage to life and property are easier than any nuclear route

  19. Sinkhole Avoidance Routing in Wireless Sensor Networks

    Science.gov (United States)

    2011-05-09

    COVERED (From- To) 09-05-2011 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Sinkhole Avoidance Routing in Wireless Sensor Networks 5b . GRANT NUMBER . 5c...reliability of wireless sensor networks. 15. SUBJECT TERMS wireless sensor networks, sinkhole attack, routing protocol 16. SECURITY CLASSIFICATION...Include area code) Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std . Z39.18 1 Sinkhole Avoidance Routing in Wireless Sensor Networks MIDN 1/C

  20. A joint routing and speed optimization problem

    OpenAIRE

    Fukasawa, Ricardo; He, Qie; Santos, Fernando; Song, Yongjia

    2016-01-01

    Fuel cost contributes to a significant portion of operating cost in cargo transportation. Though classic routing models usually treat fuel cost as input data, fuel consumption heavily depends on the travel speed, which has led to the study of optimizing speeds over a given fixed route. In this paper, we propose a joint routing and speed optimization problem to minimize the total cost, which includes the fuel consumption cost. The only assumption made on the dependence between the fuel cost an...

  1. Bridge vehicle impact assessment.

    Science.gov (United States)

    2011-12-01

    Bridges in New York State have been experiencing close to 200 bridge hits a year. These : accidents are attributed to numerous factors including: improperly stored equipment on trucks; : violation of vehicle posting signs; illegal commercial vehicles...

  2. The Electric Vehicle Development

    DEFF Research Database (Denmark)

    Wang, Jingyu; Liu, Yingqi; Kokko, Ari

    2014-01-01

    In order to respond to the energy crisis and environment problem, countries carry out their research and promotion about electric vehicles. As the ten cities one thousand new energy buses started in 2009, the new energy vehicles have been greatly developed in China, while the development...... in three aspects-city environment, government and stakeholders. Then the paper discusses the promotion ways and role of government and consumer. Finally, the paper offers some suggestions to promote electric vehicles in China: focusing on feasibility and adaptability of electric vehicles, playing...... of electric vehicles is not that good. This paper selects four cities-Los Angeles, Kanagawa, Hamburg, Amsterdam-that promote electric vehicles successfully and deeply analyzes the development of electric vehicles in these four cities and analyzes the factors that affect the development of electric vehicles...

  3. Energy harvesting water vehicle

    KAUST Repository

    Singh, Devendra

    2018-01-01

    An efficient energy harvesting (EEH) water vehicle is disclosed. The base of the EEH water vehicle is fabricated with rolling cylindrical drums that can rotate freely in the same direction of the water medium. The drums reduce the drag

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

  5. Autonomous vehicles: from paradigms to technology

    Science.gov (United States)

    Ionita, Silviu

    2017-10-01

    Mobility is a basic necessity of contemporary society and it is a key factor in global economic development. The basic requirements for the transport of people and goods are: safety and duration of travel, but also a number of additional criteria are very important: energy saving, pollution, passenger comfort. Due to advances in hardware and software, automation has penetrated massively in transport systems both on infrastructure and on vehicles, but man is still the key element in vehicle driving. However, the classic concept of ‘human-in-the-loop’ in terms of ‘hands on’ in driving the cars is competing aside from the self-driving startups working towards so-called ‘Level 4 autonomy’, which is defined as “a self-driving system that does not requires human intervention in most scenarios”. In this paper, a conceptual synthesis of the autonomous vehicle issue is made in connection with the artificial intelligence paradigm. It presents a classification of the tasks that take place during the driving of the vehicle and its modeling from the perspective of traditional control engineering and artificial intelligence. The issue of autonomous vehicle management is addressed on three levels: navigation, movement in traffic, respectively effective maneuver and vehicle dynamics control. Each level is then described in terms of specific tasks, such as: route selection, planning and reconfiguration, recognition of traffic signs and reaction to signaling and traffic events, as well as control of effective speed, distance and direction. The approach will lead to a better understanding of the way technology is moving when talking about autonomous cars, smart/intelligent cars or intelligent transport systems. Keywords: self-driving vehicle, artificial intelligence, deep learning, intelligent transport systems.

  6. Aircraft route forecasting under adverse weather conditions

    Directory of Open Access Journals (Sweden)

    Thomas Hauf

    2017-04-01

    Full Text Available In this paper storm nowcasts in the terminal manoeuvring area (TMA of Hong Kong International Airport are used to forecast deviation routes through a field of storms for arriving and departing aircraft. Storms were observed and nowcast by the nowcast system SWIRLS from the Hong Kong Observatory. Storms were considered as no-go zones for aircraft and deviation routes were determined with the DIVSIM software package. Two days (21 and 22 May 2011 with 22 actual flown routes were investigated. Flights were simulated with a nowcast issued at the time an aircraft entered the TMA or departed from the airport. These flights were compared with a posteriori simulations, in which all storm fields were known and circumnavigated. Both types of simulated routes were then compared with the actual flown routes. The qualitative comparison of the various routes revealed generally good agreement. Larger differences were found in more complex situations with many active storms in the TMA. Route differences resulted primarily from air traffic control measures imposed such as holdings, slow-downs and shortcuts, causing the largest differences between the estimated and actual landing time. Route differences could be enhanced as aircraft might be forced to circumnavigate a storm ahead in a different sense. The use of route forecasts to assist controllers coordinating flights in a complex moving storm field is discussed. The study emphasises the important application of storm nowcasts in aviation meteorology.

  7. A Machine Learning Concept for DTN Routing

    Science.gov (United States)

    Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

    2017-01-01

    This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.

  8. New Hybrid Route to Biomimetic Synthesis

    National Research Council Canada - National Science Library

    Morse, Daniel

    2003-01-01

    To develop economical low-temperature routes to biomimetic synthesis of high-performance composite materials, with control of composition and structure based on the molecular mechanisms controlling...

  9. Electric Vehicle Technician

    Science.gov (United States)

    Moore, Pam

    2011-01-01

    With President Obama's goal to have one million electric vehicles (EV) on the road by 2015, the electric vehicle technician should have a promising and busy future. "The job force in the car industry is ramping up for a revitalized green car industry," according to Greencareersguide.com. An electric vehicle technician will safely troubleshoot and…

  10. Supercavitating Vehicle Control

    Science.gov (United States)

    2008-10-10

    401) 832-1511. DISTRIBUTION STATEMENT Approved for Public Release Distribution is unlimited 20081027289 Attorney Docket No. 96674 SUPERCAVITATING ...methods and more specifically to systems and methods for controlling a trajectory of a supercavitating vehicle. (2) Description of the Prior Art [0004...1 [0005) Some investigations into reducing the drag of high-speed, underwater vehicles have focused attention on supercavitating underwater vehicles

  11. MRV - Modular Robotic Vehicle

    Science.gov (United States)

    Ridley, Justin; Bluethmann, Bill

    2015-01-01

    The Modular Robotic Vehicle, or MRV, completed in 2013, was developed at the Johnson Space Center in order to advance technologies which have applications for future vehicles both in space and on Earth. With seating for two people, MRV is a fully electric vehicle modeled as a "city car", suited for busy urban environments.

  12. Electric vehicle recycling 2020: Key component power electronics.

    Science.gov (United States)

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

    2018-04-01

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

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

    International Nuclear Information System (INIS)

    Stjernman, G.

    1992-01-01

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

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

    Directory of Open Access Journals (Sweden)

    M. S. Jabal-Ameli

    2011-01-01

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

  15. US Hazardous Materials Routes, Geographic WGS84, BTS (2006) [hazardous_material_routes_BTS_2006

    Data.gov (United States)

    Louisiana Geographic Information Center — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes were developed using the 2004 First Edition TIGER/Line files. The routes are...

  16. Transportation Routing Analysis Geographic Information System -- TRAGIS, progress on improving a routing tool

    International Nuclear Information System (INIS)

    Johnson, P.E.; Lester, P.B.

    1998-05-01

    The Transportation Routing Analysis Geographic Information System (TRAGIS) model provides a useful tool to calculate and analyze transportation routes for radioactive materials within the continental US. This paper outlines some of the features available in this model

  17. Procurement Policy for Armored Vehicles

    National Research Council Canada - National Science Library

    Jolliffe, Richard B; Burton, Bruce A; Carros, Deborah L; Schaefer, Beth K; Truong, Linh; Palmer, Kevin A; Chun, Judy M; Smith, Jessica M; Abraham, Amanda M; Peters, Anthony R

    2007-01-01

    ...., and Armor Holdings, Inc., for armored vehicles. This report addresses armored vehicles, specifically the Buffalo Mine Protected Clearance Vehicle, the Cougar, the Joint Explosive Ordnance Disposal Rapid Response Vehicle (JERRV...

  18. Exploring bikeability in a metropolitan setting: stimulating and hindering factors in commuting route environments

    Directory of Open Access Journals (Sweden)

    Wahlgren Lina

    2012-03-01

    Full Text Available Abstract Background Route environments may influence people's active commuting positively and thereby contribute to public health. Assessments of route environments are, however, needed in order to better understand the possible relationship between active commuting and the route environment. The aim of this study was, therefore, to assess the potential associations between perceptions of whether the route environment on the whole hinders or stimulates bicycle commuting and perceptions of environmental factors. Methods The Active Commuting Route Environment Scale (ACRES was used for the assessment of bicycle commuters' perceptions of their route environments in the inner urban parts of Greater Stockholm, Sweden. Bicycle commuters (n = 827 were recruited by advertisements in newspapers. Simultaneous multiple regression analyses were used to assess the relation between predictor variables (such as levels of exhaust fumes, noise, traffic speed, traffic congestion and greenery and the outcome variable (hindering - stimulating route environments. Two models were run, (Model 1 without and (Model 2 with the item traffic: unsafe or safe included as a predictor. Results Overall, about 40% of the variance of hindering - stimulating route environments was explained by the environmental predictors in our models (Model 1, R2 = 0.415, and Model 2, R 2= 0.435. The regression equation for Model 1 was: y = 8.53 + 0.33 ugly or beautiful + 0.14 greenery + (-0.14 course of the route + (-0.13 exhaust fumes + (-0.09 congestion: all types of vehicles (p ≤ 0.019. The regression equation for Model 2 was y = 6.55 + 0.31 ugly or beautiful + 0.16 traffic: unsafe or safe + (-0.13 exhaust fumes + 0.12 greenery + (-0.12 course of the route (p ≤ 0.001. Conclusions The main results indicate that beautiful, green and safe route environments seem to be, independently of each other, stimulating factors for bicycle commuting in inner urban areas. On the other hand, exhaust

  19. Potential and challenges in home care service process optimization : a route optimization approach

    OpenAIRE

    Nakari, Pentti J. E.

    2016-01-01

    Aging of the population is an increasing problem in many countries, including Finland, and it poses a challenge to public services such as home care. Vehicle routing optimization (VRP) type optimization solutions are one possible way to decrease the time required for planning home visits and driving to customer addresses, as well as decreasing transportation costs. Although VRP optimization is widely and succesfully applied to commercial and industrial logistics, the home care ...

  20. Modeling and Optimization of Inventory-Distribution Routing Problem for Agriculture Products Supply Chain

    OpenAIRE

    Liao, Li; Li, Jianfeng; Wu, Yaohua

    2013-01-01

    Mathematical models of inventory-distribution routing problem for two-echelon agriculture products distribution network are established, which are based on two management modes, franchise chain and regular chain, one-to-many, interval periodic order, demand depending on inventory, deteriorating treatment cost of agriculture products, start-up costs of vehicles and so forth. Then, a heuristic adaptive genetic algorithm is presented for the model of franchise chain. For the regular chain model,...