The Pyramidal Capacitated Vehicle Routing Problem
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...
The pyramidal capacitated vehicle routing problem
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...
Locating Depots for Capacitated Vehicle Routing
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....
Locating Depots for Capacitated Vehicle Routing
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...
Fund allocation using capacitated vehicle routing problem
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.
Locating Depots for Capacitated Vehicle Routing
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...
Two models of the capacitated vehicle routing problem
Zuzana Borčinova
2017-01-01
Full Text Available The aim of the Capacitated Vehicle Routing Problem (CVRP is to find a set of minimum total cost routes for a fleet of capacitated vehicles based at a single depot, to serve a set of customers. There exist various integer linear programming models of the CVRP. One of the main differences lies in the way to eliminate sub-tours, i.e. cycles that do not go through the depot. In this paper, we describe a well-known flow formulation of CVRP, where sub-tour elimination constraints have a cardinality exponentially growing with the number of customers. Then we present a mixed linear programming formulation with polynomial cardinality of sub-tour elimination constraints. Both of the models were implemented and compared on several benchmarks.
A novel heuristic algorithm for capacitated vehicle routing problem
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.
An optimization algorithm for a capacitated vehicle routing problem ...
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 ...
A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
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....
A Food Chain Algorithm for Capacitated Vehicle Routing Problem with Recycling in Reverse Logistics
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.
A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem
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...
Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem
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.
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.
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.
An artificial bee colony algorithm for the capacitated vehicle routing problem
Szeto, W.Y.; Wu, Yongzhong; Ho, Sin C.
2011-01-01
This paper introduces an artificial bee colony heuristic for solving the capacitated vehicle routing problem. The artificial bee colony heuristic is a swarm-based heuristic, which mimics the foraging behavior of a honey bee swarm. An enhanced version of the artificial bee colony heuristic is also...... proposed to improve the solution quality of the original version. The performance of the enhanced heuristic is evaluated on two sets of standard benchmark instances, and compared with the original artificial bee colony heuristic. The computational results show that the enhanced heuristic outperforms...
A Column Generation Approach to the Capacitated Vehicle Routing Problem with Stochastic Demands
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...
A new formulation for the 2-echelon capacitated vehicle routing problem
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...
A capacitated vehicle routing problem with order available time in e-commerce industry
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.
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.
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.
Computational results with a branch and cut code for the capacitated vehicle routing problem
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.
A Problem-Reduction Evolutionary Algorithm for Solving the Capacitated Vehicle Routing Problem
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.
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.
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.
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.
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
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...
Introducing radiality constraints in capacitated location-routing problems
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.
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
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...
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.
Capacitated arc routing problem and its extensions in waste collection
Fadzli, Mohammad; Najwa, Nurul; Luis, Martino
2015-01-01
Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time
Capacitated arc routing problem and its extensions in waste collection
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.
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.
Shortest Paths and Vehicle Routing
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....
Partial Path Column Generation for the Vehicle Routing Problem
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....
A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
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
Capacitated Vehicle Routing with Nonuniform Speeds
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...
Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm
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...
Vehicle Routing With User Generated Trajectory Data
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...
Vehicle routing problem in investment fund allocation
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.
Commercial vehicle route tracking using video detection.
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...
A variable neighborhood descent based heuristic to solve the capacitated location-routing problem
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.
Classification of Dynamic Vehicle Routing Systems
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...
Time and timing in vehicle routing problems
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
Stochastic vehicle routing with recourse
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...
Optimizing departure times in vehicle routes
Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.
2008-01-01
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW
Optimizing Departure Times in Vehicle Routes
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
Measurement of vehicle-load using capacitance and acceleration transducers
Yang, S; Yang, W; Yang, Y
2007-01-01
Over-loading is a common problem in some developing countries. Currently, large and fixed measurement systems are used to measure the load of vehicles travelling on highways. This paper presents an on-vehicle measuring device, which is based on measurement of change in capacitance due to variation in distance between electrodes mounted on vehicles. The on-vehicle leaf springs are used as a key part of the weighing transducer. Acceleration transducers are used to measure the vehicle's forward and the vertical accelerations. A feature of this on-vehicle measuring device is that it can provide both static and dynamic load measurements. The drivers can check the load in the cab, and the highway inspectors can check the load at any time and any place through radio communication, thus identifying over-loaded vehicles
The Time Window Vehicle Routing Problem Considering Closed Route
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
Vehicle Routing Problems for Drone Delivery
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 ...
Rich Vehicle Routing Problems and Applications
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....
Waste Collection Vehicle Routing Problem: Literature Review
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...
Waste Collection Vehicle Routing Problem: Literature Review
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.
Full truckload vehicle routing problem with profits
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.
Routing Cooperating Vehicles to Perform Precedence-Linked Tasks
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...
Erfan Babaee Tirkolaee
2018-04-01
Full Text Available Greenhouse gases (GHG are the main reason for the global warming during the past decades. On the other hand, establishing a well-structured transportation system will yield to create least cost-pollution. This paper addresses a novel model for the multi-trip Green Capacitated Arc Routing Problem (G-CARP with the aim of minimizing total cost including the cost of generation and emission of greenhouse gases, the cost of vehicle usage and routing cost. The cost of generation and emission of greenhouse gases is based on the calculation of the amount of carbon dioxide emitted from vehicles, which depends on such factors as the vehicle speed, weather conditions, load on the vehicle and traveled distance. The main applications of this problem are in municipalities for urban waste collection, road surface marking and so forth. Due to NP-hardness of the problem, a Hybrid Genetic Algorithm (HGA is developed, wherein a heuristic and simulated annealing algorithm are applied to generate initial solutions and a Genetic Algorithm (GA is then used to generate the best possible solution. The obtained numerical results indicate that the proposed algorithm could present desirable performance within a suitable computational run time. Finally, a sensitivity analysis is implemented on the maximum available time of the vehicles in order to determine the optimal policy.
Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles
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...
Anticipatory vehicle routing using delegate multi-agent systems
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 trafﬁc 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...
Vehicle routing with dynamic travel times : a queueing approach
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
Evolutionary algorithms for the Vehicle Routing Problem with Time Windows
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
On the vehicle routing problem with time windows
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...
Congestion avoidance and break scheduling within vehicle routing
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
An optimization algorithm for a capacitated vehicle routing problem ...
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.
Capacitated Vehicle Routing with Non-Uniform Speeds
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...
Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling
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.
Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm
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...
Capacitive properties of PANI/MnO{sub 2} synthesized via simultaneous-oxidation route
Zhang Jie [School of Chemistry and Environment, South China Normal University, Guangzhou 510006 (China); Shu Dong, E-mail: dshu@scnu.edu.cn [School of Chemistry and Environment, South China Normal University, Guangzhou 510006 (China); Tianneng Group, Changxing 313100, Zhejiang Province (China); Base of Production, Education and Research on Energy Storage and Power Battery of Guangdong Higher Education Institutes, Guangzhou 510006 (China); Key Laboratory of Electrochemical Technology on Energy Storage and Power Generation of Guangdong Higher Education Institutes, South China Normal University, Guangzhou 510006 (China); Zhang Tianren [Tianneng Group, Changxing 313100, Zhejiang Province (China); Chen Hongyu [School of Chemistry and Environment, South China Normal University, Guangzhou 510006 (China); Base of Production, Education and Research on Energy Storage and Power Battery of Guangdong Higher Education Institutes, Guangzhou 510006 (China); Key Laboratory of Electrochemical Technology on Energy Storage and Power Generation of Guangdong Higher Education Institutes, South China Normal University, Guangzhou 510006 (China); Zhao Haimin; Wang Yongsheng [Tianneng Group, Changxing 313100, Zhejiang Province (China); Sun Zhenjie; Tang Shaoqing [School of Chemistry and Environment, South China Normal University, Guangzhou 510006 (China); Fang Xueming [Tianneng Group, Changxing 313100, Zhejiang Province (China); Cao Xiufang [School of Chemistry and Environment, South China Normal University, Guangzhou 510006 (China)
2012-08-15
Highlights: Black-Right-Pointing-Pointer PANI/MnO{sub 2} composite was synthesized by the simultaneous-oxidation route. Black-Right-Pointing-Pointer Good contact in inter-molecule level between PANI and MnO{sub 2} improves the conductivity. Black-Right-Pointing-Pointer The separation between PANI and MnO{sub 2} prevents the aggregation of nano-composite. Black-Right-Pointing-Pointer The maximum specific capacitance of the PANI/MnO{sub 2} electrode is 320 F/g. Black-Right-Pointing-Pointer The as-prepared PANI/MnO{sub 2} exhibits excellent cycle stability of 84% capacitance retention after 10,000 cycles. - Abstract: Polyaniline (PANI) and manganese dioxide (MnO{sub 2}) composite (PANI/MnO{sub 2}) was synthesized via a simultaneous-oxidation route. In this route, all reactants were dispersed homogenously in precursor solution and existed as ions and molecules, and involved reactions of ions and molecules generating PANI and MnO{sub 2} simultaneously. In this way, PANI molecule and MnO{sub 2} molecule contact each other and arrange alternately in the composite. The inter-molecule contact improves the conductivity of the composite. The alternative arrangement of PANI molecules and MnO{sub 2} molecules separating each other, and prevents the aggregation of PANI and cluster of MnO{sub 2} so as to decrease the particle size of the composite. The morphology, structure, porous and capacitive properties are characterized by scanning electron microscopy, X-ray diffraction spectroscopy, X-ray photoelectron spectroscopy, Branauer-Emmett-Teller test, thermogravimetric analysis, Fourier transform infrared spectroscopy, cyclic voltammetry, charge-discharge test and the electrochemical impedance measurements. The results show that MnO{sub 2} is predominant in the PANI/MnO{sub 2} composite and the composite exhibits larger specific surface area than pure MnO{sub 2}. The maximum specific capacitance of the composite electrode reaches up to 320 F/g by charge-discharge test, 1.56 times
Capacitive properties of PANI/MnO2 synthesized via simultaneous-oxidation route
Zhang Jie; Shu Dong; Zhang Tianren; Chen Hongyu; Zhao Haimin; Wang Yongsheng; Sun Zhenjie; Tang Shaoqing; Fang Xueming; Cao Xiufang
2012-01-01
Highlights: ► PANI/MnO 2 composite was synthesized by the simultaneous-oxidation route. ► Good contact in inter-molecule level between PANI and MnO 2 improves the conductivity. ► The separation between PANI and MnO 2 prevents the aggregation of nano-composite. ► The maximum specific capacitance of the PANI/MnO 2 electrode is 320 F/g. ► The as-prepared PANI/MnO 2 exhibits excellent cycle stability of 84% capacitance retention after 10,000 cycles. - Abstract: Polyaniline (PANI) and manganese dioxide (MnO 2 ) composite (PANI/MnO 2 ) was synthesized via a simultaneous-oxidation route. In this route, all reactants were dispersed homogenously in precursor solution and existed as ions and molecules, and involved reactions of ions and molecules generating PANI and MnO 2 simultaneously. In this way, PANI molecule and MnO 2 molecule contact each other and arrange alternately in the composite. The inter-molecule contact improves the conductivity of the composite. The alternative arrangement of PANI molecules and MnO 2 molecules separating each other, and prevents the aggregation of PANI and cluster of MnO 2 so as to decrease the particle size of the composite. The morphology, structure, porous and capacitive properties are characterized by scanning electron microscopy, X-ray diffraction spectroscopy, X-ray photoelectron spectroscopy, Branauer–Emmett–Teller test, thermogravimetric analysis, Fourier transform infrared spectroscopy, cyclic voltammetry, charge–discharge test and the electrochemical impedance measurements. The results show that MnO 2 is predominant in the PANI/MnO 2 composite and the composite exhibits larger specific surface area than pure MnO 2 . The maximum specific capacitance of the composite electrode reaches up to 320 F/g by charge–discharge test, 1.56 times higher than that of MnO 2 (125 F/g). The specific capacitance retains approximately 84% of the initial value after 10,000 cycles, indicating the good cycle stability.
The vehicle routing problem latest advances and new challenges
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...
Approximation Algorithm for a Heterogeneous Vehicle Routing Problem
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.
Optimization Using Simulation of the Vehicle Routing Problem
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...
Multiple Charging Station Location-Routing Problem with Time Window of Electric Vehicle
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.
Optimizing investment fund allocation using vehicle routing problem framework
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.
Multicriteria vehicle routing problem solved by artificial immune system
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.
Routing of Electric Vehicles: City Distribution in Copenhagen
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...
A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.
Li-Ning Xing; Rohlfshagen, P; Ying-Wu Chen; Xin Yao
2011-08-01
The capacitated arc routing problem (CARP) is representative of numerous practical applications, and in order to widen its scope, we consider an extended version of this problem that entails both total service time and fixed investment costs. We subsequently propose a hybrid ant colony optimization (ACO) algorithm (HACOA) to solve instances of the extended CARP. This approach is characterized by the exploitation of heuristic information, adaptive parameters, and local optimization techniques: Two kinds of heuristic information, arc cluster information and arc priority information, are obtained continuously from the solutions sampled to guide the subsequent optimization process. The adaptive parameters ease the burden of choosing initial values and facilitate improved and more robust results. Finally, local optimization, based on the two-opt heuristic, is employed to improve the overall performance of the proposed algorithm. The resulting HACOA is tested on four sets of benchmark problems containing a total of 87 instances with up to 140 nodes and 380 arcs. In order to evaluate the effectiveness of the proposed method, some existing capacitated arc routing heuristics are extended to cope with the extended version of this problem; the experimental results indicate that the proposed ACO method outperforms these heuristics.
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.
A heuristic algorithm for a multi-product four-layer capacitated location-routing problem
Mohsen Hamidi
2014-01-01
Full Text Available The purpose of this study is to solve a complex multi-product four-layer capacitated location-routing problem (LRP in which two specific constraints are taken into account: 1 plants have limited production capacity, and 2 central depots have limited capacity for storing and transshipping products. The LRP represents a multi-product four-layer distribution network that consists of plants, central depots, regional depots, and customers. A heuristic algorithm is developed to solve the four-layer LRP. The heuristic uses GRASP (Greedy Randomized Adaptive Search Procedure and two probabilistic tabu search strategies of intensification and diversification to tackle the problem. Results show that the heuristic solves the problem effectively.
Routing Unmanned Vehicles in GPS-Denied Environments
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...
Routing Optimization of Intelligent Vehicle in Automated Warehouse
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.
Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles
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...
Vehicle routing with cross-docking
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....
A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles
İ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.
Route-Based Control of Hybrid Electric Vehicles: Preprint
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.
Vehicle routing with stochastic time-dependent travel times
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
The Vehicle Routing Problem with Time Windows and Temporal Dependencies
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...
Reachability cuts for the vehicle routing problem with time windows
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...
Path inequalities for the vehicle routing problem with time windows
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...
Vehicle routing with stochastic time-dependent travel times
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
A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem
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.
Route-Based Signal Preemption Control of Emergency Vehicle
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.
Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem
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.
Optimization for routing vehicles of seafood product transportation
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.
The vehicle routing problem with edge set costs
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...
Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm
Yingcheng Xu
2013-01-01
Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.
A green vehicle routing problem with customer satisfaction criteria
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.
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.
Dynamic vehicle routing problems: Three decades and counting
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...
Intelligent emission-sensitive routing for plugin hybrid electric vehicles.
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.
Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system
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.
Research on the optimization of vehicle distribution routes in logistics enterprises
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.
Routing the asteroid surface vehicle with detailed mechanics
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.
SOLVING THE PROBLEM OF VEHICLE ROUTING BY EVOLUTIONARY ALGORITHM
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.
Penerapan Konsep Vehicle Routing Problem dalam Kasus Pengangkutan Sampah di Perkotaan
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.
Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles
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.
Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization
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.
The Dynamic Multi-Period Vehicle Routing Problem
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....
The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows
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.
Vehicle Routing Problems with Fuel Consumption and Stochastic Travel Speeds
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.
Design of a Capacitive Flexible Weighing Sensor for Vehicle WIM System
Qing Li
2007-08-01
Full Text Available With the development of the Highway Transportation and Business Trade, vehicle weigh-in-motion (WIM technology has become a key technology and trend of measuring traffic loads. In this paper, a novel capacitive flexible weighing sensor which is light weight, smaller volume and easy to carry was applied in the vehicle WIM system. The dynamic behavior of the sensor is modeled using the Maxwell-Kelvin model because the materials of the sensor are rubbers which belong to viscoelasticity. A signal processing method based on the model is presented to overcome effects of rubber mechanical properties on the dynamic weight signal. The results showed that the measurement error is less than Ã���Â±10%. All the theoretic analysis and numerical results demonstrated that appliance of this system to weigh in motion is feasible and convenient for traffic inspection.
Routing strategies for efficient deployment of alternative fuel vehicles for freight delivery.
2017-02-01
With increasing concerns on environmental issues, recent research on Vehicle Routing Problems : (VRP) has added new factors such as greenhouse gas emissions and alternative fuel vehicles into : the models. In this report, we consider one such promisi...
Vehicle routing problem with time windows using natural inspired algorithms
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.
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
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...
Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints
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.
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.
A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material
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.
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.
A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study
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
A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study
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.
METHOD OF CHOOSING THE TECHNOLOGY OF VEHICLE OPERATION ON DELIVERY ROUTES
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.
Methodology for kinematic cycle characterization of vehicles with fixed routes in urban areas
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...
An efficient heuristic for the multi-compartment vehicle routing problem
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...
Alireza Goli
2015-09-01
Full Text Available Distribution and optimum allocation of emergency resources are the most important tasks, which need to be accomplished during crisis. When a natural disaster such as earthquake, flood, etc. takes place, it is necessary to deliver rescue efforts as quickly as possible. Therefore, it is important to find optimum location and distribution of emergency relief resources. When a natural disaster occurs, it is not possible to reach some damaged areas. In this paper, location and multi-depot vehicle routing for emergency vehicles using tour coverage and random sampling is investigated. In this study, there is no need to visit all the places and some demand points receive their needs from the nearest possible location. The proposed study is implemented for some randomly generated numbers in different sizes. The preliminary results indicate that the proposed method was capable of reaching desirable solutions in reasonable amount of time.
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
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...
Potential air pollutant emission from private vehicles based on vehicle route
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.
Optimal solutions for routing problems with profits
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
Real time monitoring system used in route planning for the electric vehicle
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.
A New Plant Intelligent Behaviour Optimisation Algorithm for Solving Vehicle Routing Problem
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...
Analysis of an Automated Vehicle Routing Problem in Logistics considering Path Interruption
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.
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
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.
The waste collection vehicle routing problem with time windows in a city logistics context
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...
Optimal Routing and Scheduling of Charge for Electric Vehicles: Case Study
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...
A model-based eco-routing strategy for electric vehicles in large urban networks
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 ...
Multiple vehicle routing and dispatching to an emergency scene
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 ...
Route Assessment for Unmanned Aerial Vehicle Based on Cloud Model
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.
Project : transit demand and routing after autonomous vehicle availability.
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...
Nearest greedy for solving the waste collection vehicle routing problem: A case study
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.
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.
Multiple depots vehicle routing based on the ant colony with the genetic algorithm
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
MULTI-VEHICLE COVERING TOUR PROBLEM: BUILDING ROUTES FOR URBAN PATROLLING
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.
On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity
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.
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.
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.
Refinements of the column generation process for the Vehicle Routing Problem with Time Windows
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...
Disjunctive cuts in a branch-and-price algorithm for the capacitated vehicle routing problem
Røpke, Stefan
This talk presents computational results that show the usefulness of the general-purpose valid inequalities disjunctive cuts when applied to the CVRP. Results indicate that the disjunctive cuts are able to reduce the gap between lower bound and upper bound more than state-of-the-art problem...... specific inequalities. Results also indicate that introducing the cuts leads to a smaller branch and bound tree and faster solution times overall....
Alberto Ochoa-Ortíz; Francisco Ornelas-Zapata; Lourdes Margain-Fuentes; Miguel Gastón Cedillo-Campos; Jöns Sánchez-Aguilar; Rubén Jaramillo-Vacio; Isabel Ávila
2015-01-01
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;...
A branch-and-cut algorithm for the capacitated open vehicle routing problem
Letchford, A.N.; Lysgaard, Jens; Eglese, R.W.
2007-01-01
-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time...... to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem....
A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem
Letchford, Adam N.; Lysgaard, Jens; Eglese, Richard W.
-and-cut. We show that, even though the open CVRP initially looks like a minor variation of the standard CVRP, the integer programming formulation and cutting planes need to be modified in subtle ways. Computational results are given for several standard test instances, which enables us for the first time...... to assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem....
Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem
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.
Vehicle Routing Problem Using Genetic Algorithm with Multi Compartment on Vegetable Distribution
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.
Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service
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.
Partial path column generation for the vehicle routing problem with time windows
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...
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.
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
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
Constraint Programming based Local Search for the Vehicle Routing Problem with Time Windows
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".
Branch-and-cut algorithms for the split delivery vehicle routing problem
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
New heuristics for the fleet size and mix vehicle routing problem with time windows
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
The life and times of the Savings Method for Vehicle Routing Problems
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 ...
Joint optimization of green vehicle scheduling and routing problem with time-varying speeds
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
Opportunity costs calculation in agent-based vehicle routing and scheduling
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
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
Formulations and exact algorithms for the vehicle routing problem with time windows
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...
Vehicle Routing with Traffic Congestion and Drivers' Driving and Working Rules
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
A branch-and-cut algorithm for the Time Window Assignment Vehicle Routing Problem
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
Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm
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.
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
Metaheuristics applied to vehicle routing. A case study. Parte 1: formulating the problem
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.
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
Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window
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.
Model and algorithm for bi-fuel vehicle routing problem to reduce GHG emissions.
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.
Routing of Electric Vehicles: Case Study of City Distribution in Copenhagen
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...
Planning of Vehicle Routing with Backup Provisioning Using Wireless Sensor Technologies
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.
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.
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. ...
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.
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
Simulated annealing (SA to vehicle routing problems with soft time windows
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.
The multi-depot electric vehicle location routing problem with time windows
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.
Improvement of Network Performance by In-Vehicle Routing Using Floating Car Data
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.
Lagrangian duality applied to the vehicle routing problem with time windows
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....
A Constraint-Based Model for Fast Post-Disaster Emergency Vehicle Routing
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.
The Edge Set Cost of the Vehicle Routing Problem with Time Windows
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...
The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem
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...
The vehicle routing game: An application of cost allocation in a gas and oil company
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.
Vehicle routing for the eco-efficient collection of household plastic waste.
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.
Performance of clustering techniques for solving multi depot vehicle routing problem
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
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.
Rao, Weizhen; Liu, Feng; Wang, Shengbin
2016-01-01
The classical model of vehicle routing problem (VRP) generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles. Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention. The resulting fuel consumption VRP (FCVRP) becomes increasingly important yet difficult. We present a mixed integer programming model for the FCVRP, and fuel consumption is ...
A memory structure adapted simulated annealing algorithm for a green vehicle routing problem.
Küçükoğlu, İlker; Ene, Seval; Aksoy, Aslı; Öztürk, Nursel
2015-03-01
Currently, reduction of carbon dioxide (CO2) emissions and fuel consumption has become a critical environmental problem and has attracted the attention of both academia and the industrial sector. Government regulations and customer demands are making environmental responsibility an increasingly important factor in overall supply chain operations. Within these operations, transportation has the most hazardous effects on the environment, i.e., CO2 emissions, fuel consumption, noise and toxic effects on the ecosystem. This study aims to construct vehicle routes with time windows that minimize the total fuel consumption and CO2 emissions. The green vehicle routing problem with time windows (G-VRPTW) is formulated using a mixed integer linear programming model. A memory structure adapted simulated annealing (MSA-SA) meta-heuristic algorithm is constructed due to the high complexity of the proposed problem and long solution times for practical applications. The proposed models are integrated with a fuel consumption and CO2 emissions calculation algorithm that considers the vehicle technical specifications, vehicle load, and transportation distance in a green supply chain environment. The proposed models are validated using well-known instances with different numbers of customers. The computational results indicate that the MSA-SA heuristic is capable of obtaining good G-VRPTW solutions within a reasonable amount of time by providing reductions in fuel consumption and CO2 emissions.
A Column Generation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
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.
A lower bound for the node, edge, and arc routing problem
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...
Similarity-Based Prediction of Travel Times for Vehicles Traveling on Known Routes
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...
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
The Emergency Vehicle Routing Problem with Uncertain Demand under Sustainability Environments
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.
Ant colony system (ACS with hybrid local search to solve vehicle routing problems
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.
Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking
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.
Split delivery vehicle routing problem with time windows: a case study
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.
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.
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.
Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem.
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.
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
A Rich Vehicle Routing Problem with Multiple Trips and Driver Shifts
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...
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.
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...
A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows
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.
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.
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%.
A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems
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.
Thummala, Prasanth; Zhang, Zhe; Andersen, Michael A. E.
2014-01-01
the converter for efficiently charging and discharging the capacitive actuator from 0 V to 2.5 kV and vice versa, respectively. The converter is used to drive a dielectric electro active polymer (DEAP) based capacitive incremental actuator, which has the potential to be used in automotive (e.g., EVs), space...
An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem
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.
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.
Real-Time Vehicle Routing for Repairing Damaged Infrastructures Due to Natural Disasters
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.
Subset-row inequalities applied to the vehicle routing problem with time windows
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...
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.
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.
Design of a Multi-layer Lane-Level Map for Vehicle Route Planning
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.
Modified artificial bee colony for the vehicle routing problems with time windows.
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.
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.
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
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
Enhanced intelligent water drops algorithm for multi-depot vehicle routing problem.
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.
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.
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.
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.
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.
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...
An inventory location routing model with environmental considerations
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.
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...
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 ...
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.
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.
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.
Efficient routing of service vehicles. Publication No. 95-82, and Publication No. 1010
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.
Vehicle-class Specific Route-guidance of Freeway Traffic by Model-predictive Control
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
Bruno Santos Goulart
2014-09-01
Full Text Available An efficient combustion depends on many factors, such as injection, turbulence and ignition characteristics. With the improvement of internal combustion engines the turbulence intensity and internal pressure have risen, demanding more efficient and powerful ignition systems. In direct injection engines, the stratified charge resultant from the wall/air-guided or spray-guided system requires even more energy. The Paschen’s law shows that spark plug gap and mixture density are proportional to the dielectric rupture voltage. It is known that larger spark gaps promote higher efficiency in the internal combustion engines, since the mixture reaction rate rises proportionally. However, the ignition system must be adequate to the imposed gap, not only on energy, but also on voltage and spark duration. For the reported study in this work two test benches were built: a standard inductive ignition system and a capacitive discharge high energy ignition system, with variable voltage and capacitance. The influence of the important parameters energy and ignition voltage on the spark duration, as well as the electrode gap and shape were analyzed. It was also investigated the utilization of a coil with lower resistance and inductance values, as well as spark plugs with and without internal resistances.
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
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.
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.
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.
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
A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce
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.
An analysis of generalised heuristics for vehicle routing and personnel rostering problems
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...
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.
Research on vehicle routing optimization for the terminal distribution of B2C E-commerce firms
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.
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.
An optimal control-based algorithm for hybrid electric vehicle using preview route information
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
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.
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.
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.
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.
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.
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 ...
John Willmer Escobar
2012-12-01
Full Text Available Consideramos el problema de localización y ruteo con restricciones de capacidad (CLRP, en el cual la meta es determinar los depósitos a ser abiertos, los clientes a ser asignados a cada depósito abierto, y las rutas a ser construidas para satisfacer las demandas de los clientes. El objetivo es minimizar la suma de los costos de abrir depósitos, de los costos de los vehículos usados, y de los costos variables asociados con la distancia recorrida por las rutas. En este paper, proponemos una metaheurística basada en simulado y recocido con espacio de búsqueda granular para resolver el problema CLRP. Experimentos computacionales en instancias de benchmarking tomadas de la literatura muestran que el algoritmo propuesto es capaz de obtener, dentro de tiempos computacionales razonables, soluciones de alta calidad mostrando su eficacia.The article deals with the Capacitated Location Routing Problem (CLRP where the goal is to determine the depots to be opened, the customers to be assigned to each deposit opened, and the routes to be constructed for fulfilling customers' demands. The objective is to minimize the sum of costs resulting from opening depots, costs resulting from used vehicles, and variable costs associated to the distance across the routes. In this paper, a metaheuristic based on simulated annealing with granular search space for solving the CLRP is proposed. Computational experiments on benchmarking instances taken from literature show that the proposed algorithm is able to obtain high-quality solutions within reasonable computational times, thus showing its efficiency.
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)
Vehicle routing for the eco-efficient collection of household plastic waste
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
Chen Chixiao; Xiang Jixuan; Chen Huabin; Xu Jun; Ye Fan; Li Ning; Ren Junyan
2015-01-01
Asynchronous successive approximation register (SAR) analog-to-digital converters (ADC) feature high energy efficiency but medium performance. From the point of view of speed, the key bottleneck is the unit capacitor size. In this paper, a small size three-dimensional (3-D) metal—oxide—metal (MOM) capacitor is proposed. The unit capacitor has a capacitance of 1-fF. It shapes as an umbrella, which is designed for fast settling consideration. A comparison among the proposed capacitor with other 3-D MOM capacitors is also given in the paper. To demonstrate the effectiveness of the MOM capacitor, a 6-b capacitive DAC is implemented in TSMC 1P9M 65 nm LP CMOS technology. The DAC consumes a power dissipation of 0.16 mW at the rate of 100 MS/s, excluding a source-follower based output buffer. Static measurement result shows that INL is less than ±1 LSB and DNL is less than ±0.5 LSB. In addition, a 100 MS/s 9-bit SAR ADC with the proposed 3-D capacitor is simulated. (paper)
Research on consumable distribution mode of shipbuilder’s shop based on vehicle routing problem
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.
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.
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.
A Time-Slotted On-Demand Routing Protocol for Mobile Ad Hoc Unmanned Vehicle Systems
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.
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.
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)
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.
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.
The split delivery capacitated team orienteering problem
Archetti, C.; Bianchessi, N.; Speranza, M. G.; Hertz, A.
2014-01-01
In this article, we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the
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.
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.
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.
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.
False capacitance of supercapacitors
Ragoisha, G. A.; Aniskevich, Y. M.
2016-01-01
Capacitance measurements from cyclic voltammetry, galvanostatic chronopotentiometry and calculation of capacitance from imaginary part of impedance are widely used in investigations of supercapacitors. The methods assume the supercapacitor is a capacitor, while real objects correspond to different equivalent electric circuits and show various contributions of non-capacitive currents to the current which is used for calculation of capacitance. Specific capacitances which are presented in F g-1...
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.
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.
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.
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...
VANET Routing Protocols: Pros and Cons
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...
Manginell, Ronald P; Moorman, Matthew W; Wheeler, David R
2014-05-27
A microfabricated capacitive chemical sensor can be used as an autonomous chemical sensor or as an analyte-sensitive chemical preconcentrator in a larger microanalytical system. The capacitive chemical sensor detects changes in sensing film dielectric properties, such as the dielectric constant, conductivity, or dimensionality. These changes result from the interaction of a target analyte with the sensing film. This capability provides a low-power, self-heating chemical sensor suitable for remote and unattended sensing applications. The capacitive chemical sensor also enables a smart, analyte-sensitive chemical preconcentrator. After sorption of the sample by the sensing film, the film can be rapidly heated to release the sample for further analysis. Therefore, the capacitive chemical sensor can optimize the sample collection time prior to release to enable the rapid and accurate analysis of analytes by a microanalytical system.
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...
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...
Membrane capacitive deionization
Biesheuvel, P.M.; Wal, van der A.
2010-01-01
Membrane capacitive deionization (MCDI) is an ion-removal process based on applying an electrical potential difference across an aqueous solution which flows in between oppositely placed porous electrodes, in front of which ion-exchange membranes are positioned. Due to the applied potential, ions
Capacitance for carbon capture
Landskron, Kai
2018-01-01
Metal recycling: A sustainable, capacitance-assisted carbon capture and sequestration method (Supercapacitive Swing Adsorption) can turn scrap metal and CO 2 into metal carbonates at an attractive energy cost. (copyright 2018 Wiley-VCH Verlag GmbH and Co. KGaA, Weinheim)
Capacitance for carbon capture
Landskron, Kai [Department of Chemistry, Lehigh University, Bethlehem, PA (United States)
2018-03-26
Metal recycling: A sustainable, capacitance-assisted carbon capture and sequestration method (Supercapacitive Swing Adsorption) can turn scrap metal and CO{sub 2} into metal carbonates at an attractive energy cost. (copyright 2018 Wiley-VCH Verlag GmbH and Co. KGaA, Weinheim)
Routing and scheduling problems
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...
Enhanced ant colony optimization for inventory routing problem
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.
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.
Developing an eco-routing application.
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...
Capacitive discharge exciplex lamps
Sosnin, E A; Erofeev, M V; Tarasenko, V F [High Current Electronics Institute, 2/3, Akademichesky Ave., Tomsk 634055 (Russian Federation)
2005-09-07
Simple-geometry exciplex lamps of a novel type excited by a capacitive discharge (CD-excilamps) have been investigated. An efficient radiation has been obtained on KrBr*, KrCl*, XeBr*, XeCl* molecules and I* atom. The highest values of efficiency of various working molecules are approximately 10-18%. The lifetime of the operating gas mixture in KrCl*, XeCl*, I* and XeBr* exciplex lamps excited by a CD is above 1000 h. Owing to the above-mentioned characteristics, the exciplex lamps excited by a CD are supposed to be very promising for various applications.
Capacitive discharge exciplex lamps
Sosnin, E A; Erofeev, M V; Tarasenko, V F
2005-01-01
Simple-geometry exciplex lamps of a novel type excited by a capacitive discharge (CD-excilamps) have been investigated. An efficient radiation has been obtained on KrBr*, KrCl*, XeBr*, XeCl* molecules and I* atom. The highest values of efficiency of various working molecules are approximately 10-18%. The lifetime of the operating gas mixture in KrCl*, XeCl*, I* and XeBr* exciplex lamps excited by a CD is above 1000 h. Owing to the above-mentioned characteristics, the exciplex lamps excited by a CD are supposed to be very promising for various applications
Capacitance of circular patch resonator
Miano, G.; Verolino, L.; Naples Univ.; Panariello, G.; Vaccaro, V.G.; Naples Univ.
1995-11-01
In this paper the capacitance of the circular microstrip patch resonator is computed. It is shown that the electrostatic problem can be formulated as a system of dual integral equations, and the most interesting techniques of solutions of these systems are reviewed. Some useful approximated formulas for the capacitance are derived and plots of the capacitance are finally given in a wide range of dielectric constants
Coordinated Platoon Routing in a Metropolitan Network
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.
Dong Linxi; Chen Jindan; Huo Weihong; Li Yongjie; Sun Lingling; Yan Haixia
2009-01-01
The comb capacitances fabricated by deep reactive ion etching (RIE) process have high aspect ratio which is usually smaller than 30: 1 for the complicated process factors, and the combs are usually not parallel due to the well-known micro-loading effect and other process factors, which restricts the increase of the seismic mass by increasing the thickness of comb to reduce the thermal mechanical noise and the decrease of the gap of the comb capacitances for increasing the sensitive capacitance to reduce the electrical noise. Aiming at the disadvantage of the deep RIE, a novel capacitive micro-accelerometer with grid strip capacitances and sensing gap alterable capacitances is developed. One part of sensing of inertial signal of the micro-accelerometer is by the grid strip capacitances whose overlapping area is variable and which do not have the non-parallel plate's effect caused by the deep RIE process. Another part is by the sensing gap alterable capacitances whose gap between combs can be reduced by the actuators. The designed initial gap of the alterable comb capacitances is relatively large to depress the effect of the maximum aspect ratio (30 : 1) of deep RIE process. The initial gap of the capacitance of the actuator is smaller than the one of the comb capacitances. The difference between the two gaps is the initial gap of the sensitive capacitor. The designed structure depresses greatly the requirement of deep RIE process. The effects of non-parallel combs on the accelerometer are also analyzed. The characteristics of the micro-accelerometer are discussed by field emission microscopy (FEM) tool ANSYS. The tested devices based on slide-film damping effect are fabricated, and the tested quality factor is 514, which shows that grid strip capacitance design can partly improve the resolution and also prove the feasibility of the designed silicon-glass anodically bonding process.
The Service-Time Restricted Capacitated Arc Routing Problem
Lystlund, Lise; Wøhlk, Sanne
We consider an inventory system, operated by a base stock policy and serving two customer classes. One customer class, Class 1, does not provide any advance demand information at all, while the other, Class 2, does. In order to reward a customer of Class 2 for providing advance order information......, it may be sensible to make reservations for the order in the inventory system, thereby preventing later arriving orders from getting access to the inventory before this particular order. We propose various reservation policies and study their impact on the performance of the inventory system....
Walton, H.
1985-01-01
Apparatus for gauging physical dimensions of solid or tubular bodies (e.g. a nuclear fuel pellet) comprises a capacitive transducer having electrodes forming diametrically arranged pairs of capacitors and means for connecting the pairs, preferably sequentially, in an arm of a four arm electrical network. For circumferential scanning of a solid body along its length, the body is moved along a path of travel through head assembly including the transducer by means of plungers with the axis of the body being coincident with the axis of the transducer. As the body moves through the transducer the diametrically arranged pairs of capacitors scan the surface to result in a surface profile of the body. For scanning the bore of a pipe or tube the transducer is inserted as a probe and moved along the bore of the pipe or tube, means being provided for maintaining the probe coaxial with the pipe or tube. (author)
Efficiency of Capacitively Loaded Converters
Andersen, Thomas; Huang, Lina; Andersen, Michael A. E.
2012-01-01
This paper explores the characteristic of capacitance versus voltage for dielectric electro active polymer (DEAP) actuator, 2kV polypropylene film capacitor as well as 3kV X7R multi layer ceramic capacitor (MLCC) at the beginning. An energy efficiency for capacitively loaded converters...... is introduced as a definition of efficiency. The calculated and measured efficiency curves for charging DEAP actuator, polypropylene film capacitor and X7R MLCC are provided and compared. The attention has to be paid for the voltage dependent capacitive load, like X7R MLCC, when evaluating the charging...... polypropylene film capacitor can be the equivalent capacitive load. Because of the voltage dependent characteristic, X7R MLCC cannot be used to replace the DEAP actuator. However, this type of capacitor can be used to substitute the capacitive actuator with voltage dependent property at the development phase....
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.
Ferroelectric negative capacitance domain dynamics
Hoffmann, Michael; Khan, Asif Islam; Serrao, Claudy; Lu, Zhongyuan; Salahuddin, Sayeef; Pešić, Milan; Slesazeck, Stefan; Schroeder, Uwe; Mikolajick, Thomas
2018-05-01
Transient negative capacitance effects in epitaxial ferroelectric Pb(Zr0.2Ti0.8)O3 capacitors are investigated with a focus on the dynamical switching behavior governed by domain nucleation and growth. Voltage pulses are applied to a series connection of the ferroelectric capacitor and a resistor to directly measure the ferroelectric negative capacitance during switching. A time-dependent Ginzburg-Landau approach is used to investigate the underlying domain dynamics. The transient negative capacitance is shown to originate from reverse domain nucleation and unrestricted domain growth. However, with the onset of domain coalescence, the capacitance becomes positive again. The persistence of the negative capacitance state is therefore limited by the speed of domain wall motion. By changing the applied electric field, capacitor area or external resistance, this domain wall velocity can be varied predictably over several orders of magnitude. Additionally, detailed insights into the intrinsic material properties of the ferroelectric are obtainable through these measurements. A new method for reliable extraction of the average negative capacitance of the ferroelectric is presented. Furthermore, a simple analytical model is developed, which accurately describes the negative capacitance transient time as a function of the material properties and the experimental boundary conditions.
A Genetic Algorithm on Inventory Routing Problem
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.
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.
The Capacitive Magnetic Field Sensor
Zyatkov, D. O.; Yurchenko, A. V.; Balashov, V. B.; Yurchenko, V. I.
2016-01-01
The results of a study of sensitive element magnetic field sensor are represented in this paper. The sensor is based on the change of the capacitance with an active dielectric (ferrofluid) due to the magnitude of magnetic field. To prepare the ferrofluid magnetic particles are used, which have a followingdispersion equal to 50 brand 5BDSR. The dependence of the sensitivity of the capacitive element from the ferrofluid with different dispersion of magnetic particles is considered. The threshold of sensitivity and sensitivity of a measuring cell with ferrofluid by a magnetic field was determined. The experimental graphs of capacitance change of the magnitude of magnetic field are presented.
Virtual electrical capacitance tomography sensor
Li, Y; Yang, W Q
2005-01-01
Electrical capacitance tomography (ECT) is an effective technique for elucidating the distribution of dielectric materials inside closed pipes or vessels. This paper describes a virtual electrical capacitance tomography (VECT) system, which can simulate a range of sensor and hardware configurations and material distributions. A selection of popular image reconstruction algorithms has been made available and image error and capacitance error tools enable their performance to be evaluated and compared. Series of frame-by-frame results can be stored for simulating real-time dynamic flows. The system is programmed in Matlab with DOS functions. It is convenient to use and low-cost to operate, providing an effective tool for engineering experiment
A location-routing problem model with multiple periods and fuzzy demands
Ali Nadizadeh
2014-08-01
Full Text Available This paper puts forward a dynamic capacitated location-routing problem with fuzzy demands (DCLRP-FD. It is given on input a set of identical vehicles (each having a capacity, a fixed cost and availability level, a set of depots with restricted capacities and opening costs, a set of customers with fuzzy demands, and a planning horizon with multiple periods. The problem consists of determining the depots to be opened only in the first period of the planning horizon, the customers and the vehicles to be assigned to each opened depot, and performing the routes that may be changed in each time period due to fuzzy demands. A fuzzy chance-constrained programming (FCCP model has been designed using credibility theory and a hybrid heuristic algorithm with four phases is presented in order to solve the problem. To obtain the best value of the fuzzy parameters of the model and show the influence of the availability level of vehicles on final solution, some computational experiments are carried out. The validity of the model is then evaluated in contrast with CLRP-FD's models in the literature. The results indicate that the model and the proposed algorithm are robust and could be used in real world problems.
Ferroelectric Negative Capacitance Domain Dynamics
Hoffmann, Michael; Khan, Asif Islam; Serrao, Claudy; Lu, Zhongyuan; Salahuddin, Sayeef; Pešić, Milan; Slesazeck, Stefan; Schroeder, Uwe; Mikolajick, Thomas
2017-01-01
Transient negative capacitance effects in epitaxial ferroelectric Pb(Zr$_{0.2}$Ti$_{0.8}$)O$_3$ capacitors are investigated with a focus on the dynamical switching behavior governed by domain nucleation and growth. Voltage pulses are applied to a series connection of the ferroelectric capacitor and a resistor to directly measure the ferroelectric negative capacitance during switching. A time-dependent Ginzburg-Landau approach is used to investigate the underlying domain dynamics. The transien...
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...
Capacitive sensor for engine oil deterioration measurement
Shinde, Harish; Bewoor, Anand
2018-04-01
A simple system or mechanism for engine Oil (lubricating oil) deterioration monitoring is a need. As engine oil is an important element in I C engines and it is exposed to various strains depending on the operating conditions. If it becomes contaminated with dirt and metal particles, it can become too thick or thin and loses its protective properties, leads to unwanted friction. In turn, to avoid an engine failure, the oil must be changed before it loses its protective properties, which may be harmful to engine which deteriorates vehicle performance. At the same time, changing the lubricant too early, cause inefficient use of already depleting resources, also unwanted impact on the environment and economic reasons. Hence, it will be always helpful to know the quality of the oil under use. With this objective, the research work had been undertaken to develop a simple capacitance sensor for quantification of the quality of oil under use. One of the investigated parameter to quantify oil degradation is Viscosity (as per standard testing procedure: DIN 51562-1). In this research work, an alternative method proposed which analyzing change in capacitance of oil, to quantify the quality of oil underuse and compared to a conventional standard method. The experimental results reported in this paper shows trend for the same. Engine oil of grade SAE 15W40 used for light-duty vehicle, vans and passenger cars is used for experimentation. Suggested method can form a base for further research to develop a cost-effective method for indicating the time to change in engine oil quality have been presented.
Paek, Eunsu; Pak, Alexander J; Hwang, Gyeong S
2014-08-13
Chemically doped graphene-based materials have recently been explored as a means to improve the performance of supercapacitors. In this work, we investigate the effects of 3d transition metals bound to vacancy sites in graphene with [BMIM][PF6] ionic liquid on the interfacial capacitance; these results are compared to the pristine graphene case with particular attention to the relative contributions of the quantum and electric double layer capacitances. Our study highlights that the presence of metal-vacancy complexes significantly increases the availability of electronic states near the charge neutrality point, thereby enhancing the quantum capacitance drastically. In addition, the use of metal-doped graphene electrodes is found to only marginally influence the microstructure and capacitance of the electric double layer. Our findings indicate that metal-doping of graphene-like electrodes can be a promising route toward increasing the interfacial capacitance of electrochemical double layer capacitors, primarily by enhancing the quantum capacitance.
Capacitance probe for detection of anomalies in non-metallic plastic pipe
Mathur, Mahendra P.; Spenik, James L.; Condon, Christopher M.; Anderson, Rodney; Driscoll, Daniel J.; Fincham, Jr., William L.; Monazam, Esmail R.
2010-11-23
The disclosure relates to analysis of materials using a capacitive sensor to detect anomalies through comparison of measured capacitances. The capacitive sensor is used in conjunction with a capacitance measurement device, a location device, and a processor in order to generate a capacitance versus location output which may be inspected for the detection and localization of anomalies within the material under test. The components may be carried as payload on an inspection vehicle which may traverse through a pipe interior, allowing evaluation of nonmetallic or plastic pipes when the piping exterior is not accessible. In an embodiment, supporting components are solid-state devices powered by a low voltage on-board power supply, providing for use in environments where voltage levels may be restricted.
Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem
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.
Bioenergetics of mammalian sperm capacitation.
Ferramosca, Alessandra; Zara, Vincenzo
2014-01-01
After ejaculation, the mammalian male gamete must undergo the capacitation process, which is a prerequisite for egg fertilization. The bioenergetics of sperm capacitation is poorly understood despite its fundamental role in sustaining the biochemical and molecular events occurring during gamete activation. Glycolysis and mitochondrial oxidative phosphorylation (OXPHOS) are the two major metabolic pathways producing ATP which is the primary source of energy for spermatozoa. Since recent data suggest that spermatozoa have the ability to use different metabolic substrates, the main aim of this work is to present a broad overview of the current knowledge on the energy-producing metabolic pathways operating inside sperm mitochondria during capacitation in different mammalian species. Metabolism of glucose and of other energetic substrates, such as pyruvate, lactate, and citrate, is critically analyzed. Such knowledge, besides its obvious importance for basic science, could eventually translate into the development of novel strategies for treatment of male infertility, artificial reproduction, and sperm selection methods.
Voltage Dependence of Supercapacitor Capacitance
Szewczyk Arkadiusz
2016-09-01
Full Text Available Electronic Double-Layer Capacitors (EDLC, called Supercapacitors (SC, are electronic devices that are capable to store a relatively high amount of energy in a small volume comparing to other types of capacitors. They are composed of an activated carbon layer and electrolyte solution. The charge is stored on electrodes, forming the Helmholtz layer, and in electrolyte. The capacitance of supercapacitor is voltage- dependent. We propose an experimental method, based on monitoring of charging and discharging a supercapacitor, which enables to evaluate the charge in an SC structure as well as the Capacitance-Voltage (C-V dependence. The measurement setup, method and experimental results of charging/discharging commercially available supercapacitors in various voltage and current conditions are presented. The total charge stored in an SC structure is proportional to the square of voltage at SC electrodes while the charge on electrodes increases linearly with the voltage on SC electrodes. The Helmholtz capacitance increases linearly with the voltage bias while a sublinear increase of total capacitance was found. The voltage on SC increases after the discharge of electrodes due to diffusion of charges from the electrolyte to the electrodes. We have found that the recovery voltage value is linearly proportional to the initial bias voltage value.
A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design
Qunli Yuchi
2016-01-01
Full Text Available We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL network design, which simultaneously integrates the location decisions of distribution centers (DCs, the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.
Zhou, Junshuang; Lian, Jie; Hou, Li; Zhang, Junchuan; Gou, Huiyang; Xia, Meirong; Zhao, Yufeng; Strobel, Timothy A.; Tao, Lu; Gao, Faming
2015-09-01
Highly porous nanostructures with large surface areas are typically employed for electrical double-layer capacitors to improve gravimetric energy storage capacity; however, high surface area carbon-based electrodes result in poor volumetric capacitance because of the low packing density of porous materials. Here, we demonstrate ultrahigh volumetric capacitance of 521 F cm-3 in aqueous electrolytes for non-porous carbon microsphere electrodes co-doped with fluorine and nitrogen synthesized by low-temperature solvothermal route, rivaling expensive RuO2 or MnO2 pseudo-capacitors. The new electrodes also exhibit excellent cyclic stability without capacitance loss after 10,000 cycles in both acidic and basic electrolytes at a high charge current of 5 A g-1. This work provides a new approach for designing high-performance electrodes with exceptional volumetric capacitance with high mass loadings and charge rates for long-lived electrochemical energy storage systems.
An adversarial queueing model for online server routing
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
Paradox in a non-linear capacitated transportation problem
Dahiya Kalpana
2006-01-01
Full Text Available This paper discusses a paradox in fixed charge capacitated transportation problem where the objective function is the sum of two linear fractional functions consisting of variables costs and fixed charges respectively. A paradox arises when the transportation problem admits of an objective function value which is lower than the optimal objective function value, by transporting larger quantities of goods over the same route. A sufficient condition for the existence of a paradox is established. Paradoxical range of flow is obtained for any given flow in which the corresponding objective function value is less than the optimum value of the given transportation problem. Numerical illustration is included in support of theory.
Systems and methods for vehicle speed management
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.
Akhtar, Mahmuda; Hannan, M A; Begum, R A; Basri, Hassan; Scavino, Edgar
2017-03-01
Waste collection is an important part of waste management that involves different issues, including environmental, economic, and social, among others. Waste collection optimization can reduce the waste collection budget and environmental emissions by reducing the collection route distance. This paper presents a modified Backtracking Search Algorithm (BSA) in capacitated vehicle routing problem (CVRP) models with the smart bin concept to find the best optimized waste collection route solutions. The objective function minimizes the sum of the waste collection route distances. The study introduces the concept of the threshold waste level (TWL) of waste bins to reduce the number of bins to be emptied by finding an optimal range, thus minimizing the distance. A scheduling model is also introduced to compare the feasibility of the proposed model with that of the conventional collection system in terms of travel distance, collected waste, fuel consumption, fuel cost, efficiency and CO 2 emission. The optimal TWL was found to be between 70% and 75% of the fill level of waste collection nodes and had the maximum tightness value for different problem cases. The obtained results for four days show a 36.80% distance reduction for 91.40% of the total waste collection, which eventually increases the average waste collection efficiency by 36.78% and reduces the fuel consumption, fuel cost and CO 2 emission by 50%, 47.77% and 44.68%, respectively. Thus, the proposed optimization model can be considered a viable tool for optimizing waste collection routes to reduce economic costs and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.
Predictive cruise control in hybrid electric vehicles
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
Triboelectricity in capacitive biopotential measurements.
Wartzek, Tobias; Lammersen, Thomas; Eilebrecht, Benjamin; Walter, Marian; Leonhardt, Steffen
2011-05-01
Capacitive biopotential measurements suffer from strong motion artifacts, which may result in long time periods during which a reliable measurement is not possible. This study examines contact electrification and triboelectricity as possible reasons for these artifacts and discusses local triboelectric effects on the electrode-body interface as well as global electrostatic effects as common-mode interferences. It will be shown that most probably the triboelectric effects on the electrode-body interface are the main reason for artifacts, and a reduction of artifacts can only be achieved with a proper design of the electrode-body interface. For a deeper understanding of the observed effects, a mathematical model for triboelectric effects in highly isolated capacitive biopotential measurements is presented and verified with experiments. Based on these analyses of the triboelectric effects on the electrode-body interface, different electrode designs are developed and analyzed in order to minimize artifacts due to triboelectricity on the electrode-body interface. © 2011 IEEE
Synthesis of graphene platelets by chemical and electrochemical route
Ramachandran, Rajendran; Felix, Sathiyanathan [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Joshi, Girish M. [Materials Physics Division, School of Advanced Sciences, VIT University, Vellore 632014, Tamil Nadu (India); Raghupathy, Bala P.C., E-mail: balapraveen2000@yahoo.com [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Research and Advanced Engineering Division (Materials), Renault Nissan Technology and Business Center India (P) Ltd., Chennai, Tamil Nadu (India); Jeong, Soon Kwan, E-mail: jeongsk@kier.re.kr [Climate Change Technology Research Division, Korea Institute of Energy Research, Yuseong-gu, Daejeon 305-343 (Korea, Republic of); Grace, Andrews Nirmala, E-mail: anirmalagrace@vit.ac.in [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Climate Change Technology Research Division, Korea Institute of Energy Research, Yuseong-gu, Daejeon 305-343 (Korea, Republic of)
2013-10-15
Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH{sub 4} was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide.
Synthesis of graphene platelets by chemical and electrochemical route
Ramachandran, Rajendran; Felix, Sathiyanathan; Joshi, Girish M.; Raghupathy, Bala P.C.; Jeong, Soon Kwan; Grace, Andrews Nirmala
2013-01-01
Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH 4 was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide
Prashad, Har
1992-07-01
A theoretical approach is developed for determining the capacitance and active resistance between the interacting surfaces of pivoted pads and thrust collar, under different conditions of operation. It is shown that resistance and capacitive reactance of a thrust bearing decrease with the number of pads times the values of these parameters for an individual pad, and that capacitance increases with the number of pads times the capacitance of an individual pad. The analysis presented has a potential to diagnose the behavior of pivoted pad thrust bearings with the angle of tilt and the ratio of film thickness at the leading to trailing edge, by determining the variation of capacitance, resistance, and capacitive reactance.
A queueing framework for routing problems with time-dependent travel times
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
Capacitance enhancement via electrode patterning
Ho, Tuan A.; Striolo, Alberto
2013-01-01
The necessity of increasing the energy density in electric double layer capacitors to meet current demand is fueling fundamental and applied research alike. We report here molecular dynamics simulation results for aqueous electrolytes near model electrodes. Particular focus is on the effect of electrode patterning on the structure of interfacial electrolytes, and on the potential drop between the solid electrodes and the bulk electrolytes. The latter is estimated by numerically integrating the Poisson equation using the charge densities due to water and ions accumulated near the interface as input. We considered uniform and patterned electrodes, both positively and negatively charged. The uniformly charged electrodes are modeled as graphite. The patterned ones are obtained by removing carbon atoms from the top-most graphene layer, yielding nanoscopic squares and stripes patterns. For simplicity, the patterned electrodes are effectively simulated as insulators (the charge remains localized on the top-most layer of carbon atoms). Our simulations show that the patterns alter the structure of water and the accumulation of ions at the liquid-solid interfaces. Using aqueous NaCl solutions, we found that while the capacitance calculated for three positively charged electrodes did not change much, that calculated for the negatively charged electrodes significantly increased upon patterning. We find that both water structure and orientation, as well as ion accumulation affect the capacitance. As electrode patterning affects differently water structure and ion accumulation, it might be possible to observe ion-specific effects. These results could be useful for advancing our understanding of electric double layer capacitors, capacitive desalination processes, as well as of fundamental interfacial electrolytes properties
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...
Aspheric surface measurement using capacitive probes
Tao, Xin; Yuan, Daocheng; Li, Shaobo
2017-02-01
With the application of aspheres in optical fields, high precision and high efficiency aspheric surface metrology becomes a hot research topic. We describe a novel method of non-contact measurement of aspheric surface with capacitive probe. Taking an eccentric spherical surface as the object of study, the averaging effect of capacitive probe measurement and the influence of tilting the capacitive probe on the measurement results are investigated. By comparing measurement results from simultaneous measurement of the capacitive probe and contact probe of roundness instrument, this paper indicates the feasibility of using capacitive probes to test aspheric surface and proposes the compensation method of measurement error caused by averaging effect and the tilting of the capacitive probe.
Flexible PVDF ferroelectric capacitive temperature sensor
Khan, Naveed
2015-08-02
In this paper, a capacitive temperature sensor based on polyvinylidene fluoride (PVDF) capacitor is explored. The PVDF capacitor is characterized below its Curie temperature. The capacitance of the PVDF capacitor changes vs temperature with a sensitivity of 16pF/°C. The linearity measurement of the capacitance-temperature relation shows less than 0.7°C error from a best fit straight line. An LC oscillator based temperature sensor is demonstrated based on this capacitor.
Ultrahigh Temperature Capacitive Pressure Sensor
Harsh, Kevin
2014-01-01
Robust, miniaturized sensing systems are needed to improve performance, increase efficiency, and track system health status and failure modes of advanced propulsion systems. Because microsensors must operate in extremely harsh environments, there are many technical challenges involved in developing reliable systems. In addition to high temperatures and pressures, sensing systems are exposed to oxidation, corrosion, thermal shock, fatigue, fouling, and abrasive wear. In these harsh conditions, sensors must be able to withstand high flow rates, vibration, jet fuel, and exhaust. In order for existing and future aeropropulsion turbine engines to improve safety and reduce cost and emissions while controlling engine instabilities, more accurate and complete sensor information is necessary. High-temperature (300 to 1,350 C) capacitive pressure sensors are of particular interest due to their high measurement bandwidth and inherent suitability for wireless readout schemes. The objective of this project is to develop a capacitive pressure sensor based on silicon carbon nitride (SiCN), a new class of high-temperature ceramic materials, which possesses excellent mechanical and electric properties at temperatures up to 1,600 C.
Capacitive Feedthroughs for Medical Implants.
Grob, Sven; Tass, Peter A; Hauptmann, Christian
2016-01-01
Important technological advances in the last decades paved the road to a great success story for electrically stimulating medical implants, including cochlear implants or implants for deep brain stimulation. However, there are still many challenges in reducing side effects and improving functionality and comfort for the patient. Two of the main challenges are the wish for smaller implants on one hand, and the demand for more stimulation channels on the other hand. But these two aims lead to a conflict of interests. This paper presents a novel design for an electrical feedthrough, the so called capacitive feedthrough, which allows both reducing the size, and increasing the number of included channels. Capacitive feedthroughs combine the functionality of a coupling capacitor and an electrical feedthrough within one and the same structure. The paper also discusses the progress and the challenges of the first produced demonstrators. The concept bears a high potential in improving current feedthrough technology, and could be applied on all kinds of electrical medical implants, even if its implementation might be challenging.
On line routing per mobile phone
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...
Disruption management of the vehicle routing problem with vehicle breakdown
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....
A new interface weak-capacitance detection ASIC of capacitive liquid level sensor in the rocket
Yin, Liang; Qin, Yao; Liu, Xiao-Wei
2017-11-01
A new capacitive liquid level sensing interface weak-capacitance detection ASIC has been designed. This ASIC realized the detection of the output capacitance of the capacitive liquid level sensor, which converts the output capacitance of the capacitive liquid level sensor to voltage. The chip is fabricated in a standard 0.5μm CMOS process. The test results show that the linearity of capacitance detection of the ASIC is 0.05%, output noise is 3.7aF/Hz (when the capacitance which will be detected is 40 pF), the stability of capacitance detection is 7.4 × 10-5pF (1σ, 1h), the output zero position temperature coefficient is 4.5 uV/∘C. The test results prove that this interface ASIC can meet the requirement of high accuracy capacitance detection. Therefore, this interface ASIC can be applied in capacitive liquid level sensing and capacitive humidity sensing field.
Capacitance densitometer for flow regime identification
Shipp, R.L. Jr.
1978-01-01
This invention relates to a capacitance densitometer for determining the flow regime of a two-phase flow system. A two-element capacitance densitometer is used in conjunction with a conventional single-beam gamma densitometer to unambiguously identify the prevailing flow regime and the average density of a flowing fluid
Design of double capacitances infrasonic receiver
Wang Changhai; Han Kuixia; Wang Fei
2003-01-01
The article introduces the theory of infrasonic generation and reception of nuclear explosion. An idea of the design of double capacitances infrasonic receiver using CPLD technology is given in it. Compare with the single capacitance infrasonic receiver, sensitivity of the improved receiver can be improved scores of times, dynamic range can be improved largely, and the whole performance gets improvement a lots
Novel RF-MEMS capacitive switching structures
Rottenberg, X.; Jansen, Henricus V.; Fiorini, P.; De Raedt, W.; Tilmans, H.A.C.
2002-01-01
This paper reports on novel RF-MEMS capacitive switching devices implementing an electrically floating metal layer covering the dielectric to ensure intimate contact with the bridge in the down state. This results in an optimal switch down capacitance and allows optimisation of the down/up
Scanning Capacitance Microscopy | Materials Science | NREL
obtained using scanning capacitance microscopy. Top Right: Image of p-type and n-type material, obtained 'fingers' of light-colored n-type material on a yellow and blue background representing p-type material material, obtained using scanning capacitance microscopy, in a sample semiconductor device; the image shows
Capacitive Biosensors and Molecularly Imprinted Electrodes.
Ertürk, Gizem; Mattiasson, Bo
2017-02-17
Capacitive biosensors belong to the group of affinity biosensors that operate by registering direct binding between the sensor surface and the target molecule. This type of biosensors measures the changes in dielectric properties and/or thickness of the dielectric layer at the electrolyte/electrode interface. Capacitive biosensors have so far been successfully used for detection of proteins, nucleotides, heavy metals, saccharides, small organic molecules and microbial cells. In recent years, the microcontact imprinting method has been used to create very sensitive and selective biorecognition cavities on surfaces of capacitive electrodes. This chapter summarizes the principle and different applications of capacitive biosensors with an emphasis on microcontact imprinting method with its recent capacitive biosensor applications.
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.
Routing in opportunistic networks
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...
Tourism Routes, Local Economic Promotion and Pro-Poor ...
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 ...
Reducing the capacitance of piezoelectric film sensors
González, Martín G., E-mail: mggonza@fi.uba.ar [Grupo de Láser, Óptica de Materiales y Aplicaciones Electromagnéticas (GLOMAE), Departamento de Física, Facultad de Ingeniería, Universidad de Buenos Aires, Paseo Colón 850, C1063ACV Buenos Aires (Argentina); Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), C1425FQB Buenos Aires (Argentina); Sorichetti, Patricio A.; Santiago, Guillermo D. [Grupo de Láser, Óptica de Materiales y Aplicaciones Electromagnéticas (GLOMAE), Departamento de Física, Facultad de Ingeniería, Universidad de Buenos Aires, Paseo Colón 850, C1063ACV Buenos Aires (Argentina)
2016-04-15
We present a novel design for large area, wideband, polymer piezoelectric sensor with low capacitance. The large area allows better spatial resolution in applications such as photoacoustic tomography and the reduced capacitance eases the design of fast transimpedance amplifiers. The metalized piezoelectric polymer thin film is segmented into N sections, electrically connected in series. In this way, the total capacitance is reduced by a factor 1/N{sup 2}, whereas the mechanical response and the active area of the sensor are not modified. We show the construction details for a two-section sensor, together with the impedance spectroscopy and impulse response experimental results that validate the design.
Reducing the capacitance of piezoelectric film sensors
González, Martín G.; Sorichetti, Patricio A.; Santiago, Guillermo D.
2016-01-01
We present a novel design for large area, wideband, polymer piezoelectric sensor with low capacitance. The large area allows better spatial resolution in applications such as photoacoustic tomography and the reduced capacitance eases the design of fast transimpedance amplifiers. The metalized piezoelectric polymer thin film is segmented into N sections, electrically connected in series. In this way, the total capacitance is reduced by a factor 1/N"2, whereas the mechanical response and the active area of the sensor are not modified. We show the construction details for a two-section sensor, together with the impedance spectroscopy and impulse response experimental results that validate the design.
A miniature electrical capacitance tomograph
York, T. A.; Phua, T. N.; Reichelt, L.; Pawlowski, A.; Kneer, R.
2006-08-01
The paper describes a miniature electrical capacitance tomography system. This is based on a custom CMOS silicon integrated circuit comprising eight channels of signal conditioning electronics to source drive signals and measure voltages. Electrodes are deposited around a hole that is fabricated, using ultrasonic drilling, through a ceramic substrate and has an average diameter of 0.75 mm. The custom chip is interfaced to a host computer via a bespoke data acquisition system based on a microcontroller, field programmable logic device and wide shift register. This provides fast capture of up to 750 frames of data prior to uploading to the host computer. Data capture rates of about 6000 frames per second have been achieved for the eight-electrode sensor. This rate could be increased but at the expense of signal to noise. Captured data are uploaded to a PC, via a RS232 interface, for off-line imaging. Initial tests are reported for the static case involving 200 µm diameter rods that are placed in the sensor and for the dynamic case using the dose from an inhaler.
Improved capacitive melting curve measurements
Sebedash, Alexander; Tuoriniemi, Juha; Pentti, Elias; Salmela, Anssi
2009-01-01
Sensitivity of the capacitive method for determining the melting pressure of helium can be enhanced by loading the empty side of the capacitor with helium at a pressure nearly equal to that desired to be measured and by using a relatively thin and flexible membrane in between. This way one can achieve a nanobar resolution at the level of 30 bar, which is two orders of magnitude better than that of the best gauges with vacuum reference. This extends the applicability of melting curve thermometry to lower temperatures and would allow detecting tiny anomalies in the melting pressure, which must be associated with any phenomena contributing to the entropy of the liquid or solid phases. We demonstrated this principle in measurements of the crystallization pressure of isotopic helium mixtures at millikelvin temperatures by using partly solid pure 4 He as the reference substance providing the best possible universal reference pressure. The achieved sensitivity was good enough for melting curve thermometry on mixtures down to 100 μK. Similar system can be used on pure isotopes by virtue of a blocked capillary giving a stable reference condition with liquid slightly below the melting pressure in the reference volume. This was tested with pure 4 He at temperatures 0.08-0.3 K. To avoid spurious heating effects, one must carefully choose and arrange any dielectric materials close to the active capacitor. We observed some 100 pW loading at moderate excitation voltages.
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...
Regulation of capacitative and non-capacitative Ca2+ entry in A7r5 vascular smooth muscle cells
COLIN W TAYLOR
2004-01-01
Full Text Available A capacitative Ca2+ entry (CCE pathway, activated by depletion of intracellular Ca2+ stores, is thought to mediate much of the Ca2+ entry evoked by receptors that stimulate phospholipase C (PLC. However, in A7r5 vascular smooth muscle cells, vasopressin, which stimulates PLC, empties intracellular Ca2+ stores but simultaneously inhibits their ability to activate CCE. The diacylglycerol produced with the IP3 that empties the stores is metabolized to arachidonic and this leads to activation of nitric oxide (NO synthase, production of NO and cyclic GMP, and consequent activation of protein kinase G. The latter inhibits CCE. In parallel, NO directly activates a non-capacitative Ca2+ entry (NCCE pathway, which is entirely responsible for the Ca2+ entry that occurs in the presence of vasopressin. This reciprocal regulation of two Ca2+ entry pathways ensures that there is sequential activation of first NCCE in the presence of vasopressin, and then a transient activation of CCE when vasopressin is removed. We suggest that the two routes for Ca2+ entry may selectively direct Ca2+ to processes that mediate activation and then recovery of the cell.
Resistive and Capacitive Based Sensing Technologies
Winncy Y. Du
2008-04-01
Full Text Available Resistive and capacitive (RC sensors are the most commonly used sensors. Their applications span homeland security, industry, environment, space, traffic control, home automation, aviation, and medicine. More than 30% of modern sensors are direct or indirect applications of the RC sensing principles. This paper reviews resistive and capacitive sensing technologies. The physical principles of resistive sensors are governed by several important laws and phenomena such as Ohm’s Law, Wiedemann-Franz Law; Photoconductive-, Piezoresistive-, and Thermoresistive Effects. The applications of these principles are presented through a variety of examples including accelerometers, flame detectors, pressure/flow rate sensors, RTDs, hygristors, chemiresistors, and bio-impedance sensors. The capacitive sensors are described through their three configurations: parallel (flat, cylindrical (coaxial, and spherical (concentric. Each configuration is discussed with respect to its geometric structure, function, and application in various sensor designs. Capacitance sensor arrays are also presented in the paper.
Capacitive Cells for Dielectric Constant Measurement
Aguilar, Horacio Munguía; Maldonado, Rigoberto Franco
2015-01-01
A simple capacitive cell for dielectric constant measurement in liquids is presented. As an illustrative application, the cell is used for measuring the degradation of overheated edible oil through the evaluation of their dielectric constant.
Complementary surface charge for enhanced capacitive deionization
Gao, X.; Porada, S.; Omosebi, A.; Liu, K.L.; Biesheuvel, P.M.; Landon, J.
2016-01-01
Commercially available activated carbon cloth electrodes are treated using nitric acid and ethylenediamine solutions, resulting in chemical surface charge enhanced carbon electrodes for capacitive deionization (CDI) applications. Surface charge enhanced electrodes are then configured in a CDI
Capacitance and surface of carbons in supercapacitors
Lobato Ortega, Belén; Suárez Fernández, Loreto; Guardia, Laura; Álvarez Centeno, Teresa
2017-01-01
This research is focused in the missing link between the specific surface area of carbons surface and their electrochemical capacitance. Current protocols used for the characterization of carbons applied in supercapacitors electrodes induce inconsistencies in the values of the interfacial capacitance (in F m−2), which is hindering the optimization of supercapacitors. The constraints of both the physisorption of N2 at 77 K and the standard methods used for the isotherm analysis frequently lead...
Development of electrical capacitance sensor for tomography
Rasif Mohd Zain; Jaafar Abdullah; Ismail Mustapha; Sazrol Azizee Ariff; Susan Maria Sipaun; Lojius Lombigit
2004-01-01
Electrical capacitance tomography (ECT) is one of the successful methods for imaging 2-phase liquid/gas mixture in oil pipelines and solids/gas mixture in fluidized bed and pneumatic conveying system for improvement of process plants. This paper presents the design development of an electrical capacitance sensor for use with an ECT system. This project is aimed at developing a demonstration ECT unit to be used in the oil pipe line. (Author)
Automatic Power Factor Correction Using Capacitive Bank
Mr.Anant Kumar Tiwari,; Mrs. Durga Sharma
2014-01-01
The power factor correction of electrical loads is a problem common to all industrial companies. Earlier the power factor correction was done by adjusting the capacitive bank manually [1]. The automated power factor corrector (APFC) using capacitive load bank is helpful in providing the power factor correction. Proposed automated project involves measuring the power factor value from the load using microcontroller. The design of this auto-adjustable power factor correction is ...
Narrow gap electronegative capacitive discharges
Kawamura, E.; Lieberman, M. A.; Lichtenberg, A. J. [Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, California 94720 (United States)
2013-10-15
Narrow gap electronegative (EN) capacitive discharges are widely used in industry and have unique features not found in conventional discharges. In this paper, plasma parameters are determined over a range of decreasing gap length L from values for which an electropositive (EP) edge exists (2-region case) to smaller L-values for which the EN region connects directly to the sheath (1-region case). Parametric studies are performed at applied voltage V{sub rf}=500 V for pressures of 10, 25, 50, and 100 mTorr, and additionally at 50 mTorr for 1000 and 2000 V. Numerical results are given for a parallel plate oxygen discharge using a planar 1D3v (1 spatial dimension, 3 velocity components) particle-in-cell (PIC) code. New interesting phenomena are found for the case in which an EP edge does not exist. This 1-region case has not previously been investigated in detail, either numerically or analytically. In particular, attachment in the sheaths is important, and the central electron density n{sub e0} is depressed below the density n{sub esh} at the sheath edge. The sheath oscillations also extend into the EN core, creating an edge region lying within the sheath and not characterized by the standard diffusion in an EN plasma. An analytical model is developed using minimal inputs from the PIC results, and compared to the PIC results for a base case at V{sub rf}=500 V and 50 mTorr, showing good agreement. Selected comparisons are made at the other voltages and pressures. A self-consistent model is also developed and compared to the PIC results, giving reasonable agreement.
Ghezavati, V. R.; Beigi, M.
2016-12-01
During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among established facilities and existing demand points. In this paper, the location-routing problem with time window (LRPTW) and homogeneous fleet type and designing a multi-echelon, and capacitated reverse logistics network, are considered which may arise in many real-life situations in logistics management. Our proposed RL network consists of hybrid collection/inspection centers, recovery centers and disposal centers. Here, we present a new bi-objective mathematical programming (BOMP) for LRPTW in reverse logistic. Since this type of problem is NP-hard, the non-dominated sorting genetic algorithm II (NSGA-II) is proposed to obtain the Pareto frontier for the given problem. Several numerical examples are presented to illustrate the effectiveness of the proposed model and algorithm. Also, the present work is an effort to effectively implement the ɛ-constraint method in GAMS software for producing the Pareto-optimal solutions in a BOMP. The results of the proposed algorithm have been compared with the ɛ-constraint method. The computational results show that the ɛ-constraint method is able to solve small-size instances to optimality within reasonable computing times, and for medium-to-large-sized problems, the proposed NSGA-II works better than the ɛ-constraint.
State alternative route designations
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
36 CFR 4.10 - Travel on park roads and designated routes.
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...
36 CFR 1004.10 - Travel on Presidio Trust roads and designated routes.
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...
Advanced Vehicle Testing and Evaluation
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.
Porada, S.; Hamelers, H.V.M.; Bryjak, M.; Presser, V.; Biesheuvel, P.M.; Weingarth, D.
2014-01-01
Capacitive technologies, such as capacitive deionization and energy harvesting based on mixing energy (“capmix” and “CO2 energy”), are characterized by intermittent operation: phases of ion electrosorption from the water are followed by system regeneration. From a system application point of view,
Capacitive behavior of highly-oxidized graphite
Ciszewski, Mateusz; Mianowski, Andrzej
2014-09-01
Capacitive behavior of a highly-oxidized graphite is presented in this paper. The graphite oxide was synthesized using an oxidizing mixture of potassium chlorate and concentrated fuming nitric acid. As-oxidized graphite was quantitatively and qualitatively analyzed with respect to the oxygen content and the species of oxygen-containing groups. Electrochemical measurements were performed in a two-electrode symmetric cell using KOH electrolyte. It was shown that prolonged oxidation causes an increase in the oxygen content while the interlayer distance remains constant. Specific capacitance increased with oxygen content in the electrode as a result of pseudo-capacitive effects, from 0.47 to 0.54 F/g for a scan rate of 20 mV/s and 0.67 to 1.15 F/g for a scan rate of 5 mV/s. Better cyclability was observed for the electrode with a higher oxygen amount.
Negative capacitance in a ferroelectric capacitor.
Khan, Asif Islam; Chatterjee, Korok; Wang, Brian; Drapcho, Steven; You, Long; Serrao, Claudy; Bakaul, Saidur Rahman; Ramesh, Ramamoorthy; Salahuddin, Sayeef
2015-02-01
The Boltzmann distribution of electrons poses a fundamental barrier to lowering energy dissipation in conventional electronics, often termed as Boltzmann Tyranny. Negative capacitance in ferroelectric materials, which stems from the stored energy of a phase transition, could provide a solution, but a direct measurement of negative capacitance has so far been elusive. Here, we report the observation of negative capacitance in a thin, epitaxial ferroelectric film. When a voltage pulse is applied, the voltage across the ferroelectric capacitor is found to be decreasing with time--in exactly the opposite direction to which voltage for a regular capacitor should change. Analysis of this 'inductance'-like behaviour from a capacitor presents an unprecedented insight into the intrinsic energy profile of the ferroelectric material and could pave the way for completely new applications.
Carbon nanofiber supercapacitors with large areal capacitances
McDonough, James R.
2009-01-01
We develop supercapacitor (SC) devices with large per-area capacitances by utilizing three-dimensional (3D) porous substrates. Carbon nanofibers (CNFs) functioning as active SC electrodes are grown on 3D nickel foam. The 3D porous substrates facilitate a mass loading of active electrodes and per-area capacitance as large as 60 mg/ cm2 and 1.2 F/ cm2, respectively. We optimize SC performance by developing an annealing-free CNF growth process that minimizes undesirable nickel carbide formation. Superior per-area capacitances described here suggest that 3D porous substrates are useful in various energy storage devices in which per-area performance is critical. © 2009 American Institute of Physics.
Electrochemical capacitance performance of titanium nitride nanoarray
Xie, Yibing, E-mail: ybxie@seu.edu.cn [School of Chemistry and Chemical Engineering, Southeast University, Nanjing 211189 (China); Suzhou Research Institute of Southeast University, Suzhou 215123 (China); Wang, Yong [School of Chemistry and Chemical Engineering, Southeast University, Nanjing 211189 (China); Du, Hongxiu [School of Chemistry and Chemical Engineering, Southeast University, Nanjing 211189 (China); Suzhou Research Institute of Southeast University, Suzhou 215123 (China)
2013-12-01
Highlights: • TiN nanoarray is formed by a nitridation process of TiO{sub 2} in ammonia atmosphere. • TiN nanoarray exhibits much higher EDLC capacitance than TiO{sub 2} nanoarray. • The specific capacitance of TiN nanoarray achieves a high level of 99.7 mF cm{sup −2}. • A flexible solid-state supercapacitor is constructed by TiN nanoarray and PVA gel. -- Abstract: In this study, titanium nitride (TiN) nanoarrays with a short nanotube and long nanopore structure have been prepared by an anodization process of ultra thin titanium foil in ethylene glycol (EG) solution containing ammonium fluoride, subsequent calcination process in an air atmosphere, and final nitridation process in an ammonia atmosphere. The morphology and microstructure characterization has been conducted using field emission scanning electron microscope and X-ray diffraction. The electrochemical properties have been investigated through cyclic voltammetry and electrochemical impedance spectrum measurements. The electrochemical capacitance performance has been investigated by galvanostatic charge–discharge measurements in the acidic, neural and alkali electrolyte solution. Well-defined TiN nanoarrays contribute a much higher capacitance performance than titania (TiO{sub 2}) in the supercapacitor application due to the extraordinarily improved electrical conductivity. Such an electrochemical capacitance can be further enhanced by increasing aspect ratio of TiN nanoarray from short nanotubes to long nanopores. A flexible supercapacitor has been constructed using two symmetrical TiN nanoarray electrodes and a polyvinyl alcohol (PVA) gel electrolyte with H{sub 2}SO{sub 4}–KCl–H{sub 2}O–EG. Such a supercapacitor has a highly improved potential window and still keeps good electrochemical energy storage. TiN nanoarray with a high aspect ratio can act well as an ultra thin film electrode material of flexible supercapacitor to contribute a superior capacitance performance.
Capacitance level probe, Type FSK 88
Vogt, W.
2001-01-01
The aim of the capacitive level probe, Type FSK 88, is to supervise the level within vessels continuously and to signalize alterations immediately. Since 1987 the level probe is installed in the pool for burn up fuel elements and in the reactor containment sump of BWRs, PWRs and WWERs. The capacitive level probe of type FSK 88 was qualified for Loss of Coolant Accidents and seismic events according to international rules. The measuring principle takes credit from the fact that the dielectric with different dielectric constants in a condensator changes the capacity of the condensator. (Authors)
Detecting size and shape of bodies capacitatively
Walton, H.
1980-01-01
The size and shape of a body is determined by rolling it between the plates of capacitors and measuring the capacitance changes. A capacitor comprising two parallel, spaced wires inclined to the rolling direction and above and below the rolling body scans sections of the body along its longitudinal axis, another determines the body's lengths and a third comprising two non-parallel wires determines the position of the body. The capacitance changes are compared with those produced by a body of known size and shape so that the size and shape of the body can be determined. (author)
Capacitors and Resistance-Capacitance Networks.
Balabanian, Norman; Root, Augustin A.
This programed textbook was developed under a contract with the United States Office of Education as Number 5 in a series of materials for use in an electrical engineering sequence. It is divided into three parts--(1) capacitors, (2) voltage-current relationships, and (3) simple resistance-capacitance networks. (DH)
Thermodynamic cycle analysis for capacitive deionization
Biesheuvel, P.M.
2009-01-01
Capacitive deionization (CDI) is an ion removal technology based on temporarily storing ions in the polarization layers of two oppositely positioned electrodes. Here we present a thermodynamic model for the minimum work required for ion separation in the fully reversible case by describing the ionic
Performance relations in Capacitive Deionization systems
Limpt, van B.
2010-01-01
Capacitive Deionization (CDI) is a relatively new deionization technology based on the temporary storage of ions on an electrically charged surface. By directing a flow between two oppositely charged surfaces, negatively charged ions will adsorb onto the positively charged surface, and positively
Flexible PVDF ferroelectric capacitive temperature sensor
Khan, Naveed; Omran, Hesham; Yao, Yingbang; Salama, Khaled N.
2015-01-01
sensitivity of 16pF/°C. The linearity measurement of the capacitance-temperature relation shows less than 0.7°C error from a best fit straight line. An LC oscillator based temperature sensor is demonstrated based on this capacitor.
Comparison of gate capacitance extraction methodologies
Kazmi, S.N.R.; Schmitz, Jurriaan
2008-01-01
In recent years, many new capacitance-voltage measurement approaches have been presented in literature. New approaches became necessary with the rapidly increasing gate current density in newer CMOS generations. Here we present a simulation platform using Silvaco software, to describe the full chain
Inside-out electrical capacitance tomography
Kjærsgaard-Rasmussen, Jimmy; Meyer, Knud Erik
2011-01-01
In this work we demonstrate the construction of an ‘inside-out’ sensor geometry for electrical capacitance tomography (ECT). The inside-out geometry has the electrodes placed around a tube, as usual, but measuring ‘outwards’. The flow between the electrodes and an outer tube is reconstructed...
Overview of capacitive couplings in windings
Djukic, N.; Encica, L.; Paulides, J.J.H.
2015-01-01
The use of electrical machines (EMs) with variable-frequency drives (VFDs) results in electromagnetic interference (EMI). At high frequencies (HFs) of conducted EMI, the impedance of an EM insulation system fed from a VFD is small due to the parasitic capacitive couplings. Thus, the conducted EMI
Capacitive system detects and locates fluid leaks
1966-01-01
Electronic monitoring system automatically detects and locates minute leaks in seams of large fluid storage tanks and pipelines covered with thermal insulation. The system uses a capacitive tape-sensing element that is adhesively bonded over seams where fluid leaks are likely to occur.
A Review of Vehicle to Vehicle Communication Protocols for VANETs in the Urban Environment
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.
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...
Evaluation of cyclic battery ageing for railway vehicle application
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...
Erfani, Seyed Mohammad Hassan; Danesh, Shahnaz; Karrabi, Seyed Mohsen; Shad, Rouzbeh
2017-07-01
One of the major challenges in big cities is planning and implementation of an optimized, integrated solid waste management system. This optimization is crucial if environmental problems are to be prevented and the expenses to be reduced. A solid waste management system consists of many stages including collection, transfer and disposal. In this research, an integrated model was proposed and used to optimize two functional elements of municipal solid waste management (storage and collection systems) in the Ahmadabad neighbourhood located in the City of Mashhad - Iran. The integrated model was performed by modelling and solving the location allocation problem and capacitated vehicle routing problem (CVRP) through Geographic Information Systems (GIS). The results showed that the current collection system is not efficient owing to its incompatibility with the existing urban structure and population distribution. Application of the proposed model could significantly improve the storage and collection system. Based on the results of minimizing facilities analyses, scenarios with 100, 150 and 180 m walking distance were considered to find optimal bin locations for Alamdasht, C-metri and Koohsangi. The total number of daily collection tours was reduced to seven as compared to the eight tours carried out in the current system (12.50% reduction). In addition, the total number of required crews was minimized and reduced by 41.70% (24 crews in the current collection system vs 14 in the system provided by the model). The total collection vehicle routing was also optimized such that the total travelled distances during night and day working shifts was cut back by 53%.
Varying carbon structures templated from KIT-6 for optimum electrochemical capacitance
Li Fujun; Laak, Nicole van der; Ting, S.-W. [Department of Chemistry, University of Hong Kong, Pokfulam Road, Hong Kong (Hong Kong); Chan, K.-Y., E-mail: hrsccky@hku.h [Department of Chemistry, University of Hong Kong, Pokfulam Road, Hong Kong (Hong Kong)
2010-03-01
Bicontinuous ordered mesoporous carbons (OMCs), fabricated from a KIT-6 template using aluminosilicate as catalyst and furfuryl alcohol as carbon source, were successfully prepared and studied as electrodes in supercapacitors. Their structures were characterized by transmission electron microscopy (TEM), small-angle X-ray diffraction (SAXD) and N{sub 2} cryosorption methods. Using cyclic voltammetry (CV) and electrochemical impedance spectroscopy (EIS), the capacitive performance of the OMCs was found to be strongly dependent on the mesostructure. Specific capacitance value greater than 130 F g{sup -1} at 20 mV s{sup -1} were obtained from an OMC that featured high surface area with the existence of additional large pores to enhance the specific capacitance at high discharge rate. For the OMC with the best performance, we found that a power density as high as 4.5 kW kg{sup -1} at an energy density of 6.1 Wh kg{sup -1} can be delivered when the discharge current density is 20 A g{sup -1} and can also be continuously charged and discharged with little variation in capacitance after 2500 cycles. These results indicate that this OMC with optimized structure has potential to be used as a power component in electric vehicles.
Pedersen, Thomas; Fragiacomo, Giulio; Hansen, Ole
2009-01-01
This paper describes the design and fabrication of a capacitive pressure sensor that has a large capacitance signal and a high sensitivity of 76 pF/bar in touch mode operation. Due to the large signal, problems with parasitic capacitances are avoided and hence it is possible to integrate the sensor...... bonding to create vacuum cavities. The exposed part of the sensor is perfectly flat such that it can be coated with corrosion resistant thin films. Hysteresis is an inherent problem in touch mode capacitive pressure sensors and a technique to significantly reduce it is presented....... with a discrete components electronics circuit for signal conditioning. Using an AC bridge electronics circuit a resolution of 8 mV/mbar is achieved. The large signal is obtained due to a novel membrane structure utilizing closely packed hexagonal elements. The sensor is fabricated in a process based on fusion...
Nonlinear dynamics of capacitive charging and desalination by porous electrodes
Biesheuvel, P.M.; Bazant, M.Z.
2010-01-01
The rapid and efficient exchange of ions between porous electrodes and aqueous solutions is important in many applications, such as electrical energy storage by supercapacitors, water desalination and purification by capacitive deionization, and capacitive extraction of renewable energy from a
A Review Of Design And Control Of Automated Guided Vehicle Systems
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
Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs
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.
Understanding individual routing behaviour.
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).
Conductive MOF electrodes for stable supercapacitors with high areal capacitance.
Sheberla, Dennis; Bachman, John C; Elias, Joseph S; Sun, Cheng-Jun; Shao-Horn, Yang; Dincă, Mircea
2017-02-01
Owing to their high power density and superior cyclability relative to batteries, electrochemical double layer capacitors (EDLCs) have emerged as an important electrical energy storage technology that will play a critical role in the large-scale deployment of intermittent renewable energy sources, smart power grids, and electrical vehicles. Because the capacitance and charge-discharge rates of EDLCs scale with surface area and electrical conductivity, respectively, porous carbons such as activated carbon, carbon nanotubes and crosslinked or holey graphenes are used exclusively as the active electrode materials in EDLCs. One class of materials whose surface area far exceeds that of activated carbons, potentially allowing them to challenge the dominance of carbon electrodes in EDLCs, is metal-organic frameworks (MOFs). The high porosity of MOFs, however, is conventionally coupled to very poor electrical conductivity, which has thus far prevented the use of these materials as active electrodes in EDLCs. Here, we show that Ni 3 (2,3,6,7,10,11-hexaiminotriphenylene) 2 (Ni 3 (HITP) 2 ), a MOF with high electrical conductivity, can serve as the sole electrode material in an EDLC. This is the first example of a supercapacitor made entirely from neat MOFs as active materials, without conductive additives or other binders. The MOF-based device shows an areal capacitance that exceeds those of most carbon-based materials and capacity retention greater than 90% over 10,000 cycles, in line with commercial devices. Given the established structural and compositional tunability of MOFs, these results herald the advent of a new generation of supercapacitors whose active electrode materials can be tuned rationally, at the molecular level.
Conductive MOF electrodes for stable supercapacitors with high areal capacitance
Sheberla, Dennis; Bachman, John C.; Elias, Joseph S.; Sun, Cheng-Jun; Shao-Horn, Yang; Dincă, Mircea
2017-02-01
Owing to their high power density and superior cyclability relative to batteries, electrochemical double layer capacitors (EDLCs) have emerged as an important electrical energy storage technology that will play a critical role in the large-scale deployment of intermittent renewable energy sources, smart power grids, and electrical vehicles. Because the capacitance and charge-discharge rates of EDLCs scale with surface area and electrical conductivity, respectively, porous carbons such as activated carbon, carbon nanotubes and crosslinked or holey graphenes are used exclusively as the active electrode materials in EDLCs. One class of materials whose surface area far exceeds that of activated carbons, potentially allowing them to challenge the dominance of carbon electrodes in EDLCs, is metal-organic frameworks (MOFs). The high porosity of MOFs, however, is conventionally coupled to very poor electrical conductivity, which has thus far prevented the use of these materials as active electrodes in EDLCs. Here, we show that Ni3(2,3,6,7,10,11-hexaiminotriphenylene)2 (Ni3(HITP)2), a MOF with high electrical conductivity, can serve as the sole electrode material in an EDLC. This is the first example of a supercapacitor made entirely from neat MOFs as active materials, without conductive additives or other binders. The MOF-based device shows an areal capacitance that exceeds those of most carbon-based materials and capacity retention greater than 90% over 10,000 cycles, in line with commercial devices. Given the established structural and compositional tunability of MOFs, these results herald the advent of a new generation of supercapacitors whose active electrode materials can be tuned rationally, at the molecular level.
Dynamic Routing of Short Transfer Baggage
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...
Quantum capacitance of the armchair-edge graphene nanoribbon
Home; Journals; Pramana – Journal of Physics; Volume 81; Issue 2. Quantum capacitance of the ... Abstract. The quantum capacitance, an important parameter in the design of nanoscale devices, is derived for armchair-edge single-layer graphene nanoribbon with semiconducting property. The quantum capacitance ...
Exact Algorithm for the Capacitated Team Orienteering Problem with Time Windows
Junhyuk Park
2017-01-01
Full Text Available The capacitated team orienteering problem with time windows (CTOPTW is a problem to determine players’ paths that have the maximum rewards while satisfying the constraints. In this paper, we present the exact solution approach for the CTOPTW which has not been done in previous literature. We show that the branch-and-price (B&P scheme which was originally developed for the team orienteering problem can be applied to the CTOPTW. To solve pricing problems, we used implicit enumeration acceleration techniques, heuristic algorithms, and ng-route relaxations.
Inventory slack routing application in emergency logistics and relief distributions.
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.
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.
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...
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....
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.
A Review on the Recent Development of Capacitive Wireless Power Transfer Technology
Fei Lu
2017-11-01
Full Text Available Capacitive power transfer (CPT technology is an effective and important alternative to the conventional inductive power transfer (IPT. It utilizes high-frequency electric fields to transfer electric power, which has three distinguishing advantages: negligible eddy-current loss, relatively low cost and weight, and excellent misalignment performance. In recent years, the power level and efficiency of CPT systems has been significantly improved and has reached the power level suitable for electric vehicle charging applications. This paper reviews the latest developments in CPT technology, focusing on two key technologies: the compensation circuit topology and the capacitive coupler structure. The comparison with the IPT system and some critical issues in practical applications are also discussed. Based on these analyses, the future research direction can be developed and the applications of the CPT technology can be promoted.
A Review Of Design And Control Of Automated Guided Vehicle Systems
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...
Compressed magnetic flux amplifier with capacitive load
Stuetzer, O.M.
1980-03-01
A first-order analysis is presented for a compressed magnetic flux (CMF) current amplifier working into a load with a capacitive component. Since the purpose of the investigation was to gain a general understanding of the arrangement, a number of approximations and limitations were accepted. The inductance of the transducer varies with time; the inductance/resistance/capacitance (LRC) circuit therefore is parametric and solutions are different for the stable regime (high C), the oscillation regime (low C), and the transition case. Solutions and performance depend strongly on circuit boundary conditions, i.e., energization of the circuit by either an injected current or by an applied capacitor charge. The behavior of current and energy amplification for the various cases are discussed in detail. A number of experiments with small CMF devices showed that the first-order theory presented predicts transducer performance well in the linear regime
Exact methods for time constrained routing and related scheduling problems
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...
Development of a contactless capacitive immunosensor
Perruche, Brice Emmanuel
2011-01-01
In the present work, a label-free, contactless and capacitive immunosensor is developed using impedance spectroscopy, in the aim to perform low-cost immunoassays. Chapter 1 puts this work in perspective with some existing techniques, while a presentation of impedance theory used in this work is carried out in chapter 2. In Chapter 3, numerical simulations using a commercial finite element method software is carried out. The response of coplanar and fa...
Adding Resistances and Capacitances in Introductory Electricity
Efthimiou, C. J.; Llewellyn, R. A.
2005-09-01
All introductory physics textbooks, with or without calculus, cover the addition of both resistances and capacitances in series and in parallel as discrete summations. However, none includes problems that involve continuous versions of resistors in parallel or capacitors in series. This paper introduces a method for solving the continuous problems that is logical, straightforward, and within the mathematical preparation of students at the introductory level.
Multi-Channel Capacitive Sensor Arrays
Bingnan Wang
2016-01-01
Full Text Available In this paper, multi-channel capacitive sensor arrays based on microstrip band-stop filters are studied. The sensor arrays can be used to detect the proximity of objects at different positions and directions. Each capacitive sensing structure in the array is connected to an inductive element to form resonance at different frequencies. The resonances are designed to be isolated in the frequency spectrum, such that the change in one channel does not affect resonances at other channels. The inductive element associated with each capacitive sensor can be surface-mounted inductors, integrated microstrip inductors or metamaterial-inspired structures. We show that by using metamaterial split-ring structures coupled to a microstrip line, the quality factor of each resonance can be greatly improved compared to conventional surface-mounted or microstrip meander inductors. With such a microstrip-coupled split-ring design, more sensing elements can be integrated in the same frequency spectrum, and the sensitivity can be greatly improved.
Capacitive Structures for Gas and Biological Sensing
Sapsanis, Christos
2015-04-01
The semiconductor industry was benefited by the advances in technology in the last decades. This fact has an impact on the sensors field, where the simple transducer was evolved into smart miniaturized multi-functional microsystems. However, commercially available gas and biological sensors are mostly bulky, expensive, and power-hungry, which act as obstacles to mass use. The aim of this work is gas and biological sensing using capacitive structures. Capacitive sensors were selected due to its design simplicity, low fabrication cost, and no DC power consumption. In the first part, the dominant structure among interdigitated electrodes (IDEs), fractal curves (Peano and Hilbert) and Archimedean spiral was investigated from capacitance density perspective. The investigation consists of geometrical formula calculations, COMSOL Multiphysics simulations and cleanroom fabrication of the capacitors on a silicon substrate. Moreover, low-cost fabrication on flexible plastic PET substrate was conducted outside cleanroom with rapid prototyping using a maskless laser etching. The second part contains the humidity, Volatile Organic compounds (VOCs) and Ammonia sensing of polymers, Polyimide and Nafion, and metal-organic framework (MOF), Cu(bdc)2.xH2O using IDEs and tested in an automated gas setup for experiment control and data extraction. The last part includes the biological sensing of C - reactive protein (CRP) quantification, which is considered as a biomarker of being prone to cardiac diseases and Bovine serum albumin (BSA) protein quantification, which is used as a reference for quantifying unknown proteins.
Micromachined capacitive ultrasonic immersion transducer array
Jin, Xuecheng
Capacitive micromachined ultrasonic transducers (cMUTs) have emerged as an attractive alternative to conventional piezoelectric ultrasonic transducers. They offer performance advantages of wide bandwidth and sensitivity that have heretofore been attainable. In addition, micromachining technology, which has benefited from the fast-growing microelectronics industry, enables cMUT array fabrication and electronics integration. This thesis describes the design and fabrication of micromachined capacitive ultrasonic immersion transducer arrays. The basic transducer electrical equivalent circuit is derived from Mason's theory. The effects of Lamb waves and Stoneley waves on cross coupling and acoustic losses are discussed. Electrical parasitics such as series resistance and shunt capacitance are also included in the model of the transducer. Transducer fabrication technology is systematically studied. Device dimension control in both vertical and horizontal directions, process alternatives and variations in membrane formation, via etch and cavity sealing, and metalization as well as their impact on transducer performance are summarized. Both 64 and 128 element 1-D array transducers are fabricated. Transducers are characterized in terms of electrical input impedance, bandwidth, sensitivity, dynamic range, impulse response and angular response, and their performance is compared with theoretical simulation. Various schemes for cross coupling reduction is analyzed, implemented, and verified with both experiments and theory. Preliminary results of immersion imaging are presented using 64 elements 1-D array transducers for active source imaging.
Calculation of secondary capacitance of compact Tesla pulse transformer
Yu Binxiong; Liu Jinliang
2013-01-01
An analytic expression of the secondary capacitance of a compact Tesla pulse transformer is derived. Calculated result by the expression shows that two parts contribute to the secondary capacitance, namely the capacitance between inner and outer magnetic cores and the attached capacitance caused by the secondary winding. The attached capacitance equals to the capacitance of a coaxial line which is as long as the secondary coil, and whose outer and inner diameters are as large as the inner diameter of the outer magnetic and the outer diameter of the inner magnetic core respectively. A circuital model for analyzing compact Tesla transformer is built, and numeric calculation shows that the expression of the secondary capacitance is correct. Besides, a small compact Tesla transformer is developed, and related test is carried out. Test result confirms the calculated results by the expression derived. (authors)
Improved capacitance sensor with variable operating frequency for scanning capacitance microscopy
Kwon, Joonhyung; Kim, Joonhui; Jeong, Jong-Hwa; Lee, Euy-Kyu; Seok Kim, Yong; Kang, Chi Jung; Park, Sang-il
2005-01-01
Scanning capacitance microscopy (SCM) has been gaining attention for its capability to measure local electrical properties in doping profile, oxide thickness, trapped charges and charge dynamics. In many cases, stray capacitance produced by different samples and measurement conditions affects the resonance frequency of a capacitance sensor. The applications of conventional SCM are critically limited by the fixed operating frequency and lack of tunability in its SCM sensor. In order to widen SCM application to various samples, we have developed a novel SCM sensor with variable operating frequency. By performing variable frequency sweep over the band of 160 MHz, the SCM sensor is tuned to select the best and optimized resonance frequency and quality factor for each sample measurement. The fundamental advantage of the new variable frequency SCM sensor was demonstrated in the SCM imaging of silicon oxide nano-crystals. Typical sensitivity of the variable frequency SCM sensor was found to be 10 -19 F/V
Capacitive Sensing of Glucose in Electrolytes Using Graphene Quantum Capacitance Varactors.
Zhang, Yao; Ma, Rui; Zhen, Xue V; Kudva, Yogish C; Bühlmann, Philippe; Koester, Steven J
2017-11-08
A novel graphene-based variable capacitor (varactor) that senses glucose based on the quantum capacitance effect was successfully developed. The sensor utilizes a metal-oxide-graphene varactor device structure that is inherently compatible with passive wireless sensing, a key advantage for in vivo glucose sensing. The graphene varactors were functionalized with pyrene-1-boronic acid (PBA) by self-assembly driven by π-π interactions. Successful surface functionalization was confirmed by both Raman spectroscopy and capacitance-voltage characterization of the devices. Through glucose binding to the PBA, the glucose concentration in the buffer solutions modulates the level of electrostatic doping of the graphene surface to different degrees, which leads to capacitance changes and Dirac voltage shifts. These responses to the glucose concentration were shown to be reproducible and reversible over multiple measurement cycles, suggesting promise for eventual use in wireless glucose monitoring.
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.
Optimizing well intervention routes
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)
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
Multihop Wireless Networks Opportunistic Routing
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
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...
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...
Enabling Routes as Context in Mobile Services
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...
A current driven capacitively coupled chlorine discharge
Huang, Shuo; Gudmundsson, J T
2014-01-01
The effect of driving current, driving frequency and secondary electrons on capacitively coupled chlorine discharge is systematically investigated using a hybrid approach consisting of a particle-in-cell/Monte Carlo simulation and a volume-averaged global model. The driving current is varied from 20 to 80 A m −2 , the driving frequency is varied from 13.56 to 60 MHz and the secondary electron emission coefficient is varied from 0.0 to 0.4. Key plasma parameters including electron energy probability function, electron heating rate, ion energy and angular distributions are explored and their variations with control parameters are analyzed and compared with other discharges. Furthermore, we extend our study to dual-frequency (DF) capacitively coupled chlorine discharge by adding a low-frequency current source and explore the effect of the low-frequency source on the discharge. The low-frequency current density is increased from 0 to 4 A m −2 . The flux of Cl 2 + ions to the surface increases only slightly while the average energy of Cl 2 + ions to the surface increases almost linearly with increasing low-frequency current, which shows possible independent control of the flux and energy of Cl 2 + ions by varying the low-frequency current in a DF capacitively coupled chlorine discharge. However, the increase in the flux of Cl + ions with increasing low-frequency current, which is mainly due to the increased dissociation fraction of the background gas caused by extra power supplied by the low-frequency source, is undesirable. (paper)
CMOS MEMS capacitive absolute pressure sensor
Narducci, M; Tsai, J; Yu-Chia, L; Fang, W
2013-01-01
This paper presents the design, fabrication and characterization of a capacitive pressure sensor using a commercial 0.18 µm CMOS (complementary metal–oxide–semiconductor) process and postprocess. The pressure sensor is capacitive and the structure is formed by an Al top electrode enclosed in a suspended SiO 2 membrane, which acts as a movable electrode against a bottom or stationary Al electrode fixed on the SiO 2 substrate. Both the movable and fixed electrodes form a variable parallel plate capacitor, whose capacitance varies with the applied pressure on the surface. In order to release the membranes the CMOS layers need to be applied postprocess and this mainly consists of four steps: (1) deposition and patterning of PECVD (plasma-enhanced chemical vapor deposition) oxide to protect CMOS pads and to open the pressure sensor top surface, (2) etching of the sacrificial layer to release the suspended membrane, (3) deposition of PECVD oxide to seal the etching holes and creating vacuum inside the gap, and finally (4) etching of the passivation oxide to open the pads and allow electrical connections. This sensor design and fabrication is suitable to obey the design rules of a CMOS foundry and since it only uses low-temperature processes, it allows monolithic integration with other types of CMOS compatible sensors and IC (integrated circuit) interface on a single chip. Experimental results showed that the pressure sensor has a highly linear sensitivity of 0.14 fF kPa −1 in the pressure range of 0–300 kPa. (paper)
Study the Z-Plane Strip Capacitance
Parikh, H.; Swain, S.
2005-01-01
The BaBaR detector at the Stanford Linear Accelerator Center is currently undergoing an upgrade to improve its muon and neutral hadron detection system. The Resistive Plate Chambers (RPCs) that had been used till now have deteriorated in performance over the past few years and are being replaced by Limited Streamer Tube (LSTs). Each layer of the system consists of a set of up to 10 streamer tube modules which provide one coordinate (φ coordinate) and a single ''Z-plane'' which provides the Z coordinate of the hit. The large area Z-planes (up to 12m 2 ) are 1mm thick and contain 96 copper strips that detect the induced charge from avalanches created in the streamer tube wires. All the Z-planes needed for the upgrade have already been constructed, but only a third of the planes were installed last summer. After installing the 24 Z-planes last year, it was learned that 0.7% of the strips were dead when put inside the detector. This was mainly due to the delicate solder joint between the read-out cable and the strip, and since it is difficult to access or replace the Z-planes inside the detector, it is very important to perform various tests to make sure that the Z-planes will be efficient and effective in the long term. We measure the capacitance between the copper strips and the ground plane, and compare it to the theoretical value that we expect. Instead of measuring the capacitance channel by channel, which would be a very tedious job, we developed a more effective method of measuring the capacitance. Since all the Z-planes were built at SLAC, we also built a smaller 46 cm by 30 cm Z-plane with 12 strips just to see how they were constructed and to gain a better understanding about the solder joints
Routing helicopters for crew exchanges on off-shore locations
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
Understanding the Capacitance of PEDOT:PSS
Volkov, Anton V.; Wijeratne, Kosala; Mitraka, Evangelia
2017-01-01
Poly(3,4-ethylenedioxythiophene):polystyrene sulfonate (PEDOT:PSS) is the most studied and explored mixed ion-electron conducting polymer system. PEDOT:PSS is commonly included as an electroactive conductor in various organic devices, e.g., supercapacitors, displays, transistors, and energy......-converters. In spite of its long-term use as a material for storage and transport of charges, the fundamentals of its bulk capacitance remain poorly understood. Generally, charge storage in supercapacitors is due to formation of electrical double layers or redox reactions, and it is widely accepted that PEDOT...
Spectral response analysis of PVDF capacitive sensors
Reyes-Ramírez, B.; García-Segundo, C.; García-Valenzuela, A.
2013-06-01
We investigate the spectral response to ultrasound waves in water of low-noise capacitive sensors based on PVDF polymer piezoelectric films. First, we analyze theoretically the mechanical-to-electrical transduction as a function of the frequency of ultrasonic signals and derive an analytic expression of the sensor's transfer function. Then we present experimental results of the frequency response of a home-made PDVF in water to test signals from 1 to 20 MHz induced by a commercial hydrophone powered by a signal generator and compare with our theoretical model.
Capacitive tool standoff sensor for dismantlement tasks
Schmitt, D.J.; Weber, T.M.; Liu, J.C.
1996-01-01
A capacitive sensing technology has been applied to develop a Standoff Sensor System for control of robotically deployed tools utilized in Decontamination and Dismantlement (D and D) activities. The system combines four individual sensor elements to provide non-contact, multiple degree-of-freedom control of tools at distances up to five inches from a surface. The Standoff Sensor has been successfully integrated to a metal cutting router and a pyrometer, and utilized for real-time control of each of these tools. Experiments demonstrate that the system can locate stationary surfaces with a repeatability of 0.034 millimeters
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.)
Whirlpool routing for mobility
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.
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.
Study on effective MOSFET channel length extracted from gate capacitance
Tsuji, Katsuhiro; Terada, Kazuo; Fujisaka, Hisato
2018-01-01
The effective channel length (L GCM) of metal-oxide-semiconductor field-effect transistors (MOSFETs) is extracted from the gate capacitances of actual-size MOSFETs, which are measured by charge-injection-induced-error-free charge-based capacitance measurement (CIEF CBCM). To accurately evaluate the capacitances between the gate and the channel of test MOSFETs, the parasitic capacitances are removed by using test MOSFETs having various channel sizes and a source/drain reference device. A strong linear relationship between the gate-channel capacitance and the design channel length is obtained, from which L GCM is extracted. It is found that L GCM is slightly less than the effective channel length (L CRM) extracted from the measured MOSFET drain current. The reason for this is discussed, and it is found that the capacitance between the gate electrode and the source and drain regions affects this extraction.
Dispersion capacitive de l'interface H2SO4/Pt Capacitive dispersion ...
Administrateur
Département de Physique, Faculté des Sciences Exactes. Université des .... d'un comportement idéal de la capacité. Au vu .... Figure 2 : Photographie de la cellule Pt/0,5 MH2SO4 (fabriquée par Verre-Lab Constantine) plongée dans un bain.
Accurate sizing of supercapacitors storage system considering its capacitance variation.
Trieste , Sony; Bourguet , Salvy; Olivier , Jean-Christophe; Loron , Luc; Le Claire , Jean-Claude
2011-01-01
International audience; This paper highlights the energy errors made for the design of supercapacitors used as a main energy source. First of all, the paper presents the two definitions of capacitance of a capacitance-voltage dependent material. The number of supercapacitors is important for the application purchasing cost. That is why the paper introduces an analytical model and an electrical model along with an identification method for the capacitance variation. This variation is presented...
Carrier Statistics and Quantum Capacitance Models of Graphene Nanoscroll
M. Khaledian
2014-01-01
schematic perfect scroll-like Archimedes spiral. The DOS model was derived at first, while it was later applied to compute the carrier concentration and quantum capacitance model. Furthermore, the carrier concentration and quantum capacitance were modeled for both degenerate and nondegenerate regimes, along with examining the effect of structural parameters and chirality number on the density of state and carrier concentration. Latterly, the temperature effect on the quantum capacitance was studied too.
Programmable differential capacitance-to-voltage converter for MEMS accelerometers
Royo, G.; Sánchez-Azqueta, C.; Gimeno, C.; Aldea, C.; Celma, S.
2017-05-01
Capacitive MEMS sensors exhibit an excellent noise performance, high sensitivity and low power consumption. They offer a huge range of applications, being the accelerometer one of its main uses. In this work, we present the design of a capacitance-to-voltage converter in CMOS technology to measure the acceleration from the capacitance variations. It is based on a low-power, fully-differential transimpedance amplifier with low input impedance and a very low input noise.
An Ultra-Low-Latency Geo-Routing Scheme for Team-Based Unmanned Vehicular Applications
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
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
Optimization of the coplanar interdigital capacitive sensor
Huang, Yunzhi; Zhan, Zheng; Bowler, Nicola
2017-02-01
Interdigital capacitive sensors are applied in nondestructive testing and material property characterization of low-conductivity materials. The sensor performance is typically described based on the penetration depth of the electric field into the sample material, the sensor signal strength and its sensitivity. These factors all depend on the geometry and material properties of the sensor and sample. In this paper, a detailed analysis is provided, through finite element simulations, of the ways in which the sensor's geometrical parameters affect its performance. The geometrical parameters include the number of digits forming the interdigital electrodes and the ratio of digit width to their separation. In addition, the influence of the presence or absence of a metal backplane on the sample is analyzed. Further, the effects of sensor substrate thickness and material on signal strength are studied. The results of the analysis show that it is necessary to take into account a trade-off between the desired sensitivity and penetration depth when designing the sensor. Parametric equations are presented to assist the sensor designer or nondestructive evaluation specialist in optimizing the design of a capacitive sensor.
Design of electrical capacitance tomography sensors
Yang, Wuqiang
2010-01-01
Electrical capacitance tomography (ECT) has been developed since the late 1980s for visualization and measurement of a permittivity distribution in a cross section using a multi-electrode capacitance sensor. While the hardware and image reconstruction algorithms for ECT have been published extensively and the topics have been reviewed, few papers have been published to discuss ECT sensors and the design issues, which are crucial for a specific application. This paper will briefly discuss the principles of ECT sensors, but mostly will address key issues for ECT sensor design, with reference to some existing ECT sensors as a good understanding of the key issues would help optimization of the design of ECT sensors. The key issues to be discussed include the number and length of electrodes, the use of external and internal electrodes, implications of wall thickness, earthed screens (including the outer screen, axial end screens and radial screens), driven guard electrodes, dealing with high temperature and high pressure, twin planes for velocity measurement by cross correlation and limitations in sensor diameter. While conventional ECT sensors are circular with the electrodes in a single plane or in twin planes, some non-conventional ECT sensors, such as square, conical and 3D sensors, will also be discussed. As a practical guidance, the procedure to fabricate an ECT sensor will be given. In the end are summary and discussion on future challenges, including re-engineering of ECT sensors. (topical review)
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.
A Dynamic Travel Time Estimation Model Based on Connected Vehicles
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.
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...
Solar Cell Capacitance Determination Based on an RLC Resonant Circuit
Petru Adrian Cotfas
2018-03-01
Full Text Available The capacitance is one of the key dynamic parameters of solar cells, which can provide essential information regarding the quality and health state of the cell. However, the measurement of this parameter is not a trivial task, as it typically requires high accuracy instruments using, e.g., electrical impedance spectroscopy (IS. This paper introduces a simple and effective method to determine the electric capacitance of the solar cells. An RLC (Resistor Inductance Capacitor circuit is formed by using an inductor as a load for the solar cell. The capacitance of the solar cell is found by measuring the frequency of the damped oscillation that occurs at the moment of connecting the inductor to the solar cell. The study is performed through simulation based on National Instruments (NI Multisim application as SPICE simulation software and through experimental capacitance measurements of a monocrystalline silicon commercial solar cell and a photovoltaic panel using the proposed method. The results were validated using impedance spectroscopy. The differences between the capacitance values obtained by the two methods are of 1% for the solar cells and of 9.6% for the PV panel. The irradiance level effect upon the solar cell capacitance was studied obtaining an increase in the capacitance in function of the irradiance. By connecting different inductors to the solar cell, the frequency effect upon the solar cell capacitance was studied noticing a very small decrease in the capacitance with the frequency. Additionally, the temperature effect over the solar cell capacitance was studied achieving an increase in capacitance with temperature.
Adaptive powertrain control for plugin hybrid electric vehicles
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.
Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint
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.
Predictive routing for autonomous mobility-on-demand systems with ride-sharing
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
ANALYTICAL ESTIMATION OF MINIMUM AND MAXIMUM TIME EXPENDITURES OF PASSENGERS AT AN URBAN ROUTE STOP
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.
A capacitive bioelectrode for recording electrophysiological signals
Moreno Garcia, E.; Mujica Ascencio, S.; Rosa Vazquez, J. M.de la; Stolik Isakina, S.
2012-01-01
In this paper we describe a gel-free sensor with on-board electrode design, which capacitive couples to the skin to detect the electrical activity in the body. The integrated sensor is manufactured on a standard printed circuit board within 2.2 cm diameter enclosure that can operate through fabric or other insulation. The electrode includes amplification (60db gain) and passive band pass filtering (0.5 to 100 Hz). Active shielding surrounding the sensor plate is used to reduce noise pickup. The input referred noise, measured over the electrode bandwidth is 4 μV rms at 0.2 mm sensor distance, and 16 μV rms at 1.2 mm distance trough two cotton cloths. The bioelectrodes were coupled to the scalp trough hair for EEG signals (with 80 db gain), and coupled to the chest through clothing for ECG signals. The recorded signals show well performance of the designed bielectrode. (Author)
Vertically aligned BCN nanotubes with high capacitance.
Iyyamperumal, Eswaramoorthi; Wang, Shuangyin; Dai, Liming
2012-06-26
Using a chemical vapor deposition method, we have synthesized vertically aligned BCN nanotubes (VA-BCNs) on a Ni-Fe-coated SiO(2)/Si substrate from a melamine diborate precursor. The effects of pyrolysis conditions on the morphology and thermal property of grown nanotubes, as well as the nanostructure and composition of an individual BCN nanotube, were systematically studied. It was found that nitrogen atoms are bonded to carbons in both graphitic and pyridinic forms and that the resultant VA-BCNs grown at 1000 °C show the highest specific capacitance (321.0 F/g) with an excellent rate capability and high durability with respect to nonaligned BCN (167.3 F/g) and undoped multiwalled carbon nanotubes (117.3 F/g) due to synergetic effects arising from the combined co-doping of B and N in CNTs and the well-aligned nanotube structure.
Developments of capacitance stabilised etalon technology
Bond, R. A.; Foster, M.; Thwaite, C.; Thompson, C. K.; Rees, D.; Bakalski, I. V.; Pereira do Carmo, J.
2017-11-01
This paper describes a high-resolution optical filter (HRF) suitable for narrow bandwidth filtering in LIDAR applications. The filter is composed of a broadband interference filter and a narrowband Fabry-Perot etalon based on the capacitance stabilised concept. The key requirements for the HRF were a bandwidth of less than 40 pm, a tuneable range of over 6 nm and a transmission greater than 50%. These requirements combined with the need for very high out-of-band rejection (greater than 50 dB in the range 300 nm to 1200 nm) drive the design of the filter towards a combination of high transmission broadband filter and high performance tuneable, narrowband filter.
Capacitive Neutralization Dialysis for Direct Energy Generation.
Liu, Yue; Zhang, Yi; Ou-Yang, Wei; Bastos Sales, Bruno; Sun, Zhuo; Liu, Fei; Zhao, Ran
2017-08-15
Capacitive neutralization dialysis energy (CNDE) is proposed as a novel energy-harvesting technique that is able to utilize waste acid and alkaline solutions to produce electrical energy. CNDE is a modification based on neutralization dialysis. It was found that a higher NaCl concentration led to a higher open-circuit potential when the concentrations of acid and alkaline solutions were fixed. Upon closing of the circuit, the membrane potential was used as a driving force to move counter ions into the electrical double layers at the electrode-liquid interface, thereby creating an ionic current. Correspondingly, in the external circuit, electrons flow through an external resistor from one electrode to the other, thereby generating electrical energy directly. The influence of external resistances was studied to achieve greater energy extraction, with the maximum output of 110 mW/m 2 obtained by employing an external resistance of 5 Ω together with the AC-coated electrode.
The capacitated team orienteering problem with incomplete service
Archetti, Claudia; Bianchessi, Nicola; Speranza, M. Grazia
2013-01-01
In this paper we study the capacitated version of the Team Orienteering Problem (TOP), that is the Capacitated TOP (CTOP) and the impact of relaxing the assumption that a customer, if served, must be completely served. We prove that the profit collected by the CTOP with Incomplete Service (CTOP-IS)
Clean energy generation using capacitive electrodes in reverse electrodialysis
Vermaas, David; Bajracharya, S.; Bastos Sales, B.; Saakes, Michel; Hamelers, B.; Nijmeijer, Dorothea C.
2013-01-01
Capacitive reverse electrodialysis (CRED) is a newly proposed technology to generate electricity from mixing of salt water and fresh water (salinity gradient energy) by using a membrane pile as in reverse electrodialysis (RED) and capacitive electrodes. The salinity difference between salt water and
Electric field theory and the fallacy of void capacitance
McAllister, Iain Wilson
1991-01-01
The concept of the capacitance of a gaseous void is discussed as applied to electrical insulation science. The most pertinent aspect of the capacitance definition is that of reference to a single-valued potential difference between surfaces. This implies that these surfaces must be surfaces...
Nanoscale capacitance: A quantum tight-binding model
Zhai, Feng; Wu, Jian; Li, Yang; Lu, Jun-Qiang
2017-01-01
Landauer-Buttiker formalism with the assumption of semi-infinite electrodes as reservoirs has been the standard approach in modeling steady electron transport through nanoscale devices. However, modeling dynamic electron transport properties, especially nanoscale capacitance, is a challenging problem because of dynamic contributions from electrodes, which is neglectable in modeling macroscopic capacitance and mesoscopic conductance. We implement a self-consistent quantum tight-binding model to calculate capacitance of a nano-gap system consisting of an electrode capacitance C‧ and an effective capacitance Cd of the middle device. From the calculations on a nano-gap made of carbon nanotube with a buckyball therein, we show that when the electrode length increases, the electrode capacitance C‧ moves up while the effective capacitance Cd converges to a value which is much smaller than the electrode capacitance C‧. Our results reveal the importance of electrodes in modeling nanoscale ac circuits, and indicate that the concepts of semi-infinite electrodes and reservoirs well-accepted in the steady electron transport theory may be not applicable in modeling dynamic transport properties.
A Review of High Voltage Drive Amplifiers for Capacitive Actuators
Huang, Lina; Zhang, Zhe; Andersen, Michael A. E.
2012-01-01
This paper gives an overview of the high voltage amplifiers, which are used to drive capacitive actuators. The amplifiers for both piezoelectric and DEAP (dielectric electroactive polymer) actuator are discussed. The suitable topologies for driving capacitive actuators are illustrated in detail...
Large Capacitance Measurement by Multiple Uses of MBL Charge Sensor
Lee, Jung Sook; Chae, Min; Kim, Jung Bog
2010-01-01
A recent article by Morse described interesting electrostatics experiments using an MBL charge sensor. In this application, the charge sensor has a large capacitance compared to the charged test object, so nearly all charges can be transferred to the sensor capacitor from the capacitor to be measured. However, the typical capacitance of commercial…
Measurement Error Estimation for Capacitive Voltage Transformer by Insulation Parameters
Bin Chen
2017-03-01
Full Text Available Measurement errors of a capacitive voltage transformer (CVT are relevant to its equivalent parameters for which its capacitive divider contributes the most. In daily operation, dielectric aging, moisture, dielectric breakdown, etc., it will exert mixing effects on a capacitive divider’s insulation characteristics, leading to fluctuation in equivalent parameters which result in the measurement error. This paper proposes an equivalent circuit model to represent a CVT which incorporates insulation characteristics of a capacitive divider. After software simulation and laboratory experiments, the relationship between measurement errors and insulation parameters is obtained. It indicates that variation of insulation parameters in a CVT will cause a reasonable measurement error. From field tests and calculation, equivalent capacitance mainly affects magnitude error, while dielectric loss mainly affects phase error. As capacitance changes 0.2%, magnitude error can reach −0.2%. As dielectric loss factor changes 0.2%, phase error can reach 5′. An increase of equivalent capacitance and dielectric loss factor in the high-voltage capacitor will cause a positive real power measurement error. An increase of equivalent capacitance and dielectric loss factor in the low-voltage capacitor will cause a negative real power measurement error.
Capacitive-discharge-pumped copper bromide vapour laser
Sukhanov, V B; Fedorov, V F; Troitskii, V O; Gubarev, F A; Evtushenko, Gennadii S
2007-01-01
A copper bromide vapour laser pumped by a high-frequency capacitive discharge is developed. It is shown that, by using of a capacitive discharge, it is possible to built a sealed off metal halide vapour laser of a simple design allowing the addition of active impurities into the working medium. (letters)
Biasing of Capacitive Micromachined Ultrasonic Transducers.
Caliano, Giosue; Matrone, Giulia; Savoia, Alessandro Stuart
2017-02-01
Capacitive micromachined ultrasonic transducers (CMUTs) represent an effective alternative to piezoelectric transducers for medical ultrasound imaging applications. They are microelectromechanical devices fabricated using silicon micromachining techniques, developed in the last two decades in many laboratories. The interest for this novel transducer technology relies on its full compatibility with standard integrated circuit technology that makes it possible to integrate on the same chip the transducers and the electronics, thus enabling the realization of extremely low-cost and high-performance devices, including both 1-D or 2-D arrays. Being capacitive transducers, CMUTs require a high bias voltage to be properly operated in pulse-echo imaging applications. The typical bias supply residual ripple of high-quality high-voltage (HV) generators is in the millivolt range, which is comparable with the amplitude of the received echo signals, and it is particularly difficult to minimize. The aim of this paper is to analyze the classical CMUT biasing circuits, highlighting the features of each one, and to propose two novel HV generator architectures optimized for CMUT biasing applications. The first circuit proposed is an ultralow-residual ripple (generator that uses an extremely stable sinusoidal power oscillator topology. The second circuit employs a commercially available integrated step-up converter characterized by a particularly efficient switching topology. The circuit is used to bias the CMUT by charging a buffer capacitor synchronously with the pulsing sequence, thus reducing the impact of the switching noise on the received echo signals. The small area of the circuit (about 1.5 cm 2 ) makes it possible to generate the bias voltage inside the probe, very close to the CMUT, making the proposed solution attractive for portable applications. Measurements and experiments are shown to demonstrate the effectiveness of the new approaches presented.
Electrostatic capacitance and Faraday cage behavior of carbon nanotube forests
Ya' akobovitz, A. [Mechanosynthesis Group, Department of Mechanical Engineering, University of Michigan, Ann Arbor, Michigan 48109 (United States); Department of Mechanical Engineering, Faculty of Engineering Sciences, Ben-Gurion University, Beer-Sheva (Israel); Bedewy, M. [Mechanosynthesis Group, Department of Mechanical Engineering, University of Michigan, Ann Arbor, Michigan 48109 (United States); Hart, A. J. [Mechanosynthesis Group, Department of Mechanical Engineering, University of Michigan, Ann Arbor, Michigan 48109 (United States); Department of Mechanical Engineering and Laboratory for Manufacturing and Productivity, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)
2015-02-02
Understanding of the electrostatic properties of carbon nanotube (CNT) forests is essential to enable their integration in microelectronic and micromechanical devices. In this study, we sought to understand how the hierarchical geometry and morphology of CNT forests determines their capacitance. First, we find that at small gaps, solid micropillars have greater capacitance, yet at larger gaps the capacitance of the CNT forests is greater. The surface area of the CNT forest accessible to the electrostatic field was extracted by analysis of the measured capacitance, and, by relating the capacitance to the average density of CNTs in the forest, we find that the penetration depth of the electrostatic field is on the order of several microns. Therefore, CNT forests can behave as a miniature Faraday cage. The unique electrostatic properties of CNT forests could therefore enable their use as long-range proximity sensors and as shielding elements for miniature electronic devices.
Interdigitated electrodes as impedance and capacitance biosensors: A review
Mazlan, N. S.; Ramli, M. M.; Abdullah, M. M. A. B.; Halin, D. S. C.; Isa, S. S. M.; Talip, L. F. A.; Danial, N. S.; Murad, S. A. Z.
2017-09-01
Interdigitated electrodes (IDEs) are made of two individually addressable interdigitated comb-like electrode structures. IDEs are one of the most favored transducers, widely utilized in technological applications especially in the field of biological and chemical sensors due to their inexpensive, ease of fabrication process and high sensitivity. In order to detect and analyze a biochemical molecule or analyte, the impedance and capacitance signal need to be obtained. This paper investigates the working principle and influencer of the impedance and capacitance biosensors. The impedance biosensor depends on the resistance and capacitance while the capacitance biosensor influenced by the dielectric permittivity. However, the geometry and structures of the interdigitated electrodes affect both impedance and capacitance biosensor. The details have been discussed in this paper.
Electrostatic capacitance and Faraday cage behavior of carbon nanotube forests
Ya'akobovitz, A.; Bedewy, M.; Hart, A. J.
2015-01-01
Understanding of the electrostatic properties of carbon nanotube (CNT) forests is essential to enable their integration in microelectronic and micromechanical devices. In this study, we sought to understand how the hierarchical geometry and morphology of CNT forests determines their capacitance. First, we find that at small gaps, solid micropillars have greater capacitance, yet at larger gaps the capacitance of the CNT forests is greater. The surface area of the CNT forest accessible to the electrostatic field was extracted by analysis of the measured capacitance, and, by relating the capacitance to the average density of CNTs in the forest, we find that the penetration depth of the electrostatic field is on the order of several microns. Therefore, CNT forests can behave as a miniature Faraday cage. The unique electrostatic properties of CNT forests could therefore enable their use as long-range proximity sensors and as shielding elements for miniature electronic devices
Electrostatic capacitance and Faraday cage behavior of carbon nanotube forests
Ya'akobovitz, A.; Bedewy, M.; Hart, A. J.
2015-02-01
Understanding of the electrostatic properties of carbon nanotube (CNT) forests is essential to enable their integration in microelectronic and micromechanical devices. In this study, we sought to understand how the hierarchical geometry and morphology of CNT forests determines their capacitance. First, we find that at small gaps, solid micropillars have greater capacitance, yet at larger gaps the capacitance of the CNT forests is greater. The surface area of the CNT forest accessible to the electrostatic field was extracted by analysis of the measured capacitance, and, by relating the capacitance to the average density of CNTs in the forest, we find that the penetration depth of the electrostatic field is on the order of several microns. Therefore, CNT forests can behave as a miniature Faraday cage. The unique electrostatic properties of CNT forests could therefore enable their use as long-range proximity sensors and as shielding elements for miniature electronic devices.
Neighboring and Connectivity-Aware Routing in VANETs
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.
Robustness of airline route networks
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.
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
Personal continuous route pattern mining
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.
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
Elisabeth Badinter, Fausse route
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...
Tramp Ship Routing and Scheduling - Incorporating Additional Complexities
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...
A multi-objective location routing problem using imperialist competitive algorithm
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.
Multiple Attribute Decision Making Based Relay Vehicle Selection for Electric Vehicle Communication
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.
Routing Service Quality—Local Driver Behavior Versus Routing Services
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...
The dynamic multi-period vehicle routing problem
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....
Solving stochastic multiobjective vehicle routing problem using probabilistic metaheuristic
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.
Solving Vehicle Routing with Full Container Load and Time Windows
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...
Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling
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
Distribution of coronary arterial capacitance in a canine model.
Lader, A S; Smith, R S; Phillips, G C; McNamee, J E; Abel, F L
1998-03-01
The capacitative properties of the major left coronary arteries, left main (LM), left anterior descending (LAD), and left circumflex (LCX), were studied in 19 open-chest isolated dog hearts. Capacitance was determined by using ramp perfusion and a left ventricular-to-coronary shunt diastolic decay method; both methods gave similar results, indicating a minimal systolic capacitative component. Increased pericardial pressure (PCP), 25 mmHg, was used to experimentally alter transmural wall pressure. The response to increased PCP was different in the LAD vs. LCX; increasing PCP decreased capacitance in the LCX but increased capacitance in the LAD. This may have been due to the different intramural vs. epicardial volume distribution of these vessels and a decrease in intramural tension during increased PCP. Increased PCP decreased LCX capacitance by approximately 13%, but no changes in conductance or zero flow pressure intercept occurred in any of the three vessels, i. e., evidence against the waterfall theory of vascular collapse at these levels of PCP. Coronary arterial capacitance was also linearly related to perfusion pressure.
Development trends of combined inductance-capacitance electromechanical energy converters
Karayan Hamlet
2018-01-01
Full Text Available In the article the modern state of completely new direction of electromechanical science such as combined inductive-capacitive electromechanics is considered. The wide spectra of its possible practical applications and prospects for further development are analyzed. A new approach for mathematical description of transients in dualcon jugate dynamic systems is proposed. On the basis of the algorithm differential equations for inductive-capacitive compatible electromechanical energy converters are derived. The generalized Lagrangian theory of combined inductively-capacitive electric machines was developed as a union of generalized Lagrangian models of inductive and capacitive electro-mechanical energy converters developed on the basis of the basic principles of binary-conjugate electrophysics. The author gives equations of electrodynamics and electromechanics of combined inductive-capacitive electric machines in case there are active electrotechnical materials of dual purpose (ferroelectromagnets in the structure of their excitation system. At the same time, the necessary Lagrangian for combined inductive-capacitive forces was built using new technologies of interaction between inductive and capacitive subsystems. The joint solution of these equations completely determines the dynamic behavior and energy characteristics of the generalized model of combined machines of any design and in any modes of interaction of their functional elements
Moronshing, Maku; Subramaniam, Chandramouli
2017-11-22
A scalable route to highly efficient purification of water through capacitive deionization (CDI) is reported using CNT-thread as electrodes. Electro-sorption capacity (q e ) of 139 mg g -1 and average salt-adsorption rate (ASAR) of 2.78 mg g -1 min -1 achieved here is the highest among all known electrode materials and nonmembrane techniques, indicating efficient and rapid deionization. Such exceptional performance is achieved with feedstock concentrations (≤1000 ppm) where conventional techniques such as reverse osmosis and electrodialysis prove ineffective. Further, both cations (Na + , K + , Mg 2+ , and Ca 2+ ) and anions (Cl - , SO 4 2- and NO 3 - ) are removed with equally high efficiency (∼80%). Synergism between electrical conductivity (∼25 S cm -1 ), high specific surface area (∼900 m 2 g -1 ), porosity (0.7 nm, 3 nm) and hydrophilicity (contact angle ∼25°) in CNT-thread electrode enable superior contact with water, rapid formation of extensive electrical double layer and consequently efficient deionization. The tunable capacitance of the device (0.4-120 mF) and its high specific capacitance (∼27.2 F g -1 ) enable exceptional performance across a wide range of saline concentrations (50-1000 ppm). Facile regeneration of the electrode and reusability of the device is achieved for several cycles. The device demonstrated can desalinate water as it trickles down its surface because of gravity, thereby eliminating the requirement of any water pumping system. Finally, its portable adaptability is demonstrated by operating the device with an AA battery.
An overview of smart grid routing algorithms
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.
Yang, Fan; Xu, Maowen; Bao, Shu-Juan; Wei, Hua; Chai, Hui
2014-01-01
In this work, polyaniline nanowires (PANI-NWs) act as spacers, incorporated with graphene oxide and self-assembled into graphene/PANI hybrid aerogels through a facile hydrothermal route. The as-synthesized samples have been characterized by X-ray diffraction (XRD), Fourier transform infrared (FT-IR) spectra, X-ray photoelectron spectroscopy (XPS), contact angle measurement, field emission scanning electron microscopy (FESEM) and transmission electron microscopy (TEM) for their microstructure, morphology and relative affinities toward water. Cyclic voltammetry (CV) and electrochemical impedance spectroscopy (EIS) measurements have been used to study the effects of composition, microstructure and morphology of the samples on their capacitive performance. The experimental results indicate that the PANI can effectively tailor the microstructures and electrochemical performances of the products. The as-prepared materials with an appropriate proportion of PANI nanowires can efficiently prevent the adjacent graphene sheets from aggregation and provide fast ionic channels for electrochemical energy storage. A specific capacitance of 520.3 F g −1 has been achieved from graphene/PANI hybrid aerogel, which also exhibits excellent cycling stability
High Voltage Bi-directional Flyback Converter for Capacitive Actuator
Thummala, Prasanth; Zhang, Zhe; Andersen, Michael A. E.
2013-01-01
in the converter, including the most dominating parameters of the high voltage transformer viz., self-capacitance and leakage inductance. The specific capacitive load for this converter is a dielectric electro active polymer (DEAP) actuator, which can be used as an effective replacement for conventional actuators...... in a number of applications. In this paper, the discharging energy efficiency definition is introduced. The proposed converter has been experimentally tested with the film capacitive load and the DEAP actuator, and the experimental results are shown together with the efficiency measurements....
Human body capacitance: static or dynamic concept? [ESD
Jonassen, Niels M
1998-01-01
A standing human body insulated from ground by footwear and/or floor covering is in principle an insulated conductor and has, as such, a capacitance, i.e. the ability to store a charge and possibly discharge the stored energy in a spark discharge. In the human body, the human body capacitance (HBC...... when a substantial part of the flux extends itself through badly defined stray fields. Since the concept of human body capacitance is normally used in a static (electric) context, it is suggested that the HBC be determined by a static method. No theoretical explanation of the observed differences...
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
Capacitive density measurement for supercritical hydrogen
Funke, Th; Haberstroh, Ch; Szoucsek, K.; Schott, S.; Kunze, K.
2017-12-01
A new approach for automotive hydrogen storage systems is the so-called cryo-compressed hydrogen storage (CcH2). It has a potential for increased energy densities and thus bigger hydrogen amounts onboard, which is the main attractiveness for car manufacturers such as BMW. This system has further advantages in terms of safety, refueling and cooling potential. The current filling level measurement by means of pressure and temperature measurement and subsequent density calculation faces challenges especially in terms of precision. A promising alternative is the capacitive gauge. This measuring principle can determine the filling level of the CcH2 tank with significantly smaller tolerances. The measuring principle is based on different dielectric constants of gaseous and liquid hydrogen. These differences are successfully leveraged in liquid hydrogen storage systems (LH2). The present theoretical analysis shows that the dielectric values of CcH2 in the relevant operating range are comparable to LH2, thus achieving similarly good accuracy. The present work discusses embodiments and implementations for such a sensor in the CcH2 tank.
Design Considerations in Capacitively Coupled Plasmas
Song, Sang-Heon; Ventzek, Peter; Ranjan, Alok
2015-11-01
Microelectronics industry has driven transistor feature size scaling from 10-6 m to 10-9 m during the past 50 years, which is often referred to as Moore's law. It cannot be overstated that today's information technology would not have been so successful without plasma material processing. One of the major plasma sources for the microelectronics fabrication is capacitively coupled plasmas (CCPs). The CCP reactor has been intensively studied and developed for the deposition and etching of different films on the silicon wafer. As the feature size gets to around 10 nm, the requirement for the process uniformity is less than 1-2 nm across the wafer (300 mm). In order to achieve the desired uniformity, the hardware design should be as precise as possible before the fine tuning of process condition is applied to make it even better. In doing this procedure, the computer simulation can save a significant amount of resources such as time and money which are critical in the semiconductor business. In this presentation, we compare plasma properties using a 2-dimensional plasma hydrodynamics model for different kinds of design factors that can affect the plasma uniformity. The parameters studied in this presentation include chamber accessing port, pumping port, focus ring around wafer substrate, and the geometry of electrodes of CCP.
Hydrogen atom kinetics in capacitively coupled plasmas
Nunomura, Shota; Katayama, Hirotaka; Yoshida, Isao
2017-05-01
Hydrogen (H) atom kinetics has been investigated in capacitively coupled very high frequency (VHF) discharges at powers of 16-780 mW cm-2 and H2 gas pressures of 0.1-2 Torr. The H atom density has been measured using vacuum ultra violet absorption spectroscopy (VUVAS) with a micro-discharge hollow cathode lamp as a VUV light source. The measurements have been performed in two different electrode configurations of discharges: conventional parallel-plate diode and triode with an intermediate mesh electrode. We find that in the triode configuration, the H atom density is strongly reduced across the mesh electrode. The H atom density varies from ˜1012 cm-3 to ˜1010 cm-3 by crossing the mesh with 0.2 mm in thickness and 36% in aperture ratio. The fluid model simulations for VHF discharge plasmas have been performed to study the H atom generation, diffusion and recombination kinetics. The simulations suggest that H atoms are generated in the bulk plasma, by the electron impact dissociation (e + H2 \\to e + 2H) and the ion-molecule reaction (H2 + + H2 \\to {{{H}}}3+ + H). The diffusion of H atoms is strongly limited by a mesh electrode, and thus the mesh geometry influences the spatial distribution of the H atoms. The loss of H atoms is dominated by the surface recombination.
Ultrasensitive interdigitated capacitance immunosensor using gold nanoparticles
Alizadeh Zeinabad, Hojjat; Ghourchian, Hedayatollah; Falahati, Mojtaba; Fathipour, Morteza; Azizi, Marzieh; Boutorabi, Seyed Mehdi
2018-06-01
Immunosensors based on interdigitated electrodes (IDEs), have recently demonstrated significant improvements in the sensitivity of capacitance detection. Herein, a novel type of highly sensitive, compact and portable immunosensor based on a gold interdigital capacitor has been designed and developed for the rapid detection of hepatitis B surface antigen (HBsAg). To improve the efficiency of antibody immobilization and time-saving, a self-assembled monolayer (SAM) of 2-mercaptoethylamine film was coated on IDEs. Afterwards, carboxyl groups on primary antibodies were activated through 1-ethyl-3-(3-dimethylaminopropyl)carbodiimide and were immobilized on amino-terminated SAM for better control of the oriented immobilization of antibodies on gold IDEs. In addition, gold nanoparticles conjugated with a secondary antibody were used to enhance the sensitivity. Under optimal conditions, the immunosensor exhibited the sensitivity of 0.22 nF.pg ml–1, the linear range from 5 pg ml‑1 to 1 ng ml–1 and the detection limit of 1.34 pg ml‑1, at a signal-to-noise ratio of 3.
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.
50 CFR 27.31 - General provisions regarding vehicles.
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...
Online prediction of battery electric vehicle energy consumption
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
Route planning of separate waste collection on a small settlement
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.
Southern states' routing agency report
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
Southern States' Routing Agency Report
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
Connected vehicle applications : safety.
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...
Research and application of genetic algorithm in path planning of logistics distribution vehicle
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.
Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles.
Wan, Jiafu; Liu, Jianqi; Shao, Zehui; Vasilakos, Athanasios V; Imran, Muhammad; Zhou, Keliang
2016-01-11
The advances in wireless communication techniques, mobile cloud computing, automotive and intelligent terminal technology are driving the evolution of vehicle ad hoc networks into the Internet of Vehicles (IoV) paradigm. This leads to a change in the vehicle routing problem from a calculation based on static data towards real-time traffic prediction. In this paper, we first address the taxonomy of cloud-assisted IoV from the viewpoint of the service relationship between cloud computing and IoV. Then, we review the traditional traffic prediction approached used by both Vehicle to Infrastructure (V2I) and Vehicle to Vehicle (V2V) communications. On this basis, we propose a mobile crowd sensing technology to support the creation of dynamic route choices for drivers wishing to avoid congestion. Experiments were carried out to verify the proposed approaches. Finally, we discuss the outlook of reliable traffic prediction.
Mobile Crowd Sensing for Traffic Prediction in Internet of Vehicles
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.
A capacitive ECG array with visual patient feedback.
Eilebrecht, Benjamin; Schommartz, Antje; Walter, Marian; Wartzek, Tobias; Czaplik, Michael; Leonhardt, Steffen
2010-01-01
Capacitive electrocardiogram (ECG) sensing is a promising technique for less constraining vital signal measurement and close to a commercial application. Even bigger trials testing the diagnostic significance were already done with single lead systems. Anyway, most applications to be found in research are limited to one channel and thus limited in its diagnostic relevance as only diseases coming along with a change of the heart rate can be diagnosed adequately. As a consequence the need for capacitive multi-channel ECGs combining the diagnostic relevance and the advantages of capacitive ECG sensing emerges. This paper introduces a capacitive ECG measurement system which allows the recording of standardized ECG leads according to Einthoven and Goldberger by means of an electrode array with nine electrodes.
Fringe Capacitance of a Parallel-Plate Capacitor.
Hale, D. P.
1978-01-01
Describes an experiment designed to measure the forces between charged parallel plates, and determines the relationship among the effective electrode area, the measured capacitance values, and the electrode spacing of a parallel plate capacitor. (GA)
Capacitance-Power-Hysteresis Trilemma in Nanoporous Supercapacitors
Alpha A. Lee
2016-06-01
Full Text Available Nanoporous supercapacitors are an important player in the field of energy storage that fill the gap between dielectric capacitors and batteries. The key challenge in the development of supercapacitors is the perceived trade-off between capacitance and power delivery. Current efforts to boost the capacitance of nanoporous supercapacitors focus on reducing the pore size so that they can only accommodate a single layer of ions. However, this tight packing compromises the charging dynamics and hence power density. We show via an analytical theory and Monte Carlo simulations that charging is sensitively dependent on the affinity of ions to the pores, and that high capacitances can be obtained for ionophobic pores of widths significantly larger than the ion diameter. Our theory also predicts that charging can be hysteretic with a significant energy loss per cycle for intermediate ionophilicities. We use these observations to explore the parameter regimes in which a capacitance-power-hysteresis trilemma may be avoided.
Integration of Capacitive Micromachined Ultrasound Transducers to Microfluidic Devices
Viržonis, Darius; Kodzius, Rimantas; Vanagas, Galius
2013-01-01
The design and manufacturing flexibility of capacitive micromachined ultrasound transducers (CMUT) makes them attractive option for integration with microfluidic devices both for sensing and fluid manipulation. CMUT concept is introduced here
Investigation of capacitance characteristics in metal/high-k ...
MS received 4 May 2016; accepted 10 January 2017; published online 21 August 2017. Abstract. Capacitance vs. ... with high-k materials is the prime technological challenge. [2]. ... reliability of MOS devices are strongly dependent on the for-.
Integration of Capacitive Micromachined Ultrasound Transducers to Microfluidic Devices
Viržonis, Darius
2013-10-22
The design and manufacturing flexibility of capacitive micromachined ultrasound transducers (CMUT) makes them attractive option for integration with microfluidic devices both for sensing and fluid manipulation. CMUT concept is introduced here by presentin
Low Power/Low Voltage Interface Circuitry for Capacitive Sensors
Furst, Claus Efdmann
This thesis focuses mainly on low power/low voltage interface circuits, implemented in CMOS, for capacitive sensors. A brief discussion of demands and possibilities for analog signal processing in the future is presented. Techniques for low power design is presented. This is done by analyzing power...... power consumption. It is shown that the Sigma-Delta modulator is advantageous when embedded in a feedback loop with a mechanical sensor. Here a micro mechanical capacitive microphone. Feedback and detection circuitry for a capacitive microphone is presented. Practical implementations of low power....../low voltage interface circuitry is presented. It is demonstrated that an amplifier optimized for a capacitive microphone implemented in a standard 0.7 micron CMOS technology competes well with a traditional JFET amplifier. Furthermore a low power/low voltage 3rd order Sigma-Delta modulator is presented...
Capacitance-Power-Hysteresis Trilemma in Nanoporous Supercapacitors
Lee, Alpha A; Vella, Dominic; Goriely, Alain; Kondrat, Svyatoslav
2015-01-01
Nanoporous supercapacitors are an important player in the field of energy storage that fill the gap between dielectric capacitors and batteries. The key challenge in the development of supercapacitors is the perceived trade-off between capacitance and power delivery. Current efforts to boost the capacitance of nanoporous supercapacitors focus on reducing the pore size so that they can only accommodate a single layer of ions. However, this tight packing compromises the charging dynamics and he...
Conjugate Image Theory Applied on Capacitive Wireless Power Transfer
Ben Minnaert; Nobby Stevens
2017-01-01
Wireless power transfer using a magnetic field through inductive coupling is steadily entering the market in a broad range of applications. However, for certain applications, capacitive wireless power transfer using electric coupling might be preferable. In order to obtain a maximum power transfer efficiency, an optimal compensation network must be designed at the input and output ports of the capacitive wireless link. In this work, the conjugate image theory is applied to determine this opti...
Current Progress of Capacitive Deionization for Removal of Pollutant Ions
Gaikwad, Mahendra S.; Balomajumder, Chandrajit
2016-08-01
A mini review of a recently developing water purification technology capacitive deionization (CDI) applied for removal of pollutant ions is provided. The current progress of CDI for removal of different pollutant ions such as arsenic, fluoride, boron, phosphate, lithium, copper, cadmium, ferric, and nitrate ions is presented. This paper aims at motivating new research opportunities in capacitive deionization technology for removal of pollutant ions from polluted water.
Capacitive Imaging For Skin Characterization and Solvent Penetration
Xiao, P; Zhang, X; Bontozoglou, C
2016-01-01
Capacitive contact imaging has shown potential in measuring skin properties including hydration, micro relief analysis, as well as solvent penetration measurements . Through calibration we can also measure the absolute permittivity of the skin, and from absolute permittivity we then work out the absolute water content (or solvent content) in skin. In this paper, we present our latest study of capacitive contact imaging for skin characterization, i.e. skin hydration and skin damages etc. The r...