WorldWideScience

Sample records for arc routing problem

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-05-15

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

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

    International Nuclear Information System (INIS)

    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

  3. The time-dependent prize-collecting arc routing problem

    DEFF Research Database (Denmark)

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

    2013-01-01

    A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TD-PARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change with the...

  4. An evolutionary algorithm for the capacitated arc routing problem.

    Directory of Open Access Journals (Sweden)

    Dalessandro Soares Vianna

    2006-08-01

    Full Text Available The Capacitated Arc Routing Problem (CARP consists of visiting a subset of edges of the graph that describes the problem. CARP applications include urban waste collection and inspection of power lines. The CARP is NP-hard, even in the single-vehicle case (called Rural Postman Problem. In this case, the use of metaheuristics is an efficient solution strategy. This paper proposes a hybrid genetic algorithm for the CARP, which is tested on available instances of the literature. The results obtained until now show the effectiveness of the proposed algorithm when it is compared with lower bounds described in the literature.

  5. Solving Arc Routing Problems Using the Lin-Kernighan-Helsgaun Algorithm

    DEFF Research Database (Denmark)

    Helsgaun, Keld

    It is well known that many arc routing problems can be transformed into the Equality Generalized Traveling Salesman Problem (E-GTSP), which in turn can be transformed into a standard Asymmetric Traveling Salesman Problem (TSP). This opens up the possibility of solving arc routing problems using...

  6. A global repair operator for capacitated arc routing problem.

    Science.gov (United States)

    Mei, Yi; Tang, Ke; Yao, Xin

    2009-06-01

    Capacitated arc routing problem (CARP) has attracted much attention during the last few years due to its wide applications in real life. Since CARP is NP-hard and exact methods are only applicable for small instances, heuristics and metaheuristic methods are widely adopted when solving CARP. This paper demonstrates one major disadvantage encountered by traditional search algorithms and proposes a novel operator named global repair operator (GRO) to address it. We further embed GRO in a recently proposed tabu search algorithm (TSA) and apply the resultant repair-based tabu search (RTS) algorithm to five well-known benchmark test sets. Empirical results suggest that RTS not only outperforms TSA in terms of quality of solutions but also converges to the solutions faster. Moreover, RTS is also competitive with a number of state-of-the-art approaches for CARP. The efficacy of GRO is thereby justified. More importantly, since GRO is not specifically designed for the referred TSA, it might be a potential tool for improving any existing method that adopts the same solution representation. PMID:19211356

  7. A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens; Wøhlk, Sanne

    2009-01-01

    We address the Capacitated Arc Routing Problem with Stochastic Demands (CARPSD), which we formulate as a Set Partitioning Problem. The CARPSD is solved by a Branch-and-Price algorithm, which we apply without graph transformation. The demand's stochastic nature is incorporated into the pricing pro...... problem. Computational results are reported....

  8. A mathematical modeling proposal for a Multiple Tasks Periodic Capacitated Arc Routing Problem

    Directory of Open Access Journals (Sweden)

    Cleverson Gonçalves dos Santos

    2015-12-01

    Full Text Available The countless accidents and incidents occurred at dams at the last years, propelled the development of politics related with dams safety. One of the strategies is related to the plan for instrumentation and monitoring of dams. The monitoring demands from the technical team the reading of the auscultation data, in order to periodically monitor the dam. The monitoring plan of the dam can be modeled as a problem of mathematical program of the periodical capacitated arcs routing program (PCARP. The PCARP is considered as a generalization of the classic problem of routing in capacitated arcs (CARP due to two characteristics: 1 Planning period larger than a time unity, as that vehicle make several travels and; 2 frequency of associated visits to the arcs to be serviced over the planning horizon. For the dam's monitoring problem studied in this work, the frequent visits, along the time horizon, it is not associated to the arc, but to the instrument with which is intended to collect the data. Shows a new problem of Multiple tasks Periodic Capacitated Arc Routing Problem and its elaboration as an exact mathematical model. The new main characteristics presented are: multiple tasks to be performed on each edge or edges; different frequencies to accomplish each of the tasks; heterogeneous fleet; and flexibility for more than one vehicle passing through the same edge at the same day. The mathematical model was implemented and examples were generated randomly for the proposed model's validation.

  9. THE PERIODIC CAPACITATED ARC ROUTING PROBLEM LINEAR PROGRAMMING MODEL,METAHEURISTIC AND LOWER BOUNDS

    Institute of Scientific and Technical Information of China (English)

    Feng CHU; Nacima LABADI; Christian PRINS

    2004-01-01

    The Periodic Capacitated Arc Routing Problem (PCARP) generalizes the well known NP-hard Capacitated Arc Routing Problem (CARP) by extending the single period to multi-period horizon.The Capacitated Arc Routing Problem (CARP) is defined on an undirected network in which a fleet of identical vehicles is based at a depot node. A subset of edges, called tasks, must be serviced by a vehicle. The CARP consists of determining a set of feasible vehicle trips that minimizes the total cost of traversed edges. The PCARP involves the assignment of tasks to periods and the determination of vehicles trips in each period, to minimize the total cost on the whole horizon. This new problem arises in various real life applications such as waste collection, mail delivery, etc. In this paper, a new linear programming model and preliminary lower bounds based on graph transformation are proposed. A meta-heuristic approach - Scatter Search (SS) is developed for the PCARP and evaluated on a large variety of instances.

  10. Lower and Upper Bounds for the Node, Edge, and Arc Routing Problem

    DEFF Research Database (Denmark)

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

    The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004. They also proposed a memetic algorithm procedure and defined a set of test instances: the so-called CBMix benchmark. The NEARP generalizes the classical CVRP, the CARP, and the General Routing Problem. It...... for the CARP. We also define two novel sets of test instances to complement the CBMix benchmark. The first is based on well-known CARP instances; the second consists of real life cases of newspaper delivery routing. We provide numerical results in the form 1 of lower and best known upper bounds for...... all instances of all three benchmarks. For two of the instances, the gap is closed....

  11. Implementation Weather-Type Models of Capacitated Arc Routing Problem via Heuristics

    Directory of Open Access Journals (Sweden)

    Zuhaimy Ismail

    2011-01-01

    Full Text Available Problem statement: In this study, we introduced a new and real-life condition of Capacitated Arc Routing Problem (CARP, a model that represents vehicles operation in waste collection. In general, we studied the element of rain drops that affected the collected waste weight in total by imposed a new variable namely rainy weight age. In rainy days, the household refusals did not increase in volumes, but in weights due to rain drops. Consequently, this matter thus burdened vehicles capacity and prolonged its operation time. This dynamic variable thus changes the initial CARP model where the existing model did not consider other external elements that have effected onto the model. Approach: Then we developed and enhanced CARP by integrating stochastic demand and time windows to suit the models with our specific case. Results: Objectively, CARP with stochastic demand (CARPSD and CARP with time windows (CARPTW were designed to minimize the total routing cost and number of trips for a vehicle. Our approach is to design CARP models in almost likely to road layout in residential area and graphically this model is called mesh network. We also developed a constructive heuristic that is called nearest procedure based on highest demand/cost (NPHDC and work in conjunction with switching rules to search the feasible solution. Conclusion: Our preliminary results show a higher cost and more trips are needed when the vehicle operates in rainy day compared to normal day operation.

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

    DEFF Research Database (Denmark)

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

    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...... quality of the upper bound. This fact, and the high industrial relevance of the NEARP, should motivate more research on approximate and exact methods for this important problem....

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

    DEFF Research Database (Denmark)

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

    2015-01-01

    -life traffic situations where the travel times change with the time of day are taken into account. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time...... information. Both algorithms are capable of finding good solutions, though the Tabu Search approach generally shows better performance for large instances whereas the VNS is superior for small instances. We discuss the structural differences of the implementation of the algorithms which explain these results....

  14. Routing and scheduling problems

    DEFF Research Database (Denmark)

    Reinhardt, Line Blander

    to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  15. Vehicle routing problems with alternative paths: an application to on-demand transportation

    OpenAIRE

    Garaix, Thierry; Artigues, Christian; Feillet, Dominique; Josselin, Didier

    2010-01-01

    The class of vehicle routing problems involves the optimization of freight or passenger transportation activities. These problems are generally treated via the representation of the road network as a weighted complete graph. Each arc of the graph represents the shortest route for a possible origin-destination connection. Several attributes can be defined for one arc (travel time, travel cost . . . ), but the shortest route modelled by this arc is computed according to one single criterion, gen...

  16. Major arcs for Goldbach's problem

    OpenAIRE

    Helfgott, H. A.

    2013-01-01

    The ternary Goldbach conjecture states that every odd number $n\\geq 7$ is the sum of three primes. The estimation of the Fourier series $\\sum_{p\\leq x} e(\\alpha p)$ and related sums has been central to the study of the problem since Hardy and Littlewood (1923). Here we show how to estimate such Fourier series for $\\alpha$ in the so-called major arcs, i.e., for $\\alpha$ close to a rational of small denominator. This is part of the author's proof of the ternary Goldbach conjecture. In contrast ...

  17. Adaptive Memory Procedure to solve the Profitable Arc Tour Problem

    Directory of Open Access Journals (Sweden)

    Jalel Euchi

    2010-05-01

    Full Text Available In this paper we propose an Adaptive memory procedure to solve the Profitable Arc Tour Problem (PATP. The PATP is a variant of the well-known Vehicle Routing Problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to constraints limiting the length of cycles that profit is available on arcs. Computational experiments show that our algorithms provide good results in terms of quality of solution and running times.

  18. The Pyramidal Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

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

  19. The pyramidal capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2010-01-01

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

  20. Minor arcs for Goldbach's problem

    OpenAIRE

    Helfgott, H. A.

    2012-01-01

    The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \\sum_{p\\leq x} e(\\alpha p), \\alpha = a/q + O(1/q^2), has been a central part of the main approach to the conjecture since (Vinogradov, 1937). Previous work required q or x to be too large to make a proof of the conjecture for all n feasible. The present paper gives new bounds on minor arcs and the tails of major arcs. This is part of the author's proof of the ternar...

  1. Route Elimination Heuristic for Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sándor Csiszár

    2005-11-01

    Full Text Available The paper deals with the design of a route elimination (RE algorithm for thevehicle routing problem with time windows (VRPTW. The problem has two objectives, oneof them is the minimal number of routes the other is the minimal cost. To cope with theseobjectives effectively two-phase solutions are often suggested in the relevant literature. Inthe first phase the main focus is the route elimination, in the second one it is the costreduction. The algorithm described here is a part of a complete VRPWT study. The methodwas developed by studying the graph behaviour during the route elimination. For thispurpose a model -called “Magic Bricks” was developed. The computation results on theSolomon problem set show that the developed algorithm is competitive with the best ones.

  2. Minor arcs for Goldbach's problem

    CERN Document Server

    Helfgott, H A

    2012-01-01

    The ternary Goldbach conjecture states that every odd number $n\\geq 7$ is the sum of three primes. The estimation of sums of the form $\\sum_{p\\leq x} e(\\alpha p)$, $\\alpha = a/q + O(1/q^2)$, has been a central part of the main approach to the conjecture since (Vinogradov, 1937). Previous work required $q$ or $x$ to be too large to make a proof of the conjecture for all $n$ feasible. The present paper gives new bounds on minor arcs and the tails of major arcs. For $q\\geq 4\\cdot 10^6$, these bounds are of the strength needed to solve the ternary Goldbach conjecture. Only the range $q\\in \\lbrack 10^5, 4\\cdot 10^6\\rbrack$ remains to be checked, possibly by brute force, before the conjecture is proven for all $n$. The new bounds are due to several qualitative improvements. In particular, this paper presents a general method for reducing the cost of Vaughan's identity, as well as a way to exploit the tails of minor arcs in the context of the large sieve.

  3. Vehicle routing problem in investment fund allocation

    Science.gov (United States)

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

    2013-04-01

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

  4. Rich Vehicle Routing Problems and Applications

    DEFF Research Database (Denmark)

    Wen, Min

    given set of customers. The VRP is a computationally hard combinatorial problem and has been intensively studied by numerous researchers in the last fifty years. Due to the significant economic benefit that can be achieved by optimizing the routing problems in practice, more and more attention has been......The Vehicle Routing Problem (VRP) is one of the most important and challenging optimization problems in the field of Operations Research. It was introduced by Dantzig and Ramser (1959) and defined as the problem of designing the optimal set of routes for a fleet of vehicles in order to serve a...... problems in the sense that consolidation decisions have to be made at the depot and these decisions interact with the planning of pickup and delivery routes. We presented a mathematical model and proposed a Tabu Search based heuristic to solve it. It is shown that the approach can produce near-optimal...

  5. Routing problems based on hils system platform

    Directory of Open Access Journals (Sweden)

    Andrzej Adamski

    2015-03-01

    Full Text Available Background: The logistic systems are very complex socio-technical systems. In this paper the proposal of application of the hierarchical multi-layers system platform HILS approach for the solution of the complex vehicle routing problems is presented. The interactive system functional structure was proposed which by intelligent dedicated inter-layers interactions enables the professional solutions of these practical problems. To illustrate these capabilities the complex example of the real-time VRP-SPD-TW routing problem was presented in which upper layers offers the context-related real-time updating network specifications that stimulates the adequate routing parameters and specifications updating for problem solution in optimization layer. At the bottom dispatching control layer the DISCON (Dispatching CONtrol method from public transport was adopted to logistics applications in which the actual routing is treated as obligatory reference schedule to be stabilized. The intelligence aspects are related among others to HILS based decomposition, context-related trade-offs between routing modifications and corrective dispatching control capabilities e.g. priority or route guidance actions. Methods: Decomposition of the vehicle routing problem for the HILS layers tasks creating the ILS system hierarchical structure. Dedicated solution method for the VRP-SPD-TW routing problem. The recognition of the control preferences structure by AHP-Entropy methods. DISCON and PIACON multi-criteria interacting control methods. Results: Original formulation and solution of the vehicle routing problem by system-wide approach with essential practical advantages: consistency, lack of redundancy, essential reduction of dimension, dedicated formulation, multi-criteria approach, exploration of the integration and intelligence features supported by the intelligent PIACON-DISCON methods control activities Conclusions: The presented proposal creates the professional

  6. Genetic algorithms for the vehicle routing problem

    Science.gov (United States)

    Volna, Eva

    2016-06-01

    The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

  7. Integrating routing decisions in public transportation problems

    CERN Document Server

    Schmidt, Marie E

    2014-01-01

    This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs ...

  8. Applying min–max k postmen problems to the routing of security guards

    OpenAIRE

    E J Willemse; J W Joubert

    2012-01-01

    The most essential and alluring characteristic of a security estate is the estate's ability to provide 24-h security to its residents, of which the continual patrolling of roads and paths is vital. The objective of this paper is to address the lack of sufficient patrol route design procedures by presenting a tabu search algorithm capable of generating multiple patrol routes for an estate's security guards. The paper shows that the problem of designing these routes can be modelled as an Arc Ro...

  9. Fund allocation using capacitated vehicle routing problem

    Science.gov (United States)

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

    2014-09-01

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

  10. Vehicle routing problem for save fuel consumption

    Institute of Scientific and Technical Information of China (English)

    LIU Hao; AI Wen-wen

    2016-01-01

    This study has extended a vehicle routing problem,by considering economy of fuel,and constructing a LF-VRP model,to obtain optimal fixed costs.Our objective was to minimize not only distance,but also the fuel consumption.A example were developed to solve the proposed models.It was found that our proposed models yielded better results than the traditional VRP models.

  11. A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Pop Petrica

    2011-01-01

    Full Text Available Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems; they are harder than the classical ones, and nowadays are intensively studied due to their interesting properties and applications in the real world. Because of the complexity of finding the optimal or near-optimal solution in case of the generalized combinatorial optimization problems, great effort has been made, by many researchers, to develop efficient ways of their transformation into classical corresponding variants. We present in this paper an efficient way of transforming the generalized vehicle routing problem into the vehicle routing problem, and a new integer programming formulation of the problem.

  12. A new approach to turbulent arcs problem

    International Nuclear Information System (INIS)

    A new hypothesis is advanced which assumes the mass being a charge that has not only the known static interaction but also the dynamic one. Moving mass charge produces a special field likewise the electric charge creates magnetic one. Dynamic Interaction of moving mass with the copartner field bends the particles trajectory and creates vortexes which are responsible for flow turbulization. The permeability constant and basic relations are derived for the ''vortex'' field. Some verifications of the hypothesis is done for ''cold'' flow and arc discharge. (author)

  13. a Genetic Algorithm for Urban Transit Routing Problem

    Science.gov (United States)

    Chew, Joanne Suk Chun; Lee, Lai Soon

    The Urban Transit Routing Problem (UTRP) involves solving a set of transit route networks, which proved to be a highly complex multi-constrained problem. In this study, a bus route network to find an efficient network to meet customer demands given information on link travel times is considered. An evolutionary optimization technique, called Genetic Algorithm is proposed to solve the UTRP. The main objective is to minimize the passenger costs where the quality of the route sets is evaluated by a set of parameters. Initial computational experiments show that the proposed algorithm performs better than the benchmark results for Mandl's problems.

  14. Modeling the Multicommodity Multimodal Routing Problem with Schedule-Based Services and Carbon Dioxide Emission Costs

    Directory of Open Access Journals (Sweden)

    Yan Sun

    2015-01-01

    Full Text Available We explore a freight routing problem wherein the aim is to assign optimal routes to move commodities through a multimodal transportation network. This problem belongs to the operational level of service network planning. The following formulation characteristics will be comprehensively considered: (1 multicommodity flow routing; (2 a capacitated multimodal transportation network with schedule-based rail services and time-flexible road services; (3 carbon dioxide emissions consideration; and (4 a generalized costs optimum oriented to customer demands. The specific planning of freight routing is thus defined as a capacitated time-sensitive multicommodity multimodal generalized shortest path problem. To solve this problem systematically, we first establish a node-arc-based mixed integer nonlinear programming model that combines the above formulation characteristics in a comprehensive manner. Then, we develop a linearization method to transform the proposed model into a linear one. Finally, a computational experiment from the Chinese inland container export business is presented to demonstrate the feasibility of the model and linearization method. The computational results indicate that implementing the proposed model and linearization method in the mathematical programming software Lingo can effectively solve the large-scale practical multicommodity multimodal transportation routing problem.

  15. Optimizing investment fund allocation using vehicle routing problem framework

    Science.gov (United States)

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

    2014-07-01

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

  16. Tawanda’s non- iterative optimal tree algorithm for shortest route problems

    Directory of Open Access Journals (Sweden)

    Trust Tawanda

    2013-03-01

    Full Text Available So many algorithms have been proposed to solve the shortest path in road networks, in this paper, an algorithm is developed to solve shortest route problems. The algorithm is being demonstrated through solving of various network problems. The principle of the algorithm consist in  transforming  the graph into a tree by means of arc and node replication, thereby expanding outwards from the source node  considering all possible paths up to the destination node. The objective is to develop a method that can be applied in directed and non-directed graphs.

  17. Robustness of a routing tree for the Push Tree Problem

    OpenAIRE

    Havet, Frédéric

    2002-01-01

    The Push Tree problem contains elements from both the Steiner Tree and Shortest Path problem. It deals with the trade-offs between the push and pull mechanism used in information distribution and retrieval. In , a two step approach for the Push Tree Problem was proposed. In the first step, a «good» spanning tree (called routing tree) is constructed and then the problem is solved in this particular tree. Finding a routing tree is NP-hard but the second step may be performed easily, thus the id...

  18. The Service-Time Restricted Capacitated Arc Routing Problem

    DEFF Research Database (Denmark)

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

  19. Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms

    OpenAIRE

    Nallusamy, R; K. Duraiswamy,; Dhanalaksmi, R.; P. Parthiban

    2010-01-01

    This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP). We used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. k- Means clustering algorithm has been used for easy clustering of the cities. In this way the mVRP has been converted into VRP which is simple in computation compared to mVRP. After clustering, an optimized route is generated for each vehicle in its allotted cl...

  20. Ant Colony Algorithm for Solving QoS Routing Problem

    Institute of Scientific and Technical Information of China (English)

    SUN Li-juan; WANG Liang-jun; WANG Ru-chuan

    2004-01-01

    Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least-cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss-constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.

  1. A Subpath Ejection Method for the Vehicle Routing Problem

    OpenAIRE

    César Rego

    1998-01-01

    Generically, ejection chains are methods conceived to allow solution transformations to be efficiently carried out by modifying a variable number of their components at each step of a local search algorithm. We consider a subpath ejection chain method for the vehicle routing problem (VRP) under capacity and route length restrictions. The method undertakes the identification of a substructure named the flower reference structure which, besides coordinating moves during an ejection chain constr...

  2. The vehicle routing problem with time windows and temporal dependencies

    DEFF Research Database (Denmark)

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

    2011-01-01

    In this article, we formulate the vehicle routing problem with time windows and temporal dependencies. The problem is an extension of the well studied vehicle routing problem with time windows. In addition to the usual constraints, a scheduled time of one visit may restrain the scheduling options...... on the relaxed master problems. Finally, a computational study is performed to quantitatively reveal strengths and weaknesses of the proposed formulations. It is concluded that, depending on the problem at hand, the best performance is achieved either by relaxing the generalized precedence constraints...... in the master problem, or by using a time‐indexed model, where generalized precedence constraints are added as cuts when they become severely violated. © 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 58(4), 273–289 2011...

  3. A Study of Urgency Vehicle Routing Disruption Management Problem

    Directory of Open Access Journals (Sweden)

    Xuping Wang

    2010-12-01

    Full Text Available If a transit vehicle breaks down on a schedule trip, there are some vehicles in the system need to serve this trip and the former plan must be changed. For solving the urgency vehicle routing problem with disruption that may be vehicle breakdowns or traffic accidents in the logistics distribution system, through the analysis of the problem and the disruption measurement, the mathematics model is given based on the thought of disruption management. For the characteristics of the problem, a Lagrangian relaxation is given to simplify the model, and decompose the problem into two parts. The Lagrangian multiplier is given by subgradient method and the subproblems are solved by saving approach to gain the initial solution. A fast insertion algorithm is given to obtain a feasible solution for the primal problem. The results show that the algorithm designed in this paper performs very well for solving the urgency vehicle routing disruption management problem.

  4. On the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Kallehauge, Brian

    2006-01-01

    eliminate time and capacity infeasible paths. We present a new class of strengthened path inequalities based on polyhedral results obtained in the context of the asymmetric traveling salesman problem with replenishment arcs. We study the VRPTW polytope and determine the polytope dimension. We show that the...... lifted path inequalities are facet defining under certain assumptions. We also introduce precedence constraints in the context of the VRPTW. Computational experiments are performed with a branch-and-cut algorithm on the Solomon test problems with wide time windows. Based on results on 25-node problems...

  5. Classification of Ship Routing and Scheduling Problems in Liner Shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    2011-01-01

    This article provides a classification scheme for ship routing and scheduling problems in liner shipping in line with the current and future operational conditions of the liner shipping industry. Based on the classification, the literature is divided into groups whose main characteristics are...

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

    DEFF Research Database (Denmark)

    Kohl, Niklas

    1995-01-01

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

  7. Modeling a four-layer location-routing problem

    Directory of Open Access Journals (Sweden)

    Mohsen Hamidi

    2012-01-01

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

  8. Vehicle routing problem with time-varying speed

    Institute of Scientific and Technical Information of China (English)

    LIU Yun-zhong

    2010-01-01

    Vehicle routing problem with time-varying speed(VRPTS)is a generalization of vehicle routing problem in which the travel speed between two locations depends on the passing areas and the time of a day.This paper proposes a simple model for estimating time-varying travel speeds in VRPTS that relieves much bur den to the data-related problems.The study further presents three heuristics(saving technique,proximity priority searching technique,and insertion technique)for VRPTS,developed by extending and modifying the existing heuristics for conventional VRP.The results of computational experiments demonstrate that the proposed estimation model performs well and the saving technique is the best among the three heuristics.

  9. The Vehicle Routing Problem with Limited Vehicle Capacities

    Directory of Open Access Journals (Sweden)

    Fernando Taracena Sanz

    2013-09-01

    Full Text Available The vehicle routing problem (VRP has been an important research topic during the last decades because of his vital role in the productive systems efficiency. Most of the work done in this area has been directed to solve large scale problems which may not apply for small companies which are a very important engine of the world economy. This paper approaches the problem when limited vehicle resources are present and road transportation is used. This study assumes variable customer orders. Variable volume and weight vehicle capacities are considered and the proposed algorithm develops the vehicle delivery routes and the set of customer orders to deliver per vehicle minimizing a cost objective function. In sampling small company’s logistics costs, big cost savings are found when using the proposed method.

  10. FUNDAMENTAL PROBLEMS IN PULSED-BIAS ARC DEPOSITION

    Institute of Scientific and Technical Information of China (English)

    G.Q.Lin; Z.F.Ding; D.Qi; N.H.Wang; M.D.Huang; D.Z.Wang; Y.N.Wang; C.Dong; L.S.Wen

    2002-01-01

    Arc deposition, a widely used surface coating technique, has disadvantages such aslarge droplet size and high deposition temperature. Recent trend in its renovation isthe introduction of pulsed bias at the substrate. The present paper attempts to describethe deposition process of TiN films using this technique with emphasis laid on theunderstanding of the basic problems such as discharge plasma properties, temperaturecalculation, and droplet size reduction. We show that this technique improves thefilm microstructure and quality, lowers deposition temperature, and allows coatingson insulating substrates. After analyzing load current oscillation behaviors, we havedetermined that the plasma load is of capacitance nature due to plasma sheath and thatit is equivalent to a circuit element consisting of parallel capacitance and resistance.At last, we point out the remaining problems and future development of the pulsed-biasarc deposition technique.

  11. Optimization of Multiple Vehicle Routing Problems Using Approximation Algorithms

    Directory of Open Access Journals (Sweden)

    R. Nallusamy

    2009-12-01

    Full Text Available This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP. We used a methodology of clustering the given cities depending upon the number of vehicles and eachcluster is allotted to a vehicle. k- Means clustering algorithm has been used for easy clustering of the cities. In this way the mVRP has been converted into VRP which is simple in computation compared to mVRP. After clustering, an optimized route is generated for each vehicle in its allotted cluster. Once the clustering had been done and after the cities were allocated to the various vehicles, each cluster/tour was taken as an individual Vehicle Routing problem and the steps of Genetic Algorithm were applied to the cluster and iterated to obtain the most optimal value of the distance after convergence takes place. After the application of the variousheuristic techniques, it was found that the Genetic algorithm gave a better result and a more optimal tour for mVRPs in short computational time than other Algorithms due to the extensive search and constructive nature of the algorithm.

  12. ACTIVITY-BASED COSTING FOR VEHICLE ROUTING PROBLEMS

    Directory of Open Access Journals (Sweden)

    A. J. Moolman

    2012-01-01

    Full Text Available

    ENGLISH ABSTRACT:Activity-based costing (ABC is a costing model that identifies activity costs in an organisation. It assigns the cost of activity resources to generate the actual cost of products in order to eliminateunprofitable products and to lowerthe prices of overpriced ones. The vehicle routing problem (VRP is a combinatorial optimisation and nonlinear programming problem that seeks to service a number of customers with a fleet of vehicles in a cost-effective manner. In this article we propose a new approach to determine costing for vehicle routing type problems. The methodology incorporates the predictive sharing of a resource by clustering producers.

    AFRIKAANSE OPSOMMING: ‘Activity-based costing’ (ABC is ’n kostemodel wat die aktiwiteitskoste in ’n organisasie identifiseer. Dit allokeer die koste van die bronne sodat die ware koste van die vervaardiging en dienste van die produk bereken kan word om winsgewendheid te bepaal. Die ‘vehicle routing problem’ (VRP is ’n kombinatoriese optimisering en nie-lineêre programmeringsprobleem wat verskeie kliënte met ’n vloot voertuie in die mees koste- effektiewe manier bedien. Die artikel bespreek ’n nuwe metode om die kombinasie van probleme op te los. Die metode maak gebruik van groeperingsalgoritmes om meer akkurate voertuig deling te voorspel.

  13. Enhanced ant colony optimization for inventory routing problem

    Science.gov (United States)

    Wong, Lily; Moin, Noor Hasnah

    2015-10-01

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

  14. Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Annisa Kesy Garside

    2014-01-01

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

  15. STUDI TENTANG TRAVELLING SALESMAN DAN VEHICLE ROUTING PROBLEM DENGAN TIME WINDOWS

    Directory of Open Access Journals (Sweden)

    I Nyoman Sutapa

    2003-01-01

    Full Text Available The article shows the study of model development of travelling salesman problem. Three models are studied, i.e. travelling salesman problem with time windows, vehicle routing problem, and vehicle routing problem with time windows. Abstract in Bahasa Indonesia : Dalam artikel ini dipaparkan kajian mengenai pengembangan model travelling salesman problem. Ada tiga model yang dikaji yaitu travelling salesman problem dengan time windows, vehicle routing problem, serta vehicle routing problem dengan time windows. Kata-kunci: travelling salesman problem, vehicle routing problem, time windows.

  16. Analysis of the single-vehicle cyclic inventory routing problem

    Science.gov (United States)

    Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel

    2012-11-01

    The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

  17. Parallelization of the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Larsen, Jesper

    1999-01-01

    This dissertation presents a number of algorithms for solving the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP). In the VRP a fleet of vehicles based at a central depot must service a set of...... customers. In the VRPTW each customer has a time window. Service of a customer must begin within the interval given by the time window. The objective is to minimize some aspect of operating costs (e.g. total distance traveled, number of vehicles needed or a combination of parameters). Since the late 80's...... also been obtained using Lagrange relaxation. This dissertation is divided into three parts. First the theoretical framework is described. Thereafter a number of techniques to improve the performance of the column-generation framework are proposed and analyzed. Finally a parallel algorithm based on the...

  18. Vehicle Coordinated Strategy for Vehicle Routing Problem with Fuzzy Demands

    Directory of Open Access Journals (Sweden)

    Chang-shi Liu

    2016-01-01

    Full Text Available The vehicle routing problem with fuzzy demands (VRPFD is considered. A fuzzy reasoning constrained program model is formulated for VRPFD, and a hybrid ant colony algorithm is proposed to minimize total travel distance. Specifically, the two-vehicle-paired loop coordinated strategy is presented to reduce the additional distance, unloading times, and waste capacity caused by the service failure due to the uncertain demands. Finally, numerical examples are presented to demonstrate the effectiveness of the proposed approaches.

  19. The vehicle routing problem with edge set costs

    OpenAIRE

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

    2011-01-01

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

  20. The selective vehicle routing problem in a collaborative environment

    OpenAIRE

    DEFRYN, Christof; Sörensen, Kenneth; CORNELISSENS, Trijntje

    2015-01-01

    We consider a selective vehicle routing problem, in which customers belonging to different partners in a logistic coalition are served in a single logistic operation with multiple vehicles. Each partner determines a cost of non-delivery (CND) for each of its customers, and a central algorithm creates an operational plan, including the decision on which customers to serve and in which trip. The total transportation cost of the coalition is then divided back to the partners through a cost alloc...

  1. Choosing offshore pipeline routes: problems and solutions. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Gowen, A.M.; Goetz, M.J.; Waitsman, I.M.

    1980-05-01

    The report discusses the environmental and fisheries problems associated with offshore pipelines. The report focuses on how these problems can be addressed during the pipeline planning and route selection process. Geologic hazards are highlighted as the major factors related to pipeline failure which can be addressed through the pipeline routing process. Habitats and ecosystems are particularly susceptible to installation-related disturbances. These areas as well as those where geologic hazards are most likely to be encountered are described. Fishing problems highlighted include loss of access to fishing areas due to pipelines both from platform to shore and between platforms. The effects of obstructions on bottom fishing gear are also considered. The concept of pipeline trenching for safety and stability is discussed. Finally, criteria to use in analyzing a proposed pipeline route are presented. Topics discussed include general industry siting criteria, geologic and environmental areas to avoid in pipeline siting and methods for minimizing unavoidable impacts. The report is designed to be used by scientists or engineers involved in offshore petroleum pipeline planning.

  2. The Vehicle Routing Problem with Time Windows and Temporal Dependencies

    DEFF Research Database (Denmark)

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

    to be scheduled with a certain slack between them. They refer to the vehicle problem as having interdependent time windows. Temporal dependencies have been modeled for a home care routing problem in a mixed integer programming model (MIP) which was solved with a standard MIP solver. An application with general...... temporal dependencies is also found in machine scheduling. Column generation is used to solve the problem. The pricing problem is primarily solved heuristically by local search and occasionally to optimality using a standard solver on an integer programming formulation of the pricing problem. Two compact...... is novel as well. Finally, we introduce a new set of context-free benchmark instances which enables a thorough quantitative analysis and which we hope will facilitate future research in this area. The analysis shows that, even though the time-indexed model has some nice properties, it also retains its...

  3. Two Multivehicle Routing Problems with Unit-Time Windows

    CERN Document Server

    Frederickson, Greg N

    2011-01-01

    Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to visit as many locations as possible using a fixed number of vehicles. In the second, the goal is to visit all locations using the smallest number of vehicles possible. For the first problem, we present an approximation algorithm whose output path collects a reward within a constant factor of optimal for any fixed number of vehicles. For the second problem, our algorithm finds a 6-approximation to the problem on a tree metric, whenever a single vehicle could visit all locations during their time windows.

  4. On the vehicle routing problem with time windows

    OpenAIRE

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

    2006-01-01

    Den danske titel på denne afhandling er ‘Ruteplanlægningsproblemet med tidsvinduer’. Dette problem omhandler den optimale styring af en flåde af lastbiler mellem et lager og et antal kunder, der skal besøges inden for et bestemt tidsinterval, et såkaldt tidsvindue. Formålet med denne afhandling er udvikling af nye og effektive metoder til løsning af ruteplanlægningsproblemet med tidsvinduer (vehicle routing problem with time windows - VRPTW). Afhandlingen består af et afsnit af introducerende...

  5. The Cyclic-Routing UAV Problem is PSPACE-Complete

    OpenAIRE

    Ho, Hsi-Ming; Ouaknine, Joel

    2014-01-01

    Consider a finite set of targets, with each target assigned a relative deadline, and each pair of targets assigned a fixed transit flight time. Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target's relative deadline? The Cyclic-Routing UAV Problem (CR-UAV) is the question of whether this task has a solution. This problem can straightforwardly be solved in PSPACE by modelling it as a network of timed au...

  6. Reachability cuts for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Lysgaard, Jens

    2004-01-01

    This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem with Time Windows and to k-path cuts for the...... VRPTW. In particular, any reachability cut dominates one or more k-path cuts. The paper presents separation procedures for reachability cuts and reports computational experiments on well-known VRPTW instances. The computational results suggest that reachability cuts can be highly useful as cutting...

  7. The vehicle routing problem with edge set costs

    DEFF Research Database (Denmark)

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

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

  8. Solving the time dependent vehicle routing problem by metaheuristic algorithms

    Science.gov (United States)

    Johar, Farhana; Potts, Chris; Bennell, Julia

    2015-02-01

    The problem we consider in this study is Time Dependent Vehicle Routing Problem (TDVRP) which has been categorized as non-classical VRP. It is motivated by the fact that multinational companies are currently not only manufacturing the demanded products but also distributing them to the customer location. This implies an efficient synchronization of production and distribution activities. Hence, this study will look into the routing of vehicles which departs from the depot at varies time due to the variation in manufacturing process. We consider a single production line where demanded products are being process one at a time once orders have been received from the customers. It is assumed that order released from the production line will be loaded into scheduled vehicle which ready to be delivered. However, the delivery could only be done once all orders scheduled in the vehicle have been released from the production line. Therefore, there could be lateness on the delivery process from awaiting all customers' order of the route to be released. Our objective is to determine a schedule for vehicle routing that minimizes the solution cost including the travelling and tardiness cost. A mathematical formulation is developed to represent the problem and will be solved by two metaheuristics; Variable Neighborhood Search (VNS) and Tabu Search (TS). These algorithms will be coded in C ++ programming and run using 56's Solomon instances with some modification. The outcome of this experiment can be interpreted as the quality criteria of the different approximation methods. The comparison done shown that VNS gave the better results while consuming reasonable computational efforts.

  9. SOLVING THE PROBLEM OF VEHICLE ROUTING BY EVOLUTIONARY ALGORITHM

    Directory of Open Access Journals (Sweden)

    Remigiusz Romuald Iwańkowicz

    2016-03-01

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

  10. Separable cross decomposition to solve the assign–routing problem

    Directory of Open Access Journals (Sweden)

    M. Elizondo–Cortés

    2008-01-01

    Full Text Available The Inventory–Routing Problem emerges on a logistical context, that is presented into the companies and that it seeks to satisfy the demands of a group of clients distributed geographically, using a flotilla of vehicles of limited capacity, which are in a central ware house, at the small est possible cost. The IRP is a NP–hard problem that is usually great size in real applications. For its solution was designed an strategy that uses of combined form, the crossed de composition and the separable Lagrangean relaxation in order to solve the assign–distribution phase, with what it is obtained a ping–pong type scheme between two subproblems, which are from transport type, with which it is obtained a very efficient algorithm of order O(n3 and easy to implement for the complete problem.

  11. Dynamic vehicle routing problems: Three decades and counting

    DEFF Research Database (Denmark)

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

    2016-01-01

    of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the nature of the dynamic element, (10) the......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 a real explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy...... 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...

  12. A green vehicle routing problem with customer satisfaction criteria

    Science.gov (United States)

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

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

  13. Cooperative vehicle routing problem: an opportunity for cost saving

    Science.gov (United States)

    Zibaei, Sedighe; Hafezalkotob, Ashkan; Ghashami, Seyed Sajad

    2016-02-01

    In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost saving allocations which are obtained from various coalitions of owners. The methodology is illustrated with a numerical example in which different coalitions of the players are evaluated along with the results of cooperation and cost saving allocation methods.

  14. Linearization and Decomposition Methods for Large Scale Stochastic Inventory Routing Problem with Service Level Constraints

    NARCIS (Netherlands)

    Y. Yu (Yugang); C. Chu (Chengbin); H.X. Chen (Haoxun); F. Chu (Feng)

    2010-01-01

    textabstractA stochastic inventory routing problem (SIRP) is typically the combination of stochastic inventory control problems and NP-hard vehicle routing problems, for a depot to determine delivery volumes to its customers in each period, and vehicle routes to distribute the delivery volumes. This

  15. A Capacitated Location Routing Problem with Semi Soft Time Windows

    Directory of Open Access Journals (Sweden)

    Maryam Gharavani

    2015-03-01

    Full Text Available In this article we address The Location Routing Problem (LRP, where there is a set of customers with known demand and a set of potential depot site and there is a set of heterogeneous vehicle with a certain capacity. Due to the similarity of the problem with real world, the constraints of depot capacity and vehicle capacity as well as route length have been considered simultaneously. The model provided in this article is described concerning the semi soft time window in which that a delay in service delivery time results in delay costs. The total costs in the proposed model include, the total fixed costs of construction depot, fixed costs associated with the use of vehicles, the total distance traveled by the vehicles, the total time within the system for the vehicle and penalty cost associated with the violation of working hour of vehicles and penalty costs associated with delay time in the start of service to customers and the aim is to minimize the total cost. Due to its complexity, two Meta-Heuristic algorithms of Genetic and Tabu Search algorithm have been used. Since the performance of the Meta-Heuristic algorithms is significantly influenced by their parameters, Taguchi Method is used to set the parameters of developed algorithms. Finally, the result represents that the Genetic Algorithm and Tabu Search are significantly efficient in terms of better quality of solution and computational time respectively.

  16. Efficient Intelligent Optimized Algorithm for Dynamic Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Jiangqing Wang

    2011-11-01

    Full Text Available In order to solve the dynamic vehicle routing problem (DVRP containing both dynamic network environment and real-time customer requests, an efficient intelligent optimized algorithm called IOA is proposed in this paper, which takes advantages of both global searching ability of evolutionary algorithms and local searching capability of ant colony algorithm. The proposed IOA incorporates ant colony algorithm for exploration and evolutionary algorithm for exploitation, and uses real-time information during the optimization process. In order to discuss the performance of the proposed algorithm, a mixed integral programming model for DVRP is formulated, and benchmark functions are constructed. Detailed simulation results and comparisons with the existed work show that the proposed IOA algorithm can achieve a higher performance gain, and is well suited to problems containing dynamic network environment and real-time customer requests.

  17. An evolutionary algorithm for a real vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Adamidis, P.

    2012-01-01

    Full Text Available The NP-hard Vehicle Routing Problem (VRP is central in the optimisation of distribution networks. Its main objective is to determine a set of vehicle trips of minimum total cost. The ideal schedule will efficiently exploit the company's recourses, service all customers and satisfy the given (mainly daily constraints. There have been many attempts to solve this problem with conventional techniques but applied to small-scale simplified problems. This is due to the complexity of the problem and the large volume of data to be processed. Evolutionary Algorithms are search and optimization techniques that are capable of confronting that kind of problems and reach a good feasible solution in a reasonable period of time. In this paper we develop an Evolutionary Algorithm in order to solve the VRP of a specific transportation company in Volos, Greece with different vehicle capacities. The algorithm has been tested with different configurations and constraints, and proved to be effective in reaching a satisfying solution for the company's needs.

  18. A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

    Science.gov (United States)

    Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

    2010-01-01

    Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

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

    Directory of Open Access Journals (Sweden)

    Yu Lin

    2015-01-01

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

  20. A sequential insertion heuristic for the vehicle routing problem with time windows with relatively few customers per route

    OpenAIRE

    DULLAERT, Wout

    2000-01-01

    In this paper we study the performance of Solomon’s (1987) sequential insertion heuristic |1, for Vehicle Routing Problems with Time Windows (VRPTWs) in which the number of customers per rout is small with respect to the customers’ time windows and the scheduling horizon. Solomon’s (1987) time insertion c12 (i, u, j) underestimates the additional time needed of inserting a new customer u between the depot, i= i0 and the first customer j in the partially constructed rout (i0= I, i1=j,i1,…,im)....

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

    DEFF Research Database (Denmark)

    Wøhlk, Sanne; Lysgaard, Jens

    2014-01-01

    The paper considers the Cumulative Capacitated Vehicle Routing Problem (CCVRP), which is a variation of the well-known Capacitated Vehicle Routing Problem (CVRP). In this problem, the traditional objective of minimizing total distance or time traveled by the vehicles is replaced by minimizing the...

  2. Route Selection Problem Based on Hopfield Neural Network

    Directory of Open Access Journals (Sweden)

    N. Kojic

    2013-12-01

    Full Text Available Transport network is a key factor of economic, social and every other form of development in the region and the state itself. One of the main conditions for transport network development is the construction of new routes. Often, the construction of regional roads is dominant, since the design and construction in urban areas is quite limited. The process of analysis and planning the new roads is a complex process that depends on many factors (the physical characteristics of the terrain, the economic situation, political decisions, environmental impact, etc. and can take several months. These factors directly or indirectly affect the final solution, and in combination with project limitations and requirements, sometimes can be mutually opposed. In this paper, we present one software solution that aims to find Pareto optimal path for preliminary design of the new roadway. The proposed algorithm is based on many different factors (physical and social with the ability of their increase. This solution is implemented using Hopfield's neural network, as a kind of artificial intelligence, which has shown very good results for solving complex optimization problems.

  3. Combining Nearest Neighbor Search with Tabu Search for Large-Scale Vehicle Routing Problem

    Science.gov (United States)

    Du, Lingling; He, Ruhan

    The vehicle routing problem is a classical problem in operations research, where the objective is to design least cost routes for a fleet of identical capacitated vehicles to service geographically scattered customers. In this paper, we present a new and effective hybrid metaheuristic algorithm for large-scale vehicle routing problem. The algorithm combines the strengths of the well-known Nearest Neighbor Search and Tabu Search into a two-stage procedure. More precisely, Nearest Neighbor Search is used to construct initial routes in the first stage and the Tabu Search is utilized to optimize the intra-route and the inter-route in the second stage. The presented algorithm is specifically designed for large-scale problems. The computational experiments were carried out on a standard benchmark and a real dataset with 6772 tobacco customers. The results demonstrate that the suggested method is highly competitive.

  4. Bi-objective optimization for multi-modal transportation routing planning problem based on Pareto optimality

    OpenAIRE

    Yan Sun; Maoxiang Lang

    2015-01-01

    Purpose: The purpose of study is to solve the multi-modal transportation routing planning problem that aims to select an optimal route to move a consignment of goods from its origin to its destination through the multi-modal transportation network. And the optimization is from two viewpoints including cost and time. Design/methodology/approach: In this study, a bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. ...

  5. The problem of pulmonary diseases in arc welders

    International Nuclear Information System (INIS)

    25 cases of affections of the broncho-pulmonary tract in arc welders were evaluated on the basis of the case histories submitted to the professional association for acknowledgement as professional diseases. Unfortunately it was not possible to quantify the exposure. Welding in places too small to be adequately ventilated was normal with more than 80% of the persons concerned and is probably, in some cases, a negative influencing parameter in relation to the genesis of pulmonary damage. Approximately a quarter of the patients had a previous record of serious affections of the broncho-pulmonary system. The clinical diagnoses and findings were heterogeneous. A uniform ''welders' disease'' of the lungs cannot be derived from the case histories evaluated. In individual cases a characteristic aggravation of the affection respectively a substantial share in its causation by professional factors must be discussed. (orig./MG)

  6. Problems in the Information Dissemination of the Internet Routing

    Institute of Scientific and Technical Information of China (English)

    ZHAO YiXin(赵邑新); YIN Xia(尹霞); WU JianPing(吴建平)

    2003-01-01

    Internet routing is achieved by a set of nodes running distributed algorithms -routing protocols. However, many nodes are resistless to wrong messages or improper operations,unable to detect or correct them. Thus a wrong message or an improper operation can easilysweep almost the whole Internet. Such a fragile Internet routing comes from the features of thesealgorithms and protocols. Besides, the strategies taken by the network equipment manufacturersand administrators also are of important influence. When determining the options or selectionsin the implementation/operation, they always pay more attention to the expense of a single nodeor a single area and make some simplifications in implementations and configurations while caringless about the influence on the whole network. This paper tries to illustrate such a scheme is notreasonable at all and suggests the consideration from the view of the overall optimization. Fromthree typical cases involved in the Internet routing, a general model is abstracted, which makes theresults signiflcative for more Internet related aspects. This paper evaluates the complexity of thetheoretical analysis, then acquires the effect of error information on the whole network through thesimulation on the Internet topology. It is shown that even very little error information can incursevere impact on the Internet. And it will take much more efforts of downstream nodes to makeremedies. This result is intuitively revealed through the comparisons in the charts and the visualpresentations. Then a hierarchical solution to establish the upgrade plan is given, which helps toupgrade the nodes of the network in a most efficient and economical way.

  7. A branch-and-cut algorithm for the capacitated open vehicle routing problem

    DEFF Research Database (Denmark)

    Letchford, A.N.; Lysgaard, Jens; Eglese, R.W.

    2007-01-01

    In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch...... assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem....

  8. A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Letchford, Adam N.; Lysgaard, Jens; Eglese, Richard W.

    In open vehicle routing problems, the vehicles are not required to return to the depot after completing service. In this paper, we present the first exact optimization algorithm for the open version of the well-known capacitated vehicle routing problem (CVRP). The algorithm is based on branch...... assess the quality of existing heuristic methods, and to compare the relative difficulty of open and closed versions of the same problem....

  9. An adaptive Cooperative Receding Horizon controller for the multivehicle routing problem

    OpenAIRE

    Giorgia Chini; Maria Guido Oddi; Antonio Pietrabissa

    2012-01-01

    The objective of the Vehicle Routing Problem (VRP), in the meaning of this paper, is to find the best path for a vehicle, or the best paths for a fleet of vehicles, with the aim of visiting a set of targets. Possible applications of the vehicle routing problem include surveillance, exploration, logistic,transportation, relief systems, etc. A lot of research has been carried out so far, but the VRP remains a complex and computationally expensive combinatorial problem, leading to the difficulty...

  10. Improved Region-Growing and Combinatorial Algorithms for $k$-Route Cut Problems

    OpenAIRE

    Guruganesh, Guru; Sanita, Laura; Swamy, Chaitanya

    2014-01-01

    We study the {\\em $k$-route} generalizations of various cut problems, the most general of which is \\emph{$k$-route multicut} ($k$-MC) problem, wherein we have $r$ source-sink pairs and the goal is to delete a minimum-cost set of edges to reduce the edge-connectivity of every source-sink pair to below $k$. The $k$-route extensions of multiway cut ($k$-MWC), and the minimum $s$-$t$ cut problem ($k$-$(s,t)$-cut), are similarly defined. We present various approximation and hardness results for th...

  11. Investigating the Value of Postponement in Inventory Routing Problems

    OpenAIRE

    Saka, Fernando

    2009-01-01

    Transportation and inventory management account for a large portion of the costs of distribution companies, so postponing delivery services could result in savings in these expenses. This particular study focuses on finding the optimal postponement horizon in which both routing and inventory holding costs are minimized. In addition, the research aims to explore the impact of a variety of parameters (service area, depot location, customers demand rate, customers density and vehicle capaci...

  12. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid approximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimization (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.

  13. Optimization of Capacitated Vehicle Routing Problem by Nested Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Karuppusamy Kanthavel

    2011-01-01

    Full Text Available Problem statement: Vehicle routing problem determines the optimum route for each vehicle as a sequence of visiting cities. The problem has been defined as NP-hard and exact solution is relatively difficult to achieve for real time large scale models. Though several attempts to solve the problem were made in the literature, new approaches may be tried to solve the problem to further reduce computational efforts. Approach: In this context this study focuses on maximum utilization of loading capacity and determines the optimum set of vehicle routes for Capacitated Vehicle Routing Problem (CVRP by a Nested Particle Swarm Optimization (NPSO technique. The algorithm is implemented as Master PSO and slave PSO for the identification of candidate list and route sequence in nested form to optimize the model. Results: Benchmarking data set of capacitated vehicle routing is considered for the evaluations. The total distance of set vehicle route obtained by the new approach is compared with the best known solution and other existing techniques. Conclusions/Recommendations: The NPSO produces significant results and computational performance than the existing PSO algorithms. This newly proposed NPSO algorithm develops the vehicle schedule without any local optimization technique.

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

    DEFF Research Database (Denmark)

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

    2011-01-01

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  16. Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators

    Directory of Open Access Journals (Sweden)

    V.PURUSHOTHAM REDDY

    2011-02-01

    Full Text Available In computer networks the routing is based on shortest path routing algorithms. Based on its advantages, an alternative method is used known as Genetic Algorithm based routing algorithm, which is highly scalable and insensitive to variations in network topology. Here we propose a coarse-grained parallel genetic algorithm to solve the shortest path routing problem with the primary goal of computation time reduction along with the use of migration scheme. This algorithm is developed and implemented on an MPI cluster. The effects of migration and its performance is studied in this paper.

  17. The electric vehicle routing problem with partial charging and nonlinear charging function

    OpenAIRE

    Montoya, Alejandro; Guéret, Christelle; Mendoza, Jorge E.; Villegas, Juan

    2015-01-01

    Electric vehicle routing problems (eVRPs) extend classical routing problems to consider the limited driving range of electric vehicles. In general, this limitation is overcome by introducing planned detours to battery charging stations. Most existing eVRP models rely on one (or both) of the following assumptions: (i) the vehicles fully charge their batteries every time they reach a charging station, and (ii) the battery charge level is a linear function of the charging time. In practical situ...

  18. A Particle Swarm Optimization with Adaptive Multi-Swarm Strategy for Capacitated Vehicle Routing Problem

    OpenAIRE

    Kui-Ting CHEN; Yijun Dai; Ke Fan; Takaaki Baba

    2015-01-01

    Capacitated vehicle routing problem with pickups and deliveries (CVRPPD) is one of the most challenging combinatorial optimization problems which include goods delivery/pickup optimization, vehicle number optimization, routing path optimization and transportation cost minimization. The conventional particle swarm optimization (PSO) is difficult to find an optimal solution of the CVRPPD due to its simple search strategy. A PSO with adaptive multi-swarm strategy (AMSPSO) is proposed to solve th...

  19. Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes

    OpenAIRE

    Nair, T. R. Gopalakrishnan; Sooda, Kavitha; Yashoda, M. B.

    2011-01-01

    In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in ...

  20. A Centroid-based Heuristic Algorithm for the Capacitated Vehicle Routing Problem

    OpenAIRE

    Kwangcheol Shin; Sangyong Han

    2012-01-01

    The vehicle routing problem (VRP) is famous as a nondeterministic polynomial-time hard problem. This study proposes a centroid-based heuristic algorithm to solve the capacitated VRP in polynomial time. The proposed algorithm consists of three phases: cluster construction, cluster adjustment, and route establishment. At the cluster construction phase, the farthest node (customer) among un-clustered nodes is selected as a seed to form a cluster. The notion of the geometrical centre of a cluster...

  1. Research on multi-objective emergency logistics vehicle routing problem under constraint conditions

    OpenAIRE

    Miaomiao Du; Hua Yi

    2013-01-01

    Purpose: Aim at choosing a relative good vehicle routing in emergency conditions under constraint conditions when disaster happens. Rapid response and rescue can save a lot of people. Design/methodology/approach: Modeling analysis: establishing a mathematical model of multi-objective emergency logistics vehicle routing problem. And in end of the paper, we intend to use genetic algorithms to solve the problem. Findings: Considering time requirement and cost limit both while choosing vehicle ro...

  2. Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach

    OpenAIRE

    Hongqi Li; Yue Lu; Jun Zhang; Tianyi Wang

    2012-01-01

    We study the tractor and semi-trailer routing problem (TSRP), a variant of the vehicle routing problem (VRP). In the TSRP model for this paper, vehicles are dispatched on a trailer-flow network where there is only one main depot, and all tractors originate and terminate in the main depot. Two types of decisions are involved: the number of tractors and the route of each tractor. Heuristic algorithms have seen widespread application to various extensions of the VRP. However, this approach has n...

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

    International Nuclear Information System (INIS)

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

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

    DEFF Research Database (Denmark)

    Mu, Q; Fu, Z; Lysgaard, Jens;

    2011-01-01

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

  5. REFINEMENTS OF THE COLUMN GENERATION PROCESS FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Institute of Scientific and Technical Information of China (English)

    Jesper LARSEN

    2004-01-01

    The Vehicle Routing Problem with Time Windows is a generalization of the well known capacity constrained Vehicle Routing Problem. A homogeneous fleet of vehicles has to service a set of customers. The service of the customers can only start within a well-defined time interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance). 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 run-time refinements when speeding up an exact approach without compromising optimality.

  6. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...... of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings......In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...

  7. Genetic Algorithm and Tabu Search for Vehicle Routing Problems with Stochastic Demand

    Science.gov (United States)

    Ismail, Zuhaimy; Irhamah

    2010-11-01

    This paper presents a problem of designing solid waste collection routes, involving scheduling of vehicles where each vehicle begins at the depot, visits customers and ends at the depot. It is modeled as a Vehicle Routing Problem with Stochastic Demands (VRPSD). A data set from a real world problem (a case) is used in this research. We developed Genetic Algorithm (GA) and Tabu Search (TS) procedure and these has produced the best possible result. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities.

  8. Parallel algorithms for network routing problems and recurrences

    Energy Technology Data Exchange (ETDEWEB)

    Wisniewski, J.A. (Sandia Labs., Albuquerque, NM); Sameh, A.H.

    1982-09-01

    In this paper, we consider the parallel solution of recurrences, and linear systems in the regular algebra of Carre. These problems are equivalent to solving the shortest path problem in graph theory, and they also arise in the analysis of Fortran programs. Our methods for solving linear systems in the regular algebra are analogues of well-known methods for solving systems of linear algebraic equations. A parallel version of Dijkstra's method, which has no linear algebraic analogue, is presented. Considerations for choosing an algorithm when the problem is large and sparse are also discussed.

  9. Parallel algorithms for network routing problems and recurrences

    International Nuclear Information System (INIS)

    In this paper, we consider the parallel solution of recurrences, and linear systems in the regular algebra of Carre. These problems are equivalent to solving the shortest path problem in graph theory, and they also arise in the analysis of Fortran programs. Our methods for solving linear systems in the regular algebra are analogues of well-known methods for solving systems of linear algebraic equations. A parallel version of Dijkstra's method, which has no linear algebraic analogue, is presented. Considerations for choosing an algorithm when the problem is large and sparse are also discussed

  10. Enhanced Mixed Integer Programming Techniques and Routing Problems

    OpenAIRE

    Tramontani, Andrea

    2009-01-01

    Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically ...

  11. The integrated model for solving the single-period deterministic inventory routing problem

    Science.gov (United States)

    Rahim, Mohd Kamarul Irwan Abdul; Abidin, Rahimi; Iteng, Rosman; Lamsali, Hendrik

    2016-08-01

    This paper discusses the problem of efficiently managing inventory and routing problems in a two-level supply chain system. Vendor Managed Inventory (VMI) policy is an integrating decisions between a supplier and his customers. We assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The objective of this paper is to minimize the inventory and the transportation costs of the customers for a two-level supply chain. The problem is to determine the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixed-integer program is developed for the solutions of the SP-DIRP problem.

  12. Considering lost sale in inventory routing problems for perishable goods

    DEFF Research Database (Denmark)

    Mirzaei, Samira; Seifi, Abbas

    2015-01-01

    solved to optimality for small instances and is used to obtain lower bounds for larger instances. We have also devised an efficient meta-heuristic algorithm to find good solutions for this class of problems based on Simulated Annealing (SA) and Tabu Search (TS). Computational results indicate that, for...

  13. On the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    This paper examines the NP-hard problem of scheduling a number of jobs on a finite set of machines such that the overall profit of executed jobs is maximized. Each job demands a number of resources, which must be sent to the executing machine via constrained paths. Furthermore, two resource demand...

  14. The dynamic multi-period vehicle routing problem

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  15. The Dynamic Multi-Period Vehicle Routing Problem

    DEFF Research Database (Denmark)

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

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

  16. On an iterative procedure for solving a routing problem with constraints

    OpenAIRE

    Chentsov, A. A.; A. G Chentsov

    2013-01-01

    The generalized precedence constrained traveling salesman problem is considered in the case when travel costs depend explicitly on the list of tasks that have not been performed (by the time of the travel). The original routing problem with dependent variables is represented in terms of an equivalent extremal problem with independent variables. An iterative method based on this representation is proposed for solving the original problem. The algorithm based on this method is implemented as a ...

  17. RaceTrack: An Approximation Algorithm for the Mobile Sink Routing Problem

    Science.gov (United States)

    Yuan, Yuan; Peng, Yuxing

    In large-scale monitoring applications, randomly deployed wireless sensor networks may not be fully connected. Using mobile sink for data collection is one of the feasible solutions. For energy saving, it is necessary to plan a shortest route for the mobile sink. Mobile sink routing problem can be regarded as a special case of TSP with neighborhoods (TSPN) problem. In this paper, we propose a novel approximation algorithm called RaceTrack. This algorithm forms a "racetrack" based on the TSP route, which is constructed from the locations of the deployed sensor nodes. By using inner lane heuristic and concave bend heuristic of auto racing, and a shortcut finding step, we optimize the obtained TSP route within O(n) computation time. Through formal proofs and large-scale simulations, we verified that our RaceTrack algorithm can achieve a good approximation ratio.

  18. A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem

    CERN Document Server

    Laekhanukit, Bundit; Singh, Mohit

    2012-01-01

    In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc disjoint paths between any pair of vertices. We give a simple (1 + 1/k)-approximation to the unweighted variant of the problem, where all arcs of G have the same cost. This improves on the 1 + 2/k approximation of Gabow et al. [GGTW09]. Similar to the 2-approximation algorithm for this problem [FJ81], our algorithm simply takes the union of a k in-arborescence and a k out-arborescence. The main difference is in the selection of the two arborescences. Here, inspired by the recent applications of the rounding by sampling method (see e.g. [AGM+ 10, MOS11, OSS11, AKS12]), we select the arborescences randomly by sampling from a distribution on unions of k arborescences that is defined based on an extreme point solution of the linear programming relaxation of the problem. In the analysis, we crucially utilize the sparsity property of the ext...

  19. Enhanced Genetic Algorithm approach for Solving Dynamic Shortest Path Routing Problems using Immigrants and Memory Schemes

    CERN Document Server

    Nair, T R Gopalakrishnan; Yashoda, M B

    2011-01-01

    In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in wireless communication lead more and more mobile wireless networks, such as mobile networks [mobile ad hoc networks (MANETs)] and wireless sensor networks. Dynamic nature of the network is the main characteristic of MANET. Therefore, the SP routing problem in MANET turns into dynamic optimization problem (DOP). Here the nodes ae made aware of the environmental condition, thereby making it intelligent, which goes as the input for GA. The implementation then uses GAs with immigrants and memory schemes to solve the dynamic SP routing problem (DSPRP) in MANETS. In our paper, once the network topology changes, the optimal solutions in the new environment can be searched using the new immigrants or the useful information stored in the memory. Results shows GA with new immigrants sho...

  20. A STUDY AND IMPLEMENTATION OF THE TRANSIT ROUTE NETWORK DESIGN PROBLEM FOR A REALISTIC URBAN CASE

    OpenAIRE

    M. Kalochristianakis; Kosmopoulos, D.

    2016-01-01

    The design of public transportation networks presupposes solving optimization problems, involving various parameters such as the proper mathematical description of networks, the algorithmic approach to apply, and also the consideration of real-world, practical characteristics such as the types of vehicles in the network, the frequencies of routes, demand, possible limitations of route capacities, travel decisions made by passengers, the environmental footprint of the system, th...

  1. A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens

    This article introduces a new exact algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands (CVRPSD). The CVRPSD can be formulated as a Set Partitioning Problem and it is shown that the associated column generation subproblem can be solved using a dynamic programming scheme....... Computational experiments show promising results....

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

    Directory of Open Access Journals (Sweden)

    Johan Oscar Ong

    2011-01-01

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

  3. Research on multi-objective emergency logistics vehicle routing problem under constraint conditions

    Directory of Open Access Journals (Sweden)

    Miaomiao Du

    2013-03-01

    Full Text Available Purpose: Aim at choosing a relative good vehicle routing in emergency conditions under constraint conditions when disaster happens. Rapid response and rescue can save a lot of people. Design/methodology/approach: Modeling analysis: establishing a mathematical model of multi-objective emergency logistics vehicle routing problem. And in end of the paper, we intend to use genetic algorithms to solve the problem. Findings: Considering time requirement and cost limit both while choosing vehicle routing when the disasters happens is meaningful. We can get a relative good result and give a guidance to rescue teams. Originality/value: Consider cost and time objectives and kinds of realistic conditions (such as the road congestion in the model when solving the problem, having expanded the theory scope.

  4. Multidimentional Self-organization for Online Time-Constrained Vehicle Routing Problems

    OpenAIRE

    ZEDDINI, B; ZARGAYOUNA, M

    2010-01-01

    Vehicle Routing problems are highly complex problems for which different Artificial Intelligence techniques have been used. In this paper, we propose two agent-oriented self-organization models for the dynamic version of the problem with time windows. The first model relies on a spatial representation, and the second is based on a space-time representation of the agents' action zones, which are able to maintain a good distribution of the vehicles on the environment. This distribution provides...

  5. Solution to the problem of ant being stuck by ant colony routing algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHAO Jing; TONG Wei-ming

    2009-01-01

    Many ant colony routing (ACR) algorithms have been presented in recent years, but few have studied the problem that ants will get stuck with probability in any terminal host when they are searching paths to route packets around a network. The problem has to be faced when designing and implementing the ACR algorithm. This article analyzes in detail the differences between the ACR and the ant colony optimization (ACO). Besides, particular restrictions on the ACR are pointed out and the three causes of ant being-stuck problem are obtained. Furthermore, this article proposes a new ant searching mechanism through dual path-checking and online routing loop removing by every intermediate node an ant visited and the destination host respectively, to solve the problem of ant being stuck and routing loop simultaneously. The result of numerical simulation is abstracted from one real network. Compared with existing two typical ACR algorithms, it shows that the proposed algorithm can settle the problem of ant being stuck and achieve more effective searching outcome for optimization path.

  6. An Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing Problem

    Directory of Open Access Journals (Sweden)

    Salman Yussof

    2011-01-01

    Full Text Available Problem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to variations in network topologies. However, it is also known that GA-based routing algorithm is not fast enough for real-time computation. Approach: To improve the computation time of GA-based routing algorithm, this study proposes a coarse-grained parallel GA routing algorithm for solving the shortest path routing problem. The proposed algorithm is evaluated using simulation where the proposed algorithm is executed on networks with various topologies and sizes. The parallel computation is performed using an MPI cluster. Three different experiments were conducted to identify the best value for the migration rate, the accuracy and execution time with respect to the number of computing nodes and speedup achieved as compared to the serial version of the same algorithm. Results: The result of the simulation shows that the best result is achieved for a migration rate around 0.1 and 0.2. The experiments also show that with larger number of computing nodes, accuracy decreases linearly, but computation time decreases exponentially, which justifies the use parallel implementation of GA to improve the speed of GA-based routing algorithm. Finally, the experiments also show that the proposed algorithm is able to achieve a speedup of up to 818.11% on the MPI cluster used to run the simulation. Conclusion/Recommendations: We have successfully shown that the performance of GA-based shortest path routing algorithm can be improved by using a coarse-grained parallel GA implementation. Even though in this study the proposed algorithm is executed

  7. An Artificial Bee Colony Algorithm for the Capacitated Vehicle Routing Problem

    DEFF Research Database (Denmark)

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

    This paper introduces an artificial bee colony heuristic for 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. The performance of the heuristic is evaluated on two sets of benchmark...... instances, and the computational results show that the heuristic produces good solutions....

  8. Hybrid self organizing migrating algorithm - Scatter search for the task of capacitated vehicle routing problem

    Science.gov (United States)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman; Jasek, Roman; Bialic-Davendra, Magdalena

    2012-11-01

    One of the new emerging application strategies for optimization is the hybridization of existing metaheuristics. The research combines the unique paradigms of solution space sampling of SOMA and memory retention capabilities of Scatter Search for the task of capacitated vehicle routing problem. The new hybrid heuristic is tested on the Taillard sets and obtains good results.

  9. Forming optimal routes in the problems of transport logistics by use of GIS technology

    Science.gov (United States)

    Nikolaenko, A. E.; Shugaley, O. A.

    2014-12-01

    Consideration of the key issues that arise in solving the problems of transport logistics, how to overcome them through the use of GIS technology. The analysis of the benefits of using GІS before forming routes in manual mode and the evaluation of economic efficiency in the use of GIS technology in transport logistics.

  10. A Hybrid Column Generation approach for an Industrial Waste Collection Routing Problem

    DEFF Research Database (Denmark)

    Hauge, Kristian; Larsen, Jesper; Lusby, Richard Martin;

    2014-01-01

    This paper presents a practical roll-on/roll-o_ routing (ROROR) problem arising in the collection of industrial waste. Skip containers, which are used for the waste col-lection, need to be distributed between, and collected from, a set of customers. Full containers must be driven to dump sites...

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

    Science.gov (United States)

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

    2015-12-01

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

  12. Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service

    Directory of Open Access Journals (Sweden)

    Goran Martinovic

    2008-01-01

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

  13. A framework for the interactive resolution of multi-objective vehicle routing problems

    CERN Document Server

    Geiger, Martin Josef

    2008-01-01

    The article presents a framework for the resolution of rich vehicle routing problems which are difficult to address with standard optimization techniques. We use local search on the basis on variable neighborhood search for the construction of the solutions, but embed the techniques in a flexible framework that allows the consideration of complex side constraints of the problem such as time windows, multiple depots, heterogeneous fleets, and, in particular, multiple optimization criteria. In order to identify a compromise alternative that meets the requirements of the decision maker, an interactive procedure is integrated in the resolution of the problem, allowing the modification of the preference information articulated by the decision maker. The framework is prototypically implemented in a computer system. First results of test runs on multiple depot vehicle routing problems with time windows are reported.

  14. The Effects of the Tractor and Semitrailer Routing Problem on Mitigation of Carbon Dioxide Emissions

    Directory of Open Access Journals (Sweden)

    Hongqi Li

    2013-01-01

    Full Text Available The incorporation of CO2 emissions minimization in the vehicle routing problem (VRP is of critical importance to enterprise practice. Focusing on the tractor and semitrailer routing problem with full truckloads between any two terminals of the network, this paper proposes a mathematical programming model with the objective of minimizing CO2 emissions per ton-kilometer. A simulated annealing (SA algorithm is given to solve practical-scale problems. To evaluate the performance of the proposed algorithm, a lower bound is developed. Computational experiments on various problems generated randomly and a realistic instance are conducted. The results show that the proposed methods are effective and the algorithm can provide reasonable solutions within an acceptable computational time.

  15. Research of Multi-Depot Vehicle Routing Problem by Cellular Ant Algorithm

    Directory of Open Access Journals (Sweden)

    Yuanzhi Wang

    2013-07-01

    Full Text Available The Multi-Depot Vehicle Routing Problem (MDVRP is a generalization of SDVRP, in which multiple vehicles start from multiple depots and return to their original depots at the end of their assigned tours. The MDVRP is NP-hard, therefore, the development of heuristic algorithms for this problem class is of primary interest. This paper solves Multi-Depot Vehicle Routing Problem with Cellular Ant Algorithm which is a new optimization method for solving real problems by using both the evolutionary rule of cellular, graph theory and the characteristics of ant colony optimization. The simulation experiment shows that the Cellular Ant Algorithm is feasible and effective for the MDVRP. The clarity and simplicity of the Cellular Ant Algorithm is greatly enhanced to ant colony optimization.

  16. Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach

    Directory of Open Access Journals (Sweden)

    Hongqi Li

    2012-01-01

    Full Text Available We study the tractor and semi-trailer routing problem (TSRP, a variant of the vehicle routing problem (VRP. In the TSRP model for this paper, vehicles are dispatched on a trailer-flow network where there is only one main depot, and all tractors originate and terminate in the main depot. Two types of decisions are involved: the number of tractors and the route of each tractor. Heuristic algorithms have seen widespread application to various extensions of the VRP. However, this approach has not been applied to the TSRP. We propose a heuristic algorithm to solve the TSRP. The proposed heuristic algorithm first constructs the initial route set by the limitation of a driver’s on-duty time. The candidate routes in the initial set are then filtered by a two-phase approach. The computational study shows that our algorithm is feasible for the TSRP. Moreover, the algorithm takes relatively little time to obtain satisfactory solutions. The results suggest that our heuristic algorithm is competitive in solving the TSRP.

  17. Hybrid tabu search for the multi-depot vehicle routing problem

    Science.gov (United States)

    Hu, Shan-Liang

    2010-07-01

    A hybrid tabu search for the multi-depot vehicle routing problem is considered in this paper. The purpose of the proposed approach is to decrease the number of used vehicles and the total travel cost. An extensive numerical experiment was performed on benchmark problem instances available in literature, the computational results are presented to show the high effectiveness and performance of the proposed approaches.

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

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper;

    2011-01-01

    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...... week. Computational results show that the aggregation procedure and the decomposition strategy are very effective in solving this large scale problem, and our solutions are superior to the industrial solutions given the constraints considered in this work....

  19. Solving global two dimensional routing problems using Snell's law and A* search

    OpenAIRE

    Richbourg, Robert F.; Rowe, Neil C.; Zyda, Michael J.; McGhee, Robert

    1986-01-01

    Long range route planning based on map data is an important component in the intelligent control system of an autonomous agent. Most attempts to solve this problem rely on applying simple search strategies to high resolution, node and link representations of the map. These techniques have several disadvantages including large time and space requirements. The authors present a solution technique which utilizes a more intelligent representation of the problem environment. Topographical features...

  20. Acceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows

    OpenAIRE

    Abbas Seifi,; Hadi Karimi

    2012-01-01

    The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper, ACCPM is used to accelerate Lagrangian relaxation procedure for solving a vehicle routing problem with time windows (VRPTW). First, a basic cutting plane algorithm and its relationship with a column generation technique is clarified. Then, the proposed method based on ACCPM is explained as a stabilization technique for Lagrangian relaxation. Both appro...

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

    Directory of Open Access Journals (Sweden)

    C Hauman

    2014-06-01

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

  2. Solving the Vehicle Routing Problem with Stochastic Demands via Hybrid Genetic Algorithm-Tabu Search

    Directory of Open Access Journals (Sweden)

    Z. Ismail

    2008-01-01

    Full Text Available This study considers a version of the stochastic vehicle routing problem where customer demands are random variables with known probability distribution. A new scheme based on a hybrid GA and Tabu Search heuristic is proposed for this problem under a priori approach with preventive restocking. The relative performance of the proposed HGATS is compared to each GA and TS alone, on a set of randomly generated problems following some discrete probability distributions. The problem data are inspired by real case of VRPSD in waste collection. Results from the experiment show the advantages of the proposed algorithm that are its robustness and better solution qualities resulted.

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

    DEFF Research Database (Denmark)

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

    2016-01-01

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

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

    DEFF Research Database (Denmark)

    Fukasawa, R.; Longo, H.; Lysgaard, Jens; Poggi de Aragão, M.; Reis, M.; Uchoa, E.; Werneck, R.F.

    2006-01-01

    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......The best exact algorithms for the Capacitated Vehicle Routing Problem (CVRP) have been based on either branch-and-cut or Lagrangean relaxation/column generation. This paper presents an algorithm that combines both approaches: it works over the intersection of two polytopes, one associated with a...

  5. A Discrete Firefly Algorithm to Solve a Rich Vehicle Routing Problem Modelling a Newspaper Distribution System with Recycling Policy

    OpenAIRE

    E. Osaba; Yang, Xin-She; Diaz, F.; Onieva, E.; Masegosa, A. D.; A. Perallos

    2016-01-01

    A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a bench...

  6. Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    H. Nazif

    2010-01-01

    Full Text Available Problem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on capacity and travel time are available to service a set of customers with demands and earliest and latest time for serving. The objective is to find routes for the vehicles to service all the customers at a minimal cost without violating the capacity and travel time constraints of the vehicles and the time window constraints set by the customers. Approach: We proposed a genetic algorithm using an optimized crossover operator designed by a complete undirected bipartite graph that finds an optimal set of delivery routes satisfying the requirements and giving minimal total cost. Various techniques have also been introduced into the proposed algorithm to further enhance the solutions quality. Results: We tested our algorithm with benchmark instances and compared it with some other heuristics in the literature. The results showed that the proposed algorithm is competitive in terms of the quality of the solutions found. Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. From the results, it can be concluded that the proposed algorithm is competitive when compared with other heuristics in the literature.

  7. A Mathematical Model for the Industrial Hazardous Waste Location-Routing Problem

    Directory of Open Access Journals (Sweden)

    Omid Boyer

    2013-01-01

    Full Text Available Technology progress is a cause of industrial hazardous wastes increasing in the whole world . Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be a result of location of undesirable facilities and also routing hazardous waste. In this paper a biobjective mixed integer programing model for location-routing industrial hazardous waste with two objectives is developed. First objective is total cost minimization including transportation cost, operation cost, initial investment cost, and cost saving from selling recycled waste. Second objective is minimization of transportation risk. Risk of population exposure within bandwidth along route is used to measure transportation risk. This model can help decision makers to locate treatment, recycling, and disposal centers simultaneously and also to route waste between these facilities considering risk and cost criteria. The results of the solved problem prove conflict between two objectives. Hence, it is possible to decrease the cost value by marginally increasing the transportation risk value and vice versa. A weighted sum method is utilized to combine two objectives function into one objective function. To solve the problem GAMS software with CPLEX solver is used. The problem is applied in Markazi province in Iran.

  8. Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking

    Directory of Open Access Journals (Sweden)

    Zhi-Hua Hu

    2013-01-01

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

  9. Relative Performance of Certain Meta Heuristics on Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sandhya

    2015-11-01

    Full Text Available —Solving Vehicle Routing Problem (VRP and its variants arise in many real life distribution systems. Classical VRP can be described as the problem of finding minimum cost routes with identical vehicles having fixed capacity which starts from a depot and reaches a number of customers with known demands with the proviso that each route starts and ends at the depot and the demand of each customer does not exceed the vehicle capacity is met. One of the generalizations of standard VRP is Vehicle Routing Problem with Time Windows (VRPTW with added complexity of serving every customer within a specified time window. Since VRPTW is a NP hard meta heuristics have often been designed for solving it. In this paper we compare the performance of Simulated Annealing (SA, genetic Algorithm (GA and Ant Colony Optimization (ACO for solving VRPTW based on their performance using different parameters taking total travel distance as the objective to be minimized. The results indicate that ACO is in general slightly more efficient then SA and GA.

  10. A set-covering based heuristic algorithm for the periodic vehicle routing problem.

    Science.gov (United States)

    Cacchiani, V; Hemmelmayr, V C; Tricoire, F

    2014-01-30

    We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

  11. Adaptive Agent Model with Hybrid Routing Selection Strategy for Improving the Road-Network Congestion Problem

    Institute of Scientific and Technical Information of China (English)

    Bin Jiang; Chao Yang; Takao Terano

    2015-01-01

    This paper proposes an adaptive agent model with a hybrid routing selection strategy for studying the road⁃network congestion problem. We focus on improving those severely congested links. Firstly, a multi⁃agent system is built, where each agent stands for a vehicle, and it makes its routing selection by considering the shortest path and the minimum congested degree of the target link simultaneously. The agent⁃based model captures the nonlinear feedback between vehicle routing behaviors and road⁃network congestion status. Secondly, a hybrid routing selection strategy is provided, which guides the vehicle routes adapting to the real⁃time road⁃network congestion status. On this basis, we execute simulation experiments and compare the simulation results of network congestion distribution, by Floyd agent with shortest path strategy and our proposed adaptive agent with hybrid strategy. The simulation results show that our proposed model has reduced the congestion degree of those seriously congested links of road⁃network. Finally, we execute our model on a real road map. The results finds that those seriously congested roads have some common features such as located at the road junction or near the unique road connecting two areas. And, the results also show an effectiveness of our model on reduction of those seriously congested links in this actual road network. Such a bottom⁃up congestion control approach with a hybrid congestion optimization perspective will have its significance for actual traffic congestion control.

  12. A HYBRID GENETIC ALGORITHM IMPLEMENTATION FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS

    Directory of Open Access Journals (Sweden)

    Muhammad Faisal Ibrahim

    2016-01-01

    Full Text Available This article is related to approach development in order to determine the most appropriate route for bottled water delivery from warehouse to retail from particular boundaries such as a limit on number of vehicle, vehicle capacity, and time windows to each retail. A mathematical model of VRPTW is adopted to solve the problem. Malang is one of the drinking water production centers in Indonesia, definitely it will be difficult for the company to determine the optimal delivery route with the existing restrictions. In this research hybrid genetic algorithm is use to determine the route shipping companies with the Java programming language. After analyzing the results obtained show that the results of the implementation of hybrid genetic algorithm is better than the company actual route. Moreover, authors also analyze the effect the number of iterations for the computation time, and the influence the number of iterations for the fitness value or violation. This algorithm can be applied for the routing and the result obtained is an optimal solution

  13. A HYBRID HOPFIELD NEURAL NETWORK AND TABU SEARCH ALGORITHM TO SOLVE ROUTING PROBLEM IN COMMUNICATION NETWORK

    Directory of Open Access Journals (Sweden)

    MANAR Y. KASHMOLA

    2012-06-01

    Full Text Available The development of hybrid algorithms for solving complex optimization problems focuses on enhancing the strengths and compensating for the weakness of two or more complementary approaches. The goal is to intelligently combine the key elements of these approaches to find superior solutions to solve optimization problems. Optimal routing in communication network is considering a complex optimization problem. In this paper we propose a hybrid Hopfield Neural Network (HNN and Tabu Search (TS algorithm, this algorithm called hybrid HNN-TS algorithm. The paradigm of this hybridization is embedded. We embed the short-term memory and tabu restriction features from TS algorithm in the HNN model. The short-term memory and tabu restriction control the neuron selection process in the HNN model in order to get around the local minima problem and find an optimal solution using the HNN model to solve complex optimization problem. The proposed algorithm is intended to find the optimal path for packet transmission in the network which is fills in the field of routing problem. The optimal path that will be selected is depending on 4-tuples (delay, cost, reliability and capacity. Test results show that the propose algorithm can find path with optimal cost and a reasonable number of iterations. It also shows that the complexity of the network model won’t be a problem since the neuron selection is done heuristically.

  14. Determination of optimal self-drive tourism route using the orienteering problem method

    Science.gov (United States)

    Hashim, Zakiah; Ismail, Wan Rosmanira; Ahmad, Norfaieqah

    2013-04-01

    This paper was conducted to determine the optimal travel routes for self-drive tourism based on the allocation of time and expense by maximizing the amount of attraction scores assigned to each city involved. Self-drive tourism represents a type of tourism where tourists hire or travel by their own vehicle. It only involves a tourist destination which can be linked with a network of roads. Normally, the traveling salesman problem (TSP) and multiple traveling salesman problems (MTSP) method were used in the minimization problem such as determination the shortest time or distance traveled. This paper involved an alternative approach for maximization method which is maximize the attraction scores and tested on tourism data for ten cities in Kedah. A set of priority scores are used to set the attraction score at each city. The classical approach of the orienteering problem was used to determine the optimal travel route. This approach is extended to the team orienteering problem and the two methods were compared. These two models have been solved by using LINGO12.0 software. The results indicate that the model involving the team orienteering problem provides a more appropriate solution compared to the orienteering problem model.

  15. An artificial bee colony algorithm for the capacitated vehicle routing problem

    DEFF Research Database (Denmark)

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

    2011-01-01

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

  16. An Angle-Based Crossover Tabu Search for Vehicle Routing Problem

    Science.gov (United States)

    Yang, Ning; Li, Ping; Li, Mingsen

    An improved tabu search - crossover tabu search (CTS) is presented which adopt the crossover operator of the genetic algorithm as the diversification strategy, and selecting elite solutions as the intensification strategies. To improve the performances, the angle-based idea of the sweep heuristic is used to confirm the neighborhood, and an object function with punishment. The angle-based CTS is applied for the vehicle routing problem. The simulating results which compared the tradition sweep heuristic and the standard tabu search shows the results got by angle-based CTS are better than those got by other two heuristics. The experiment shows the angle-based CTS has good performance on the vehicle routing problem.

  17. Branch and price for the time-dependent vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Dabia, Said; Van Woensel, Tom; De Kok, Ton;

    2013-01-01

    This paper presents a branch-and-price algorithm for the time-dependent vehicle routing problem with time windows (TDVRPTW). We capture road congestion by considering time-dependent travel times, i.e., depending on the departure time to a customer, a different travel time is incurred. We consider...... the variant of the TDVRPTW where the objective is to minimize total route duration and denote this variant the duration minimizing TDVRPTW (DM-TDVRPTW). Because of time dependency, vehicles' dispatch times at the depot are crucial as road congestion might be avoided. Because of its complexity, all...... means of column generation, and a tailored labeling algorithm is used to solve the pricing problem. We introduce new dominance criteria that allow more label dominance. For our numerical results, we modified Solomon's data sets by adding time dependency. Our algorithm is able to solve about 63% of the...

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

    Science.gov (United States)

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

    2015-01-01

    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. PMID:26343655

  19. A Hybrid Genetic Algorithm for Vehicle Routing Problem with Complex Constraints

    Institute of Scientific and Technical Information of China (English)

    CHEN Yan; LU Jun; LI Zeng-zhi

    2006-01-01

    Most research on the Vehicle Routing Problem (VRP) is focused on standard conditions, which is not suitable for specific cases. A Hybrid Genetic Algorithm is proposed to solve a Vehicle Routing Problem (VRP) with complex side constraints. A novel coding method is designed especially for side constraints. A greedy algorithm combined with a random algorithm is introduced to enable the diversity of the initial population, as well as a local optimization algorithm employed to improve the searching efficiency. In order to evaluate the performance, this mechanism has been implemented in an oil distribution center, the experimental and executing results show that the near global optimal solution can be easily and quickly obtained by this method, and the solution is definitely satisfactory in the VRP application.

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

    OpenAIRE

    Li Liao; Jianfeng Li; Yaohua Wu

    2013-01-01

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

  1. A mathematical model for the municipal solid waste location-routing problem with intermediate transfer stations

    OpenAIRE

    Hossein Asefi; Samsung Lim; Mojtaba Maghrebi

    2015-01-01

    Municipal solid waste management is one of the challenging issues in mega cities due to various interrelated factors such as operational costs and environmental concerns. Cost as one of the most significant constraints of municipal solid waste management can be effectively economized by efficient planning approaches. Considering diverse waste types in an integrated municipal solid waste system, a mathematical model of the location-routing problem is formulated and solved in this study in orde...

  2. Cost Optimisation in Freight Distribution with Cross-Docking: N-Echelon Location Routing Problem

    OpenAIRE

    Gonzalez-Feliu, Jesus

    2012-01-01

    Freight transportation constitutes one of the main activities that influences economy and society, as it assures a vital link between suppliers and customers and it represents a major source of employment. Multi-echelon distribution is one of the most common strategies adopted by the transportation companies in an aim of cost reduction. Although vehicle routing problems are very common in operational research, they are essentially related to single-echelon cases. This paper presents the main ...

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

    OpenAIRE

    Hiermann, Gerhard; Puchinger, Jakob; Ropke, Stefan; Hartl, Richard F.

    2016-01-01

    International audience 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 conventio...

  4. Control strategies for the vehicle routing problem applied to medical emergencies

    OpenAIRE

    Chini, Giorgia

    2014-01-01

    This thesis deals with dynamic Multi-Vehicle Routing Problem (MVRP) in both deterministic and stochastic scenarios. The objective of the MVRP is to find the best paths for a fleet of vehicles, with the aim of visiting a set of targets. Based on the Cooperative Receding Horizon (CRH) approach proposed by Cassandras et al.(CRH) for the Euclidean case, this thesis: i) presents another algorithm that is more efficient with clustered targets (tCRH); ii) illustrates an algorithm that ex...

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

    Directory of Open Access Journals (Sweden)

    Qi Hu

    2013-04-01

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

  6. A P-Based Hybrid Evolutionary Algorithm for Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Yunyun Niu

    2014-01-01

    Full Text Available The ability to solve optimization problems using membrane algorithms is an important application of membrane computing. This work combines membrane systems and genetic operators to build an approximated algorithm for the vehicle routing problem with time windows. The algorithm is based on a tissue-like membrane structure combined with cell separation rules and communication rules; during such processes membranes collect and disperse information. Genetic operators are used as the system's subalgorithms. We also design a special improvement strategy to speed up the search process in subsystems. The experimental results show that the solution quality from the proposed algorithm is competitive with other heuristic or metaheuristic algorithms in the literature.

  7. Clique inequalities applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

    Spoorendonk, Simon; Desaulniers, Guy

    2010-01-01

    This work presents an exact branch-cut-and-price algorithm for the vehicle routing problem with time windows (VRPTW) where the well-known clique inequalities are used as cutting planes defined on the set partitioning master problem variables. It shows how these cutting planes affect the dominance......, to our knowledge, this is a first attempt at incorporating for the VRPTW a set of valid inequalities specialized for the set partitioning polytope. Computational results show that the use of clique inequalities improves the lower bound at the root node of the search tree and reduces the number of...

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

    DEFF Research Database (Denmark)

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

    2013-01-01

    This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow m...... model that is a relaxation and provides a valid lower bound. A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms....

  9. Bi-objective optimization for multi-modal transportation routing planning problem based on Pareto optimality

    Directory of Open Access Journals (Sweden)

    Yan Sun

    2015-09-01

    Full Text Available Purpose: The purpose of study is to solve the multi-modal transportation routing planning problem that aims to select an optimal route to move a consignment of goods from its origin to its destination through the multi-modal transportation network. And the optimization is from two viewpoints including cost and time. Design/methodology/approach: In this study, a bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. Minimizing the total transportation cost and the total transportation time are set as the optimization objectives of the model. In order to balance the benefit between the two objectives, Pareto optimality is utilized to solve the model by gaining its Pareto frontier. The Pareto frontier of the model can provide the multi-modal transportation operator (MTO and customers with better decision support and it is gained by the normalized normal constraint method. Then, an experimental case study is designed to verify the feasibility of the model and Pareto optimality by using the mathematical programming software Lingo. Finally, the sensitivity analysis of the demand and supply in the multi-modal transportation organization is performed based on the designed case. Findings: The calculation results indicate that the proposed model and Pareto optimality have good performance in dealing with the bi-objective optimization. The sensitivity analysis also shows the influence of the variation of the demand and supply on the multi-modal transportation organization clearly. Therefore, this method can be further promoted to the practice. Originality/value: A bi-objective mixed integer linear programming model is proposed to optimize the multi-modal transportation routing planning problem. The Pareto frontier based sensitivity analysis of the demand and supply in the multi-modal transportation organization is performed based on the designed case.

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

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2016-02-01

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

  11. A modified ant colony optimization to solve multi products inventory routing problem

    Science.gov (United States)

    Wong, Lily; Moin, Noor Hasnah

    2014-07-01

    This study considers a one-to-many inventory routing problem (IRP) network consisting of a manufacturer that produces multi products to be transported to many geographically dispersed customers. We consider a finite horizon where a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, transport products from the warehouse to meet the demand specified by the customers in each period. The demand for each product is deterministic and time varying and each customer requests a distinct product. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount on inventory and to construct a delivery schedule that minimizes both the total transportation and inventory holding costs 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 solution) for each problem considered. We propose a modified ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. ACO performs better on large instances compared to the upper bound.

  12. A STUDY AND IMPLEMENTATION OF THE TRANSIT ROUTE NETWORK DESIGN PROBLEM FOR A REALISTIC URBAN CASE

    Directory of Open Access Journals (Sweden)

    M. Kalochristianakis

    2016-01-01

    Full Text Available The design of public transportation networks presupposes solving optimization problems, involving various parameters such as the proper mathematical description of networks, the algorithmic approach to apply, and also the consideration of real-world, practical characteristics such as the types of vehicles in the network, the frequencies of routes, demand, possible limitations of route capacities, travel decisions made by passengers, the environmental footprint of the system, the available bus technologies, besides others. The current paper presents the progress of the work that aims to study the design of a municipal public transportation system that employs middleware technologies and geographic information services in order to produce practical, realistic results. The system employs novel optimization approaches such as the particle swarm algorithms and also considers various environmental parameters such as the use of electric vehicles and the emissions of conventional ones.

  13. Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one.

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

    Directory of Open Access Journals (Sweden)

    Ali Nadizadeh

    2014-08-01

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

  15. A route-based decomposition for the Multi-Commodity k-splittable Maximum Flow Problem

    DEFF Research Database (Denmark)

    Gamst, Mette

    2012-01-01

    The Multi-Commodity k-splittable Maximum Flow Problem routes flow through a capacitated graph such that each commodity uses at most k paths and such that the total amount of routedflow is maximized. This paper proposes a branch-and-price algorithm based on a route-based Dantzig-Wolfe decomposition...

  16. A heuristic algorithm for a multi-product four-layer capacitated location-routing problem

    Directory of Open Access Journals (Sweden)

    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.

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

    Directory of Open Access Journals (Sweden)

    Xuhao Zhang

    2014-01-01

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

  18. A mathematical model for the municipal solid waste location-routing problem with intermediate transfer stations

    Directory of Open Access Journals (Sweden)

    Hossein Asefi

    2015-09-01

    Full Text Available Municipal solid waste management is one of the challenging issues in mega cities due to various interrelated factors such as operational costs and environmental concerns. Cost as one of the most significant constraints of municipal solid waste management can be effectively economized by efficient planning approaches. Considering diverse waste types in an integrated municipal solid waste system, a mathematical model of the location-routing problem is formulated and solved in this study in order to minimize the total cost of transportation and facility establishment.

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

    DEFF Research Database (Denmark)

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

    2016-01-01

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

  20. Flow Merging and Hub Route Optimization in Collaborative Transportation

    OpenAIRE

    2013-01-01

    This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers’ transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route could be acquired after paying fixed charges. The problem arises in the application of logistics, postal services, airline transportation, and so forth. We formulate the problem as a mixed-integer prog...

  1. Comparing The Performance of Simulated Annealing and Genetic Algorithm Metaheuristics in The Solving of Vehicle Routing Problem Variants

    OpenAIRE

    Epps, M

    2014-01-01

    Solving the variants of the Vehicle Routing Problem (VRP) is invaluable to a huge range of businesses today. It allows for the calculation of efficient logistics routing which can drastically improve a firm’s competitiveness. As NP-hard combinatorial optimisation problems, they cannot be solved by exact methods: the solution space is simply too large for it to be evaluated in entirety in a reasonable timespan. Instead, metaheuristic algorithms, which produce reasonably good solutions much mor...

  2. Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks

    Directory of Open Access Journals (Sweden)

    Subbaraj Potti

    2011-01-01

    Full Text Available Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA, is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing and noncommensurable objectives. Results: SPEA combines several features of previous multi-objective evolutionary algorithms in a unique manner. SPEA stores nondominated solutions externally in another continuously-updated population and uses a hierarchical clustering algorithm to provide the decision maker with a manageable pareto-optimal set. SPEA is applied to a 20 node network as well as to large size networks ranging from 50-200 nodes. Conclusion: The results demonstrate the capabilities of the proposed approach to generate true and well distributed pareto-optimal nondominated solutions.

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

    Directory of Open Access Journals (Sweden)

    Ali Hossein Mirzaei

    2012-02-01

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

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

    Science.gov (United States)

    Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana

    2016-01-01

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

  5. A Simulation-Based Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Travel Times

    Directory of Open Access Journals (Sweden)

    Zheng Wang

    2013-01-01

    Full Text Available This paper presents a flexible solution methodology for the capacitated vehicle routing problem with stochastic travel times (CVRPSTT. One of the basic ideas of the methodology is to consider a vehicle working time lower than the actual maximum vehicle working time when designing CVRPSTT solutions. In this way, the working time surplus can be used to cope with unexpected congestions when necessary. Another important idea is to transform the CVRPSTT instance to a limited set of capacitated vehicle routing problems (CVRP, each of which is defined by a given percentage of the maximum vehicle working time. Thus, our approach can take advantage of any efficient heuristic that already exists for the CVRP. Based on the two key ideas, this paper presents a simulation-based algorithm, in which Monte Carlo simulation is used to obtain estimates of the cost and the reliability of each solution, and the Clarke and Wright heuristic is improved to generate more reliable solutions. Finally, a number of numerical experiments are done in the paper with the purpose of analyzing the efficiency of the described methodology under different uncertainty scenarios.

  6. Research on cultural algorithm for solving routing problem of mobile agent

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    The key idea behind cultural algorithm is to explicitly acquire problem-solving knowledge from the evolving population and in return apply that knowledge to guide the search. In this article, cultural algorithm-simulated annealing is proposed to solve the routing problem of mobile agent. The optimal individual is accepted to improve the belief space's evolution of cultural algorithms by simulated annealing. The step size in search is used as situational knowledge to guide the search of optimal solution in the population space. Because of this feature, the search time is reduced. Experimental results show that the algorithm proposed in this article can ensure the quality of optimal solutions, and also has better convergence speed. The operation efficiency of the system is considerably improved.

  7. A Hybrid Bat Algorithm with Path Relinking for Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Yongquan Zhou

    2013-01-01

    Full Text Available The capacitated vehicle routing problem (CVRP is an NP-hard problem with wide engineering and theoretical background. In this paper, a hybrid bat algorithm with path relinking (HBA-PR is proposed to solve CVRP. The HBA-PR is constructed based on the framework of continuous bat algorithm; the greedy randomized adaptive search procedure (GRASP and path relinking are effectively integrated into bat algorithm. Moreover, in order to further improve the performance, the random subsequences and single-point local search are operated with certain loudness (probability. In order to verify the validity of the method in this paper, and it's efficiency and with other existing methods, several classical CVRP instances from three classes of CVRP benchmarks are selected to tested. Experimental results and comparisons show that the HBA-PR is effective for CVRP.

  8. Application of Modified Ant Colony Optimization (MACO for Multicast Routing Problem

    Directory of Open Access Journals (Sweden)

    Sudip Kumar Sahana

    2016-04-01

    Full Text Available It is well known that multicast routing is combinatorial problem finds the optimal path between source destination pairs. Traditional approaches solve this problem by establishment of the spanning tree for the network which is mapped as an undirected weighted graph. This paper proposes a Modified Ant Colony Optimization (MACO algorithm which is based on Ant Colony System (ACS with some modification in the configuration of starting movement and in local updation technique to overcome the basic limitations of ACS such as poor initialization and slow convergence rate. It is shown that the proposed Modified Ant Colony Optimization (MACO shows better convergence speed and consumes less time than the conventional ACS to achieve the desired solution.

  9. Arc-based constrained ant colony optimisation algorithms for the optimal solution of hydropower reservoir operation problems

    Energy Technology Data Exchange (ETDEWEB)

    Moeini, R.; Afshar, M.H.

    2011-07-15

    Hydropower is currently the number one source of electricity production in the world. For the design and construction of such systems, mathematical modelling is often use for reservoir operations. As conventional methods present some shortcomings in solving reservoir operation problems, a new method is presented here. It consists in an arc-based formulation of hydropower reservoir operation problems which can be applied to ant colony optimization algorithms. This paper first described this formulation and then applied it to solve two hydropower reservoir operation problems. The results showed that this formulation can optimally solve large-scale hydropower reservoir operation problems while offering a clear definition of heuristic information.

  10. Multiobjective Dynamic Vehicle Routing Problem and Time Seed Based Solution Using Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Omprakash Kaiwartya

    2015-01-01

    Full Text Available A multiobjective dynamic vehicle routing problem (M-DVRP has been identified and a time seed based solution using particle swarm optimization (TS-PSO for M-DVRP has been proposed. M-DVRP considers five objectives, namely, geographical ranking of the request, customer ranking, service time, expected reachability time, and satisfaction level of the customers. The multiobjective function of M-DVRP has four components, namely, number of vehicles, expected reachability time, and profit and satisfaction level. Three constraints of the objective function are vehicle, capacity, and reachability. In TS-PSO, first of all, the problem is partitioned into smaller size DVRPs. Secondly, the time horizon of each smaller size DVRP is divided into time seeds and the problem is solved in each time seed using particle swarm optimization. The proposed solution has been simulated in ns-2 considering real road network of New Delhi, India, and results are compared with those obtained from genetic algorithm (GA simulations. The comparison confirms that TS-PSO optimizes the multiobjective function of the identified problem better than what is offered by GA solution.

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

    OpenAIRE

    Yu Lin; Tianyi Xu; Zheyong Bian

    2015-01-01

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

  12. An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

    OpenAIRE

    Hao Yu; Wei Deng Solvang

    2016-01-01

    Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing tran...

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

    OpenAIRE

    Wan-Yu Liu; Chun-Cheng Lin; Ching-Ren Chiu; You-Song Tsao; Qunwei Wang

    2014-01-01

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

  14. A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem

    Science.gov (United States)

    Nguyen, Viet-Phuong; Prins, Christian; Prodhon, Caroline

    This paper presents a new hybrid metaheuristic between a greedy randomized adaptive search procedure (GRASP) and an evolutionary/iterated local search (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation between ELS and ILS. In this phase, each child is obtained by mutation and evaluated through a splitting procedure of giant tour followed by a local search. The tabu list, defined by two characteristics of solution (total cost and number of trips), is used to avoid searching a space already explored. The results show that our metaheuristic clearly outperforms all previously published methods on LRP-2E benchmark instances. Furthermore, it is competitive with the best meta-heuristic published for the single-echelon LRP.

  15. Improved Multi-Agent System for the Vehicle Routing Problem with Time Windows

    Institute of Scientific and Technical Information of China (English)

    DAN Zhenggang; CAI Linning; ZHENG Li

    2009-01-01

    The vehicle routing problem with time windows (VRPTW) involves assigning a fleet of limited ca-pacity vehicles to serve a set of customers without violating the capacity and time constraints. This paper presents a multi-agent model system for the VRPTW based on the internal behavior of agents and coordina-tion among the agents. The system presents a formal view of coordination using the traditional contract-net protocol (CNP) that relies on the basic loop of agent behavior for order receiving, order announcement, bid calculation, and order scheduling followed by order execution. An improved CNP method based on a vehicle selection strategy is used to reduce the number of negotiations and the negotiation time. The model is vali-dated using Solomon's benchmarks, with the results showing that the improved CNP uses only 30% as many negotiations and only 70% of the negotiation time of the traditional CNP.

  16. A hybrid genetic algorithm for route optimization in the bale collecting problem

    Directory of Open Access Journals (Sweden)

    C. Gracia

    2013-06-01

    Full Text Available The bale collecting problem (BCP appears after harvest operations in grain and other crops. Its solution defines the sequence of collecting bales which lie scattered over the field. Current technology on navigation-aid systems or auto-steering for agricultural vehicles and machines, is able to provide accurate data to make a reliable bale collecting planning. This paper presents a hybrid genetic algorithm (HGA approach to address the BCP pursuing resource optimization such as minimizing non-productive time, fuel consumption, or distance travelled. The algorithmic route generation provides the basis for a navigation tool dedicated to loaders and bale wagons. The approach is experimentally tested on a set of instances similar to those found in real situations. In particular, comparative results show an average improving of a 16% from those obtained by previous heuristics.

  17. Route optimisation and solving Zermelo's navigation problem during long distance migration in cross flows.

    Science.gov (United States)

    Hays, Graeme C; Christensen, Asbjørn; Fossette, Sabrina; Schofield, Gail; Talbot, Julian; Mariani, Patrizio

    2014-02-01

    The optimum path to follow when subjected to cross flows was first considered over 80 years ago by the German mathematician Ernst Zermelo, in the context of a boat being displaced by ocean currents, and has become known as the 'Zermelo navigation problem'. However, the ability of migrating animals to solve this problem has received limited consideration, even though wind and ocean currents cause the lateral displacement of flyers and swimmers, respectively, particularly during long-distance journeys of 1000s of kilometres. Here, we examine this problem by combining long-distance, open-ocean marine turtle movements (obtained via long-term GPS tracking of sea turtles moving 1000s of km), with a high resolution basin-wide physical ocean model to estimate ocean currents. We provide a robust mathematical framework to demonstrate that, while turtles eventually arrive at their target site, they do not follow the optimum (Zermelo's) route. Even though adult marine turtles regularly complete incredible long-distance migrations, these vertebrates primarily rely on course corrections when entering neritic waters during the final stages of migration. Our work introduces a new perspective in the analysis of wildlife tracking datasets, with different animal groups potentially exhibiting different levels of complexity in goal attainment during migration. PMID:24304813

  18. Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen

    Directory of Open Access Journals (Sweden)

    Vanessa de Oliveira Ferreira

    2012-08-01

    Full Text Available In this work we consider a variant of the vehicle routing problem that allows the assignment of multiple deliverymen to one or more routes. A practical motivation for this variant arises, for example, in the distribution of beverages in highly dense urban areas, characterized by the difficulty in serving daily requests within regular working day hours with a single deliveryman per vehicle. We present a mathematical model and a savings algorithm in order to generate low cost routes that maximize the number of requests served in compliance with the maximum route time. The impact of the extra deliverymen on the solutions provided by the proposed heuristic is assessed by means of sets of generated examples based on classical instances of literature. It is also presented the results obtained by an adaptation of a tabu search approach from the literature.

  19. Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms.

    Science.gov (United States)

    Wang, Jiahai; Zhou, Ying; Wang, Yong; Zhang, Jun; Chen, C L Philip; Zheng, Zibin

    2016-03-01

    This paper investigates a practical variant of the vehicle routing problem (VRP), called VRP with simultaneous delivery and pickup and time windows (VRPSDPTW), in the logistics industry. VRPSDPTW is an important logistics problem in closed-loop supply chain network optimization. VRPSDPTW exhibits multiobjective properties in real-world applications. In this paper, a general multiobjective VRPSDPTW (MO-VRPSDPTW) with five objectives is first defined, and then a set of MO-VRPSDPTW instances based on data from the real-world are introduced. These instances represent more realistic multiobjective nature and more challenging MO-VRPSDPTW cases. Finally, two algorithms, multiobjective local search (MOLS) and multiobjective memetic algorithm (MOMA), are designed, implemented and compared for solving MO-VRPSDPTW. The simulation results on the proposed real-world instances and traditional instances show that MOLS outperforms MOMA in most of instances. However, the superiority of MOLS over MOMA in real-world instances is not so obvious as in traditional instances. PMID:25794408

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

    Directory of Open Access Journals (Sweden)

    Wan-Yu Liu

    2014-07-01

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

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

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2013-09-01

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

  2. Weldability Characteristics of Sintered Hot-Forged AISI 4135 Steel Produced through P/M Route by Using Pulsed Current Gas Tungsten Arc Welding

    Science.gov (United States)

    Joseph, Joby; Muthukumaran, S.; Pandey, K. S.

    2016-01-01

    Present investigation is an attempt to study the weldability characteristics of sintered hot-forged plates of AISI 4135 steel produced through powder metallurgy (P/M) route using matching filler materials of ER80S B2. Compacts of homogeneously blended elemental powders corresponding to the above steel were prepared on a universal testing machine (UTM) by taking pre-weighed powder blend with a suitable die, punch and bottom insert assembly. Indigenously developed ceramic coating was applied on the entire surface of the compacts in order to protect them from oxidation during sintering. Sintered preforms were hot forged to flat, approximately rectangular plates, welded by pulsed current gas tungsten arc welding (PCGTAW) processes with aforementioned filler materials. Microstructural, tensile and hardness evaluations revealed that PCGTAW process with low heat input could produce weldments of good quality with almost nil defects. It was established that PCGTAW joints possess improved tensile properties compared to the base metal and it was mainly attributed to lower heat input, resulting in finer fusion zone grains and higher fusion zone hardness. Thus, the present investigation opens a new and demanding field in research.

  3. Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost

    OpenAIRE

    Luo, Zhixin; Qin, Hu; Zhu, Wenbin; Lim, Andrew

    2014-01-01

    This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weight-related cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time windows. The travel cost per unit distance is a linear function of the vehicle weight and the custo...

  4. An optimization algorithm for a capacitated vehicle routing problem with time windows

    Indian Academy of Sciences (India)

    PINAR KIRCI

    2016-05-01

    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 hours. Recently, cost and on-time delivery are the most important actors in logistics. Thus, the logistic applications attract attention of companies. In logistic management, determining the locations of delivery points and deciding the path are the vital components that should be considered. Deciding the paths of vehicles provides companies to use their vehicles efficiently. And with utilizing optimized paths, big amounts of cost and time savings will be gained. The main aim of the work is providing the best path according to the needs of the customers, minimizing the costs with utilizing the VRP and presenting an application for companies that need logistic management. To compare the results, simulated annealing is used on special scenarios. And t-test is performed in the study for the visited path in km with p-value of 0.05.

  5. Approximation Algorithms and Hardness of the k-Route Cut Problem

    CERN Document Server

    Chuzhoy, Julia; Zhou, Yuan; Vijayaraghavan, Aravindan

    2011-01-01

    We study the k-route cut problem: given an undirected edge-weighted graph G=(V,E), a collection {(s_1,t_1),(s_2,t_2),...,(s_r,t_r)} of source-sink pairs, and an integer connectivity requirement k, the goal is to find a minimum-weight subset E' of edges to remove, such that the connectivity of every pair (s_i, t_i) falls below k. Specifically, in the edge-connectivity version, EC-kRC, the requirement is that there are at most (k-1) edge-disjoint paths connecting s_i to t_i in G \\ E', while in the vertex-connectivity version, NC-kRC, the same requirement is for vertex-disjoint paths. Prior to our work, poly-logarithmic approximation algorithms have been known for the special case where k >= 3, but no non-trivial approximation algorithms were known for any value k>3, except in the single-source setting. We show an O(k log^{3/2}r)-approximation algorithm for EC-kRC with uniform edge weights, and several polylogarithmic bi-criteria approximation algorithms for EC-kRC and NC-kRC, where the connectivity requirement ...

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

    Directory of Open Access Journals (Sweden)

    Alberto Ochoa-Ortíz

    2015-01-01

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

  7. MILP for the Inventory and Routing for Replenishment Problem in the Car Assembly Line.

    Directory of Open Access Journals (Sweden)

    Raul Pulido

    2014-01-01

    Full Text Available The inbound logistic for feeding the workstation inside the factory represents a critical issue in the car manufacturing industry. Nowadays, this issue is even more critical than in the past since more types of car are being produced in the assembly lines. Consequently, as workstations have to install many types of components, they also need to have an inventory of different types of the component in a compact space.The replenishment is a critical issue since a lack of inventory could cause line stoppage or reworking. On the other hand, an excess of inventory could increase the holding cost or even block the replenishment paths. The decision of the replenishment routes cannot be made without taking into consideration the inventory needed by each station during the production time which will depend on the production sequence. This problem deals with medium-sized instances and it is solved using online solvers. The contribution of this paper is a MILP for the replenishment and inventory of the components in a car assembly line.

  8. Exact and heuristic solution approaches for the Integrated Job Scheduling and Constrained Network Routing Problem

    DEFF Research Database (Denmark)

    Gamst, M.

    2014-01-01

    better than using a standard IP-solver; however, it is still unable to solve several instances. The proposed heuristics generally have good performance. Especially, the First Come First Serve scheduling heuristic combined with a routing strategy, which proposes several good routes for each demand, has...

  9. MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH TIME WINDOW MENGGUNAKAN ADAPTIVE GENETIC ALGORITHM DENGAN FUZZY LOGIC CONTROLLER

    Directory of Open Access Journals (Sweden)

    Tri Kusnandi Fazarudin

    2015-12-01

    Full Text Available Multi-Depot Vehicle Routing Problem with Time Window (MDVRPTW is a problem of finding an optimal route for a supplier. The supplier needs to deliver goods to a number of customers using the vehicles located in a number of depots. Each delivery must be done within the service time specified by each customer The vehicles used have a maximum limit on the amount of goods that can be loaded and the maximum time the vehicle may be used. MDVRPTW is one of the variations of Vehicle Routing Problem (VRP. There are various algorithms that have been used to solve VRP problems. Some of them are Genetic Algorithm (GA, Tabu Search, and Adaptive GA with Artificial Bee Colony. GA can solve the problem within a shorter time, but it is vulnerable to get trapped in a local optimum. A strategy to reduce the probability of it is to make the GA adaptive. In this research, MDVRPTW is solved with GA. To reduce the probability of getting trapped in a local optimum, the GA parameters are made adaptive using Fuzzy Logic Controller (FLC. Based on the results of this research, using FLC on GA causes the average of the solution to be better than the solution produced using GA without FLC.

  10. A Mathematical Model for the Industrial Hazardous Waste Location-Routing Problem

    OpenAIRE

    Boyer, Omid; Sai Hong, Tang; Pedram, Ali; Mohd Yusuff, Rosnah Bt; Zulkifli, Norzima

    2013-01-01

    Technology progress is a cause of industrial hazardous wastes increasing in the whole world . Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be a result of location of undesirable facilities and also routing hazardous waste. In this paper a biobjective mixed integer programing model for location-routing industrial hazardous waste with two objectives is developed. First objective is total cost minimization including tra...

  11. Enhancing Solution Similarity in Multi-Objective Vehicle Routing Problems with Different Demand Periods

    OpenAIRE

    Murata, Tadahiko; Itai, Ryota

    2008-01-01

    In this chapter, we proposed a local search that can be used in a two-fold EMO algorithm for multiple-objective VRPs with different demands. The simulation results show that the proposed method have the fine effectiveness to enhance the similarity of obtained routes for vehicles. Although the local search slightly deteriorates the maximum duration, it improves the similarity of the routes that may decrease the possibility of getting lost the way of drivers. If drivers get lost their ways duri...

  12. A multi-level variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem

    DEFF Research Database (Denmark)

    Wen, Min; Krapper, Emil; Larsen, Jesper;

    things, predefined workdays, fixed starting time, maximum weekly working duration, break rule. The objective is to minimize the total delivery cost. The real-life case study is fi rst introduced and modelled as a mixed integer linear program. A multilevel variable neighborhood search heuristic is then......This paper addresses an integrated vehicle routing and driver scheduling problem arising at the largest fresh meat producer in Denmark. The problem consists of a one-week planning horizon, heterogeneous vehicles, and drivers with predefi ned work regulations. These regulations include, among other...... proposed for the problem. At the first level, the problem size is reduced through an aggregation procedure. At the second level, the aggregated weekly planning problem is decomposed into daily planning problems, each of which is solved by a variable neighborhood search. At the last level, the solution of...

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

    DEFF Research Database (Denmark)

    Larsen, Jesper

    2004-01-01

    interval denoted the time window. The objective is to determine routes for the vehicles that minimizes the accumulated cost (or distance) with respect to the above mentioned constraints. Currently the best approaches for determining optimal solutions are based on column generation and Branch...

  14. The Green Ship Routing and Scheduling Problem (GSRSP): A conceptual approach

    DEFF Research Database (Denmark)

    Kontovas, Christos A.

    2014-01-01

    Recent reviews of the literature on ship routing and scheduling note the increased attention to environmental issues. This is an area of paramount importance for international shipping and will be even more so in the future. This short communication is motivated by the increasing attention to...

  15. Paving a Way to Algebraic Word Problems Using a Nonalgebraic Route

    Science.gov (United States)

    Amit, Miriam; Klass-Tsirulnikov, Bella

    2005-01-01

    A three-stage model for algebraic word problem solving is developed in which students' understanding of the intrinsic logical structure of word problems is strengthened by connecting real-life problems and formal mathematics. (Contains 3 figure.)

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

    Science.gov (United States)

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

    2013-07-01

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

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

    Science.gov (United States)

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

    2015-12-01

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

  18. Modeling Arcs

    CERN Document Server

    Insepov, Zeke; Veitzer, Seth; Mahalingam, Sudhakar

    2011-01-01

    Although vacuum arcs were first identified over 110 years ago, they are not yet well understood. We have since developed a model of breakdown and gradient limits that tries to explain, in a self-consistent way: arc triggering, plasma initiation, plasma evolution, surface damage and gra- dient limits. We use simple PIC codes for modeling plasmas, molecular dynamics for modeling surface breakdown, and surface damage, and mesoscale surface thermodynamics and finite element electrostatic codes for to evaluate surface properties. Since any given experiment seems to have more variables than data points, we have tried to consider a wide variety of arcing (rf structures, e beam welding, laser ablation, etc.) to help constrain the problem, and concentrate on common mechanisms. While the mechanisms can be comparatively simple, modeling can be challenging.

  19. Arc Statistics

    CERN Document Server

    Meneghetti, M; Dahle, H; Limousin, M

    2013-01-01

    The existence of an arc statistics problem was at the center of a strong debate in the last fifteen years. With the aim to clarify if the optical depth for giant gravitational arcs by galaxy clusters in the so called concordance model is compatible with observations, several studies were carried out which helped to significantly improve our knowledge of strong lensing clusters, unveiling their extremely complex internal structure. In particular, the abundance and the frequency of strong lensing events like gravitational arcs turned out to be a potentially very powerful tool to trace the structure formation. However, given the limited size of observational and theoretical data-sets, the power of arc statistics as a cosmological tool has been only minimally exploited so far. On the other hand, the last years were characterized by significant advancements in the field, and several cluster surveys that are ongoing or planned for the near future seem to have the potential to make arc statistics a competitive cosmo...

  20. Flow Merging and Hub Route Optimization in Collaborative Transportation

    Directory of Open Access Journals (Sweden)

    Kerui Weng

    2014-01-01

    Full Text Available This paper studies the optimal hub routing problem of merged tasks in collaborative transportation. This problem allows all carriers’ transportation tasks to reach the destinations optionally passing through 0, 1, or 2 hubs within limited distance, while a cost discount on arcs in the hub route could be acquired after paying fixed charges. The problem arises in the application of logistics, postal services, airline transportation, and so forth. We formulate the problem as a mixed-integer programming model, and provide two heuristic approaches, respectively, based on Lagrangian relaxation and Benders decomposition. Computational experiments show that the algorithms work well.

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

    Directory of Open Access Journals (Sweden)

    Julia Rieck

    2013-05-01

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

  2. Solution Representations and Local Search for the bi-objective Inventory Routing Problem

    CERN Document Server

    Barthélemy, Thibaut; Sevaux, Marc

    2012-01-01

    The solution of the biobjective IRP is rather challenging, even for metaheuristics. We are still lacking a profound understanding of appropriate solution representations and effective neighborhood structures. Clearly, both the delivery volumes and the routing aspects of the alternatives need to be reflected in an encoding, and must be modified when searching by means of local search. Our work contributes to the better understanding of such solution representations. On the basis of an experimental investigation, the advantages and drawbacks of two encodings are studied and compared.

  3. Exactly solving the Split Pickup and Split Delivery Vehicle Routing Problem on a bike-sharing system

    OpenAIRE

    Casazza, Marco

    2016-01-01

    We propose an exact methodology to solve the Split Pickup and Split Delivery Vehicle Routing Problem arising in bike-sharing systems: a bike-sharing system is a public service in which bicycles are stored in rack stations and made available for shared use to individuals on a short term basis. However, during peak hours, flows along particular direction are registered, leading to high risk of empty racks in departure stations, and full racks at destination. One of the solutions chosen by many ...

  4. Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing

    OpenAIRE

    Ghoniem, Ahmed

    2007-01-01

    This dissertation addresses the development of enhanced formulations for minimax and mixed-integer programming models for certain industrial and logistical systems, along with the design and implementation of efficient algorithmic strategies. We first examine the general class of minimax mixed-integer 0-1 problems of the type that frequently arise in decomposition approaches and in a variety of location and scheduling problems. We conduct an extensive polyhedral analysis of this problem in o...

  5. Does Calculation or Word-Problem Instruction Provide a Stronger Route to Prealgebraic Knowledge?

    Science.gov (United States)

    Fuchs, Lynn S.; Powell, Sarah R.; Cirino, Paul T.; Schumacher, Robin F.; Marrin, Sarah; Hamlett, Carol L.; Fuchs, Douglas; Compton, Donald L.; Changas, Paul C.

    2014-01-01

    The focus of this study was connections among 3 aspects of mathematical cognition at 2nd grade: calculations, word problems, and prealgebraic knowledge. We extended the literature, which is dominated by correlational work, by examining whether intervention conducted on calculations or word problems contributes to improved performance in the other…

  6. Modelling Problem-Solving Situations into Number Theory Tasks: The Route towards Generalisation

    Science.gov (United States)

    Papadopoulos, Ioannis; Iatridou, Maria

    2010-01-01

    This paper examines the way two 10th graders cope with a non-standard generalisation problem that involves elementary concepts of number theory (more specifically linear Diophantine equations) in the geometrical context of a rectangle's area. Emphasis is given on how the students' past experience of problem solving (expressed through interplay…

  7. An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

    Directory of Open Access Journals (Sweden)

    Hao Yu

    2016-05-01

    Full Text Available Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

  8. An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems.

    Science.gov (United States)

    Yu, Hao; Solvang, Wei Deng

    2016-01-01

    Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment. PMID:27258293

  9. An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

    Science.gov (United States)

    Yu, Hao; Solvang, Wei Deng

    2016-01-01

    Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment. PMID:27258293

  10. 基于 ArcGIS 的传统村落最佳观景路线提取方法-以世界文化遗产:开平碉楼与村落为例%ArcGIS Based Scenic Route Design Of Traditional Vilages:Kaiping Watchtowers Case

    Institute of Scientific and Technical Information of China (English)

    阴劼; 杨雯; 孔中华

    2015-01-01

    传统村落具有规模较小、景观点数量众多且分散、景观层次丰富和生产与生活性路网发达的特点。采取微观视角下的观景路线选线方法,在已有路网基础上提取最佳观景路线对于传统村落景观的保护与利用具有重要意义。研究以世界文化遗产之开平碉楼与村落为例,探索基于 ArcGIS 的空间视域选线方法:首先,通过要素提取分析和对象特征分析,建立要素数据库、界定景观的观赏效果,以景观数量多且质量好的点为最佳观景点;其次,综合利用 ArcGIS 表面、三维、缓冲分析工具在生产与生活性道路上分析各观景点的景观数量和质量,判断最佳观景点;最后,利用网络分析工具选取最佳观景路线。最佳观景点及最佳观景路线的选择有利于优化村落游赏规划、调整遗产保护范围,为遗产区管理和遗产保护提供新的思路。%Traditional vil ages have rich landscape and road network. Scenic route design is significant to traditional vil age landscape preservation and utilization. The paper studies viewing route design with ArcGIS technology in world cultural heritage site-Kaiping watchtowers case. Firstly analysis of landscape qualities recommend the best viewing points, then ArcGIS technology is used to analyze the amount and quality of dif erent viewpoints, and final y the best scenic route is defined by network tools. The best scenic route design wil help improve vil age planning and heritage preservation.

  11. Lagrangian duality applied to the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

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

    2006-01-01

    shortest path subproblem. We present a stabilized cutting-plane algorithm within the framework of linear programming for solving the associated Lagrangian dual problem. This algorithm creates easier constrained shortest path subproblems because less negative cycles are introduced and it leads to faster...... 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....

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

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2014-06-01

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

  13. Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines

    Directory of Open Access Journals (Sweden)

    J. Díaz-Ramírez

    2012-08-01

    Full Text Available For the case of low-cost airlines, which are characterized by having a single fleet with a small number of airplanes, ina previous work, a heuristic algorithm (AFS-MRA was developed to simultaneously find the flight schedule and theaircraft routes subject to maintenance constraints. This work advances this algorithm by incorporating competition inthe planning process (MAFS-MRA.Within a time frame with a given demand data, competition is seen as a game with two players (one airline and all itscompetitors, where the strategies are all the potential origin-destinations that could be included in the flight schedule,and the payment matrix contains the objective function coefficients that depend on the market share and the routespreviously selected.Numerical experimentation was undertaken using real data for the case of two airlines that operate at TolucaInternational Airport in Mexico. It was found that, by considering competition, the occupation improves to 3% and thatthe number of flights required to satisfy the demand was reduced to 21%. Besides, the updating process reduces theprofit computation error in almost 80%, as compared to the real market behavior for the period under study.

  14. Combining Single (Mixed) Metric Approach and Genetic Algorithm for QoS Routing Problem

    Institute of Scientific and Technical Information of China (English)

    胡世余; 谢剑英

    2004-01-01

    A hybrid algorithm for the delay constrained least cost path problem is proposed through combination of single (mixed) metric approach and genetic algorithm. Compared with the known genetic algorithm for the same problem, the new algorithm adopts integral coding scheme and new genetic operator, which reduces the search space and improves the efficiency of genetic operation. Meanwhile, the single (mixed) approach accelerates the convergence speed. Simulation results indicate that the proposed algorithm can find near-optimal even optimal solutions within moderate numbers of generations.

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

    DEFF Research Database (Denmark)

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

    2008-01-01

    Solomon benchmarks where we were able to close several instances. The results show that applying subset-row inequalities in the master problem significantly improves the lower bound and, in many cases, makes it possible to prove optimality in the root node.   Subject classifications: transportation...

  16. The Complex Route to Success: Complex Problem-Solving Skills in the Prediction of University Success

    Science.gov (United States)

    Stadler, Matthias J.; Becker, Nicolas; Greiff, Samuel; Spinath, Frank M.

    2016-01-01

    Successful completion of a university degree is a complex matter. Based on considerations regarding the demands of acquiring a university degree, the aim of this paper was to investigate the utility of complex problem-solving (CPS) skills in the prediction of objective and subjective university success (SUS). The key finding of this study was that…

  17. Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state-space-time network representations

    OpenAIRE

    Mahmoudi, Monirehalsadat; Zhou, Xuesong

    2015-01-01

    Optimization of on-demand transportation systems and ride-sharing services involves solving a class of complex vehicle routing problems with pickup and delivery with time windows (VRPPDTW). This paper first proposes a new time-discretized multi-commodity network flow model for the VRPPDTW based on the integration of vehicles carrying states within space-time transportation networks, so as to allow a joint optimization of passenger-to-vehicle assignment and turn-by-turn routing in congested tr...

  18. Disjunctive cuts in a branch-and-price algorithm for the capacitated vehicle routing problem

    DEFF Research Database (Denmark)

    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 speci...... specific inequalities. Results also indicate that introducing the cuts leads to a smaller branch and bound tree and faster solution times overall.......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...

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

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens

    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...... approach we have embedded this column generation scheme in a branch-and-price algorithm. Computational experiments on a large set of test instances show promising results....

  20. The home health care routing and scheduling problem with interdependent services.

    Science.gov (United States)

    Mankowska, Dorota Slawa; Meisel, Frank; Bierwirth, Christian

    2014-03-01

    This paper presents a model for the daily planning of health care services carried out at patients' homes by staff members of a home care company. The planning takes into account individual service requirements of the patients, individual qualifications of the staff and possible interdependencies between different service operations. Interdependencies of services can include, for example, a temporal separation of two services as is required if drugs have to be administered a certain time before providing a meal. Other services like handling a disabled patient may require two staff members working together at a patient's home. The time preferences of patients are included in terms of given time windows. In this paper, we propose a planning approach for the described problem, which can be used for optimizing economical and service oriented measures of performance. A mathematical model formulation is proposed together with a powerful heuristic based on a sophisticated solution representation. PMID:23780750

  1. Peek Arc Consistency

    CERN Document Server

    Bodirsky, Manuel

    2008-01-01

    This paper studies peek arc consistency, a reasoning technique that extends the well-known arc consistency technique for constraint satisfaction. In contrast to other more costly extensions of arc consistency that have been studied in the literature, peek arc consistency requires only linear space and quadratic time and can be parallelized in a straightforward way such that it runs in linear time with a linear number of processors. We demonstrate that for various constraint languages, peek arc consistency gives a polynomial-time decision procedure for the constraint satisfaction problem. We also present an algebraic characterization of those constraint languages that can be solved by peek arc consistency, and study the robustness of the algorithm.

  2. A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment

    Directory of Open Access Journals (Sweden)

    Yanhui Li

    2013-01-01

    Full Text Available Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment.

  3. A hybrid genetic-simulated annealing algorithm for the location-inventory-routing problem considering returns under e-supply chain environment.

    Science.gov (United States)

    Li, Yanhui; Guo, Hao; Wang, Lin; Fu, Jing

    2013-01-01

    Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routing problem model with no quality defects returns. To solve this NP-hard problem, an effective hybrid genetic simulated annealing algorithm (HGSAA) is proposed. Results of numerical examples show that HGSAA outperforms GA on computing time, optimal solution, and computing stability. The proposed model is very useful to help managers make the right decisions under e-supply chain environment. PMID:24489489

  4. A Hybrid Genetic-Simulated Annealing Algorithm for the Location-Inventory-Routing Problem Considering Returns under E-Supply Chain Environment

    OpenAIRE

    Yanhui Li; Hao Guo; Lin Wang; Jing Fu

    2013-01-01

    Facility location, inventory control, and vehicle routes scheduling are critical and highly related problems in the design of logistics system for e-business. Meanwhile, the return ratio in Internet sales was significantly higher than in the traditional business. Many of returned merchandise have no quality defects, which can reenter sales channels just after a simple repackaging process. Focusing on the existing problem in e-commerce logistics system, we formulate a location-inventory-routin...

  5. Solving a Closed-Loop Location-Inventory-Routing Problem with Mixed Quality Defects Returns in E-Commerce by Hybrid Ant Colony Optimization Algorithm

    OpenAIRE

    Shuai Deng; Yanhui Li; Hao Guo; Bailing Liu

    2016-01-01

    This paper presents a closed-loop location-inventory-routing problem model considering both quality defect returns and nondefect returns in e-commerce supply chain system. The objective is to minimize the total cost produced in both forward and reverse logistics networks. We propose a combined optimization algorithm named hybrid ant colony optimization algorithm (HACO) to address this model that is an NP-hard problem. Our experimental results show that the proposed HACO is considerably effici...

  6. Modeling and Solving the Liner Shipping Service Selection Problem

    DEFF Research Database (Denmark)

    Karsten, Christian Vad; Balakrishnan, Anant

    We address a tactical planning problem, the Liner Shipping Service Selection Problem (LSSSP), facing container shipping companies. Given estimated demand between various ports, the LSSSP entails selecting the best subset of non-simple cyclic sailing routes from a given pool of candidate routes, and...... transporting as much demand as possible over the chosen routes. Since most containers are sent directly or transshipped at most twice in current liner shipping networks, we impose limits on the number of transshipments for each container. The objective is to maximize the net revenue, i.e., revenue from demand...... served less shipping costs. We propose a new hop-constrained multi-commodity arc flow model for the LSSSP that is based on an augmented network containing, for each candidate route, an arc (representing a sub-path) between every pair of ports that the route visits. This sub-path construct permits us to...

  7. Road and Street Centerlines - MO 2011 October MoDOT Roads - Routes (GDB)

    Data.gov (United States)

    NSGIC GIS Inventory (aka Ramona) — Routes represent a single linear feature, such as a city street or highway. Routes are linear features composed of one or more arcs or parts of an arc; for example,...

  8. Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

    Science.gov (United States)

    Sun, Yan; Lang, Maoxiang; Wang, Danzhu

    2016-01-01

    The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

  9. Bi-Objective Modelling for Hazardous Materials Road-Rail Multimodal Routing Problem with Railway Schedule-Based Space-Time Constraints.

    Science.gov (United States)

    Sun, Yan; Lang, Maoxiang; Wang, Danzhu

    2016-01-01

    The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing-Tianjin-Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

  10. Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

    Science.gov (United States)

    Ghezavati, V. R.; Beigi, M.

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

  11. A Pseudo-Parallel Genetic Algorithm Integrating Simulated Annealing for Stochastic Location-Inventory-Routing Problem with Consideration of Returns in E-Commerce

    Directory of Open Access Journals (Sweden)

    Bailing Liu

    2015-01-01

    Full Text Available Facility location, inventory control, and vehicle routes scheduling are three key issues to be settled in the design of logistics system for e-commerce. Due to the online shopping features of e-commerce, customer returns are becoming much more than traditional commerce. This paper studies a three-phase supply chain distribution system consisting of one supplier, a set of retailers, and a single type of product with continuous review (Q, r inventory policy. We formulate a stochastic location-inventory-routing problem (LIRP model with no quality defects returns. To solve the NP-hand problem, a pseudo-parallel genetic algorithm integrating simulated annealing (PPGASA is proposed. The computational results show that PPGASA outperforms GA on optimal solution, computing time, and computing stability.

  12. Arc-preserving subsequences of arc-annotated sequences

    CERN Document Server

    Popov, Vladimir Yu

    2011-01-01

    Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures. We consider the longest arc preserving common subsequence problem. In particular, we show that the decision version of the 1-{\\sc fragment LAPCS(crossing,chain)} and the decision version of the 0-{\\sc diagonal LAPCS(crossing,chain)} are {\\bf NP}-complete for some fixed alphabet $\\Sigma$ such that $|\\Sigma| = 2$. Also we show that if $|\\Sigma| = 1$, then the decision version of the 1-{\\sc fragment LAPCS(unlimited, plain)} and the decision version of the 0-{\\sc diagonal LAPCS(unlimited, plain)} are {\\bf NP}-complete.

  13. Study on vehicle routing problem based on heuristic ant colony optimization%基于启发式蚁群算法的VRP问题研究

    Institute of Scientific and Technical Information of China (English)

    刘晓勇; 付辉

    2011-01-01

    When Ant Colony Optimization algorithm (ACO) is applied to vehicle routing problem, it always spends much time and has worse solutions.This paper uses ACO based on a heuristic method for vehicle routing problem.This heuristic method combines distance matrix with saving route matrix to assign initial pheromone matrix.Three benchmark datasets are chosen to verify performance of the new algorithm. Experiments show that ant colony optimization based on heuristic information has better solution and spends less time.%针对蚁群算法求解VRP问题时收敛速度慢,求解质量不高的缺点,把城市和仓库间的距离矩阵和路径节约矩阵信息融入到初始信息素矩阵中作为启发式信息引入到蚁群算法中用于求解有容量限制的车辆路径规划问题(CVRP),在三个基准数据集上的实验研究表明,基于启发式信息的蚁群算法与基本蚁群算法相比能够以较快的速度收敛到较好的解.

  14. Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols

    CERN Document Server

    Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A

    2011-01-01

    In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In all of the above mentioned situations, routing overhead and delay generated by the chosen protocols can exactly be calculated from our modeled equations. Finally, we analyze the performance of selected routing protocols using our proposed framework in NS-2 by considering different performance parameters; Route REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) with respect to varyi...

  15. Single-Arc IMRT?

    International Nuclear Information System (INIS)

    The idea of delivering intensity-modulated radiation therapy (IMRT) with a multileaf collimator in a continuous dynamic mode during a single rotation of the gantry has recently gained momentum both in research and industry. In this note we investigate the potential of this Single-Arc IMRT technique at a conceptual level. We consider the original theoretical example case from Brahme et al that got the field of IMRT started. Using analytical methods, we derive deliverable intensity 'landscapes' for Single-Arc as well as standard IMRT and Tomotherapy. We find that Tomotherapy provides the greatest flexibility in shaping intensity landscapes and that it allows one to deliver IMRT in a way that comes close to the ideal case in the transverse plane. Single-Arc and standard IMRT make compromises in different areas. Only in relatively simple cases that do not require substantial intensity modulation will Single-Arc be dosimetrically comparable to Tomotherapy. Compared with standard IMRT, Single-Arc could be dosimetrically superior in certain cases if one is willing to accept the spreading of low dose values over large volumes of normal tissue. In terms of treatment planning, Single-Arc poses a more challenging optimization problem than Tomotherapy or standard IMRT. We conclude that Single-Arc holds potential as an efficient IMRT technique especially for relatively simple cases. In very complex cases, Single-Arc may unduly compromise the quality of the dose distribution, if one tries to keep the treatment time below 2 min or so. As with all IMRT techniques, it is important to explore the tradeoff between plan quality and the efficiency of its delivery carefully for each individual case. (note)

  16. Routing Discovery Algorithm Using Parallel Chase Packet

    OpenAIRE

    Amera Al-Ameri; Muneer Bani Yassein; Khamayseh, Yaser M.

    2013-01-01

    On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been...

  17. 基于ACS-GA算法的车辆路径问题研究%An ACS-GA Hybrid Optimization Method to Solve Vehicle Routing Problem

    Institute of Scientific and Technical Information of China (English)

    赵婉忻; 曲仕茹

    2011-01-01

    Vehicle routing problem is an important research area in intelligent transportation and business logistics. Planning the vehicle routes reasonably, reducing the delivery mileage and minimizing the cost of logistic distribution are great significance to increase economic efficiency. The paper focuses on vehicle routing problem with time windows in logistic distribution and establishes an improved mathematical model in which the delivery time and delivery distance is shortest. A novel hybrid optimization method integrating ant colony system with genetic algorithm ( ACS - GA) is presented. The initial solution is obtained by ant colony system. A genetic algorithm is used to improve the performance of ACS by reproduction, crossover and mutation operations. The ACS - GA hybrid optimization method can overcome the premature phenomenon and enhance the global search ability. Based on the benchmark datasets of vehicle routing problem with time windows, the experimental results demonstrate that the proposed method has a better ability to search the global optimal solution than other optimization methods.%物流配送车辆路径问题是智能交通和商业物流领域中一个重要研究方面.合理规划车辆的行驶路线,减少配送里程,降低物流成本,对提高经济效益具有重要意义.重点分析了带时间窗的物流配送车辆路径问题,建立了兼顾配送时间与配送距离最短的改进数学模型.提出了基于蚁群系统算法和遗传算法相融合的混合算法.该算法利用蚁群系统算法得到初始解,运用遗传算法中复制、交叉、变异操作对解的种群多样性进行扩充,克服了蚁群系统算法的早熟现象,增强了算法的全局搜索能力.基于标准数据集的实验结果表明,该算法与其他优化方法相比较,具有较好的搜索车辆路径最优解的能力.

  18. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

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

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand...... 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...

  19. A Two-Stage Simulated Annealing Algorithm for the Many-to-Many Milk-Run Routing Problem with Pipeline Inventory Cost

    Directory of Open Access Journals (Sweden)

    Yu Lin

    2015-01-01

    Full Text Available In recent years, logistics systems with multiple suppliers and plants in neighboring regions have been flourishing worldwide. However, high logistics costs remain a problem for such systems due to lack of information sharing and cooperation. This paper proposes an extended mathematical model that minimizes transportation and pipeline inventory costs via the many-to-many Milk-run routing mode. Because the problem is NP hard, a two-stage heuristic algorithm is developed by comprehensively considering its characteristics. More specifically, an initial satisfactory solution is generated in the first stage through a greedy heuristic algorithm to minimize the total number of vehicle service nodes and the best insertion heuristic algorithm to determine each vehicle’s route. Then, a simulated annealing algorithm (SA with limited search scope is used to improve the initial satisfactory solution. Thirty numerical examples are employed to test the proposed algorithms. The experiment results demonstrate the effectiveness of this algorithm. Further, the superiority of the many-to-many transportation mode over other modes is demonstrated via two case studies.

  20. PNW River Reach Files -- 1:100k LLID Routed Streams (routes)

    Data.gov (United States)

    Pacific States Marine Fisheries Commission — This feature class includes the ROUTE features from the 2001 version of the PNW River Reach files Arc/INFO coverage. Separate, companion feature classes are also...

  1. FASTER MUSE CSP ARC CONSISTENCY ALGORITHMS

    OpenAIRE

    Harper, Mary P.; White, Christopher M.; Helzerman, Randall A.; Hockema, Stephen A.

    1997-01-01

    MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem) [5, 61 is an extension to the constraint satisfaction problem (CSP) which is especially useful for problems that segment into riultiple instances of CSP that share variables. In Belzerman and Harper [6], the concepts of MUSE node, arc, and path consistency were defined and algorithms for MUSE arc consistency, MUSE AC-1, and MUSE path consistency were developed. MUSE AC-1 is similar to the CSP arc consistency algorithm AC-4 [ l j ] ...

  2. 基于模糊期望值模型的车辆路径问题%Vehicle routing problem based on fuzzy expected value model

    Institute of Scientific and Technical Information of China (English)

    王连锋; 宋建社; 杨正磊; 曹继平

    2012-01-01

    Aiming at the vehicle routing problem with fuzzy demands, the probability of vehicle service failure was analyzed based on fuzzy credibility theory, and a fuzzy expected value model was formulated. A parallel particle swarm optimization with double layers tabu search was proposed for routes optimization. In this algorithm, two different types of tabu search space were inserted, and two neighborhood arithmetic operators were designed by using new iterative formula and roulette strategy. The effectiveness of proposed method was verified by simulation contrast tests.%针对模糊需求的车辆路径问题,基于模糊可信性理论对车辆服务失败事件进行可能性分析,建立了一个模糊期望值模型,提出一种带双层禁忌搜索的并行粒子群算法。该算法引入两种不同的禁忌空间,采用新的粒子迭代公式,并利用轮盘赌策略设计了两类邻域算子。通过仿真对比实验表明了该算法的有效性。

  3. 铁路选线设计中常见问题分析%Analysis on Common Problems in Railway Route Selection Design

    Institute of Scientific and Technical Information of China (English)

    李永贵

    2014-01-01

    铁路选线的好坏,决定了项目工程的难易程度、工程投资的大小、施工和运营的安全,所以铁路选线是铁路项目设计中最基本、最重要的工作,是影响全局的总体性工作。在中国西南地区,山高谷深、地形地质条件复杂,在此区域修建铁路,工程十分艰巨,更有必要做好铁路选线。笔者经过多年在中国西南山区铁路选线设计工作的经验积累,将铁路选线设计中遇到的环境选线、地质选线、紧坡地段定线、竖曲线与平面圆曲线重合、坡度代数差、坡度使用等问题在文中分别进行了列举分析。铁路选线应根据规范、规定,结合项目沿线的环境和地形地质条件、工程条件、规划及人文等因数,经过多方案的比选,来确定最优的线路方案。%The route selection of railway determines the complexity of project engineering, the amount of project invest-ment as well as the safety of construction and operation, therefore, route selection is the most fundamental and signifi-cant work of project design and it's also a general task that influences the whole project. As Southwest China orea fea-tures high mountains, deep valleys and complex terrains and geological conditions, it's very difficult to build railways here. It is necessary to railway line. With years of experiences in route selection of railways in mountainous regions of Southwest China, problems encountered in selection of railway route are inevitable in the project of railway environmental route selection, geological line selection, tight slope segment alignment, vertical curve and plane circular curve coin-cide, difference in gradients, slope utilization. Route selection should be compliant with regulations and rules to deter-mine the optimal scheme of line,combining to the project along the terrain and geological conditions, construction condi-tions, project planning and cultural factors.

  4. Research of Vehicle Routing Problem Based on Fuzzy Time Windows%基于模糊时间窗的车辆调度问题研究

    Institute of Scientific and Technical Information of China (English)

    王旭坪; 张凯; 胡祥培

    2011-01-01

    An increasing number of enterprises are focusing on the vehicle routing problems (VRP) because of expanded logistics support. VRP belongs to typical NP-Hard problems. An enterprise typically spends 25% to 30% of total expenses on vehicle routing problems because they can affect economic efficiency and customer benefits. Therefore, it is important to research VRP and optimize logistics activities.Exiting literature has focused on the vehicle routing problem with hard time and soft time windows. In the VRP with hard time window, the service time must fall within each customer' s time window. Due to the limitation of hard time window and the number of available vehicles, it is often unable to find feasible schedules. To deal with issues pertaining to the violation of time window, researchers have proposed the concept of "soft time window". In the VRP with soft time window, a penalty cost is added once a time window is violated, and the penalty cost is often assumed to be linear with the degree of violation. In some cases, violation of time window does not directly incur any penalty cost, although the satisfaction levels of customers may drop and lead to benefit loss in the long term. In many realistic applications, the hard time window or soft time window does represent customer requirements very well. Under these circumstances, the fuzzy processing of time window can reflect customers' requirements well and truly. Until now, few studies have addressed VRP-with fuzzy time window when the number of vehicle is limited. There are many real-life situations where the number of vehicle is limited, such as logistics distribution, post express and so on. Thus, this paper proposes and solves vehicle routing problems based on the fuzzy time window and a definite number of vehicles. In this paper, a fuzzy membership function is used to characterize customers' satisfaction levels by analyzing customers' practical requirements of the service time window.A multi-objective model

  5. Using Genetic Algorithm For Winter Maintenance Operations: Multi Depot K-Chinese Postman Problem

    Directory of Open Access Journals (Sweden)

    İbrahim Zeki Akyurt

    2015-02-01

    Full Text Available In this study, the assignment and routing problem of one of Istanbul’s winter maintenance activities, salt pouring, was scrutinized. The starting point of the study considers the high cost of winter maintenance work, a shrinking assigned budget, high numbers of vehicles and streets to service that the increase in difficulty to solve the problem due to their high numbers. In this respect, the problem was modeled as multi depot k-Chinese postman problem, a type of arc routing problem. This mathematical model was solved by genetic algorithm. For comparison, the current solution, Clarke and Wright Algorithm and Sweep Algorithm were used.

  6. Multi-objective Location-routing Problem in Emergency Logistics as Time Varies%时变条件下应急物流多目标LRP研究

    Institute of Scientific and Technical Information of China (English)

    赵佳虹

    2012-01-01

    The multi-objective location-routing problem in emergency logistics aims to decide where to open emergency logistics centers, how much capacity and how to route different types of emergency relief between relief collection nodes, emergency logistics centers and relief demand nodes. Based on the current literatures, considered the diversity of relief demands as time varies as well as the diversity of relief types and emergency logistics centers' minimize treatment amount requirements, taken the route capacity and the emergency logistics centers' capacity with surplus degree as constraints and taken the minimum time and cost as optimal objectives, a multi-objective 0-1 mixed-integer linear programming model for this problem was proposed. Adopted percentage normalization technique to normalize the objective units, the algorithm was designed to solve this model. Through an experimental example, a comparing analysis of the time and cost between this 0-1 mixed-integer linear programming model and the exiting one was conducted. The results proved that the location-routing scheme got from this new model could decrease the cost and time when comparing with the exiting model, and then, this new model would be more in line with the practice of emergency logistics management.%应急物流系统的多目标选址-路径问题主要旨在解决应急物流中心的选址问题、物流中心处理能力的设定问题和各类应急物资车辆运输路径的选择问题.基于既有研究成果,主要考虑时变条件下物资需求的多样性特点,兼顾应急物资类型的多样性特点和物流中心最小处理量要求,以运输路线能力和含有富余度系数的物流中心能力为约束条件,以时间和费用最小化为优化目标,建立了更为完善的多目标0-1混合整数线性规划模型.采用百分比无量纲化技术消除优化目标的量纲,并设计了基于目标规划的模型求解算法.通过算例试验,对比分析了0-1混合整

  7. A algorithm for the Vehicle Problem

    Directory of Open Access Journals (Sweden)

    Aziz Ezzatneshan

    2010-09-01

    Full Text Available In this paper, we propose a hybrid ACO algorithm for solving vehicle routing problem (VRP heuristically in combination with an exact In the basic VRP, geographically scattered customers of known demand are supplied from a single depot by a fleet of identically capacitated vehicles. The intuition of the proposed algorithm is that nodes which are near to each other will probably belong to the same branch of the minimum spanning tree of the problem graph and thus will probably belong to the same route in VRP. Given a clustering of client nodes, the solution is to find a route in these clusters by using ACO with a modified version of transition rule of the ants. At the end of each iteration, ACO tries to improve the quality of solutions by using a local search algorithm, and update the associated weights of the graph arcs.

  8. Route optimization model for strike aircraft

    OpenAIRE

    Lee, Steve H. K.

    1995-01-01

    A model is designed and implemented to construct a 'flyable,' least- risk route for strike aircraft from takeoff to target, through enemy radars, in a defined area of operations. A network is fust constructed by discretizing the airspace into a three-dimensional grid of nodes and then connecting adjacent nodes with arcs. A shortest-path model in this network is then constructed with arc lengths that are a function of the probability of detection by radars monitoring t...

  9. Arc saw development report

    International Nuclear Information System (INIS)

    The arc saw is one of the key components of the Contaminated Equipment Volume Reduction (CEVR) Program. This report describes the progress of the arc saw from its inception to its current developmental status. History of the arc saw and early contributors are discussed. Particular features of the arc saw and their advantages for CEVR are detailed. Development of the arc saw including theory of operation, pertinent experimental results, plans for the large arc saw and advanced control systems are covered. Associated topics such as potential applications for the arc saw and other arc saw installations in the world is also touched upon

  10. Accident Emergency Response And Routing Software (AERARS using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Naveen Ramachandran,

    2011-07-01

    Full Text Available AERARS is a response and routing software for accident emergency requirement. A method has been proposed in this project for using a genetic algorithm to find the shortest route between a source and adestination. It make use of genetic algorithms ability to search the opt solution from the population helping to solve spatially addressed problem. The numbers of accident spots are plotted in ArcGISenvironment and ten major accident spots are identified. The software package is designed with closest facility estimation and shortest route generation along with other basic software facilities in Visual Basic environment. Genetic algorithm provided a great optimality to the solutions. The closest facility tool helps to estimate the nearest hospital, ambulance, police station and fire station. The shortest route estimation tool generates shortest path between a locations to the hospital or ambulance spot. The various risk zonesare assessed and more safety measures can be taken to reduce the frequency of accident. The software efficiency can be further increased by incorporating GPS and satellite technology.

  11. Blind Alley Aware ACO Routing Algorithm

    Science.gov (United States)

    Yoshikawa, Masaya; Otani, Kazuo

    2010-10-01

    The routing problem is applied to various engineering fields. Many researchers study this problem. In this paper, we propose a new routing algorithm which is based on Ant Colony Optimization. The proposed algorithm introduces the tabu search mechanism to escape the blind alley. Thus, the proposed algorithm enables to find the shortest route, even if the map data contains the blind alley. Experiments using map data prove the effectiveness in comparison with Dijkstra algorithm which is the most popular conventional routing algorithm.

  12. Metaheuristics applied to vehicle routing. A case study. Part 3: Genetic Clustering and Tabu Routing

    Directory of Open Access Journals (Sweden)

    Guillermo González Vargas

    2010-04-01

    Full Text Available This paper presents hybrid meta-heuristics called Genetic Clustering and Tabu Routing for solving a vehicle routing problem using two phases methodology: first clustering and then routing. The results are compared with those obtained using meta-heuristics and heuristic techniques presented in previous papers. Genetic clustering and Tabu routing average results were 23% and 9.1% better, respectively.

  13. Advances in optimal routing through computer networks

    Science.gov (United States)

    Paz, I. M.

    1977-01-01

    The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

  14. Generalized hyperfocused arcs in $PG(2,p)$

    OpenAIRE

    Blokhuis, A Aart; Marino, G.; Mazzocca, F.

    2013-01-01

    A {\\em generalized hyperfocused arc} $\\mathcal H $ in $PG(2,q)$ is an arc of size $k$ with the property that the $k(k-1)/2$ secants can be blocked by a set of $k-1$ points not belonging to the arc. We show that if $q$ is a prime and $\\mathcal H$ is a generalized hyperfocused arc of size $k$, then $k=1,2$ or 4. Interestingly, this problem is also related to the (strong) cylinder conjecture [Ball S.: The polynomial method in Galois geometries, in Current research topics in Galois geometry, Chap...

  15. SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations

    OpenAIRE

    Qian, Shiyou; Cao, Jian; Le Mouël, Frédéric; Sahel, Issam; Li, Minglu

    2015-01-01

    Recommending routes for a group of competing taxi drivers is almost untouched in most route recommender systems. For this kind of problem, recommendation fairness and driving efficiency are two fundamental aspects. In the paper, we propose SCRAM, a sharing considered route assignment mechanism for fair taxi route recommendations. SCRAM aims to provide recommendation fairness for a group of competing taxi drivers, without sacrificing driving efficiency. By designing a concise route assignment ...

  16. Linear Network Fractional Routing

    Directory of Open Access Journals (Sweden)

    S.ASOKAN,

    2011-07-01

    Full Text Available A Network is a finite directed acyclic graph with source messages from a fixed alphabet and message demands at sink nodes. Linear Programming is an algorithm design method. It can be used whenthe solution to a problem can be viewed as the result of a sequence of decisions. The Linear Programming model for the network problem where in every variable has a value one or zero. The problem is todetermine a method of transmitting the messages through the network such that all sink demands are satisfied. We will prove fractional routing capacity for some solvable network using Linear Programmingmodel.

  17. Heritage Route

    Czech Academy of Sciences Publication Activity Database

    Chlustiková, Katarína; Válová, Katarína

    2013. [Kulturstraßen als Konzept. 20 Jahre Straße der Romanik. 14.11.2013-16.11.2013, Merseburg] Grant ostatní: Culture Programme of European Commission(SI) CU7-MULT7/2010-0653/001-001 Source of funding: R - rámcový projekt EK Keywords : cultural routes * Romanesque * heritage Subject RIV: AC - Archeology, Anthropology, Ethnology

  18. A Privacy-Preserving Prediction Method for Human Travel Routes

    Directory of Open Access Journals (Sweden)

    Wen-Chen Hu

    2014-12-01

    Full Text Available This paper proposes a kind of location-based research, human travel route prediction, which is to predict the track of a subject's future movements. The proposed method works as follows. The mobile user sends his/her current route along with several dummy routes to the server by using a 3D route matrix, which encodes a set of routes. The server restores the routes from the 3D matrix and matches the restored routes to the saved routes. The predicted route is found as the trunk of the tree, which is built by superimposing the matching results. The server then sends the predicted routes back to the user, who will apply the predicted route to a real-world problem such as traffic control and planning. Preliminary experimental results show the proposed method successfully predicts human travel routes based on current and previous routes. User privacy is also rigorously protected by using a simple method of dummy routes.

  19. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

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

    2007-01-01

    classify dynamic vehicle routing systems. Methods for evaluation of the performance of algorithms that solve on-line routing problems are discussed and we list some of the most important issues to include in the system objective. Finally, we provide a three-echelon classification of dynamic vehicle routing...... systems based on their degree of dynamism and the system objective....

  20. Routing Discovery Algorithm Using Parallel Chase Packet

    Directory of Open Access Journals (Sweden)

    Amera Al-Ameri

    2013-04-01

    Full Text Available On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C. Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.

  1. Inventory Routing Problem in VMI & TPL Supply Chain under Centralized Control%集中控制VMI&TPL模式下的库存运输集成问题

    Institute of Scientific and Technical Information of China (English)

    汤中明

    2013-01-01

    A supply chain composed of many vendors, one third-party logistics (TPL) , and one manufacturer is addressed. It assumes that, in such a supply chain, it integrates vendor-managed inventory ( VMI) and TPL. For such a supply chain, inventory routing problem under centralized control is studied. How to make the decision of replenishing and vehicle routing plan for suppliers and TPL is a challenging problem. Based on rolling plan period, a new inventory routing model is developed. With the NP-complete nature of the inventory routing problem, a four-step heuristic algorithm based on simulated annealing is presented. The feasibility and effectiveness of the proposed heuristic algorithm is testified by a numerical example.%以“多供应商,单TPL,单制造商”供应链网络为研究环境,研究了集中控制VMI&TPL模式下的库存运输集成优化问题,旨在为供应商和TPL提供补货决策和车辆路线计划.基于滚动计划期,构建了库存运输集成计划模型.鉴于该模型问题是一个NPC问题,提出了基于模拟退火遗传算法的四步骤启发式算法.算例分析结果表明该启发式算法是有效可行的.

  2. The Abundance of Large Arcs From CLASH

    Science.gov (United States)

    Xu, Bingxiao; Postman, Marc; Meneghetti, Massimo; Coe, Dan A.; Clash Team

    2015-01-01

    We have developed an automated arc-finding algorithm to perform a rigorous comparison of the observed and simulated abundance of large lensed background galaxies (a.k.a arcs). We use images from the CLASH program to derive our observed arc abundance. Simulated CLASH images are created by performing ray tracing through mock clusters generated by the N-body simulation calibrated tool -- MOKA, and N-body/hydrodynamic simulations -- MUSIC, over the same mass and redshift range as the CLASH X-ray selected sample. We derive a lensing efficiency of 15 ± 3 arcs per cluster for the X-ray selected CLASH sample and 4 ± 2 arcs per cluster for the simulated sample. The marginally significant difference (3.0 σ) between the results for the observations and the simulations can be explained by the systematically smaller area with magnification larger than 3 (by a factor of ˜4) in both MOKA and MUSIC mass models relative to those derived from the CLASH data. Accounting for this difference brings the observed and simulated arc statistics into full agreement. We find that the source redshift distribution does not have big impact on the arc abundance but the arc abundance is very sensitive to the concentration of the dark matter halos. Our results suggest that the solution to the "arc statistics problem" lies primarily in matching the cluster dark matter distribution.

  3. Vehicle routing and the value of postponement

    OpenAIRE

    Pang, G.; L Muyldermans

    2013-01-01

    We study capacitated vehicle routing problems (CVRPs) in which the client demands occur over time and the collector or distributor performing the service can decide when to visit the clients. It has been reported in the literature that postponement of collection (or delivery) services may decrease the overall routing cost or distance. We investigate this issue in greater detail and report on experiments in different routing settings to uncover the impact of postponement on routing efficiency....

  4. Generalized Maneuvers in Route Planning

    CERN Document Server

    Hlineny, Petr

    2011-01-01

    We study an important practical aspect of the route planning problem in real-world road networks -- maneuvers. Informally, maneuvers are walks that might either decrease or increase the weight of a route by additional costs. One can model a wide range of route restrictions or traffic regulations by maneuvers. For instance turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. A new approach to tackle maneuvers during route planning queries without prior adjustments of the underlying road network graph is presented. First, a generic maneuver is defined so that we are able to model almost arbitrarily complex route restriction. In the rest we show how to modify Dijkstra's algorithm to respect maneuvers together with a formal proof of correctness and a complexity analysis of our algorithm.

  5. Rotating arc spark plug

    Science.gov (United States)

    Whealton, John H.; Tsai, Chin-Chi

    2003-05-27

    A spark plug device includes a structure for modification of an arc, the modification including arc rotation. The spark plug can be used in a combustion engine to reduce emissions and/or improve fuel economy. A method for operating a spark plug and a combustion engine having the spark plug device includes the step of modifying an arc, the modifying including rotating the arc.

  6. Sensor Control of Robot Arc Welding

    Science.gov (United States)

    Sias, F. R., Jr.

    1983-01-01

    The potential for using computer vision as sensory feedback for robot gas-tungsten arc welding is investigated. The basic parameters that must be controlled while directing the movement of an arc welding torch are defined. The actions of a human welder are examined to aid in determining the sensory information that would permit a robot to make reproducible high strength welds. Special constraints imposed by both robot hardware and software are considered. Several sensory modalities that would potentially improve weld quality are examined. Special emphasis is directed to the use of computer vision for controlling gas-tungsten arc welding. Vendors of available automated seam tracking arc welding systems and of computer vision systems are surveyed. An assessment is made of the state of the art and the problems that must be solved in order to apply computer vision to robot controlled arc welding on the Space Shuttle Main Engine.

  7. CLASSIFICATION OF FOREST ROADS AND DETERMINATION OF ROUTE USING GEOGRAPHIC INFORMATION SYSTEM

    Directory of Open Access Journals (Sweden)

    Fabrício Silva

    2016-04-01

    Full Text Available ABSTRACT Geographic Information System (GIS is an indispensable software tool in forest planning. In forestry transportation, GIS can manage the data on the road network and solve some problems in transportation, such as route planning. Therefore, the aim of this study was to determine the pattern of the road network and define transport routes using GIS technology. The present research was conducted in a forestry company in the state of Minas Gerais, Brazil. The criteria used to classify the pattern of forest roads were horizontal and vertical geometry, and pavement type. In order to determine transport routes, a data Analysis Model Network was created in ArcGIS using an Extension Network Analyst, allowing finding a route shorter in distance and faster. The results showed a predominance of horizontal geometry classes average (3 and bad (4, indicating presence of winding roads. In the case of vertical geometry criterion, the class of highly mountainous relief (4 possessed the greatest extent of roads. Regarding the type of pavement, the occurrence of secondary coating was higher (75%, followed by primary coating (20% and asphalt pavement (5%. The best route was the one that allowed the transport vehicle travel in a higher specific speed as a function of road pattern found in the study.

  8. 求解带时间窗车辆路径问题的混合智能算法%Hybrid intelligent algorithm for vehicle routing problem with time windows

    Institute of Scientific and Technical Information of China (English)

    孙小军

    2015-01-01

    Based on cuckoo search algorithm and partheno-genetic algorithm,a hybrid intelligent algorithm is designed to solve the vehicle routing problem with time windows.Firstly,this algorithm analyzes the locations of customers by clustering method,and then,forms the optimal route for the divided areas.This hybrid intelligent algorithm not only improves the operation of the cuckoo search algorithm,which is to randomly change the whole location of the cuckoo nest when the cuckoo eggs are found by the nest's master,but also accelerates the search speed of optimal delivery route by using partheno-genetic algorithm.In addition,the computational complexities of this hybrid intelligent algorithm and cuckoo search algorithm are analyzed and compared.Finally,according to test results under ISO standard test collection-Benchmark Problems,it is verified that this hybrid intelligent algorithm is an effective method in solving the vehicle routing problem with time windows.%基于布谷鸟搜索算法和单亲遗传算法,设计了一种求解带时间窗车辆路径问题的混合智能算法。该算法首先对客户位置进行聚类分析,然后再进行各区域的路径优化。混合智能算法不仅改进了布谷鸟搜索算法中当鸟卵被鸟窝主人发现后需要随机改变整个鸟窝位置的操作,同时引入的单亲遗传算法加快了最优配送路线的搜索速度。分析和比较了混合智能算法与布谷鸟搜索算法的计算复杂度。最后采用国际通用标准测试集 Benchmark Problems 进行测试。结果显示,混合智能算法是求解带时间窗车辆路径问题的一种有效算法。

  9. Allocation of solid waste collection bins and route optimisation using geographical information system: A case study of Dhanbad City, India.

    Science.gov (United States)

    Khan, D; Samadder, S R

    2016-07-01

    Collection of municipal solid waste is one of the most important elements of municipal waste management and requires maximum fund allocated for waste management. The cost of collection and transportation can be reduced in comparison with the present scenario if the solid waste collection bins are located at suitable places so that the collection routes become minimum. This study presents a suitable solid waste collection bin allocation method at appropriate places with uniform distance and easily accessible location so that the collection vehicle routes become minimum for the city Dhanbad, India. The network analyst tool set available in ArcGIS was used to find the optimised route for solid waste collection considering all the required parameters for solid waste collection efficiently. These parameters include the positions of solid waste collection bins, the road network, the population density, waste collection schedules, truck capacities and their characteristics. The present study also demonstrates the significant cost reductions that can be obtained compared with the current practices in the study area. The vehicle routing problem solver tool of ArcGIS was used to identify the cost-effective scenario for waste collection, to estimate its running costs and to simulate its application considering both travel time and travel distance simultaneously. PMID:27207771

  10. Stochastic vehicle routing: from theory to practice

    OpenAIRE

    Weyland, Dennis; Gambardella, Luca Maria; Montemanni, Roberto

    2013-01-01

    In this thesis we discuss practical and theoretical aspects of various stochastic vehicle routing problems. These are combinatorial optimization problems related to the field of transportation and logistics in which input data is (partially) represented in a stochastic way. More in detail, we focus on two-stage stochastic vehicle routing problems and in particular on so-called a priori optimization problems. The results are divided into a theoretical part and a practical part. In fact, the ...

  11. ACO based routing for MANETs

    CERN Document Server

    Arif, Mohammad

    2012-01-01

    Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It dynamically forms a temporary network without using any pre existing network infrastructure or centralized administration i.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to other nodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiences alterations during deployment. The biggest challenge in MANETs is to find a path between communicating nodes. The considerations of the MANET environment and the nature of the mobile nodes create further complications which results in the need to develop special routing algorithms to meet these challenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in other problem domains, has been applied to the MANET routing problem as it forms a good fit to the problem. In ant societies the activities of the individuals are not regulated by any explicit form of centralized control but ar...

  12. Routes visualization: Automated placement of multiple route symbols along a physical network infrastructure

    OpenAIRE

    Jules Teulade-Denantes; Adrien Maudet; Cécile Duchêne

    2015-01-01

    This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement of such route symbols while maximizing their legibility, especially at junctions. The problem is mod...

  13. Optimal routing of electric vehicles

    OpenAIRE

    Andelmin, Juho

    2014-01-01

    In this thesis, a vehicle routing problem (VRP) variant tailored for plug-in battery electric vehicles (BEVs) is studied. The studied problem involves a fleet of identical BEVs located at a central depot, a set of customers that must be serviced within given time windows, and a set of charging stations where the vehicles can recharge their batteries. The objective is to design a set of vehicle routes, each starting and ending at the depot, so that each customer is serviced exactly once and th...

  14. Electric arc hydrogen heaters

    International Nuclear Information System (INIS)

    The experimental data on the electric arc burning in hydrogen are presented. Empirical and semiempirical dependences for calculating the arc characteristics are derived. An engineering method of calculating plasma torches for hydrogen heating is proposed. A model of interaction of a hydrogen arc with a gas flow is outlined. The characteristics of plasma torches for heating hydrogen and hydrogen-bearing gases are described. (author)

  15. Wire + Arc Additive Manufacturing

    OpenAIRE

    Williams, Stewart W.; Martina, Filomeno; Addison, Adrian C.; Ding, Jialuo; Pardal, Goncalo; Colegrove, Paul A.

    2016-01-01

    Depositing large components (>10 kg) in titanium, aluminium, steel and other metals is possible using Wire + Arc Additive Manufacturing. This technology adopts arc welding tools and wire as feedstock for additive manufacturing purposes. High deposition rates, low material and equipment costs, and good structural integrity make Wire+Arc Additive Manufacturing a suitable candidate for replacing the current method of manufacturing from solid billets or large forgings, especially with regards to ...

  16. Adaptive routing in wireless communication networks using swarm intelligence

    Science.gov (United States)

    Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.

    2001-01-01

    In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.

  17. Geographic Information System (GIS) modeling approach to determine the fastest delivery routes.

    Science.gov (United States)

    Abousaeidi, Mohammad; Fauzi, Rosmadi; Muhamad, Rusnah

    2016-09-01

    This study involves the adoption of the Geographic Information System (GIS) modeling approach to determine the quickest routes for fresh vegetable delivery. During transport, fresh vegetables mainly deteriorate on account of temperature and delivery time. Nonetheless, little attention has been directed to transportation issues in most areas within Kuala Lumpur. In addition, perishable food normally has a short shelf life, thus timely delivery significantly affects delivery costs. Therefore, selecting efficient routes would consequently reduce the total transportation costs. The regression model is applied in this study to determine the parameters that affect route selection with respect to the fastest delivery of fresh vegetables. For the purpose of this research, ArcGIS software with network analyst extension is adopted to solve the problem of complex networks. The final output of this research is a map of quickest routes with the best delivery times based on all variables. The variables tested from regression analysis are the most effective parameters to make the flow of road networks slower. The objective is to improve the delivery services by achieving the least drive time. The main findings of this research are that Land use such as residential area and population as variables are the effective parameters on drive time. PMID:27579003

  18. An Efficient Bypassing Void Routing Algorithm for Wireless Sensor Network

    OpenAIRE

    2015-01-01

    Since the sensor node’s distribution in a wireless sensor network (WSN) is irregular, geographic routing protocols using the greedy algorithm can cause local minima problem. This problem may fail due to routing voids and lead to failure of data transmission. Based on the virtual coordinate mapping, this paper proposes an efficient bypassing void routing protocol to solve the control packet overhead and transmission delay in routing void of WSN, which is called EBVRPVCM. The basic idea is to t...

  19. Shortest Paths and Vehicle Routing

    OpenAIRE

    Petersen, Bjørn; Pisinger, David

    2011-01-01

    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.

  20. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.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 sol

  1. Parallel Genetic Algorithm for Channel Routing

    OpenAIRE

    Rao, Prahlada BB; Patnaik, LM; Hansdah, RC

    1993-01-01

    In this paper, we propose a new channel routing algorithm based on genetic approach. This involves designing a new encoding scheme and an evaluation function used by the genetic algorithm (GA) for channel routing problem. The algorithm has been implemented as both sequential and distributed CA. The speedup achieved is positive and encouraging.

  2. Fast Arc-Annotated Subsequence Matching in Linear Space

    CERN Document Server

    Bille, Philip

    2009-01-01

    An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings $P$ and $Q$ the arc-preserving subsequence problem is to determine if $P$ can be obtained from $Q$ by deleting bases from $Q$. Whenever a base is deleted any arc with an endpoint in that base is also deleted. Arc-annotated strings where the arcs are "nested" are a natural model of RNA molecules that captures both the primary and secondary structure of these. The arc-preserving subsequence problem for nested arc-annotated strings is basic primitive for investigating the function of RNA molecules. Gramm et al. [ACM Trans. Algorithms 2006] gave an algorithm for this problem using $O(nm)$ time and space, where $m$ and $n$ are the lengths of $P$ and $Q$, respectively. In this paper we present a new algorithm using $O(nm)$ time and $O(n + m)$ space, thereby matching the previous time bound while significantly reducing the space from a quadratic term to l...

  3. 考虑交叉口延误和转向限制的弧标号最短路径算法%An Arc Labeling Algorithm for Shortest Path Problem Considering Turn Penalties and Prohibitions at Intersections

    Institute of Scientific and Technical Information of China (English)

    高明霞; 贺国光

    2011-01-01

    It is quite special and difficult to find shortest path in traffic network with turn penalties and prohibitions at intersections, which is beyond the area of classical algorithms based on the premise that the SPP( shortest path problem) is without aftereffect when labeling at nodes with traditional method. After a simple analysis about such SPP and some existing methods,a label correcting algorithm is presented to seek the shortest path from source to all the other nodes. According to the algorithm, every arc of the network is assigned a distance label and a pre-arc label which are scanned and updated iteratively to approximate the optimal solution. For a given network, the optimal solution can be got after certain iterations and the time complexity of the algorithm is O(nm) for general road network. A numerical example is given to illustrate the application.%在考虑交叉口延误和转向限制的情况下,交通网络中的最短路问题较为特殊和复杂,传统的节点标号方式及相应的基于无后效性条件的算法不适用于这类问题.本文对该类问题的特点及已有典型方法进行了分析,提出了一个基于孤标号的标号修正算法.算法分别为每条弧设置一个距离标号和一个紧前弧标号,通过不断迭代、更新弧的标号来寻找最短路径.对给定网络经一定次数的迭代,可得到起点至其它所有节点的最短路径,在“一对多”形式的路径优化中效果较好,应用于一般道路网时计算时间复杂性为O(nm).最后给出了一个数值算例,说明算法的应用.

  4. Application of Bat Algorithm in Vehicle Routing Problem of Logistics Distribution%蝙蝠算法在物流配送车辆路径优化问题中的应用

    Institute of Scientific and Technical Information of China (English)

    马祥丽; 张惠珍; 马良

    2015-01-01

    车辆路径问题(Vehicle Routing Problem,VRP)是组合优化问题中一个典型的NP难题.蝙蝠算法(Bat Algorithm,BA)是一种新型的智能优化算法,尚未被应用到求解VRP问题中去.根据物流配送中VRP问题的数学模型及其具体特征,设计了求解VRP问题的蝙蝠算法,并通过仿真实例和与其他算法进行比较的方式验证了蝙蝠算法求解VRP问题的有效性与可行性.

  5. Routing Proposals for Multipath Interdomain Routing

    OpenAIRE

    Bilal, Sardar M.; Dilber, Muhammad Naveed; Khan, Atta ur Rehman

    2013-01-01

    Internet is composed of numbers of independent autonomous systems. BGP is used to disseminate reachability information and establishing path between autonomous systems. Each autonomous system is allowed to select a single route to a destination and then export the selected route to its neighbors. The selection of single best route imposes restrictions on the use of alternative paths during interdomain link failure and thus, incurred packet loss. Packet loss still occurs even when multiple pat...

  6. Bat algorithm for vehicle routing problem of logistics distribution with time windows%带时间窗物流配送车辆路径问题的蝙蝠算法

    Institute of Scientific and Technical Information of China (English)

    马祥丽; 张惠珍; 马良

    2016-01-01

    Vehicle Routing Problem with Time Windows(VRPTW)is an important and practical research project, which adds the time constraints into the mathematical model based on the capacity constraints with requirements of the lowest total cost in distribution system. Bat Algorithm(BA)is a new intelligent optimization algorithm, which has not yet been applied to VRPTW. Based on the mathematical model and specific features of VRPTW, this paper redesigns the operators of BA and proposes an improved bat algorithm for solving it. Furthermore, the results show that bat algorithm can effec-tively and feasibly solve VRPTW in logistics distribution through simulation examples and comparisons with other algo-rithms. The research results also expand the application field of BA.%带时间窗车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTW)是一个重要而实际的研究课题,该问题在有能力约束模型的基础上增加了时间约束,要求配送系统总费用最低.蝙蝠算法(Bat Algorithm,BA)是一种新型的智能优化算法,目前尚未被应用到求解VRPTW问题中.根据VRPTW问题的数学模型及其具体特征,重新设计了BA的操作算子,给出了求解VRPTW问题的改进蝙蝠算法,并通过仿真实例和与其他算法进行比较的方式,验证了蝙蝠算法在VRPTW问题中的求解性能,拓展了蝙蝠算法的应用领域.

  7. Physics of arcs in circuit breakers

    International Nuclear Information System (INIS)

    Some typical examples of circuit breakers are shown. Common to all these devices is that an electric arc is formed when the breaker operates which is responsible for the current interruption. The physics of those arcs can be described by the simplest single-fluid model of plasma physics which differs from the set of gas dynamic equations only by the following three terms: radiative energy transfer magnetic force and Joulean heating. These terms describe typical circuit breaker arc phenomena. This is discussed by means of three examples. The first example treats the influence of the radiative energy transfer on the temperature distribution of high-voltage circuit-breaker arcs. The second example is a discussion of the magnetic stability of circuit breaker arcs and the third example is concerned with the problem of flow turbulence produced at the arc boundary. The last effect is closely related to the current interruption process in high-voltage circuit breakers. A semi-empirical description of the turbulent heat exchange leads to a prediction of the breaking capacity for this type of circuit breaker. (author)

  8. Routing in opportunistic networks

    CERN Document Server

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

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

  9. Tokamak ARC damage

    International Nuclear Information System (INIS)

    Tokamak fusion reactors will have large plasma currents of approximately 10 MA with hundreds of megajoules stored in the magnetic fields. When a major plasma instability occurs, the disruption of the plasma current induces voltage in the adjacent conducting structures, giving rise to large transient currents. The induced voltages may be sufficiently high to cause arcing across sector gaps or from one protruding component to another. This report reviews a tokamak arcing scenario and provides guidelines for designing tokamaks to minimize the possibility of arc damage

  10. INTERPOLATION WITH RESTRICTED ARC LENGTH

    Institute of Scientific and Technical Information of China (English)

    Petar Petrov

    2003-01-01

    For given data (ti,yi), I= 0,1,…,n,0 = t0 <t1 <…<tn = 1we study constrained interpolation problem of Favard type inf{‖f"‖∞|f∈W2∞[0,1],f(ti)=yi,i=0,…,n,l(f;[0,1])≤l0}, wherel(f";[0,1])=∫1 0 / 1+f'2(x)dx is the arc length off in [0,1]. We prove the existence of a solution f* of the above problem, that is a quadratic spline with a second derivative f"* , which coincides with one of the constants - ‖f"*‖∞,0,‖f"*‖∞ between every two consecutive knots. Thus, we extend a result ofKarlin concerning Favard problem, to the case of restricted length interpolation.

  11. Vacuum arc anode phenomena

    International Nuclear Information System (INIS)

    A brief review of anode phenomena in vacuum arcs is presented. Discussed in succession are: the transition of the arc into the anode spot mode; the temperature of the anode before, during and after the anode spot forms; and anode ions. Characteristically the anode spot has a temperature of the order of the atmospheric boiling point of the anode material and is a copious source of vapor and energetic ions. The dominant mechanism controlling the transition of the vacuum arc into the anode spot mode appears to depend upon the electrode geometry, the electrode material, and the current waveform of the particular vacuum arc being considered. Either magnetic constriction in the gap plasma or gross anode melting can trigger the transition; indeed, a combination of the two is a common cause of anode spot formation

  12. ALICE - ARC integration

    OpenAIRE

    Anderlik, Csaba; Gregersen, Anders Rhod; Kleist, Josva; Peters, Andreas; Siaz, Pablo

    2007-01-01

    AliEn or Alice Environment is the Gridware developed and used within the ALICE collaboration for storing and processing data in a distributed manner. ARC (Advanced Resource Connector) is the Grid middleware deployed across the Nordic countries and gluing together the resources within the Nordic Data Grid Facility (NDGF). In this paper we will present our approach to integrate AliEn and ARC, in the sense that ALICE data management and job processing can be carried out on the NDGF infrastructur...

  13. ACO Based Routing for MANETs

    Directory of Open Access Journals (Sweden)

    Mohammad Arif

    2012-05-01

    Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile nodes. It dynamically forms atemporary network without using any pre existing network infrastructure or centralized administrationi.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to othernodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiencesalterations during deployment. The biggest challenge in MANETs is to find a path betweencommunicating nodes. The considerations of the MANET environment and the nature of the mobile nodescreate further complications which results in the need to develop special routing algorithms to meet thesechallenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in otherproblem domains, has been applied to the MANET routing problem as it forms a good fit to the problem.In ant societies the activities of the individuals are not regulated by any explicit form of centralizedcontrol but are the result of self-organizing dynamics driven by local interactions and communicationsamong a number of relatively simple individuals. This unique characteristic has made ant societies anattractive and inspiring model for building new algorithms and new multi-agent systems. In this paper,we have studied and reviewed Ant Colony based routing algorithms and its variants. Finally, aperformance evaluation of the original ARA and the EARA is carried out with respect to each other.

  14. IPv6 Network Mobility Route Optimization Survey

    Directory of Open Access Journals (Sweden)

    Samer S. Hassan

    2011-01-01

    Full Text Available Problem statement: This study describes that the Next Generation of Networks (NGN communication will supports multiple technologies, handles the mobility of end users to move through heterogeneous access networks, with ability to connect to different networks. Where the Internet Engineer Task Force maintain (IETF the Mobile IPv6 (MIPv6 to handles the mobility of networks (NEMO, to provide wide band and more scalable network services. One of the MIPv6 built-in features is Route Optimization (RO to solve the inefficient route problem. Conclusion/Recommendations: The main objective of this article is to survey, classify and make a compression between the available schemes for route optimization over the last years depends on the basic criteria generated from the published articles within different network topology. This article presents the problem of suboptimal route which is further increased with increasing of nesting levels and there is no such one scheme is perfect for all network environments.

  15. Small Universal Petri Nets with Inhibitor Arcs

    OpenAIRE

    Ivanov, Sergiu; Pelz, Elisabeth; Verlan, Sergey

    2013-01-01

    We investigate the problem of construction of small-size universal Petri nets with inhibitor arcs. We consider four descriptional complexity parameters: the number of places, transitions, inhibitor arcs, and the maximal degree of a transition, each of which we try to minimize. We give six constructions having the following values of parameters (listed in the above order): $(30,34,13,3)$, $(14, 31, 51, 8)$, $(11, 31, 79, 11)$, $(21,25,13,5)$, $(67, 64, 8, 3)$, $(58, 55, 8, 5)$ that improve the...

  16. Modeling of Arc Force in Plasma Arc Welding

    Institute of Scientific and Technical Information of China (English)

    GAO Zhonglin; HU Shengsun; YIN Fengliang; WANG Rui

    2008-01-01

    A three. dimensional mathematical model for the transferred-type argon arc was developed to describe arc force on the anode surface. The software ANSYS was employed to solve the model. The model includes a part of torch and tungsten electrode to achieve m ore reasonable results. The arc temperature and flow fields were derived. And the influences of welding parameters on arc force were also studied. The simulated results show that arc pressure at the anode are dependent on the welding current, plasma gas flow rate and electrode neck-in, while not sensitive to arc length.

  17. Auxiliary-Arc Electrodes for MHD Systems

    International Nuclear Information System (INIS)

    The important role of electrode phenomena in the operation of magneto aerodynamic machines is well known. In particular, the voltage drops which occur in the boundary layer in the immediate neighbourhood of the electrode may reduce the output of the apparatus. These voltage drops are caused partly by the increased resistance presented by the boundary layer in the neighbourhood of the electrode when the latter is appreciably colder than the gas, and partly by the fact that the electrode is not at a temperature sufficient to be emissive. Auxiliary-arc electrodes that have been constructed and tested seem to provide a solution both of the cold boundary layer problem and of the cathode emissivity problem. For this purpose an arc is established between a refractory metal cathode placed behind and clear of the generator wall and an anode forming part of the wall. The arc column can be activated by a rotational movement under the effect of a magnetic field, which may be that of the machine itself. The mechanical arrangement of the electrodes is such that, with a weak flow of gas (argon for example), it is possible to maintain a protective atmosphere around the arc cathode, while the arc anode is strongly cooled by the wall. The gas flow also has the effect of forcing the arc column towards the stream, thus increasing the conductivity of the boundary layer. Furthermore, the arc column behaves as a virtual cathode, from which a sizeable electron current can be extracted. Electrodes constructed on this principle have been tested on gas streams composed of fuel-oil combustion products. By using them as cathodes it has been possible to extract a current of 5 A without the voltage drop between the electrode and the gas exceeding 10 V. Comparative tests have been carried out with cooled metal electrodes, in which case the voltage drop is of the order of 120 V. The arc electrodes tested have operated for several hours without any apparent damage. In spite of the energy which has

  18. State alternative route designations

    Energy Technology Data Exchange (ETDEWEB)

    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.

  19. State alternative route designations

    Energy Technology Data Exchange (ETDEWEB)

    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.

  20. ALICE-ARC integration

    International Nuclear Information System (INIS)

    AliEn or Alice Environment is the Grid middleware developed and used within the ALICE collaboration for storing and processing data in a distributed manner. ARC (Advanced Resource Connector) is the Grid middleware deployed across the Nordic countries and gluing together the resources within the Nordic Data Grid Facility (NDGF). In this paper we will present our approach to integrate AliEn and ARC, in the sense that ALICE data management and job processing can be carried out on the NDGF infrastructure, using the client tools available in AliEn. The inter-operation has two aspects, one is the data management part and the second the job management aspect. The first aspect was solved by using dCache across NDGF to handle data. Therefore, we will concentrate on the second part. Solving it, was somewhat cumbersome, mainly due to the different computing models employed by AliEn and ARC. AliEN uses an Agent based pull model while ARC handles jobs through the more 'traditional' push model. The solution comes as a module implementing the functionalities necessary to achieve AliEn job submission and management to ARC enabled sites

  1. Consolidating NASA's Arc Jets

    Science.gov (United States)

    Balboni, John A.; Gokcen, Tahir; Hui, Frank C. L.; Graube, Peter; Morrissey, Patricia; Lewis, Ronald

    2015-01-01

    The paper describes the consolidation of NASA's high powered arc-jet testing at a single location. The existing plasma arc-jet wind tunnels located at the Johnson Space Center were relocated to Ames Research Center while maintaining NASA's technical capability to ground-test thermal protection system materials under simulated atmospheric entry convective heating. The testing conditions at JSC were reproduced and successfully demonstrated at ARC through close collaboration between the two centers. New equipment was installed at Ames to provide test gases of pure nitrogen mixed with pure oxygen, and for future nitrogen-carbon dioxide mixtures. A new control system was custom designed, installed and tested. Tests demonstrated the capability of the 10 MW constricted-segmented arc heater at Ames meets the requirements of the major customer, NASA's Orion program. Solutions from an advanced computational fluid dynamics code were used to aid in characterizing the properties of the plasma stream and the surface environment on the calorimeters in the supersonic flow stream produced by the arc heater.

  2. Speed-Consumption Tradeoff for Electric Vehicle Route Planning

    OpenAIRE

    Baum, Moritz; Dibbelt, Julian; Hübschle-Schneider, Lorenz; Pajor, Thomas; Wagner, Dorothea

    2014-01-01

    We study the problem of computing routes for electric vehicles (EVs) in road networks. Since their battery capacity is limited, and consumed energy per distance increases with velocity, driving the fastest route is often not desirable and may even be infeasible. On the other hand, the energy-optimal route may be too conservative in that it contains unnecessary detours or simply takes too long. In this work, we propose to use multicriteria optimization to obtain Pareto sets of routes that trad...

  3. Arc Plasma Torch Modeling

    CERN Document Server

    Trelles, J P; Vardelle, A; Heberlein, J V R

    2013-01-01

    Arc plasma torches are the primary components of various industrial thermal plasma processes involving plasma spraying, metal cutting and welding, thermal plasma CVD, metal melting and remelting, waste treatment and gas production. They are relatively simple devices whose operation implies intricate thermal, chemical, electrical, and fluid dynamics phenomena. Modeling may be used as a means to better understand the physical processes involved in their operation. This paper presents an overview of the main aspects involved in the modeling of DC arc plasma torches: the mathematical models including thermodynamic and chemical non-equilibrium models, turbulent and radiative transport, thermodynamic and transport property calculation, boundary conditions and arc reattachment models. It focuses on the conventional plasma torches used for plasma spraying that include a hot-cathode and a nozzle anode.

  4. Simulated Annealing Technique for Routing in a Rectangular Mesh Network

    Directory of Open Access Journals (Sweden)

    Noraziah Adzhar

    2014-01-01

    Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

  5. Based on particles collision PSO for vehicle routing problem with time windows%基于粒子碰撞的粒子群算法求解带时间窗车辆调度问题

    Institute of Scientific and Technical Information of China (English)

    秦家娇; 张勇; 毛剑琳; 付丽霞

    2012-01-01

    带时间窗车辆调度问题属于离散NP-hard组合优化问题,传统的粒子群算法在离散域上表现了一定的劣性,对此提出了一种基于粒子碰撞的离散PSO算法来求解该问题.受物体相互碰撞之后物体的速度和位置会发生改变的现象启发,使当前粒子与个体最优和全局最优粒子发生碰撞来更新粒子的位置,以避免传统更新操作中的取整,保证种群的进化能力.采用Solomon's VRP标准问题集的实例来对算法进行测试,实验结果数据表明了该算法的有效性.%The vehicle routing problem with time windows (VRPTW) is the NP-hard combinatorial optimization discrete problem. There was certain inferiority performance on solving it with traditional PSO, so this paper proposed a particles collision discrete PSO to solve it. Inspired by the physical phenomena of the velocity and position changed after objects collision, it made the current particle collided with the personal best particle and global best particle to avoid the tradition rounding operating in updating, and kept particles swarm evolutional capability. It used the Solomon' s VRP instance to test. The results of experiments show that the algorithm has good performance.

  6. Performance Analysis of Route Discovery by Cross Layer Routing Protocol- RDCLRP

    Directory of Open Access Journals (Sweden)

    Mehajabeen Fatima

    2013-06-01

    Full Text Available Wired and wireless network is based on the TCP / IP architecture but it is not sufficient to cope with the dynamics of the MANET. Cross layer design can be an alternative architecture for MANET. Frequent route break is one of the major problems of mobile adhoc network (MANET. Path breaks due to less available battery power and mobility of nodes. Most of the battery power is consumed in flooding of control packets. A key challenge in the design of efficient routing protocol is to reduce link breakage and flooding of control packets. Route breakage can be reduced if the possibility of route breakage is predicted and a handoff is done without drop of data packets. If route breakage is reduced, the more battery power will be available with nodes. In turn it reduces the possibility of route breakage and the possibility of flooding. This is a cumulative effect. So a novel preemptive route repair algorithm is proposed named as RDCLRP- Route discovery by cross layer routing protocol to reduce frequency of control packet flooding and route breakage. Three variants of RDCLRP and their results are illustrated. In this paper, the impact of the number of nodes on performance of RDCLRP are investigated and analyzed. The results show 55.6% reduction in link breakage, 14.7% improvement in residual battery power and an average of 6.7% increase in throughput compared to basic AODV.

  7. The line planning routing game

    OpenAIRE

    Gattermann, P.; Schiewe, A.; Schmidt, M.

    2014-01-01

    In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s best-response ...

  8. The line planning routing game

    OpenAIRE

    Gattermann, Philine; Schiewe, Alexander; Schmidt, Marie

    2014-01-01

    textabstractIn this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s be...

  9. 模糊时间窗VRP的动态规划和禁忌搜索混合算法%Dynamic programming and tabu search hybrid algorithm for Vehicle Routing Problem with fuzzy time windows

    Institute of Scientific and Technical Information of China (English)

    王君

    2014-01-01

    The Vehicle Routing Problem with Fuzzy Time Windows is addressed. A multi-objective mathematical model is designed with the objectives of logistics cost and average customer satisfaction. Based on Pareto dominance theory, a multi-objective tabu search algorithm is proposed to solve multi-objective optimization problems. Moreover, a dynamic program-ming method is embedded in the algorithm to optimize the customer satisfaction, which simplifies the original problem into tight path optimization sub-problems with the use of phasing. While fuzzy time windows are in piecewise linear and nonlinear convex membership function forms, customer beginning service time is optimized by proposed limited iteration subgradient algorithm and median iteration subgradient algorithm, respectively. Computational experiments on Solomon’s benchmark not only verify that the dynamic programming is more effective than projected subgradient methods to optimize the service level, but also show the advantages of the proposed multi-objective tabu search approach when compared with the well-known NSGA-II method.%为优化具有模糊时间窗的车辆路径问题,以物流配送成本和顾客平均满意度为目标,建立了多目标数学规划模型。基于Pareto占优的理论给出了求解多目标优化问题的并行多目标禁忌搜索算法,算法中嵌入同时优化顾客满意度的动态规划方法,运用阶段划分,把原问题分解为关于紧路径的优化子问题。对模糊时间窗为线性分段函数形式和非线性凹函数形式的隶属度函数,分别提出了次梯度有限迭代算法和次梯度中值迭代算法来优化顾客的最优开始服务时间。通过Solomon的标准算例,与次梯度投影算法的比较验证了动态规划方法优化服务水平的有效性,与主流的NSGA-II算法的对比实验表明了该研究提出的多目标禁忌搜索算法的优越性。

  10. Network Resilience through Multiple Routing Configurations

    Directory of Open Access Journals (Sweden)

    Naga Raju Pamidi

    2011-11-01

    Full Text Available We propose the use of multi-topology (MT routing for network resilience against link and node failures. We describe the multi-topologies by an n-dimensional vector of different link costs for all links in the network. It is the base for the calculation of n shortest path trees from any node to all other destinations, i.e. for n virtual routing topologies. We define the link costs in such a way that the routing topologies complement each other in the sense that at least one valid route remains in a single link or node failure scenario for each pair of nodes in at least one routing topology. In such a failure case, packets are rather deviated over the intact routing topology than discarded. The recovery speed of the presented mechanism is very fast and can be compared to fast rerouting mechanisms in MPLS, which reduce packet, drops to a minimum. In contrast to MPLS, MT routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing. As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC. Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions.

  11. A Multistage Method for Multiobjective Route Selection

    Science.gov (United States)

    Wen, Feng; Gen, Mitsuo

    The multiobjective route selection problem (m-RSP) is a key research topic in the car navigation system (CNS) for ITS (Intelligent Transportation System). In this paper, we propose an interactive multistage weight-based Dijkstra genetic algorithm (mwD-GA) to solve it. The purpose of the proposed approach is to create enough Pareto-optimal routes with good distribution for the car driver depending on his/her preference. At the same time, the routes can be recalculated according to the driver's preferences by the multistage framework proposed. In the solution approach proposed, the accurate route searching ability of the Dijkstra algorithm and the exploration ability of the Genetic algorithm (GA) are effectively combined together for solving the m-RSP problems. Solutions provided by the proposed approach are compared with the current research to show the effectiveness and practicability of the solution approach proposed.

  12. Routes visualization: Automated placement of multiple route symbols along a physical network infrastructure

    Directory of Open Access Journals (Sweden)

    Jules Teulade-Denantes

    2015-12-01

    Full Text Available This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement of such route symbols while maximizing their legibility, especially at junctions. The problem is modeled as a constraint optimization problem. Legibility criteria are identified and formalized as constraints to optimize, while focusing on the case of hiking routes in a physical network composed of roads and pedestrian paths. Two solving methods are tested, based on backtracking and simulated annealing meta-heuristics respectively. Encouraging results obtained on real data are presented and discussed.

  13. TBRF: Trust Based Routing Framework for WSNs

    Directory of Open Access Journals (Sweden)

    Kushal Gulaskar

    2014-03-01

    Full Text Available The multi-hop routing in wireless sensor networks (WSNs offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TBRF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TBRF provides trustworthy and energy-efficient route. Most importantly, TBRF proves effective against those harmful attacks developed out of identity deception; the resilience of TBRF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TBRF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TBRF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism

  14. Traffic-Adaptive Routing

    OpenAIRE

    Kammenhuber, Nils

    2011-01-01

    Despite the bursty and highly volatile traffic, routing in the Internet today is optimised only on coarse time scales, as load-adaptive routing is known to induce performance deterioration by causing massive oscillations. We describe ReplEx, an universally applicable distributed algorithm for dynamic routing/traffic engineering, which is based on game theory. We show through extensive realistic simulations that ReplEx does not oscillate, and that it achieves performance gains comparable to tr...

  15. Thermal Arc Spray Overview

    Science.gov (United States)

    Hafiz Abd Malek, Muhamad; Hayati Saad, Nor; Kiyai Abas, Sunhaji; Mohd Shah, Noriyati

    2013-06-01

    Usage of protective coating for corrosion protection was on highly demand during the past decade; and thermal spray coating played a major part during that time. In recent years, the thermal arc spray coating becomes a popular coating. Many big players in oil and gas such as PETRONAS, EXXON MOBIL and SHELL in Malaysia tend to use the coating on steel structure as a corrosion protection. Further developments in coating processes, the devices, and raw materials have led to expansion of functional coatings and applications scope from conventional coating to specialized industries. It is widely used because of its ability to withstand high process temperature, offer advantages in efficiency, lower cost and acts as a corrosion protection. Previous research also indicated that the thermal arc spray offers better coating properties compared to other methods of spray. This paper reviews some critical area of thermal spray coating by discussing the process/parameter of thermal arc spray technology and quality control of coating. Coating performance against corrosion, wear and special characteristic of coating are also described. The field application of arc spray technology are demonstrated and reviewed.

  16. Thermal Arc Spray Overview

    International Nuclear Information System (INIS)

    Usage of protective coating for corrosion protection was on highly demand during the past decade; and thermal spray coating played a major part during that time. In recent years, the thermal arc spray coating becomes a popular coating. Many big players in oil and gas such as PETRONAS, EXXON MOBIL and SHELL in Malaysia tend to use the coating on steel structure as a corrosion protection. Further developments in coating processes, the devices, and raw materials have led to expansion of functional coatings and applications scope from conventional coating to specialized industries. It is widely used because of its ability to withstand high process temperature, offer advantages in efficiency, lower cost and acts as a corrosion protection. Previous research also indicated that the thermal arc spray offers better coating properties compared to other methods of spray. This paper reviews some critical area of thermal spray coating by discussing the process/parameter of thermal arc spray technology and quality control of coating. Coating performance against corrosion, wear and special characteristic of coating are also described. The field application of arc spray technology are demonstrated and reviewed.

  17. ALICE: ARC integration

    CERN Document Server

    Anderlik, C; Kleist, J; Peters, A; Saiz, P

    2008-01-01

    AliEn or Alice Environment is the Grid middleware developed and used within the ALICE collaboration for storing and processing data in a distributed manner. ARC (Advanced Resource Connector) is the Grid middleware deployed across the Nordic countries and gluing together the resources within the Nordic Data Grid Facility (NDGF). In this paper we will present our approach to integrate AliEn and ARC, in the sense that ALICE data management and job processing can be carried out on the NDGF infrastructure, using the client tools available in AliEn. The inter-operation has two aspects, one is the data management part and the second the job management aspect. The first aspect was solved by using dCache across NDGF to handle data. Therefore, we will concentrate on the second part. Solving it, was somewhat cumbersome, mainly due to the different computing models employed by AliEn and ARC. AliEN uses an Agent based pull model while ARC handles jobs through the more 'traditional' push model. The solution comes as a modu...

  18. Contact Graph Routing

    Science.gov (United States)

    Burleigh, Scott C.

    2011-01-01

    Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic

  19. Routing-based Synthesis of Digital Microfluidic Biochips

    DEFF Research Database (Denmark)

    Maftei, Elena; Pop, Paul; Madsen, Jan

    2010-01-01

    the concept of virtual modules and allow the droplets to move on the chip on any route during operation execution. Thus, the synthesis problem is transformed into a routing problem. We propose an approach derived from a Greedy Randomized Adaptive Search Procedure (GRASP) and we show that by considering...... routing-based synthesis, significant improvements can be obtained in the application completion time. The proposed heuristic has been evaluated using two real-life case studies and ten synthetic benchmarks....

  20. Distributed Decision Making in Combined Vehicle Routing and Break Scheduling

    OpenAIRE

    Meyer, Christoph Manuel; Kopfer, Herbert; Kok, Adrianus Leendert; Schutten, Marco

    2009-01-01

    The problem of combined vehicle routing and break scheduling comprises three subproblems: clustering of customer requests, routing of vehicles, and break scheduling. In practice, these subproblems are usually solved in the interaction between planners and drivers. We consider the case that the planner performs the clustering and the drivers perform the routing and break scheduling. To analyze this problem, we embed it into the framework of distributed decision making proposed by Schneeweiss (...

  1. Hybrid Routing in Delay Tolerant Networks

    OpenAIRE

    Mayer, Christoph P.

    2012-01-01

    This work addresses the integration of today\\'s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented.

  2. Network Routing Optimization Using Swarm Intelligence

    OpenAIRE

    Galil, Mohamed A. El

    2012-01-01

    The aim of this paper is to highlight and explore a traditional problem, which is the minimum spanning tree, and finding the shortest-path in network routing, by using Swarm Intelligence. This work to be considered as an investigation topic with combination between operations research, discrete mathematics, and evolutionary computing aiming to solve one of networking problems.

  3. ACO Agent Based Routing in AOMDV Environment

    Directory of Open Access Journals (Sweden)

    Kaur Amanpreet

    2016-01-01

    Full Text Available Mobile Ad-hoc Network (MANET is a group of moving nodes which can communicate with each other without the help of any central stationary node. All the nodes in the MANET act as router for forwarding data packets. The nodes in the network also move randomly and there exists no fixed infrastructure. So, path breaks are the frequent problem in MANET. The routing protocol faces a lot of problem due these path breaks. Therefore, the routing protocol which is multipath in nature is more reliable than a unipath routing protocol. Ant colony optimization is a relatively new technique which is suitable for the optimization problems. AOMDV is a multipath routing protocol. Thus, if there happens to be path break, the packets can start following the new path which has already been selected. In this paper, we are trying to add ant’s agents into AOMDV behavior. In this way, the new protocol will be benefited by the dual properties i.e. of ant’s nature and multipath nature of AOMDV. The modified concept is simulated and the outcomes are compared with AOMDV, AODV and DSR routing protocols for few performance parameters. Results obtained are encouraging; the new algorithm performs better than traditional unipath and multipath routing protocols.

  4. Using Ant Colony Optimization for Routing in VLSI Chips

    Science.gov (United States)

    Arora, Tamanna; Moses, Melanie

    2009-04-01

    Rapid advances in VLSI technology have increased the number of transistors that fit on a single chip to about two billion. A frequent problem in the design of such high performance and high density VLSI layouts is that of routing wires that connect such large numbers of components. Most wire-routing problems are computationally hard. The quality of any routing algorithm is judged by the extent to which it satisfies routing constraints and design objectives. Some of the broader design objectives include minimizing total routed wire length, and minimizing total capacitance induced in the chip, both of which serve to minimize power consumed by the chip. Ant Colony Optimization algorithms (ACO) provide a multi-agent framework for combinatorial optimization by combining memory, stochastic decision and strategies of collective and distributed learning by ant-like agents. This paper applies ACO to the NP-hard problem of finding optimal routes for interconnect routing on VLSI chips. The constraints on interconnect routing are used by ants as heuristics which guide their search process. We found that ACO algorithms were able to successfully incorporate multiple constraints and route interconnects on suite of benchmark chips. On an average, the algorithm routed with total wire length 5.5% less than other established routing algorithms.

  5. 应用蜜蜂繁殖进化型粒子群算法求解车辆路径问题%A Bee Evolutionary Particle Swarm Optimization Algorithm for Vehicle Routing Problem

    Institute of Scientific and Technical Information of China (English)

    寇明顺; 叶春明; 陈子皓

    2012-01-01

    为了提高粒子群算法求解车辆路径问题时收敛速度和全局搜索能力,将蜜蜂繁殖进化机制与粒子群算法相结合,应用到CVRP问题的求解.该算法中,最优的个体作为蜂王与通过选择机制选择的雄蜂以随机概率进行交叉,增强了最优个体信息的应用能力;同时,随机产生一部分雄蜂种群,并将其与蜂王交叉增加了算法的多样性.实例分析表明该算法具有较好的全局搜索能力,验证了该算法的可行性.%The vehicle routing problem (VRP) is discussed in this paper. There are studies that solve VRP by using particle swarm optimization (PSO) algorithm. However, with traditional PSO, it has slow convergence rate and a local optimum may be obtained. In order to improve the performance of PSO, an algorithm called bee evolutionary particle swarm optimization (BEPSO) is presented for VRP in this paper. By this algorithm, the best particle regarded as the queen crosses with the selected drones randomly. In this way, it takes the advantage of the best individual's information. At the same time, some drones are randomly generated and crossed with the queen such that diversity is enlarged. Experimental test shows that the proposed algorithm has better global search ability than the existing ones.

  6. Research on the Routing Problem in Logistics Distribution Based on Hybrid Algorithm of Swarm Intelligence%基于群智能混合算法的物流配送路径研究

    Institute of Scientific and Technical Information of China (English)

    朱亚琪; 方建安

    2012-01-01

    针对物流车辆路径优化问题,考虑到基本蚁群算法有收敛速度慢、易陷入局部最优的缺点,采用了一种双种群蚁群算法,在蚁群的基础上引入差分进化(DE)和粒子群算法(PSO).通过在PSOAS种群和DEAS种群之间建立一种信息交流机制,使信息能够在两个种群中传递,以免某一方因错误的信息判断而陷入局部最优点.通过matlab仿真实验测试,表明该群智能混合算法可以较好地解决TSP的问题.%Aiming at the drawbacks of slow convergence speed and being easy to fall into local optimal point for basic ant colony algorithm in logistics vehicle routing optimization issue, this paper adoptes a Dual Population Ant Colony Algorithm, Differential Evolution (DE) and Particle Swarm Optimization (PSO) is introduced on the basis of the ant colony. Through the establishment of an information exchange mechanism between PSOAS population and DEAS population, so that information can be passed in the two populations, so as not to be trapped in local minima due to wrong judgment. Matlab simulation experiment showes that the group of intelligent hybrid algorithm can solve the TSP problem.

  7. 协同物流模式下多批次整车运输调度问题%Research on the Full-loaded Vehicle Routing Problem with Multiple Batches in Collaborative Transportation Mode

    Institute of Scientific and Technical Information of China (English)

    魏江宁; 陆志强; 奚立峰

    2009-01-01

    The vehicle routing problem with time windows as well as multiple pickups and deliveries was studied in collaborative transportation mode. A mathematical model was developed considering the factors such as the number of trucks rented, the distances covered, and the penalty due to service delay. A hybrid genetic algorithm was proposed accordingly, integrating the restarting scheme which is able to improve the initial population and avoid premature convergence respectively. In addition, the local research strategy was fully used to get the optimal value quickly. The results of the computational experiment indicate that the proposed algorithm is effective.%研究了协同物流模式下,单车库、多集散点的带时间窗以及单点多批次配送与集货请求的联合运输问题.考虑车辆的租用费用、行驶费用、未按时完成服务产生的惩罚费用等因素,建立了数学模型并提出了混合遗传算法.算法中加入了重启动机制,以提高种群质量和避免早熟收敛,并采用局部搜索策略以快速寻找最优值.数值实验证明,混合遗传算法求解该类运输调度问题具有良好的效果,且算法效率较高.

  8. Multi-objective model and methods for capacitated vehicle routing problem facing different target preference%面向不同目标偏好的 CVRP多目标模型及其求解方法

    Institute of Scientific and Technical Information of China (English)

    王超; 金淳; 韩庆平

    2016-01-01

    This paper proposed a multi-objective model for capacitated vehicle routing problem (CVRP)facing different target preference (MOCVRPFDTP)to solve CVRP more effectively and evaluate transportation cost comprehensively.There were three different preference structures in this model,which were joint optimization of loading and CVRP,absolute minimum vehi-cles preference,and path optimization preference.To solve this model,this paper constructed an algorithm framework with cor-responding algorithms.In experiments,the model and its solving methods display satisfactory performance in the testing for VR-PLIB,and they are more suitable for practical instance.%为了更有效地求解车辆路径问题、全方位地评估物流运输成本,提出了面向不同目标偏好的车载能力约束车辆路径问题的多目标优化模型(MOCVRPFDTP),其包括三种不同的偏好结构:装载与 CVRP 联合优化、绝对最小车辆数偏好及路径优化偏好。为了求解该模型,设计了算法架构及具体算法。在实验中,该模型及其求解方法对 CVRP 国际标准算例 VRPLIB 的测试结果显示了令人满意的性能,并且它更适用于实际 CVRP 问题的求解。

  9. Semicircular Rashba arc spin polarizer

    International Nuclear Information System (INIS)

    In this work, we study the generation of spin polarized currents using curved arcs of finite widths, in which the Rashba spin orbit interaction (RSOI) is present. Compared to the 1-dimensional RSOI arcs with zero widths studied previously, the finite width presents charge carriers with another degree of freedom along the transverse width of the arc, in addition to the longitudinal degree of freedom along the circumference of the arc. The asymmetry in the transverse direction due to the difference in the inner and outer radii of the arc breaks the antisymmetry of the longitudinal spin z current in a straight RSOI segment. This property can be exploited to generate spin z polarized current output from the RSOI arc by a spin unpolarized current input. The sign of the spin current can be manipulated by varying the arc dimensions

  10. Semicircular Rashba arc spin polarizer

    Energy Technology Data Exchange (ETDEWEB)

    Bin Siu, Zhuo, E-mail: a0018876@nus.edu.sg [NUS Graduate School for Integrative Sciences and Engineering, National University of Singapore, Singapore 117456 (Singapore); Advanced Concepts and Nanotechnology, Data Storage Institute, DSI Building, 5 Engineering Drive 1 (Off Kent Ridge Crescent, NUS), Singapore 117608 (Singapore); Jalil, Mansoor B. A. [NUS Graduate School for Integrative Sciences and Engineering, National University of Singapore, Singapore 117456 (Singapore); Ghee Tan, Seng [Advanced Concepts and Nanotechnology, Data Storage Institute, DSI Building, 5 Engineering Drive 1 (Off Kent Ridge Crescent, NUS), Singapore 117608 (Singapore)

    2014-05-07

    In this work, we study the generation of spin polarized currents using curved arcs of finite widths, in which the Rashba spin orbit interaction (RSOI) is present. Compared to the 1-dimensional RSOI arcs with zero widths studied previously, the finite width presents charge carriers with another degree of freedom along the transverse width of the arc, in addition to the longitudinal degree of freedom along the circumference of the arc. The asymmetry in the transverse direction due to the difference in the inner and outer radii of the arc breaks the antisymmetry of the longitudinal spin z current in a straight RSOI segment. This property can be exploited to generate spin z polarized current output from the RSOI arc by a spin unpolarized current input. The sign of the spin current can be manipulated by varying the arc dimensions.

  11. A Survey of Transportation Problems

    OpenAIRE

    2014-01-01

    This paper aims at being a guide to understand the different types of transportation problems by presenting a survey of mathematical models and algorithms used to solve different types of transportation modes (ship, plane, train, bus, truck, Motorcycle, Cars, and others) by air, water, space, cables, tubes, and road. Some problems are as follows: bus scheduling problem, delivery problem, combining truck trip problem, open vehicle routing problem, helicopter routing problem, truck loading p...

  12. Underestimated risks of recurrent long-range ash dispersal from northern Pacific Arc volcanoes.

    Science.gov (United States)

    Bourne, A J; Abbott, P M; Albert, P G; Cook, E; Pearce, N J G; Ponomareva, V; Svensson, A; Davies, S M

    2016-01-01

    Widespread ash dispersal poses a significant natural hazard to society, particularly in relation to disruption to aviation. Assessing the extent of the threat of far-travelled ash clouds on flight paths is substantially hindered by an incomplete volcanic history and an underestimation of the potential reach of distant eruptive centres. The risk of extensive ash clouds to aviation is thus poorly quantified. New evidence is presented of explosive Late Pleistocene eruptions in the Pacific Arc, currently undocumented in the proximal geological record, which dispersed ash up to 8000 km from source. Twelve microscopic ash deposits or cryptotephra, invisible to the naked eye, discovered within Greenland ice-cores, and ranging in age between 11.1 and 83.7 ka b2k, are compositionally matched to northern Pacific Arc sources including Japan, Kamchatka, Cascades and Alaska. Only two cryptotephra deposits are correlated to known high-magnitude eruptions (Towada-H, Japan, ca 15 ka BP and Mount St Helens Set M, ca 28 ka BP). For the remaining 10 deposits, there is no evidence of age- and compositionally-equivalent eruptive events in regional volcanic stratigraphies. This highlights the inherent problem of under-reporting eruptions and the dangers of underestimating the long-term risk of widespread ash dispersal for trans-Pacific and trans-Atlantic flight routes. PMID:27445233

  13. Architectural Surfaces and Structures from Circular Arcs

    KAUST Repository

    Shi, Ling

    2013-12-01

    In recent decades, the popularity of freeform shapes in contemporary architecture poses new challenges to digital design. One of them is the process of rationalization, i.e. to make freeform skins or structures affordable to manufacture, which draws the most attention from geometry researchers. In this thesis, we aim to realize this process with simple geometric primitives, circular arcs. We investigate architectural surfaces and structures consisting of circular arcs. Our focus is lying on how to employ them nicely and repetitively in architectural design, in order to decrease the cost in manufacturing. Firstly, we study Darboux cyclides, which are algebraic surfaces of order ≤ 4. We provide a computational tool to identify all families of circles on a given cyclide based on the spherical model of M ̈obius geometry. Practical ways to design cyclide patches that pass through certain inputs are presented. In particular, certain triples of circle families on Darboux cyclides may be suitably arranged as 3-webs. We provide a complete classification of all possible 3-webs of circles on Darboux cyclides. We then investigate the circular arc snakes, which are smooth sequences of circu- lar arcs. We evolve the snakes such that their curvature, as a function of arc length, remains unchanged. The evolution of snakes is utilized to approximate given surfaces by circular arcs or to generated freeform shapes, and it is realized by a 2-step pro- cess. More interestingly, certain 6-arc snake with boundary constraints can produce a smooth self motion, which can be employed to build flexible structures. Another challenging topic is approximating smooth freeform skins with simple panels. We contribute to this problem area by approximating a negatively-curved 5 surface with a smooth union of rational bilinear patches. We provide a proof for vertex consistency of hyperbolic nets using the CAGD approach of the rational B ́ezier form. Moreover, we use Darboux transformations for the

  14. Estimation of dynamic properties of attractors observed in hollow copper electrode atmospheric pressure arc plasma system

    Indian Academy of Sciences (India)

    S Ghorul; S N Sahasrabudhe; P S S Murthy; A K Das; N Venkatramani

    2002-07-01

    Understanding of the basic nature of arc root fluctuation is still one of the unsolved problems in thermal arc plasma physics. It has direct impact on myriads of thermal plasma applications being implemented at present. Recently, chaotic nature of arc root behavior has been reported through the analysis of voltages, acoustic and optical signals which are generated from a hollow copper electrode arc plasma torch. In this paper we present details of computations involved in the estimation process of various dynamic properties and show how they reflect chaotic behavior of arc root in the system.

  15. mARC: Memory by Association and Reinforcement of Contexts

    OpenAIRE

    Rimoux, Norbert; Descourt, Patrice

    2013-01-01

    This paper introduces the memory by Association and Reinforcement of Contexts (mARC). mARC is a novel data modeling technology rooted in the second quantization formulation of quantum mechanics. It is an all-purpose incremental and unsupervised data storage and retrieval system which can be applied to all types of signal or data, structured or unstructured, textual or not. mARC can be applied to a wide range of information clas-sification and retrieval problems like e-Discovery or contextual ...

  16. Arc cathode spots

    International Nuclear Information System (INIS)

    Arc spots are usually highly unstable and jump statistically over the cathode surface. In a magnetic field parallel to the surface, preferably they move in the retrograde direction; i.e., opposite to the Lorentzian rule. If the field is inclined with respect to the surface, the spots drift away at a certain angle with respect to the proper retrograde direction (Robson drift motion). These well-known phenomena are explained by one stability theory

  17. Vacuum Arc Ion Sources

    OpenAIRE

    Brown, I.

    2014-01-01

    The vacuum arc ion source has evolved into a more or less standard laboratory tool for the production of high-current beams of metal ions, and is now used in a number of different embodiments at many laboratories around the world. Applications include primarily ion implantation for material surface modification research, and good performance has been obtained for the injection of high-current beams of heavy-metal ions, in particular uranium, into particle accelerators. As the use of the sourc...

  18. Exploiting robots in arc welded fabrication

    International Nuclear Information System (INIS)

    This book explores the use of robots for industrial arc welding applications. A number of important issues, such as safety and economics are addressed. A wide range of industrial installation applications are described including production line chassis welding with multiple robots. The use of vision based sensor systems is explained to provide data on joint location and joint volume. Other areas covered include flexible manufacturing systems, computer integrated manufacture and design problems. The book concludes with a review of future trends. (UK)

  19. Circular arc structures

    KAUST Repository

    Bo, Pengbo

    2011-07-01

    The most important guiding principle in computational methods for freeform architecture is the balance between cost efficiency on the one hand, and adherence to the design intent on the other. Key issues are the simplicity of supporting and connecting elements as well as repetition of costly parts. This paper proposes so-called circular arc structures as a means to faithfully realize freeform designs without giving up smooth appearance. In contrast to non-smooth meshes with straight edges where geometric complexity is concentrated in the nodes, we stay with smooth surfaces and rather distribute complexity in a uniform way by allowing edges in the shape of circular arcs. We are able to achieve the simplest possible shape of nodes without interfering with known panel optimization algorithms. We study remarkable special cases of circular arc structures which possess simple supporting elements or repetitive edges, we present the first global approximation method for principal patches, and we show an extension to volumetric structures for truly threedimensional designs. © 2011 ACM.

  20. Manet Load Balancing Parallel Routing Protocol

    Directory of Open Access Journals (Sweden)

    Hesham Arafat Ali

    2012-07-01

    Full Text Available In recent years, multi-path routing protocols have attained more attention in mobile ad hoc networks as compared to other routing schemes due to their abilities and efficiency in improving bandwidth of communication, increasing delivery reliability, responding to congestion and heavy traffic. Several protocols have been developed to address multi path routing, but it always has a problem that the discovered paths may be not 100% disjoint and sending data is done in only one path until it's broken; the discovery of multiple paths also generates more overhead on the network. Load Balancing Parallel Routing Protocol [LBPRP] tried to solve previous multi path problems, distributing traffic among multiple paths sending data in parallel form as it uses all paths in the same time. We employed a simple test scenario to be sure of proposed model efficiency and to validate the proposed Load Balancing Parallel Routing Protocol. [LBPRP] will achieve load balancing in sending data, decreasing the end-to-end delay and increasing the packet delivery ratio and throughput, thus the performance of multi-path routing protocols can be improved consequently.

  1. Understanding individual routing behaviour.

    Science.gov (United States)

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

    2016-03-01

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

  2. Mathematical models of pre-arcing and arcing phenomena in vacuum circuit breakers

    International Nuclear Information System (INIS)

    The main aim of this paper is to show that properties of electrical contact materials are responsible for the metallic vapour pressure at contact closure. Dynamic phenomena accompanying electrical contacts closure in vacuum circuit breakers are considered as consecutive stages, including breakdown, touch, penetration, restitution, bridging and arcing at bouncing. The hybrid mathematical model is elaborated to describe dynamics of the arc and forces acting in contact gap. It includes experimental oscillograms of current, voltage and contact displacement and nonlinear equations for arc, anode and cathode temperature fields and contact motion. Experiments are carried out using a standard vacuum circuit breaker with laser sensors for measurement of contact gap. The special difference path method techniques was applied to take into account oscillations of a fixed contact. The axisymmetrical Stefan problem with two free boundaries corresponding to melting and evaporation interfaces is solved to find dynamics of contact evaporation. It is shown theoretically and confirmed experimentally that in the range of high current the force of metallic vapour pressure at arcing in vacuum is comparable with magnetic repulsion force and should be taken into consideration. Two mechanisms of vapour pressure formation and evolution are discussed, which occur due to explosion of micro-asperities at contact touch or due to arcing after bridge rupture at contact bouncing. (author)

  3. Sleep-Route: Routing through Sleeping Sensors

    OpenAIRE

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

    2014-01-01

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

  4. A Hybrid Routing Algorithm Based on Ant Colony and ZHLS Routing Protocol for MANET

    Science.gov (United States)

    Rafsanjani, Marjan Kuchaki; Asadinia, Sanaz; Pakzad, Farzaneh

    Mobile Ad hoc networks (MANETs) require dynamic routing schemes for adequate performance. This paper, presents a new routing algorithm for MANETs, which combines the idea of ant colony optimization with Zone-based Hierarchical Link State (ZHLS) protocol. Ant colony optimization (ACO) is a class of Swarm Intelligence (SI) algorithms. SI is the local interaction of many simple agents to achieve a global goal. SI is based on social insect for solving different types of problems. ACO algorithm uses mobile agents called ants to explore network. Ants help to find paths between two nodes in the network. Our algorithm is based on ants jump from one zone to the next zones which contains of the proactive routing within a zone and reactive routing between the zones. Our proposed algorithm improves the performance of the network such as delay, packet delivery ratio and overhead than traditional routing algorithms.

  5. ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests

    CERN Document Server

    Kataria, Jayesh; Sanyal, Sugata

    2010-01-01

    Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with control packets. There is generally a limit on the number of these packets that can be generated or forwarded. But a malicious node can disregard this limit and flood the network with fake control packets. These packets hog the limited bandwidth and processing power of genuine nodes in the network while being forwarded. Due to this, genuine route requests suffer and many routes either do not get a chance to materialize or they end up being longer than otherwise. In this paper we propose a non cryptographic solution to the above problem and prove its efficiency by means of simulation.

  6. A Review Paper on Route Maintenance in Stability Based Energy Aware Routing Protocol In MANET

    Directory of Open Access Journals (Sweden)

    Gaurav J. Bhatt*,

    2014-05-01

    Full Text Available Mobile Ad hoc Networks (MANETs are temporary formed, infrastructure-less networks. Due to the mobility in nature of mobile nodes, limited battery, congestion, as well as noise, the problem of link failure causes. The performance metrics degrades due to the unstable channel conditions, network connectivity, and mobility and resource limitations. The goal of this paper is to review papers that finds most reliable and energy aware route that is impervious to failures by topological changes by mobile node mobility or lack of energy and various route maintenance approaches in order to establish stable, long lasting route and reduce link failure and packet drops. Make before break mechanism used to achieve route maintenance that predicts link failure before it actually breaks and find alternate route towards destination to avoid unpredictable link failure. Performance increases by considering various parameters like signal strength, energy of node, congestion, noise instead of the minimum hop count approach of the default distance vector algorithm. Keywords -

  7. Dahomey Breeding Bird Survey Route

    Data.gov (United States)

    US Fish and Wildlife Service, Department of the Interior — Document contains route directions and map for the naitonal Dahomey BBS route. Includes milage for where specific listening stations are located along the route...

  8. Class network routing

    Science.gov (United States)

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    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.

  9. Analyzing combined vehicle routing and break scheduling from a distributed decision making perspective

    OpenAIRE

    C.M. Meyer; Kok, A.L.; H Kopfer; Schutten, J.M.J.

    2009-01-01

    We analyze the problem of combined vehicle routing and break scheduling from a distributed decision making perspective. The problem of combined vehicle routing and break scheduling can be defined as the problem of finding vehicle routes to serve a set of customers such that a cost criterion is minimized and legal rules on driving and working hours are observed. In the literature, this problem is always analyzed from a central planning perspective. In practice, however, this problem is solved ...

  10. Hybrid laser-arc welding

    DEFF Research Database (Denmark)

    Hybrid laser-arc welding (HLAW) is a combination of laser welding with arc welding that overcomes many of the shortfalls of both processes. This important book gives a comprehensive account of hybrid laser-arc welding technology and applications. The first part of the book reviews...... the characteristics of the process, including the properties of joints produced by hybrid laser-arc welding and ways of assessing weld quality. Part II discusses applications of the process to such metals as magnesium alloys, aluminium and steel as well as the use of hybrid laser-arc welding in such sectors as ship...... building and the automotive industry. With its distinguished editor and international team of contributors, Hybrid laser-arc welding, will be a valuable source of reference for all those using this important welding technology. Professor Flemming Ove Olsen works in the Department of Manufacturing...

  11. Our Brothers' Keepers: Secure Routing with High Performance

    CERN Document Server

    Brodsky, Alex

    2008-01-01

    The Trinity (Brodsky et al., 2007) spam classification system is based on a distributed hash table that is implemented using a structured peer-to-peer overlay. Such an overlay must be capable of processing hundreds of messages per second, and must be able to route messages to their destination even in the presence of failures and malicious peers that misroute packets or inject fraudulent routing information into the system. Typically there is tension between the requirements to route messages securely and efficiently in the overlay. We describe a secure and efficient routing extension that we developed within the I3 (Stoica et al. 2004) implementation of the Chord (Stoica et al. 2001) overlay. Secure routing is accomplished through several complementary approaches: First, peers in close proximity form overlapping groups that police themselves to identify and mitigate fraudulent routing information. Second, a form of random routing solves the problem of entire packet flows passing through a malicious peer. Thi...

  12. Comprehensive restoration performance analyzed under different routing and rerouting policies

    Science.gov (United States)

    Lei, Bo; Lee, Peiyuan; Gu, Wanyi

    2005-11-01

    This paper studies the routing and wavelength assignment (RWA) problem in wavelength-routed all-optical networks with dynamic traffic demand. As well known, the performance of network restoration strongly depends upon the routing and rerouting policies. In this letter, we comprehensively analyzed the restoration performance under two main alternate dynamic routing algorithm, LLR(Least Loaded Routing) and FPLC(Fixed-Paths Least-Congestion routing), and two rerouting policies, based on K-path backup or Dijkstra algorithm. Through modelling and simulation, we compute the restoration efficiencies of four combinations on the NSFNET T1 backbone network, with different traffic load. The numerical simulation result shows that the rerouting policy based on Dijkstra algorithm has improved more 10%-20% performance than the rerouting policy based on K-path backup. The LLR and FPLC routing algorithm achieve the same performance by and large when the same rerouting policy is used.

  13. Great Ellipse Route Planning Based on Space Vector

    Directory of Open Access Journals (Sweden)

    LIU Wenchao

    2015-07-01

    Full Text Available Aiming at the problem of navigation error caused by unified earth model in great circle route planning using sphere model and modern navigation equipment using ellipsoid mode, a method of great ellipse route planning based on space vector is studied. By using space vector algebra method, the vertex of great ellipse is solved directly, and description of great ellipse based on major-axis vector and minor-axis vector is presented. Then calculation formulas of great ellipse azimuth and distance are deduced using two basic vectors. Finally, algorithms of great ellipse route planning are studied, especially equal distance route planning algorithm based on Newton-Raphson(N-R method. Comparative examples show that the difference of route planning between great circle and great ellipse is significant, using algorithms of great ellipse route planning can eliminate the navigation error caused by the great circle route planning, and effectively improve the accuracy of navigation calculation.

  14. Locating Depots for Capacitated Vehicle Routing

    CERN Document Server

    Goertz, Inge Li

    2011-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input 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 that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for this problem. To achieve this result, we reduce to the k-median-forest problem, which generalizes both k-median and minimum spanning tree, and which might be of independent interest. We give a (3+c)-approximation algorithm for k-median-forest, which leads to a (12+c)-approximation algorithm for the above location-routing problem, for any constant c>0. The algorithm for k-median-forest is just t-swap local search, and we prove that it has locality gap 3+2/t; this generalizes the corresponding result known for k-median. Finally we consider the "non-uniform" k-median-forest problem which has different cost ...

  15. Application Research of Hybrid ant Colony Algorithm in Vehicle Routing Problem with Time Windows%一种带时间窗车辆路径问题的混合蚁群算法

    Institute of Scientific and Technical Information of China (English)

    黄震; 罗中良; 黄时慰

    2015-01-01

    A hybrid ant colony algorithm was proposed.Because,ant colony algorithm used to solve the vehicle routing problem with time windows (VRPTW)is easy to fall into local optimum,and the quality of initial population in genetic algorithm affects the effectiveness of the algorithm directly.Firstly,the al-gorithm introduces the factors of time windows into node selection probability formula of ant colony algo-rithm to get the initial population.Secondly,the crossover and the mutation were operated to get a better path for the initial population.Applying Matlab environment for hybrid algorithm simulation,the effects on the vehicle utilization and path planning is obvious.It shows the algorithm is efficient,and can avoid falling into local optimum.%针对带时间窗车辆路径问题求解时蚁群算法存在容易陷入局部最优,而遗传算法初始种群的优劣对算法有效性存在直接影响,提出一种混合蚁群优化算法。算法首先在蚁群算法的节点选择概率公式中引入时间窗因素,以得到初始种群,然后通过遗传算法的交叉算子和变异算子对初始种群中的较优路径进行交叉和变异操作,从而得到更优的路径。通过 Matlab 环境下对文中混合算法进行仿真实验,在车辆利用率和路径规划上效果明显,表明了算法的高效性,同时混合算法可以避免陷入局部最优。

  16. Gas tungsten arc welder

    International Nuclear Information System (INIS)

    A welder for automated closure of fuel pins by a gas tungsten arc process in which a rotating length of cladding is positioned adjacent a welding electrode in a sealed enclosure. An independently movable grinder, co-axial with the electrode, is provided in the enclosure for refurbishing the used electrode between welds. The specification also discloses means for loading of the cladding with fuel pellets and for placement of reflectors, gas capsules and end caps. Gravity feed conveyor and inerting means are also described. (author)

  17. Investigation of pellet acceleration by an arc heated gas gun

    International Nuclear Information System (INIS)

    This report describes work on pellet acceleration by means of an arc heated gas gun. The work is a continuation of the work described in RISO-M-2536. The aim of the work is to obtain velocities well above 2 km/s for 3.2 mm diameter deuterium pellets. By means of a cryogenic arc chamber in which the hydrogen propellant is pre-condensed, extruded deutetrium pellets are accelerated up to a maximum velocity of 1.93 km/s. When increasing the energy input to the arc in order to increase the pellet velocity further the heat input to the extrusion/punching pellet loading mechanism was found to be critical: preparation of pellets became difficult and cooling times between shots became inconveniently long. In order to circumvent this problems the concept of a room temperature hydrogen propellant pellet fed arc chamber was proposed. Preliminary results from acceleration of polyurethane pellets with this arc chamber are described as well as the work of developing of feed pellet guns for this chamber. Finally the report describes design consideration for a high pressure propellant pellet fed arc chamber together with preliminary results obtained with a proto-type arc chamber. (author)

  18. EFFECT OF MOBILITY MODELS ON THE PERFORMANCE OF MULTIPATH ROUTING PROTOCOL IN MANET

    OpenAIRE

    Indrani Das; Lobiyal, D. K.; C.P.Katti

    2014-01-01

    In this paper, we have analyzed the performance of multipath routing protocol with various mobility models for Mobile Ad Hoc Networks. The basic purpose of any multipath routing protocol is to overcome various problems occurs while data delivery through a single path routing protocol. For high acceptability of routing protocol, analysis of routing protocol in ad hoc network only with random way point mobility model is not sufficient. Here, we have considered Random waypoint, Ra...

  19. Evaluation of Flood Routing Techniques for Incremental Damage Assessment

    OpenAIRE

    Jayyousi, Enan Fakhri

    1994-01-01

    Incremental damage assessment is a tool used to assess the justification for expensive modifications of inadequate dams. The input data to incremental damage assessment are the output from the breach analysis and flood routing. For this reason, flood routing should be conducted carefully. Distorted results from the flood routing technique or unstable modeling of the problem will distort the results of an incremental damage assessment, because an error in the estimated incremental stage will c...

  20. Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

    OpenAIRE

    2015-01-01

    Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the ...

  1. BALANCE ROUTING TRAFFIC IN GENERALIZED SHUFFLE-EXCHANGE NETWORK

    Institute of Scientific and Technical Information of China (English)

    Chen Zhen; Liu Zengji; Qiu Zhiliang; Chen Peng; Tao Xiaoming

    2005-01-01

    A methodology is proposed to handle problem that under equiproble address of packet traffic at the input port, Generalized Shuffle-Exchange Network (GSEN) routes traffic unevenly because of the unbalanced routing tags. The idea is to use routing tag according to probability, which can be evaluated by using Moore-Penrose inverse in matrix analysis. An instance is used to illustrate the idea, and the simulation is done to show the improvement in performance issues.

  2. Geocasting and Multicasting Routing Operation in Mobile Ad Hoc Network

    OpenAIRE

    R.Kruthika

    2013-01-01

    The paper considers, the different multicasting routing protocols in wireless mobile Ad hoc network (MANET).An Ad hoc network is composed of mobile nodes without the presence of a wired support infrastructure .In this environment routing/multicasting protocols are faced with the challenge of producing multihop router under host mobility and band constraints. Various approaches and routing protocol have been proposed to address Ad hoc networking problems and multiple standardization effort wit...

  3. Modeling Routing Overhead Generated by Wireless Reactive Routing Protocols

    CERN Document Server

    Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A

    2011-01-01

    In this paper, we have modeled the routing over- head generated by three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by reactive protocols consists of two phases; route discovery and route maintenance. Total cost paid by a protocol for efficient routing is sum of the cost paid in the form of energy consumed and time spent. These protocols majorly focus on the optimization performed by expanding ring search algorithm to control the flooding generated by the mechanism of blind flooding. So, we have modeled the energy consumed and time spent per packet both for route discovery and route maintenance. The proposed framework is evaluated in NS-2 to compare performance of the chosen routing protocols.

  4. Electric arc welding gun

    Science.gov (United States)

    Luttrell, Edward; Turner, Paul W.

    1978-01-01

    This invention relates to improved apparatus for arc welding an interior joint formed by intersecting tubular members. As an example, the invention is well suited for applications where many similar small-diameter vertical lines are to be welded to a long horizontal header. The improved apparatus includes an arc welding gun having a specially designed welding head which is not only very compact but also produces welds that are essentially free from rolled-over solidified metal. The welding head consists of the upper end of the barrel and a reversely extending electrode holder, or tip, which defines an acute angle with the barrel. As used in the above-mentioned example, the gun is positioned to extend upwardly through the vertical member and the joint to be welded, with its welding head disposed within the horizontal header. Depending on the design of the welding head, the barrel then is either rotated or revolved about the axis of the vertical member to cause the electrode to track the joint.

  5. Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem || Branch-and-Price y generación heurística de columnas para el problema generalizado de rutas de trenes de carretera

    Directory of Open Access Journals (Sweden)

    Drexl, Michael

    2011-01-01

    Full Text Available The generalized truck-and-trailer routing problem (GTTRP constitutes a unified model for vehicle routing problems with trailers and a fixed lorry-trailer assignment. The GTTRP is a generalization of the truck-and-trailer routing problem (TTRP, which itself is an extension of the well-known vehicle routing problem (VRP. In the GTTRP, the vehicle fleet consists of single lorries and lorry-trailer combinations. Some customers may be visited only by a single lorry or by a lorry without its trailer, some may also be visited by a lorry-trailer combination. In addition to the customer locations, there is another relevant type of location, called transshipment location, where trailers can be parked and where a load transfer from a lorry to its trailer can be performed. In this paper, two mixed-integer programming (MIP formulations for the GTTRP are presented. Moreover, an exact solution procedure for the problem, a branch-and-price algorithm, and heuristic variants of this algorithm are described. Computational experiments with the algorithms are presented and discussed. The experiments are performed on randomly generated instances structured to resemble real-world situations and on TTRP benchmark instances from the literature. The results of the experiments show that instances of realistic structure and size can be solved in short time and with high solution quality by a heuristic algorithm based on column generation. || El problema generalizado de rutas de trenes de carretera (generalized truck-and-trailer routing problem, GTTRP constituye un modelo unificado para problemas de rutas de vehículos con remolques y asignación fija camión-remolque. El GTTRP es una generalización del truck-and-trailer routing problem (TTRP, que es una extensión del conocido problema de rutas de vehículos (vehicle routing problem, VRP. En el GTTRP, la flota de vehículos consiste en camiones sin remolque (camiones solos y trenes de carretera. Algunos clientes pueden

  6. Multirate Anypath Routing in Wireless Mesh Networks

    CERN Document Server

    Laufer, Rafael

    2008-01-01

    In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there is no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We bridge this gap by introducing a polynomial-time algorithm to this problem and provide the proof of its optimality. The proposed algorithm runs in the same running time as regular shortest-path algorithms and is therefore suitable for deployment in link-state routing protocols. We conducted experiments in a 802.11b testbed network, and our results show that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, p...

  7. The Route Analysis Based On Flight Plan

    Science.gov (United States)

    Feriyanto, Nur; Saleh, Chairul; Fauzi, Achmad; Rachman Dzakiyullah, Nur; Riza Iwaputra, Kahfi

    2016-02-01

    Economic development effects use of air transportation since the business process in every aspect was increased. Many people these days was prefer using airplane because it can save time and money. This situation also effects flight routes, many airlines offer new routes to deal with competition. Managing flight routes is one of the problems that must be faced in order to find the efficient and effective routes. This paper investigates the best routes based on flight performance by determining the amount of block fuel for the Jakarta-Denpasar flight route. Moreover, in this work compares a two kinds of aircraft and tracks by calculating flight distance, flight time and block fuel. The result shows Jakarta-Denpasar in the Track II has effective and efficient block fuel that can be performed by Airbus 320-200 aircraft. This study can contribute to practice in making an effective decision, especially helping executive management of company due to selecting appropriate aircraft and the track in the flight plan based on the block fuel consumption for business operation.

  8. Grid data extraction algorithm for ship routing

    Science.gov (United States)

    Li, Yuankui; Zhang, Yingjun; Yue, Xingwang; Gao, Zongjiang

    2015-05-01

    With the aim of extracting environmental data around routes, as the basis of ship routing optimization and other related studies, this paper, taking wind grid data as an example, proposes an algorithm that can effectively extract the grid data around rhumb lines. According to different ship courses, the algorithm calculates the wind grid index values in eight different situations, and a common computational formula is summarised. The wind grids around a ship route can be classified into `best-fitting' grids and `additional' grids, which are stored in such a way that, for example, when the data has a high-spacing resolution, only the `best-fitting' grids around ship routes are extracted. Finally, the algorithm was implemented and simulated with MATLAB programming. As the simulation results indicate, the algorithm designed in this paper achieved wind grid data extraction in different situations and further resolved the extraction problem of meteorological and hydrogeological field grids around ship routes efficiently. Thus, it can provide a great support for optimal ship routing related to meteorological factors.

  9. Route selection issues for NWPA shipments

    International Nuclear Information System (INIS)

    Questions surrounding the designation of routes for the movement of spent nuclear fuel (SNF) and high-level radioactive waste (HLW) by the Office of Civilian Radioactive Waste Management (OCRWM) have broad implications. Federal regulations prescribe rules to be applied in the selection of highway routes. In most cases, these rules will lead to a clear selection of one route between an origin and destination point. However, in other cases, strict application of the regulations does not result in a clear choice of a preferred route. The regulations also provide discretion to State governments and carriers to select alternative routes to enhance the safety of the shipment. Railroad shipments of radioactive materials are not subject to Federal routing regulations. Since the railroads operate on private property, it has been assumed that they know the best way to move freight on their system. This discretion, while desirable for addressing unique local safety concerns or for responding to temporary safety concerns such as road problems, weather conditions, or construction areas, leads to significant opportunity for misunderstandings and uneasiness on the part of local residents

  10. PERFORMANCE EVALUATION OF VANETS ROUTING PROTOCOLS

    Directory of Open Access Journals (Sweden)

    Abduladhim Ashtaiwi

    2014-11-01

    Full Text Available Lately, the concept of VANETs (Vehicular Ad hoc Networks has gotten a huge attention as more wireless communication technologies becoming available. Such networkis expected to be one of the most valuable technology for improving efficiency and safety of the future transportation. Vehicular networks are characterized by high mobility nodes which pose many communication challenging problems. In vehicular networks, routing Collision Avoidance Messages (CAMs among vehicles is a key communication problem.Failure in routing CAMs to their intended destination within the time constraint can render these messages useless. Many routing protocols have been adapted for VANETs, such as DSDV (Destination Sequenced Distance Vector, AODV (Ad-hoc On demand Distance Vector, and DSR (Dynamic Source Routing. This work compares the performance of those routing protocols at different driving environments and scenarios created by using the mobility generator (VanetMobiSim and network simulator(NS2. The obtained results at different vehicular densities, speeds, road obstacles, lanes, traffic lights, and transmission ranges showed that on average AODV protocol outperforms DSR and DSDV protocols in packet delivery ratio and end-toend delay. However, at certain circumstances (e.g., at shorter transmission ranges DSR tends to have better performance than AODV and DSDV protocols.

  11. Multihop Wireless Networks Opportunistic Routing

    CERN Document Server

    Zeng, Kai; Li, Ming

    2011-01-01

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

  12. Integrated cargo routing and ship scheduling in liner shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    The problem consists of creating routes and schedules for a heterogeneous fleet of ships while determining the cargo routing and the speed for all relevant port pair/ship combinations. Transshipment is allowed in ports with transshipment capabilities. The service frequency is fixed at one week...

  13. Collective network routing

    Science.gov (United States)

    Hoenicke, Dirk

    2014-12-02

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

  14. Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.

    OpenAIRE

    Trdlicka, J.; Hanzalek, Z.

    2010-01-01

    This work proposes a distributed algorithm for energy optimal routing in a wireless sensor network. The routing problem is described as a mathematical problem by the minimum-cost multi-commodity network flow problem. Due to the separability of the problem, we use the duality theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or knowledge of the whole network structure. Each node only needs to know the flow whi...

  15. Roots and routes

    DEFF Research Database (Denmark)

    Christensen, Ann-Dorte; Jensen, Sune Qvotrup

    2011-01-01

    arguing that there is a dynamic interplay between roots and routes in people's lives. The empirical point of departure is narratives about roots and routes by ethnic minorities settled in Aalborg East, an underprivileged neighbourhood in northern Denmark. One of the main findings is a gap between the...... somewhat paradoxical finding is that it appears to be more difficult for transnational migrants to maintain their roots in the country of origin when they go back than it was to establish new roots in the host country...

  16. Torch Route Twist

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    San Francisco changes Olympic flame route due to security fears The city of San Francisco,the only North American stop for the 2008 Beijing Olympic torch,surprised thousands of supporters,demon- strators and visitors on April 9,by com- pletely changing the planned torch route at the last minute without notification. As scheduled,the torch was expected to start from the McCovey Cove in the south- east of the city at 1:00 p.m.before heading along the waterfront northbound to famous tourist spot Fisherman’s Wharf and finally

  17. Route based forecasting

    Science.gov (United States)

    Zuurendonk, I. W.; Wokke, M. J. J.

    2009-09-01

    Road surface temperatures can differ several degrees on a very short distance due to local effects. In order to get more insight in the local temperature differences and to develop safer gritting routes, Meteogroup has developed a system for route based temperature forecasting. The standard version of the road model is addressed to forecast road surface temperature and condition for a specific location. This model consists of two parts. First a physical part, based on the energy balance equations. The second part of the model performs a statistical correction on the calculated physical road surface temperature. The road model is able to create a forecast for one specific location. From infrared measurements, we know that large local differences in road surface temperature exist on a route. Differences can be up to 5 degrees Celsius over a distance of several hundreds of meters. Based on those measurements, the idea came up to develop a system that forecasts road surface temperature and condition for an entire route: route based forecasting. The route is split up in sections with equal properties. For each section a temperature and condition will be calculated. The main factors that influence the road surface temperature are modelled in this forecasting system: •The local weather conditions: temperature, dew point temperature, wind, precipitation, weather type, cloudiness. •The sky view: A very sheltered place will receive less radiation during daytime and emit less radiation during nighttime. For a very open spot, the effects are reversed. •The solar view: A road section with trees on the southern side, will receive less solar radiation during daytime than a section with tress on the southern side. The route based forecast shows by means of a clear Google Maps presentation which sections will be slippery at what time of the coming night. The final goal of this type of forecast, is to make dynamical gritting possible: a variable salt amount and a different

  18. Of Eggs and Arcs

    Science.gov (United States)

    Burns, Joseph A.; Thomas, P. C.; Helfenstein, P.; Tiscareno, M. S.; Hedman, M. M.; Agarwal, M.

    2012-10-01

    New scenarios for the origins of Saturn’s rings/interior moons have directed scientific attention to the region just exterior to Saturn’s main rings. Four satellites (Aegaeon = Ae; Anthe = An; Methone = Me; Pallene = Pa) discovered by the Cassini mission on either side of Mimas’s orbit perhaps comprise a distinct class of ring-moon. They are tiny (R = 0.3-2.5 km); three (AeAnMe) are trapped in co-rotation resonances with Mimas and reside within ring-arcs; and at least two (MePa) have remarkably regular shapes. Images with pixel scales as fine as 27 m taken in May 2012 reveal Methone to be ovoid within 10 m (from sub-pixel limb detection) and devoid of any craters (>130 m) across its 9 km2 of surface; Pallene and even tiny Aegaeon have similar appearances in lesser-quality images. Numerical simulations demonstrate that particles comprising the surrounding ring-arcs populate the same resonances as their embedded moons; escape speeds from the moons are bodies. In this environment, the moons’ shapes are smooth equipotentials; electrostatic effects may also determine how grains settle to surfaces. Considering these shapes to represent equipotential surfaces for rotating, tidally distorted, homogeneous bodies, we infer mean satellite densities of 250+/-60 (Pa), 310+/-30 (Me), and 540+/-120 (Ae) kg m-3. About half of Methone’s leading hemisphere is covered by a sharply bounded, lemon-shaped, relatively dark region, having a form reminiscent of Mimas’s thermal anomaly (Howett et al. 2011). Its (601 nm) albedo is 13% lower than the bounding brighter material. An irregularly shaped, even-darker (by 4%) blotch straddles the apex of the moon’s motion. Impacts with circum-planetary meteoroids and plasma are likely responsible for these features.

  19. SET-Routes programme

    CERN Multimedia

    Marietta Schupp, EMBL Photolab

    2008-01-01

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

  20. SET-Routes programme

    CERN Multimedia

    CERN audiovisual service

    2009-01-01

    The SET-Routes programme, launched in 2007 with the goal of attracting girls and young women to careers in science, came to an end in April this year. The result of a collaboration between EMBL, EMBO and CERN, the programme established a network of "ambassadors", women scientists who went out to talk about their careers in science at schools and universities across Europe.

  1. Whirlpool routing for mobility

    KAUST Repository

    Lee, Jung Woo

    2010-01-01

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

  2. Arc Interference Behavior during Twin Wire Gas Metal Arc Welding Process

    Directory of Open Access Journals (Sweden)

    Dingjian Ye

    2013-01-01

    Full Text Available In order to study arc interference behavior during twin wire gas metal arc welding process, the synchronous acquisition system has been established to acquire instantaneous information of arc profile including dynamic arc length variation as well as relative voltage and current signals. The results show that after trailing arc (T-arc is added to the middle arc (M-arc in a stable welding process, the current of M arc remains unchanged while the agitation increases; the voltage of M arc has an obvious increase; the shape of M arc changes, with increasing width, length, and area; the transfer frequency of M arc droplet increases and the droplet itself becomes smaller. The wire extension length of twin arc turns out to be shorter than that of single arc welding.

  3. Optimal partial-arcs in VMAT treatment planning

    CERN Document Server

    Wala, Jeremiah; Chen, Wei; Craft, David

    2012-01-01

    Purpose: To improve the delivery efficiency of VMAT by extending the recently published VMAT treatment planning algorithm vmerge to automatically generate optimal partial-arc plans. Methods and materials: A high-quality initial plan is created by solving a convex multicriteria optimization problem using 180 equi-spaced beams. This initial plan is used to form a set of dose constraints, and a set of partial-arc plans is created by searching the space of all possible partial-arc plans that satisfy these constraints. For each partial-arc, an iterative fluence map merging and sequencing algorithm (vmerge) is used to improve the delivery efficiency. Merging continues as long as the dose quality is maintained above a user-defined threshold. The final plan is selected as the partial arc with the lowest treatment time. The complete algorithm is called pmerge. Results: Partial-arc plans are created using pmerge for a lung, liver and prostate case, with final treatment times of 127, 245 and 147 seconds. Treatment times...

  4. LBR: Load Balancing Routing Algorithm for Wireless Sensor Networks

    Science.gov (United States)

    Daabaj, Khaled; Dixon, Mike; Koziniec, Terry

    2010-06-01

    Homogeneous wireless sensor networks (WSNs) are organized using identical sensor nodes, but the nature of WSNs operations results in an imbalanced workload on gateway sensor nodes which may lead to a hot-spot or routing hole problem. The routing hole problem can be considered as a natural result of the tree-based routing schemes that are widely used in WSNs, where all nodes construct a multi-hop routing tree to a centralized root, e.g., a gateway or base station. For example, sensor nodes on the routing path and closer to the base station deplete their own energy faster than other nodes, or sensor nodes with the best link state to the base station are overloaded with traffic from the rest of the network and experience a faster energy depletion rate than their peers. Routing protocols for WSNs are reliability-oriented and their use of reliability metric to avoid unreliable links makes the routing scheme worse. However, none of these reliability oriented routing protocols explicitly uses load balancing in their routing schemes. Since improving network lifetime is a fundamental challenge of WSNs, we present, in this chapter, a novel, energy-wise, load balancing routing (LBR) algorithm that addresses load balancing in an energy efficient manner by maintaining a reliable set of parent nodes. This allows sensor nodes to quickly find a new parent upon parent loss due to the existing of node failure or energy hole. The proposed routing algorithm is tested using simulations and the results demonstrate that it outperforms the MultiHopLQI reliability based routing algorithm.

  5. High current electric arcs; Les arcs electriques a fort courant

    Energy Technology Data Exchange (ETDEWEB)

    Delalondre, C.; Simonin, O. [Electricite de France (EDF), 78 - Chatou (France). Lab. National d' Hydraulique; Mineau, L. [Electricite de France (EDF), 75 - Paris (France). Dept. Systemes Energetiques; Verite, J.C. [Electricite de France (EDF), 75 - Paris (France). Dept. Cables, Condensateurs, Materiel d' Automatisme et Materiaux

    1999-07-01

    The mechanisms called into play through the interaction between a high current electric arc and the surrounding environment have an essential role to play in the performance of arc furnaces and high voltage circuit breakers. Our knowledge of them remains poor, and because of the very high temperatures and speeds involved, experimental investigation is particularly difficult. What can numerical modelling teach us about these phenomena? (authors)

  6. Routing-based synthesis of digital microfluidic biochips

    DEFF Research Database (Denmark)

    Maftei, Elena; Pop, Paul; Madsen, Jan

    2012-01-01

    electrodes are considered occupied during the operation execution, although the droplet uses only one electrode at a time. Moreover, the operations can actually be performed by routing the droplets on any sequence of electrodes on the microfluidic array. Hence, in this paper, we eliminate the concept...... of virtual devices and allow the droplets to move on the chip on any route during operation execution. Thus, the synthesis problem is transformed into a routing problem. We develop an algorithm based on a Greedy Randomized Adaptive Search Procedure (GRASP) and we show that routing-based synthesis leads...... to significant improvements in the application completion time compared to traditional synthesis based on virtual devices. However, the disadvantage of the routing-based approach is that it may contaminate larger areas of the biochip, when synthesizing applications containing liquids which may adsorb...

  7. Voltage Node Arcing in the ICRH Antenna Vacuum Transmission Lines at JET

    International Nuclear Information System (INIS)

    The observation of parasitic low-VSWR activity during operations of JET RF plant and the damage caused by arcing at the voltage-node in the vacuum transmission line (VTL) in 2004 highlight the importance of the problem of low-voltage breakdown in the ICRH systems. Simulations demonstrate little response of the RF circuit to the voltage-node arcing which explains why it remains largely unnoticed and complicates the design of protection systems. Analysis of the damage pattern produced by the voltage-node arcing suggests that multipactor-related phenomena occurring at elevated voltage thresholds in conditions of unfavorable VTL geometry are most plausible arc-provoking factors

  8. Voltage Node Arcing in the ICRH Antenna Vacuum Transmission Lines at JET

    Science.gov (United States)

    Monakhov, I.; Bobkov, V.; Graham, M.; Mayoral, M.-L.; Nicholls, K.; Walden, A.

    2007-09-01

    The observation of parasitic low-VSWR activity during operations of JET RF plant and the damage caused by arcing at the voltage-node in the vacuum transmission line (VTL) in 2004 highlight the importance of the problem of low-voltage breakdown in the ICRH systems. Simulations demonstrate little response of the RF circuit to the voltage-node arcing which explains why it remains largely unnoticed and complicates the design of protection systems. Analysis of the damage pattern produced by the voltage-node arcing suggests that multipactor-related phenomena occurring at elevated voltage thresholds in conditions of unfavorable VTL geometry are most plausible arc-provoking factors.

  9. 38: Optimization of electron arc therapy doses by dynamic collimator control

    International Nuclear Information System (INIS)

    The problem of delivering a uniform dose to a large curved surface such as a patient's chest wall has been addressed by the technique of electron arc therapy. Prospective computer simulations show that a dramatic improvement in dose uniformity can, in many clinical situations, be achieved by dynamic shaping of the electron arc collimator, under computer control, as a function of gantry angle and distance superior or inferior to the central plane. Computer optimization techniques applied to the design of a multivane dynamic electron arc collimator is presented, along with representative treatment plans resulting from inclusion of this dynamic technique in electron arc therapy. 17 refs.; 5 figs

  10. Robust routing mechanisms for intradomain traffic engineering in dynamic networks

    OpenAIRE

    Casas Hernandez, Pedro; Larroca, Federico; Vaton, Sandrine

    2009-01-01

    Internet traffic is highly dynamic and difficult to predict in current network scenarios. This makes of traffic engineering (TE) a very challenging task for network management and resources optimization. We study the problem of intradomain routing optimization under this traffic uncertainty. Recent works have proposed robust optimization techniques to tackle the problem, conceiving the robust routing (RR) approach. RR copes with traffic uncertainty in an off-line preemptive fashion, computing...

  11. Mobile Anonymous Trust Based Routing Using Ant Colony Optimization

    OpenAIRE

    R. KALPANA; N. Rengarajan

    2012-01-01

    Problem statement: Ad hoc networks are susceptible to malicious attacks through denial of services, traffic analysis and spoofing. The security of the ad hoc routing protocol depends upon encryption, authentication, anonymity and trust factors. End-to-end security of data is provided by encryption and authentication, topology information of the nodes can be obtained by studying traffic and routing data. This security problem of ad hoc network is addressed by the use of anonymity mechanisms an...

  12. Fuzzy Optimized Metric for Adaptive Network Routing

    Directory of Open Access Journals (Sweden)

    Ahmad Khader Haboush

    2012-04-01

    Full Text Available Network routing algorithms used today calculate least cost (shortest paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .

  13. Low Carbon Footprint Routes for Bird Watching

    Directory of Open Access Journals (Sweden)

    Wei-Ta Fang

    2015-03-01

    Full Text Available Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA and genetic algorithms (GA. We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes.

  14. Optimization-Based Channel Constrained Data Aggregation Routing Algorithms in Multi-Radio Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Hong-Hsu Yen

    2009-06-01

    Full Text Available In wireless sensor networks, data aggregation routing could reduce the number of data transmissions so as to achieve energy efficient transmission. However, data aggregation introduces data retransmission that is caused by co-channel interference from neighboring sensor nodes. This kind of co-channel interference could result in extra energy consumption and significant latency from retransmission. This will jeopardize the benefits of data aggregation. One possible solution to circumvent data retransmission caused by co-channel interference is to assign different channels to every sensor node that is within each other’s interference range on the data aggregation tree. By associating each radio with a different channel, a sensor node could receive data from all the children nodes on the data aggregation tree simultaneously. This could reduce the latency from the data source nodes back to the sink so as to meet the user’s delay QoS. Since the number of radios on each sensor node and the number of non-overlapping channels are all limited resources in wireless sensor networks, a challenging question here is to minimize the total transmission cost under limited number of non-overlapping channels in multi-radio wireless sensor networks. This channel constrained data aggregation routing problem in multi-radio wireless sensor networks is an NP-hard problem. I first model this problem as a mixed integer and linear programming problem where the objective is to minimize the total transmission subject to the data aggregation routing, channel and radio resources constraints. The solution approach is based on the Lagrangean relaxation technique to relax some constraints into the objective function and then to derive a set of independent subproblems. By optimally solving these subproblems, it can not only calculate the lower bound of the original primal problem but also provide useful information to get the primal feasible solutions. By incorporating these

  15. Radiation Power Affected by Current and Wall Radius in Water Cooled Vortex Wall-stabilized Arc

    Science.gov (United States)

    Iwao, Toru; Nakamura, Takaya; Yanagi, Kentaro; Yamamoto, Shinji

    2015-11-01

    The arc lighting to obtain the environment to evacuate, save the life, keep the safety and be comfortable are focus on. The lack of radiation intensity and color rendering is problem because of inappropriate energy balance. Some researchers have researched the arc lamp mixed with metal vapor for improvement of color rendering spectrum. The metal vapor can emit the high intense radiation. In addition, the radiation is derived from the high temperature medium. Because the arc temperature can be controlled by current and arc radius, the radiation can be controlled by the current and arc radius. This research elucidates the radiation power affected by the current and wall radius in wall-stabilized arc of water-cooled vortex type. As a result, the radiation power increases with increasing the square of current / square of wall radius because of the temperature distribution which is derived from the current density at the simulation.

  16. STUDY ON THE PRESSURE IN PLASMA ARC

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    The axial pressure in plasma arc is measured under different conditions. The effects of the parameters, such as welding current, plasma gas flow rate, electrode setback and arc length, on the pressure in plasma arc are investigated and quantitative analyzed to explain the relationship between the quality of weld and the matching of parameters in plasma arc welding process.

  17. Region growing for multi-route cuts

    OpenAIRE

    Barman, Siddharth; Chawla, Shuchi

    2009-01-01

    We study a number of multi-route cut problems: given a graph G=(V,E) and connectivity thresholds k_(u,v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal of which reduces the connectivity between every pair (u,v) to strictly below its given threshold. These problems arise in the context of reliability in communication networks; They are natural generalizations of traditional minimum cut problems where the thresholds are either 1 (we want to completely...

  18. Issues of Routing in VANET

    OpenAIRE

    Raja, Umar Waqas; Mustafa, Bilal

    2010-01-01

    Vehicular Ad Hoc Network (VANET) is a sub class of mobile ad hoc networks. VANET provides wireless communication among vehicles and vehicle to road side equipments. The communication between vehicles is used for safety, comfort and for entertainment as well. The performance of communication depends on how better the routing takes place in the network. Routing of data depends on the routing protocols being used in network. In this study we investigated about different ad hoc routing protocols ...

  19. Alternative iron making routes

    Energy Technology Data Exchange (ETDEWEB)

    Kaushik, P.; Sharma, T. [Indian School of Mines, Dhanbad (India)

    2002-07-01

    The versatile route of iron production 'blast furnace' technique is being replaced by widely accepted Corex technology, Midrex process using Fastmelt ironmaking, eco-friendly Romelt process, more innovative Ausmelt & Hismelt technology, TATA KORF Mini blast furnace improvement, 'quickest iron through Orbiting Plasma', Direct iron ore smelting process, Conred, AISI-Hyl, Inred processes, Direct iron ore reduction methods, their comparison and proposed modifications. 18 refs., 11 figs., 14 tabs.

  20. Newton's Radii, Maupertuis' Arc Length, and Voltaire's Giant

    Science.gov (United States)

    Simoson, Andrew J.

    2011-01-01

    Given two arc length measurements along the perimeter of an ellipse--one taken near the long diameter, the other taken anywhere else--how do you find the lengths of major and minor axes? This was a problem of great interest from the time of Newton's "Principia" until the mid-eighteenth century when France launched twin geodesic expeditions--one to…

  1. Effective local dynamic routing strategy for air route networks

    Institute of Scientific and Technical Information of China (English)

    Wu Wenjun; Zhao Lingxi

    2015-01-01

    With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network (ARN), we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout-ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing (SPR) strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network (CARN) is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.

  2. Novel multi-path routing scheme for UWB Ad hoc network

    Institute of Scientific and Technical Information of China (English)

    XU Ping-ping; YANG Cai-yu; SONG Shu-qing; BI Guang-guo

    2005-01-01

    The routing protocols play an important role for ad hoc networks performance. As some problems with DSR,SMR, and AMR protocols were analyzed, a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper. The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time. Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR. While the node's mobility increases, these advantages become more obvious.

  3. Occurrence of radon in the Polish underground tourist routes

    Directory of Open Access Journals (Sweden)

    Jerzy Olszewski

    2015-08-01

    Full Text Available Background: There are about 200 underground tourist routes in Poland. There are caves, mines or underground structures. This paper presents the results of the research intended to identify the extent of the occurrence of radon concentrations in underground areas of tourist routes. Material and Methods: We conducted the measurement of periodic concentrations of radon (1–2 months in the summer using type Tastrak trace detectors. We determined the average concentrations of radon in air in 66 underground tourist routes in Poland. Results: The research results comprise 259 determinations of average radon concentrations in 66 routes. The arithmetic average of the results was 1610 Bqm–3, and the maximum measured concentration was over 20 000 Bqm–3. The minimum concentration was 100 Bqm–3 (threshold method considering the arithmetic average of the measurements. It was found that in 67% of the routes, the average concentration of radon has exceeded 300 Bqm–3 and in 22 underground routes it exceeded 1000 Bqm–3. Conclusions: Radon which occurs in many Polish underground tourist routes may be an organizational, legal and health problem. It is necessary to develop a program of measures to reduce radon concentrations in underground routes, especially routes located in the former mines. Med Pr 2015;66(4:557–563

  4. AODV routing overhead analysis based on link failure probability in MANET

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qin-juan; WU Mu-qing; ZHEN Yan; SHANG Cui-li

    2010-01-01

    This article puts forward an Ad-hoc on-demand distance vector routing(AODV)routing overhead analysis method in mobile Ad-hoc network(MANET).Although multiple routing protocols have been proposed to improve the performance,scarcely any paper analyzed the routing overhead caused by routing setup and maintenance processes in mathematical way.Routing overhead consumes part of network resources and limits the supported traffic in the network.For on-demand routing protocols like AODV,the routing overhead depends on the link failure probability to a great extent.This article analyzes the collision probability caused by hidden-node problem and the impact on link failure probability.In chain and rectangle scenarios,it presents a mathematical analysis of the theoretical routing overhead of AODV protocol based on link failure probability.Simulations on OPNET 14.5platform match well with the theoretical derivation which confirms the effectiveness of the analysis method.

  5. Robustness of airline route networks

    Science.gov (United States)

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

    2016-03-01

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

  6. Application of Harmony Search to Vehicle Routing

    Directory of Open Access Journals (Sweden)

    Zong W.  Geem

    2005-01-01

    Full Text Available A phenomenon-inspired meta-heuristic algorithm, harmony search, imitating music improvisation process, is introduced and applied to vehicle routing problem, then compared with one of the popular evolutionary algorithms, genetic algorithm. The harmony search algorithm conceptualized a group of musicians together trying to search for better state of harmony. This algorithm was applied to a test traffic network composed of one bus depot, one school and ten bus stops with demand by commuting students. This school bus routing example is a multi-objective problem to minimize both the number of operating buses and the total travel time of all buses while satisfying bus capacity and time window constraints. Harmony search could find good solution within the reasonable amount of time and computation.

  7. Multitasking the code ARC3D. [for computational fluid dynamics

    Science.gov (United States)

    Barton, John T.; Hsiung, Christopher C.

    1986-01-01

    The CRAY multitasking system was developed in order to utilize all four processors and sharply reduce the wall clock run time. This paper describes the techniques used to modify the computational fluid dynamics code ARC3D for this run and analyzes the achieved speedup. The ARC3D code solves either the Euler or thin-layer N-S equations using an implicit approximate factorization scheme. Results indicate that multitask processing can be used to achieve wall clock speedup factors of over three times, depending on the nature of the program code being used. Multitasking appears to be particularly advantageous for large-memory problems running on multiple CPU computers.

  8. Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms

    Directory of Open Access Journals (Sweden)

    Ana Maria Rodrigues

    2012-01-01

    Full Text Available The Rural Postman Problem (RPP is a particular Arc Routing Problem (ARP which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications. This paper introduces an original approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates “social knowledge”, using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications.

  9. Personal continuous route pattern mining

    Institute of Scientific and Technical Information of China (English)

    Qian YE; Ling CHEN; Gen-cai CHEN

    2009-01-01

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

  10. Dosimetric and delivery characterizations of full-arc and half-arc volumetric-modulated arc therapy for maxillary cancer

    International Nuclear Information System (INIS)

    We compared the efficiency and accuracy of full-arc and half-arc volumetric-modulated arc therapy (VMAT) delivery for maxillary cancer. Plans for gantry rotation angles of 360deg and 180deg (full-arc and half-arc VMAT) were created for six maxillary cancer cases with the Monaco treatment planning system, and delivered using an Elekta Synergy linear accelerator. Full-arc and half-arc VMAT were compared with regard to homogeneity index (HI), conformity index (CI), mean dose to normal brain, total monitor units (MU), delivery times, root mean square (r.m.s.) gantry accelerations (deg/s2), and r.m.s. gantry angle errors (deg). The half-arc VMAT plans achieved comparable HI and CI to the full-arc plans. Mean doses to the normal brain and brainstem with the half-arc VMAT plans were on average 16% and 17% lower than those with the full-arc VMAT plans. For other organs at risk (OARs), no significant dose volume histogram (DVH) differences were observed between plans. Half-arc VMAT resulted in 11% less total MU and 20% shorter delivery time than the full-arc VMAT, while r.m.s. gantry acceleration and r.m.s. gantry angle error during half-arc VMAT delivery were 30% and 23% less than those during full-arc VMAT delivery, respectively. Furthermore, the half-arc VMAT plans were comparable with the full-arc plans regarding dose homogeneity and conformity in maxillary cancer, and provided a statistical decrease in mean dose to OAR, total MU, delivery time and gantry angle error. Half-arc VMAT plans may be a suitable treatment option in radiotherapy for maxillary cancer. (author)

  11. An Evolutionary Real-Time 3D Route Planner for Aircraft

    Institute of Scientific and Technical Information of China (English)

    郑昌文; 丁明跃; 周成平

    2003-01-01

    A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time,with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.

  12. Dynamic Route Planning in Vehicular Networks based on Future Travel Time Estimation

    OpenAIRE

    Santi, Paolo; Fontanelli, Stefano; Bini, Enrico

    2010-01-01

    Traffic congestion wastes time, energy, and causes pollution. In this paper, We propose an application taking advantage of vehicular communications, namely dynamic route planning. In dynamic route planning, the route from a travel origin to its destination, instead of being statically determined at the travel starting time, is periodically recomputed according to real-time traffic information. Estimating future travel time is indeed central to the dynamic route planning problem. Since knowing...

  13. Congestion Free Routing in Adhoc Networks

    Directory of Open Access Journals (Sweden)

    V. Sankaranarayanan

    2012-01-01

    Full Text Available Problem statement: A Mobile Ad-Hoc Network (MANET is a temporary network; the mobile devices in an ad-hoc network are communicating through wireless links without any pre-existing infrastructure. The one major problem of this network is network congestion, it may take place at any intermediate nodes when data packets are traveling from source to destination. The major problems of congestion or high data loss, increasing End to End and retransmission packets which affects the overall network performance. The main goal of congestion control is to effectively utilize the existing network resources and maintain the network load below the capacity. Approach: This study presents the Congestion Free Routing in Adhoc networks (CFR, based on dynamically estimated mechanism to monitor network congestion by calculating the average queue length at the node level. While using the average queue length, the nodes’ congestion status divided into the three zones (safe zone, likely to be congested zone and congested zone. CFR utilizes the non-congested neighbors and initiates route discovery mechanism to discover a congestion free route between source and destination. This path becomes a core path between source and destination. To maintain the congestion free status, the nodes which are helping data packet transmission periodically calculate their congestion status at the node level. When a core node is noticed that it fell in to likely to congested zone and alerts to its neighbors. The predecessor core path node is aware of this situation and initiates an alternate path discovery mechanism to a destination. Finally it discovers a new congestion free route to the destination. Results: The assessment between CFR and AODV was conducted by using the Ns-2 simulator. The simulation results confirmed that the CFR improved packet delivery ratio, reduction of End to End delay and control packets. Conclusion: Our proposed technique solved the congestion problems in a

  14. Vehicle Routing and the Value of Postponement

    OpenAIRE

    Asim, Muhammad

    2008-01-01

    Industrial wisdom presumes that postponing the collection (or delivery) services reduces the transportation cost & most of the studies conducted in practical scenarios also substantiate this belief. However there is a dearth of in-depth research assessing the value of postponement in vehicle routing context. This research aims to explore the significance of postponement & its inter-relationship with related problem parameters such as vehicle capacity, clients' density, location of clients & d...

  15. Secure Position-Based Routing for VANETs

    OpenAIRE

    Harsch, Charles; Festag, Andreas; Papadimitratos, Panagiotis

    2007-01-01

    Vehicular communication (VC) systems have the potential to improve road safety and driving comfort. Nevertheless, securing the operation is a prerequisite for deployment. So far, the security of VC applications has mostly drawn the attention of research efforts, while comprehensive solutions to protect the network operation have not been developed. In this paper, we address this problem: we provide a scheme that secures geographic position-based routing, which has been widely accepted as the ...

  16. Uncovering the Missing Routes

    DEFF Research Database (Denmark)

    Tsirogiannis, Constantinos; Tsirogiannis, Christos

    2016-01-01

    In the present work we model and analyse the global network of the illegal trade in antiquities. Our goal is to use this network to estimate for any given artefact the potential sequence of people in the network among whom this artefact was traded. For this reason, we have implemented and evaluated...... three different algorithms that estimate potential trade routes within the network. We also evaluate the performance of a popular method that estimates direct links in the network, links which may not have been documented in the police records....

  17. Innovation in electric arc furnaces scientific basis for selection

    CERN Document Server

    Toulouevski, Yuri N

    2013-01-01

    This book equips a reader with knowledge necessary for critical analysis of  innovations in electric arc furnaces and helps to select the most effective ones and for their successful implementation. The book also covers general issues related to history of development, current state and prospects of steelmaking in Electric Arc Furnaces. Therefore, it can be useful for everybody who studies metallurgy, including students of colleges and universities. The modern concepts of mechanisms of Arc Furnace processes are are discussed in the book at the level sufficient to solve practical problems: To help readers lacking knowledge required in the field of heat transfer as well as hydro-gas dynamics, it contains several chapters which provide the required minimum of information in these fields of science. In order to better assess different innovations, the book describes experience of the application of similar innovations in open-hearth furnaces and oxygen converters. Some promising ideas on key issues regarding int...

  18. Direct Current Electric Arc-Electroslag Ladle Furnace

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In order to solve the high consumption problem of small capacity ladle furnace (LF), the operation principle and control method of the DC arc and electroslag heating ladle furnace are introduced. With only one arcing electrode, the distance between the arc and the wall of ladle is enlarged, and consequently the consumption of the ladle refractory is decreased. In the invention, a signal electrode is embedded in the refractory lining of the ladle, which contacts directly with the liquid steel and the ladle shell. Two graphite anode ends are submerged in the slag layer. The signal electrode is used as voltage reference during refining process. The electroslag voltage between anode end and liquid steel is applied to control the depth of anode end in the slag layer during the refining process with this ladle furnace.

  19. Utilization of steel melting electric arc furnace slag for development of vitreous ceramic tiles

    Indian Academy of Sciences (India)

    Ritwik Sarkar; Nar Singh; Swapan Kumar Das

    2010-06-01

    Steel melting through electric arc furnace route is gaining popularity due to its many advantages, but generates a new waste, electric arc furnace slag, which is getting accumulated and land/mine filling and road construction are the only utilization. This slag has been tried to be value added and utilized to develop vitreous ceramic tiles. Slag, to the extent of 30–40 wt% with other conventional raw materials, were used for the development in the temperature range 1100–1150°C. The fired products showed relatively higher density with shorter firing range and good strength properties. Microstructural and EDAX studies were also done to evaluate the developed products.

  20. Optimization Model for Headway of a Suburban Bus Route

    Directory of Open Access Journals (Sweden)

    Xiaohong Jiang

    2014-01-01

    Full Text Available Due to relatively low passenger demand, headways of suburban bus route are usually longer than those of urban bus route. Actually it is also difficult to balance the benefits between passengers and operators, subject to the service standards from the government. Hence the headway of a suburban bus route is usually determined on the empirical experience of transport planners. To cope with this problem, this paper proposes an optimization model for designing the headways of suburban bus routes by minimizing the operating and user costs. The user costs take into account both the waiting time cost and the crowding cost. The feasibility and validity of the proposed model are shown by applying it to the Route 206 in Jiangning district, Nanjing city of China. Weightages of passengers’ cost and operating cost are further discussed, considering different passenger flows. It is found that the headway and objective function are affected by the weightages largely.

  1. Influence of Gap Distance on Vacuum Arc Characteristics of Cup Type AMF Electrode in Vacuum Interrupters

    Science.gov (United States)

    Cheng, Shaoyong; Xiu, Shixin; Wang, Jimei; Shen, Zhengchao

    2006-11-01

    The greenhouse effect of SF6 is a great concern today. The development of high voltage vacuum circuit breakers becomes more important. The vacuum circuit breaker has minimum pollution to the environment. The vacuum interrupter is the key part of a vacuum circuit breaker. The interrupting characteristics in vacuum and arc-controlling technique are the main problems to be solved for a longer gap distance in developing high voltage vacuum interrupters. To understand the vacuum arc characteristics and provide effective technique to control vacuum arc in a long gap distance, the arc mode transition of a cup-type axial magnetic field electrode is observed by a high-speed charge coupled device (CCD) video camera under different gap distances while the arc voltage and arc current are recorded. The controlling ability of the axial magnetic field on vacuum arc obviously decreases when the gap distance is longer than 40 mm. The noise components and mean value of the arc voltage significantly increase. The effective method for controlling the vacuum arc characteristics is provided by long gap distances based on the test results. The test results can be used as a reference to develop high voltage and large capacity vacuum interrupters.

  2. CO2 laser-micro plasma arc hybrid welding for galvanized steel sheets

    Institute of Scientific and Technical Information of China (English)

    C. H. KIM; Y. N. AHN; J. H. KIM

    2011-01-01

    A laser lap welding process for zinc-coated steel has a well-known unsolved problem-porosity formation. The boiling temperature of coated zinc is lower than the melting temperature of the base metal. which is steel. In the autogenous laser welding,the zinc vapor generates from the lapped surfaces expels the molten pool and the expulsion causes numerous weld defects, such as spatters and blow holes on the weld surface and porosity inside the welds. The laser-arc hybrid welding was suggested as an alternative method for the laser lap welding because the arc can preheat or post-heat the weldment according to the arrangement of the laser beam and the arc. CO2 laser-micro plasma hybrid welding was applied to the lap welding of zinc-coated steel with zero-gap.The relationships among the weld quality and process parameters of the laser-arc arrangement, and the laser-arc interspacing distance and arc current were investigated using a full-factorial experimental design. The effect of laser-arc arrangement is dominant because the leading plasma arc partially melts the upper steel sheets and vaporizes or oxidizes the coated zinc on the lapped surfaces.Compared with the result from the laser-TIG hybrid welding, the heat input from arc can be reduced by 40%.

  3. Arcing phenomena in fusion devices workshop

    International Nuclear Information System (INIS)

    The workshop on arcing phenomena in fusion devices was organized (1) to review the pesent status of our understanding of arcing as it relates to confinement devices, (2) to determine what informaion is needed to suppress arcing and (3) to define both laboratory and in-situ experiments which can ultimately lead to reduction of impurities in the plasma caused by arcing. The workshop was attended by experts in the area of vacuum arc electrode phenomena and ion source technology, materials scientists, and both theoreticians and experimentalists engaged in assessing the importance of unipolar arcing in today's tokamaks. Abstracts for papers presented at the workshop are included

  4. Arcing phenomena in fusion devices workshop

    Energy Technology Data Exchange (ETDEWEB)

    Clausing, R.E.

    1979-01-01

    The workshop on arcing phenomena in fusion devices was organized (1) to review the pesent status of our understanding of arcing as it relates to confinement devices, (2) to determine what informaion is needed to suppress arcing and (3) to define both laboratory and in-situ experiments which can ultimately lead to reduction of impurities in the plasma caused by arcing. The workshop was attended by experts in the area of vacuum arc electrode phenomena and ion source technology, materials scientists, and both theoreticians and experimentalists engaged in assessing the importance of unipolar arcing in today's tokamaks. Abstracts for papers presented at the workshop are included.

  5. Mingling Multipath Routing With Quality Of Service

    Directory of Open Access Journals (Sweden)

    Dr. Shuchita Upadhyaya

    2011-09-01

    Full Text Available The QoS issue in the Internet have become essential for the successful transmission of multimedia applications . The basic problem of QoS routing is to find a path satisfying multiple constraints. It is concerned with identifying the path that will consider multiple parameters like bandwidth, delay, cost, hopcount etc. instead of one .To provide user- or application-level Quality of Service (QoS guarantee Multipath routing strategy can be used for the transmission of QoS sensitive traffic over the network. Multipath routing means using multiple paths instead of using single path to forward the traffic.If multiple paths are being used for the transmission of the traffic then the traffic will be redirected to the back up path if active path fails. In this way robustness can be achieved. On the other hand load balancing for communication network to avoid network congestion optimize network throughput also requires multi paths to distribute flows . Robustness load balancing are aspects of QoS routing . So multipath can be proved very valuable for Quality of service. This paper investigates the approaches of mingling Multipath Quality of service. The approaches considered are based on Dijkstra algorithm, Bellman ford algorithm, Resource reservation MPLS.

  6. Total Marrow Irradiation With RapidArc Volumetric Arc Therapy

    International Nuclear Information System (INIS)

    Purpose: To develop a volumetric arc therapy (VMAT)-total marrow irradiation (TMI) technique for patients with hematologic malignancies. Methods and Materials: VMAT planning was performed for 6 patients using RapidArc technology. The planning target volume consisted of all the bones in the body from the head to the mid-femur, excluding the extremities, except for the humerus, plus a 3.0-mm margin. The organs at risk included the lungs, heart, liver, kidneys, bowels, brain, eyes, and oral cavity. The VMAT-TMI technique consisted of three plans: the head and neck, the chest, and the pelvis, each with three 330o arcs. The plans were prescribed to ensure, at a minimum, 95% planning target volume dose coverage with the prescription dose (percentage of volume receiving dose of ≥12 Gy was 95%). The treatments were delivered and verified using MapCheck and ion chamber measurements. Results: The VMAT-TMI technique reported in the present study provided comparable dose distributions with respect to the fixed gantry linear accelerator intensity-modulated TMI. RapidArc planning was less subjective and easier, and, most importantly, the delivery was more efficient. RapidArc reduced the treatment delivery time to approximately 18 min from 45 min with the fixed gantry linear accelerator intensity-modulated TMI. When the prescription dose coverage was reduced to 85% from 95% and the mandible and maxillary structures were not included in the planning target volume as reported in a tomotherapy study, a considerable organ at risk dose reduction of 4.2-51% was observed. The average median dose for the lungs and lenses was reduced to 5.6 Gy from 7.2 Gy and 2.4 Gy from 4.5 Gy, respectively. Conclusion: The RapidArc VMAT technique improved the treatment planning, dose conformality, and, most importantly, treatment delivery efficiency. The results from our study suggest that the RapidArc VMAT technology can be expected to facilitate the clinical transition of TMI.

  7. A Cross Unequal Clustering Routing Algorithm for Sensor Network

    Science.gov (United States)

    Tong, Wang; Jiyi, Wu; He, Xu; Jinghua, Zhu; Munyabugingo, Charles

    2013-08-01

    In the routing protocol for wireless sensor network, the cluster size is generally fixed in clustering routing algorithm for wireless sensor network, which can easily lead to the "hot spot" problem. Furthermore, the majority of routing algorithms barely consider the problem of long distance communication between adjacent cluster heads that brings high energy consumption. Therefore, this paper proposes a new cross unequal clustering routing algorithm based on the EEUC algorithm. In order to solve the defects of EEUC algorithm, this algorithm calculating of competition radius takes the node's position and node's remaining energy into account to make the load of cluster heads more balanced. At the same time, cluster adjacent node is applied to transport data and reduce the energy-loss of cluster heads. Simulation experiments show that, compared with LEACH and EEUC, the proposed algorithm can effectively reduce the energy-loss of cluster heads and balance the energy consumption among all nodes in the network and improve the network lifetime

  8. ZERO: Probabilistic Routing for Deploy and Forget Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jose Carlos Pacho

    2010-09-01

    Full Text Available As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called ”hot spot” problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this ”hot spot” problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques.

  9. Survey on Routing Protocols for Underwater Sensor Networks

    Directory of Open Access Journals (Sweden)

    Aman Sharma

    2012-02-01

    Full Text Available Different routing protocol perform different role in the underwater sensor network. All routing perform each and specific task into underwater sensor network which responsible for networking problems issue that is why this is the latest way of research. Routing term derived from “route” that means a path a way that perform different terms in underwater sensor network problem related issue. The best part is today many routing protocol are present in the underwater wireless sensor network. Some different attributes comes underwater wireless sensor network like likes high bit error rates, limited band-width, 3D deployment and high propagation delay. This paper is referring to as helpful for giving brief overview about each and every protocol and responsible for entire underwater wireless sensor network

  10. Asymmetric effect of route-length difference and bottleneck on route choice in two-route traffic system

    Science.gov (United States)

    Hino, Yuki; Nagatani, Takashi

    2015-06-01

    We study the traffic behavior in the asymmetric two-route traffic system with real-time information. In the asymmetric two-route system, the length on route A is different from that on route B and there exists a bottleneck on route A. We extend the symmetric two-route dynamic model to the asymmetric case. We investigate the asymmetric effects of the route-length difference and bottleneck on the route choice with real-time information. The travel time on each route depends on the road length, bottleneck, and vehicular density. We derive the dependence of the travel time and mean density on the route-length ratio. We show where, when, and how the congestion occurs by the route choice in the asymmetric two-route system. We clarify the effect of the route-length ratio on the traffic behavior in the route choice.

  11. Central Control Over Distributed Routing

    OpenAIRE

    Vissicchio, Stefano; Tilmans, Olivier; Vanbever, Laurent; Rexford, Jennifer; ACM SIGCOMM

    2015-01-01

    Centralizing routing decisions offers tremendous flexibility, but sacrifices the robustness of distributed protocols. In this paper, we present Fibbing, an architecture that achieves both flexibility and robustness through central control over distributed routing. Fibbing introduces fake nodes and links into an underlying link-state routing protocol, so that routers compute their own forwarding tables based on the augmented topology. Fibbing is expressive, and readily supports flexible load b...

  12. Routing of Electric Vehicles: City Distribution in Copenhagen

    DEFF Research Database (Denmark)

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

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

  13. Combining Speed and Routing Decisions in Maritime Transportation

    DEFF Research Database (Denmark)

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

    charter costs and cargo inventory costs may impact both speed and routing decisions. We develop models that optimize speed for a spectrum of routing scenarios and we use a heuristic method to solve them. Some examples are presented so as to illustrate the various trade-offs that are involved.......We present recent results on the problem of combining ship speed and routing decisions. Speed is a key determinant of the economic and the environmental performance affecting variables such as trip duration, fuel costs, and air emissions, among others. It is seen that inputs such as fuel cost, ship...

  14. New approach in definition of multi-stop flight routes

    Directory of Open Access Journals (Sweden)

    Srećko KRILE

    2015-03-01

    Full Text Available Optimization and profitability approaches play a crucial and central role in airline industry today. The main problem is how to overcome complexity by providing effective route schedule with minimal empty seats. So we need capable tools to re-optimize existing flight routes or to offer new one instead. This research deals about the efficient heuristic algorithm for optimal transportation of N different passenger contingents between ending points. We want to find out better transport plan with minimal transport cost for the route with more charging/discharging points (airports. Such optimization tool can help in sizing of appropriate airplane for definite direction, too.

  15. Fabrication Routes for Continuous Fiber-Reinforced Ceramic Composites (CFCC)

    Science.gov (United States)

    DiCarlo, James A.; Bansal, Narottam P.

    1998-01-01

    The primary approaches used for fabrication of continuous fiber-reinforced ceramic composite (CFCC) components have been reviewed. The CFCC fabrication issues related to fiber, interface, and matrix have been analyzed. The capabilities, advantages and limitations of the five matrix-infiltration routes have been compared and discussed. Today, the best fabrication route for the CFCC end-user is not clear and compromises need to be made depending on the details of the CFCC application. However, with time, this problem should be reduced as research continues to develop advanced CFCC constituents and fabrication routes.

  16. Routing Optimization with Load Balancing: an Energy Efficient Approach

    Directory of Open Access Journals (Sweden)

    S. Prabhavathi

    2015-07-01

    Full Text Available The area of Wireless Sensor Network (WSN is covered with considerable range of problems, where majority of research attempts were carried out to enhance the network lifetime of WSN. But very few of the studies have proved successful. This manuscript discusses about a structure for optimizing routing and load balancing that uses standard radio and energy model to perform energy optimization by introducing a novel routing agent. The routing agent is built within aggregator node and base station to perform self motivated reconfiguration in case of energy depletion. Compared with standard LEACH algorithm, the proposed technique has better energy efficiency within optimal data aggregation duration.

  17. Implementasi Algoritma Ant Colony System Dalam Menentukan Optimisasi Network Routing .

    OpenAIRE

    Lubis, Dini Anggraini

    2011-01-01

    Ant Colony System is an algorithm that adapt from ants biologic behavior which the ant colony can hold to find shortest path. Ant Colony System can implement for several optimization problems and one of them is in network routing. Ant colony system that talked in this paper is about optimization cases in network routing called AntNet. The purpose of AntNet is to search shortest path between source node to destination node based the table routing read by AntNet. In this research, it implemente...

  18. Enhancing Wireless Sensor Network Routing by High Quality Link Set Cooperative Routing Algorithm

    Directory of Open Access Journals (Sweden)

    A.Narendrakumar

    2013-10-01

    Full Text Available In general Wireless Sensor Networks (WSN’s, improving the network reliability by using cooperative communication to select the relay node with low overhead is a challenging task. Also the design of routing scheme based on link quality is a critical problem. Due to the resource constraints, connections between the nodes are changeable one. It leads to the network to create a various routes which are necessary. By using the established path, it delivers the data to the base station in a reliable manner. This paper concentrates on a cross layer approach by using various cooperative metric such as Packet Delivery Rate (PDR, Packet Reception Rate(PRR, Required Number of Packet transmission (RNP, Average number of packet sent/resent and Expected Transmission Time (ETX. These parameters are taken as a fuzzy parameter that exploits the cooperative diversity at the routing layer. We propose a Fuzzy based High Quality Link Set Routing (FHQLSR which selects the high quality relay node and evaluates the quality of link in each node by using RNP and ETX parameters. This FHQLSR scheme is used to find the effective relay node that forward packets to the base station via high quality link and also find the optimal path using Improved Dijikstra’s Algorithm (IDA in the multi hop networks. By considering routing and link quality parameters, the FHQLSR scheme improves theoverall reliability, scalability and stability of the network.

  19. Alternative routes of insulin delivery

    Institute of Scientific and Technical Information of China (English)

    Ranjith K. Krishnankutty; Aju Mathew; Saikiran K. Sedimbi; Shrikumar Suryanarayan; Carani B. Sanjeevi

    2009-01-01

    Parenteral route of insulin administration has been the mode of treatment for all Type 1 diabetics and Type 2 diabetics with complications. Patient compliance has really been a major concern for this route of administration. Several alternative routes of administration are under consideration for effective glycemic control, including oral, inhaled, buccal, nasal, and patch routes. One of the approaches involving inhaled insulin has now reached the market. Several other candidates may reach the market in the near future, the promising one being oral insulin.

  20. Southern States' Routing Agency Report

    International Nuclear Information System (INIS)

    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

  1. A Primer of Multicast Routing

    CERN Document Server

    Rosenberg, Eric

    2012-01-01

    Whereas unicast routing determines a path from one source node to one destination node, multicast routing determines a path from one source to many destinations, or from many sources to many destinations. We survey multicast routing methods for when the set of destinations is static, and for when it is dynamic. While most of the methods we review are tree based, some non-tree methods are also discussed. We survey results on the shape of multicast trees, delay constrained multicast routing, aggregation of multicast traffic, inter-domain multicast, and multicast virtual private networks. We focu

  2. A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

    OpenAIRE

    Shujun Bi; Huayang Wu; Xin Guan

    2011-01-01

    The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their ener...

  3. Discrete Approaches for Optimal Routing of High Pressure Pipes

    OpenAIRE

    Schelbert, Jakob

    2015-01-01

    The planning of a whole power plant involves diversivied specializations in engineering and can take up to several years. Within the planning procedure the routing of the high pressure pipes transporting the hot steam from the main boiler to the steam turbines exerts a strong influence on efficiency of the power plant. The design of pipe routing is usually done by a specially trained and experienced engineer with the aid of CAE software. The starting point of the problem is given by...

  4. Computer Network Routing with a Fuzzy Neural Network

    OpenAIRE

    Brande, Julia K. Jr.

    1997-01-01

    The growing usage of computer networks is requiring improvements in network technologies and management techniques so users will receive high quality service. As more individuals transmit data through a computer network, the quality of service received by the users begins to degrade. A major aspect of computer networks that is vital to quality of service is data routing. A more effective method for routing data through a computer network can assist with the new problems be...

  5. Axisymmetric arc in a supersonic nozzle

    International Nuclear Information System (INIS)

    Axisymmetric arc burning in a supersonic nozzle has wide technical applications (eg in gas blast circuit breaker, arc heaters etc.). Mathematical modelling of such an arc is usually based on boundary-layer assumption which assumes a known pressure distribution imposed on the arc or based on the integral method of arc analysis. Thus, the flow outside of the arc's thermal influence is assumed to be one dimensional. In practice, this is not the case as the nozzle is not sufficiently gentle in the axial direction or the presence of the upstream electrode makes the assumption of one-dimensional flow invalid. The purpose of the present investigation is to model the arc based on Navier-Stokes equations which are modified to take into account of electrical power input and radiation transport. The arcing gas is SF6, the transport properties of which (electrical conductivity, viscosity, thermal conductivity etc.) are highly nonlinear functions of temperature but only weakly dependent on the pressure

  6. Routing and scheduling and fleet management for liner shipping

    DEFF Research Database (Denmark)

    Kjeldsen, Karina Hjortshøj

    2009-01-01

    The problem of routing, scheduling and fleet management in global liner shipping is presented. The developed model incorporates the ships' speed as a decision variable. Furthermore, the model must be able to handle problems of the size and complexity experienced by the global liner shipping...

  7. Craniospinal irradiation using Rapid Arc

    Energy Technology Data Exchange (ETDEWEB)

    Fandino, J. M.; Silva, M. C.; Marino, A.; Candal, A.; Diaz, I.; Fernandez, C.; Gesto, C.; Izquierdo, P.; Losada, C.; Poncet, M.; Soto, M.; Triana, G.

    2013-07-01

    Cranio-Spinal Irradiation is technically very challenging, historically field edge matching is needed because of the mechanical limitations of standard linear accelerators. The purpose of this study is to assess the Volumetric Arc Therapy as a competitive technique for Cranio-Spinal Irradiation compared to the conventional 3D Conformal Radiotherapy technique. (Author)

  8. A rotating arc plasma invertor

    International Nuclear Information System (INIS)

    A device is described for the inversion of direct current to alternating current. The main feature is the use of a rotating plasma arc in crossed electric and magnetic fields as a switch. This device may provide an economic alternative to other inversion methods in some circumstances

  9. Direct leaf trajectory optimization for volumetric modulated arc therapy planning with sliding window delivery

    CERN Document Server

    Papp, Dávid

    2013-01-01

    We propose a novel optimization model for volumetric modulated arc therapy (VMAT) planning that directly optimizes deliverable leaf trajectories in the treatment plan optimization problem, and eliminates the need for a separate arc-sequencing step. In this model, a 360-degree arc is divided into a given number of arc segments in which the leaves move unidirectionally. This facilitates an algorithm that determines the optimal piecewise linear leaf trajectories for each arc segment, which are deliverable in a given treatment time. Multi-leaf collimator (MLC) constraints, including maximum leaf speed and interdigitation, are accounted for explicitly. The algorithm is customized to allow for VMAT delivery using constant gantry speed and dose rate, however, the algorithm generalizes to variable gantry speed if beneficial. We demonstrate the method for three different tumor sites: a head-and-neck case, a prostate case, and a paraspinal case. For that purpose, we first obtain a reference plan for intensity modulated...

  10. Inter-Domain Routing Under Scrutiny: Routing Models and Alternative Routing Architectures

    OpenAIRE

    Mühlbauer, Wolfgang

    2010-01-01

    Inter-Domain Routing, also die Verkehrslenkung zwischen Autonomen Systemen (ASen), ist seit Jahren ein lebendiges Forschungsgebiet. Hauptursache hierfür ist dessen Komplexität: Zusammenspiel zwischen Interior und Exterior Gateway Protokollen, eine Vielfalt unterschiedlicher Routing Policies, komplexe Verbindungsstrukturen zwischen ASen, usw. Ein wesentliches Ziel der vorliegenden Dissertation besteht in einem verbesserten Allgemeinverständnis des Inter-Domain Routings. Desweiteren werden neua...

  11. The next-generation ARC middleware

    DEFF Research Database (Denmark)

    Appleton, O.; Cameron, D.; Cernak, J.;

    2010-01-01

    The Advanced Resource Connector (ARC) is a light-weight, non-intrusive, simple yet powerful Grid middleware capable of connecting highly heterogeneous computing and storage resources. ARC aims at providing general purpose, flexible, collaborative computing environments suitable for a range of uses...... the next-generation ARC middleware, implemented as Web Services with the aim of standard-compliant interoperability....

  12. Stability of alternating current gliding arcs

    DEFF Research Database (Denmark)

    Kusano, Yukihiro; Salewski, Mirko; Leipold, Frank;

    2014-01-01

    on Ohm’s law indicates that the critical length of alternating current (AC) gliding arc discharge columns can be larger than that of a corresponding direct current (DC) gliding arc. This finding is supported by previously published images of AC and DC gliding arcs. Furthermore, the analysis shows...

  13. Making Conductive Polymers By Arc Tracking

    Science.gov (United States)

    Daech, Alfred F.

    1992-01-01

    Experimental technique for fabrication of electrically conductive polymeric filaments based on arc tracking, in which electrical arc creates conductive carbon track in material that initially was insulator. Electrically conductive polymeric structures made by arc tracking aligned along wire on which formed. Alignment particularly suited to high conductivity and desirable in materials intended for testing as candidate superconductors.

  14. Routing in Cognitive Radio Networks - A Survey

    Directory of Open Access Journals (Sweden)

    Harpreet Kaur

    2015-12-01

    Full Text Available Cognitive Radio Networks (CRNs have been emerged as a revolutionary solution to migrate the spectrum scarcity problem in wireless networks. Due to increasing demand for additional spectrum resources, CRNs have been receiving significant research to solve issues related with spectrum underutilization. This technology brings efficient spectrum usage and effective interference avoidance, and also brings new challenges to routing in multi-hop Cognitive Radio Networks. In CRN, unlicensed users or secondary users are able to use underutilized licensed channels, but they have to leave the channel if any interference is caused to the primary or licensed users. So CR technology allows sharing of licensed spectrum band in opportunistic and non-interfering manner. Different routing protocols have been proposed recently based on different design goals under different assumptions.

  15. Producing gestures facilitates route learning.

    Directory of Open Access Journals (Sweden)

    Wing Chee So

    Full Text Available The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air. Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2 without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper. Participants who moved their hands (either in the form of gestures or drawing recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation.

  16. Producing gestures facilitates route learning.

    Science.gov (United States)

    So, Wing Chee; Ching, Terence Han-Wei; Lim, Phoebe Elizabeth; Cheng, Xiaoqin; Ip, Kit Yee

    2014-01-01

    The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air). Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2) without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper). Participants who moved their hands (either in the form of gestures or drawing) recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation. PMID:25426624

  17. Perception bias in route choice

    NARCIS (Netherlands)

    Vreeswijk, J.D.; Thomas, T.; Berkum, van E.C.; Arem, van B.

    2014-01-01

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

  18. Security Consideration With Dynamic Routing

    Directory of Open Access Journals (Sweden)

    VISWESWARARAO BOLLA

    2012-03-01

    Full Text Available One of the major issues for data communication over wired and wireless networks is the security. the past work is on the designs of cryptography algorithms and system infrastructures. Dynamic routing algorithm called improved dynamic routing with security consideration, which is based on the concept of Zone Routing Protocol (ZRP that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP in wired networks and Destination-Sequenced Distance Vector (DSDV protocol in wireless networks, without introducing extra control messages. This algorithm is mainly proposed to improve the and to overcome the limitations existing with the present cryptographic algorithms and protocols. Although some designs like IP security, Secure Socket Layer provide essential security, E-Mail security they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths.

  19. Power-Aware Anycast Routing in Wireless Sensor Network Exploiting Small World Effect

    Institute of Scientific and Technical Information of China (English)

    JIANG Nan; YANG Shu-qun; LI Ling-zhi; DING Qiu-lin

    2008-01-01

    By considering energy-efficient anycast routing in wireless sensor network (WSN), and combining small world characteristics of WSN with the properties of the ant algorithm, a power-aware anycast routing algorithm (SWPAR) with multi-sink nodes is proposed and evaluated. By SWPAR, the optimal sink node is found and the problem of routing path is effectively solved. Simulation results show that compared with the sink-based anycast routing protocol (SARP) and the hierarchy-based anycast routing protocol (HARP), the proposed algorithm improves network lifetime and reduces power consumption.

  20. Multistage Off-Line Permutation Packet Routing on a Mesh: An Approach with Elementary Mathematics

    Institute of Scientific and Technical Information of China (English)

    Kevin Chiew; Yingjiu Li

    2009-01-01

    Various methods have been proposed for off-line permutation packet routing on a mesh. One of the methods is known as multistage routing, in which the first stage is crucial. For the first stage of routing, the previous study normally converts it to a problem of graph theory and proves the existence of solutions. However, there is a lack of simple algorithms to the first stage of routing. This article presents an explicit and simple approach for the first stage of routing based on elementary mathematics.

  1. Yen-BSR: A New Approach for the Choice of Routes in WDM Networks

    Science.gov (United States)

    Santos, A. F.; Almeida, R. C.; Assis, K. D. R.

    2014-12-01

    In this paper we propose to use an iterative algorithm for optimizing the fixed-alternate shortest path routing in the dynamic routing and wavelength assignment (RWA) problem in wavelength routing optical networks. The algorithm performance is compared, in terms of blocking probability, with the Dijkstra and Yen traditional algorithms, as well as with the recently proposed best among the shortest routes (BSR) algorithm. The results suggest that it is feasible to choose an appropriate set of routes for each pair of nodes (source, destination), among the shortest paths and efficiently balance the network load. For all studied scenarios, the proposed heuristic achieved superior performance.

  2. 不确定性条件下危险废物物流LRP建模与求解%Modeling and Solution of Hazardous Waste Location-routing Problem under Uncertain Condition

    Institute of Scientific and Technical Information of China (English)

    赵佳虹

    2011-01-01

    Aimed to decide where to open the treatment center, which technology to be adopted and how to route different hazardous waste in the transportation network under the uncertain condition that waste generation amount is fuzzy, based on the existing literature, a measure method of risk equality was designed with consideration on the diversity of wastes type and technology and the compatibility of waste and technology. Then taking the risk, cost minimization and risk equality maximization as the optimum objectives, a multi-objective model with triangular fuzzy number was proposed. According to the fuzzy constraints of characteristics transforming of triangular fuzzy number, the original fuzzy multi-objective model was transformed into the general multi-objective 0-1 mixed-integer linear programming model. The algorithm was designed to solve this multi-objective linear programming model by adopting fuzzy technique. Finally, an example was analyzed to demonstrate the comparative advantages of this model, which obviously decreases the risk and cost comparing with the exiting one.%在危险废物产量不确定的条件下,为解决加工中心建设点、加工技术和危险废物车辆运输路径的选择问题,考虑危险废物与加工技术的多样性、危险废物与加工技术的相容性,设定风险公平性的度量方法,以风险和成本最小化,风险公平性最大化为优化目标,建立危险废物产量为三角模糊数的多目标模型.根据三角模糊数的特征转化模糊约束条件,将原模糊模型转化为多目标0~1混合整数线性规划模型,并基于模糊优化技术设计多目标线性规划模型的求解方法.最后,算例结果表明,相对于既有模型,新模型所得的优化方案能降低风险和成本.

  3. DRO: domain-based route optimization scheme for nested mobile networks

    Directory of Open Access Journals (Sweden)

    Chuang Ming-Chin

    2011-01-01

    Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

  4. Development of ultra-narrow gap welding with constrained arc by flux band

    Institute of Scientific and Technical Information of China (English)

    Zhu Liang; Zheng Shaoxian; Chen Jianhong

    2006-01-01

    Narrow gap welding has merits of lower residual stress and distortion, and superior mechanical properties of joints.A major problem of this process is the lack of fusion in sidewalls, hence many methods of weaving arc have been developed to increase heating effect of arc to the sidewalls. In this work, a new approach without weaving arc is attempted to ensure the penetration of sidewall, and ultra-narrow gap welding with the gap of less than 5 mm was executed successfully. In this approach, the width of gap is decreased further, so that the sidewalls are made within range of arc heating to obtain the enough heat. Inorder to prevent the arc from being attracted by sidewall and going up alongthe sidewalls, two pieces of flux bands consisting of the specified aggregates are adhered to the sidewalls to constrain the arc. In addition, when flux band being heated by the arc, slag and gases are formed to shield the arc and the weld pool. This technique was tested on the welding experiment of pipeline steel with thickness of 20 mm. The involved welding parameters were obtained, that is, the width of gap is 4 mm, the welding current 250 A, and the heat input 0. 5 k J/mm, the width of heat-affected zone is 1 - 2mm.

  5. Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes

    OpenAIRE

    Goodrich, Michael T.; Pszona, Paweł

    2014-01-01

    The problem of finding an electric vehicle route that optimizes both driving time and energy consumption can be modeled as a bicriterion path problem. Unfortunately, the problem of finding optimal bicriterion paths is NP-complete. This paper studies such problems restricted to two-phase paths, which correspond to a common way people drive electric vehicles, where a driver uses one driving style (say, minimizing driving time) at the beginning of a route and another driving style (say, minimizi...

  6. Relationship between arc voltage current and arc length in TIG welding

    International Nuclear Information System (INIS)

    The relationship between arc voltage, arc length and current in Tungsten Inert Gas welding has been investigated. It was not possible to determine a correlation between arc voltage, current and arc length because of the inherent variability in the experimental results. A typical value for the error in controlling the arc length using arc voltage was calculated and found to be ± 0.5mm. The variation in arc voltage at constant conditions has two components, long term and short term. Long term is the variation in voltage between welds, short term is voltage variation within a few seconds. Both are about 5% of the total arc voltage. Since only a fraction of the arc voltage depends on arc length, this leads to a much larger variation in arc length if Arc Voltage Control (AVC) is used to control arc length (about 15% in each case at 3mm arc length). A weld procedure based on AVC is likely to yield a different variability in weld bead geometry from one based on constant arc length. (author)

  7. Simulation of Magnetically Dispersed Arc Plasma

    Institute of Scientific and Technical Information of China (English)

    白冰; 查俊; 张晓宁; 王城; 夏维东

    2012-01-01

    Magnetically dispersed arc plasma exhibits typically dispersed uniform arc column as well as diffusive cathode root and diffusive anode root. In this paper magnetically dispersed arc plasma coupled with solid cathode is numerically simulated by the simplified cathode sheath model of LOWKE . The numerical simulation results in argon show that the maximum value of arc root current density on the cathode surface is 3.5×10^7 A/m^2), and the maximum value of energy flux on the cathode surface is 3× 10^7 J/m^2, both values are less than the average values of a contracted arc, respectively.

  8. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

    shortest nor fastest, indicating that drivers value route properties that are diverse and hard to quantify or even identify. We propose a routing service that uses an existing routing service while exploiting the availability of historical route usage data from local drivers. Given a source and destination......, the service recommends a corresponding route that is most preferred by local drivers. It uses a route preference function that takes into account the number of distinct drivers and the number of trips associated with a route, as well as temporal aspects of the trips. The paper provides empirical...... studies with real route usage data and an existing online routing service....

  9. A mechanism that triggers double arcing during plasma arc cutting

    Energy Technology Data Exchange (ETDEWEB)

    Nemchinsky, Valerian, E-mail: nemchinsky@bellsouth.ne [Keiser University, Fort Lauderdale, FL 33309 (United States)

    2009-10-21

    Double arcing (DA) is a phenomenon when a transferred arc, flowing inside an electrically insulated nozzle, breaks into two separate arcs: one that connects the cathode and the nozzle and another that connects the nozzle and a work-piece. It is a commonly accepted opinion that the reason for DA is high voltage drop in the plasma inside the nozzle. However, the specific mechanism that triggers the DA development is not clear. In this paper, we propose such a mechanism. Dielectric films deposited inside the nozzle's orifice play the key role in this mechanism. These films are charged by ion current from plasma. A strong electric field is created inside the film and at the boundary of the film and clean metal of the nozzle. This gives rise to a thermo-field electron emission from the clean metal that borders the film. Emitted electrons are accelerated at the voltage drop between the nozzle and plasma. These electrons produce extra ions, which in turn move back to the film and additionally charge it. This sequence of events leads to explosive instability if the voltage drop inside the nozzle is high enough. Experiments to check the proposed mechanism are suggested.

  10. Parametric Study on Arc Behavior of Magnetically Diffused Arc

    Science.gov (United States)

    Chen, Tang; Li, Hui; Bai, Bing; Liao, Mengran; Xia, Weidong

    2016-01-01

    A model coupling the plasma with a cathode body is applied in the simulation of the diffuse state of a magnetically rotating arc. Four parametric studies are performed: on the external axial magnetic field (AMF), on the cathode shape, on the total current and on the inlet gas velocity. The numerical results show that: the cathode attachment focuses in the center of the cathode tip with zero AMF and gradually shifts off the axis with the increase of AMF; a larger cathode conical angle corresponds to a cathode arc attachment farther away off axis; the maximum values of plasma temperature increase with the total current; the plasma column in front of the cathode tip expands more severely in the axial direction, with a higher inlet speed; the cathode arc attachment shrinks towards the tip as the inlet speed increases. The various results are supposed to be explained by the joint effect of coupled cathode surface heating and plasma rotating flow. supported by National Natural Science Foundation of China (Nos. 11475174, 11035005 and 50876101)

  11. A multimodal transportation system routing implemented in waste collection

    Directory of Open Access Journals (Sweden)

    Masoud Rabbani

    2016-01-01

    Full Text Available Waste collection is an important municipal service that charges large expenditures to waste management (WM system. In this study, a hierarchical structure is proposed in order to minimize total cost of waste collection routing problem. Moreover, in second stage destructive environmental effects of waste transportation are minimized concurrently through taking advantage of a road/rail transportation system. In the proposed multimodal transportation system, waste packs are transferred to final destination while travel time and risk of environmental threatening is minimized. The discussed problem is formulated mathematically in two stages. In the first stage, a household waste collection routing problem is formulated while, in second stage a multimodal transportation system is routed to transfer waste packs to final destination through roads and railroads. In order to solve the proposed NP hard models, an improved genetic algorithm is developed. Comparison of the obtained results with those of GAMS for small-size samples validates the proposed models.

  12. Exploring Issues for QoS Based Routing Algorithms

    Directory of Open Access Journals (Sweden)

    Dr. Shuchita Upadhyaya

    2010-08-01

    Full Text Available The Internet is growing at an astonishing rate, nearly doubling its enormous size every year. There is an increasing demand for using real time multimedia applications over the Internet. One of the challenging issues in exchanging multimedia information over a network is how to determine a feasible path that satisfies all the requirements of multimedia applications. Thus there is a need for routing mechanism which are able to satisfy requirement of both real time traffic and efficient management of network resources . Quality of service routing is one of these components . QoS(Quality of service routing provides guarantee of service to the receiver. The main problem to be solved by QoS routing algorithm is multi constrained path problem. In general, The multi constrained path problem is NPcomplete that cannot be exactly solved in polynomial time. So various types of heuristic and approximate algorithms have been presented in literature to solve this problem .This paperdiscusses main approaches used to reduce QoS routing algorithms complexity and to improve overall network performance.

  13. Optimization approaches to volumetric modulated arc therapy planning

    International Nuclear Information System (INIS)

    Volumetric modulated arc therapy (VMAT) has found widespread clinical application in recent years. A large number of treatment planning studies have evaluated the potential for VMAT for different disease sites based on the currently available commercial implementations of VMAT planning. In contrast, literature on the underlying mathematical optimization methods used in treatment planning is scarce. VMAT planning represents a challenging large scale optimization problem. In contrast to fluence map optimization in intensity-modulated radiotherapy planning for static beams, VMAT planning represents a nonconvex optimization problem. In this paper, the authors review the state-of-the-art in VMAT planning from an algorithmic perspective. Different approaches to VMAT optimization, including arc sequencing methods, extensions of direct aperture optimization, and direct optimization of leaf trajectories are reviewed. Their advantages and limitations are outlined and recommendations for improvements are discussed

  14. Optimization approaches to volumetric modulated arc therapy planning

    Energy Technology Data Exchange (ETDEWEB)

    Unkelbach, Jan, E-mail: junkelbach@mgh.harvard.edu; Bortfeld, Thomas; Craft, David [Department of Radiation Oncology, Massachusetts General Hospital and Harvard Medical School, Boston, Massachusetts 02114 (United States); Alber, Markus [Department of Medical Physics and Department of Radiation Oncology, Aarhus University Hospital, Aarhus C DK-8000 (Denmark); Bangert, Mark [Department of Medical Physics in Radiation Oncology, German Cancer Research Center, Heidelberg D-69120 (Germany); Bokrantz, Rasmus [RaySearch Laboratories, Stockholm SE-111 34 (Sweden); Chen, Danny [Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, Indiana 46556 (United States); Li, Ruijiang; Xing, Lei [Department of Radiation Oncology, Stanford University, Stanford, California 94305 (United States); Men, Chunhua [Department of Research, Elekta, Maryland Heights, Missouri 63043 (United States); Nill, Simeon [Joint Department of Physics at The Institute of Cancer Research and The Royal Marsden NHS Foundation Trust, London SM2 5NG (United Kingdom); Papp, Dávid [Department of Mathematics, North Carolina State University, Raleigh, North Carolina 27695 (United States); Romeijn, Edwin [H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332 (United States); Salari, Ehsan [Department of Industrial and Manufacturing Engineering, Wichita State University, Wichita, Kansas 67260 (United States)

    2015-03-15

    Volumetric modulated arc therapy (VMAT) has found widespread clinical application in recent years. A large number of treatment planning studies have evaluated the potential for VMAT for different disease sites based on the currently available commercial implementations of VMAT planning. In contrast, literature on the underlying mathematical optimization methods used in treatment planning is scarce. VMAT planning represents a challenging large scale optimization problem. In contrast to fluence map optimization in intensity-modulated radiotherapy planning for static beams, VMAT planning represents a nonconvex optimization problem. In this paper, the authors review the state-of-the-art in VMAT planning from an algorithmic perspective. Different approaches to VMAT optimization, including arc sequencing methods, extensions of direct aperture optimization, and direct optimization of leaf trajectories are reviewed. Their advantages and limitations are outlined and recommendations for improvements are discussed.

  15. A Recovery Method for Greedy Routing Protocols in Web Communications

    Directory of Open Access Journals (Sweden)

    Sheetal Kaushik

    2012-01-01

    Full Text Available Greedy Perimeter Stateless Routing (GPSR protocol is an appropriate and the most well-known routing protocol for high mobile vehicular ad-hoc networks. The protocol includes two routing modes, the greedy mode and the recovery mode, and utilizes a neighbor list to make a route decision. However, not only does the neighbor list in the protocol involve stale neighbor information, but also the stale nodes inherit a higher selection priority in the greedy mode according to the routing policy; besides, the useful redundant route information can be eliminated during planarization in the recovery mode. To overcome those problems, we propose a new recovery mode, named as Greedy Border Superiority Routing (GBSR, along with an Adaptive Neighbor list Management (ANM scheme. A node generates aborder superior graph instead of generating a planar graph whenthe node faces the local maximum. Packets in the recovery modecan escape from the recovery mode as fast as possible using thegraph. Here, GBSR protocol has the same assumption as that ofGPSR, and does not require any additional information. With anetwork simulator, GBSR and ANM are evaluated using two vehicle mobility scenarios. GBSR shows higher network performance in comparison with GPSR protocol. In addition, we accomplish a nearly stale-free neighbor list using the ANM scheme.

  16. SURVEY OF GENETIC BASED APPROACH FOR MULTICAST ROUTING IN MANET

    Directory of Open Access Journals (Sweden)

    Sumathy S

    2012-12-01

    Full Text Available An independent, self-governing group of mobile wireless hosts communicate through wireless links by forming a temporary network (Mobile Ad-hoc Network in a dynamic manner without any fixedand centralized infrastructure. Since the nodes in MANET are not stationary, same path may not be taken always for routing between the sender and the receiver(s. So, routing in such situation is acomplicated task. In addition, the resources of the wireless nodes are limited. With the intention of saving the resources of the nodes in the network, multicasting can be used instead of multiple unicast data transmissions whenever a node needs to send same data in parallel to several destinations. The grouporiented services are the primary ones that support today’s need and trend of communication. In recent years, such services are provided with the help of MANETs. The residual energy of the battery of a mobile node is finite (before recharging is done, which is a constraint while developing multicast routing protocols. Genetic Algorithm (GA presents an improved solution for the multi-constrained multicast routing problem. By choosing proper fitness function and values for metrics such as initial population size, crossover and mutation that closely relates to the chosen scenario, the genetic algorithm optimizes the routes in terms of selected metrics. This paper focuses to provide a survey and analyses the categories of multicast routing protocols. In addition, this also covers the details of the application of genetic approach in finding multicast routes.

  17. Fuzzy Controlled Routing in a Swarm Robotic Network

    Directory of Open Access Journals (Sweden)

    Navya Manoj

    2014-05-01

    Full Text Available Swarm Robotics originated in the research inspired by biology. It is the usual sense of the multi-robot systems which have been given the emerging attributes of swarm intelligence. In nature, ants, termites, wasps, bees and other social insects have inspired surprisingly inspiration of human. These groups of organisms show how to interact with a large number of simple individuals and generate the collective intelligence of systems to cope with complicated tasks. Swarm Robotics is a special robot system which is composed of a group of indiscriminate robots and so it is a typical distributed system. If a task is for only one robot and the robot will be very complex and expensive inefficiently. But if it is for the swarm robotics, the complex task can be done by many more simple robots efficiently. For the Routing problem, the quality of a potential route is determined by the length of the route (i.e. number of links and the congestion along the route. It is desired to balance the traffic load among links in the network so it is desirable to select routes with a low obstacle rate. In addition, shorter routes are preferred over longer routes because they use fewer network resources

  18. Acquisition of business intelligence from human experience in route planning

    Science.gov (United States)

    Bello Orgaz, Gema; Barrero, David F.; R-Moreno, María D.; Camacho, David

    2015-04-01

    The logistic sector raises a number of highly challenging problems. Probably one of the most important ones is the shipping planning, i.e. plan the routes that the shippers have to follow to deliver the goods. In this article, we present an artificial intelligence-based solution that has been designed to help a logistic company to improve its routes planning process. In order to achieve this goal, the solution uses the knowledge acquired by the company drivers to propose optimised routes. Hence, the proposed solution gathers the experience of the drivers, processes it and optimises the delivery process. The solution uses data mining to extract knowledge from the company information systems and prepares it for analysis with a case-based reasoning (CBR) algorithm. The CBR obtains critical business intelligence knowledge from the drivers experience that is needed by the planner. The design of the routes is done by a genetic algorithm that, given the processed information, optimises the routes following several objectives, such as minimise the distance or time. Experimentation shows that the proposed approach is able to find routes that improve, on average, the routes made by the human experts.

  19. Models of plasma arc welding

    International Nuclear Information System (INIS)

    A complex model of energy transfer from ionized gas through a weld-pool to a heat affected zone (HAZ) is considered here. The model consists of three sub-models: a model of the arc column with skin layers - sheaths coating electrodes, a model of liquid metal flow in a weld-pool, and a model of coupled thermo-mechanical-metallurgical processes in HAZ. These sub-models are descried in three reports. The first report is devoted to a short review of welding plasma models based mostly on the Magneto-Hydro-Dynamics (MHD) theory successfully applied to the simulation of welding process. This report is illustrated by arc models for TIG and PAW welding. The description of thermal energy transfer between three sub-regions of the complex welding domain refers to a large number of processes observed in gaseous electronics, thermodynamics of reacting gases, electro-dynamics of fluid, micro-metallurgy. (author)

  20. 多模糊信息条件下的物料配送路径规划问题研究%Vehicle Routing Problem in Material Distribution under Condition of Much Fuzzy Information

    Institute of Scientific and Technical Information of China (English)

    李晋航; 黄刚; 贾艳

    2011-01-01

    混流装配线的物料配送是支撑装配线运作的复杂系统.配送准确、及时不仅能够保证生产不断线,还能大大提高生产效率,发挥混流装配的优势.但是配送环节中往往存在工位货物需求量,工位预约到货时间和车辆运输时间不确定等因素,使得传统路径规划模型不能真实地反映现场情况,反而因种种异常导致事倍功半.对不确定因素进行考虑,建立模糊信息条件下的机会约束规划模型,并改进传统混合智能算法去求解模型.算法设计上,采用轮盘赌启发式算法来缩小初始解的搜索范围,在交叉算子中提出用广义海明相似度概念来区分染色体的相似程度,在进化过程中采用双选择双变异流程来加快算法的收敛速度.通过实例证明该算法处理不确定因素的可行性和高效性,并对模糊参数中关键因子的置信度选择不同值进行对比分析,给出选择建议.%Material distribution of mixed-model assembly is a complex system for supporting assembly line operation. Accurate distribution in time can ensure continuous production and greatly improve production efficiency. However, there often exist uncertain factors, such as work station demand for goods, appointed goods arrival time, and vehicle transportation time, so the traditional route programming model cannot truly reflect the field situation and on the contrary will cause low productivity. The uncertain factors are taken into consideration, the chance constraint programming model under the condition of fuzzy information is built, and traditional hybrid intelligent algorithm is improved to solve this model. In the selection of initial solution, roulette heuristic algorithm is adopted to reduce the search range. In the crossover operator, generalized hamming similarity degree is used to distinguish the similarity degree of two chromosomes in order to avoid inbreeding. Duplicate selected and mutated operator is chosen for