WorldWideScience

Sample records for dynamic vehicle routing

  1. Classification of Dynamic Vehicle Routing Systems

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  2. Partially dynamic vehicle routing - models and algorithms

    DEFF Research Database (Denmark)

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

    2002-01-01

    In this paper we propose a framework for dynamic routing systems based on their degree of dynamism. Next, we consider its impact on solution methodology and quality. Specifically, we introduce the Partially Dynamic Travelling Repairman Problem and describe several dynamic policies to minimize rou...

  3. Dynamic vehicle routing with time windows in theory and practice

    NARCIS (Netherlands)

    Yang, Z.; Osta, van J.P.; Veen, van B.; Krevelen, van R.; Stam, A.; Kok, J.N.; Bäck, T.H.W.; Michael, Emmerich T. M.

    2016-01-01

    The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are

  4. Dynamic vehicle routing with time windows in theory and practice

    NARCIS (Netherlands)

    Yang, Z.; Osta, van J.P.; Veen, van B.; Krevelen, van R.; Stam, A.; Kok, J.N.; Bäck, T.H.W.; Michael, Emmerich T. M.

    2016-01-01

    The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are can

  5. A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Shifeng Chen

    2017-09-01

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

  6. Dynamic Vehicle Routing for Robotic Networks: Models, Fundamental Limitations and Algorithms

    Science.gov (United States)

    2010-04-16

    partitions. SIAM Review, January 2010. Submitted Francesco Bullo (UCSB) Dynamic Vehicle Routing 16apr10 @ ARL 31 / 34 Gossip partitioning policy: sample...Control Conference, Hollywood, CA, October 2009 Francesco Bullo (UCSB) Dynamic Vehicle Routing 16apr10 @ ARL 32 / 34 Gossip partitioning policy: analysis...Dynamic Vehicle Routing for Robotic Networks: Models, Fundamental Limitations and Algorithms Francesco Bullo Center for Control, Dynamical Systems

  7. Dynamic vehicle routing problems: Three decades and counting

    DEFF Research Database (Denmark)

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

    2016-01-01

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

  8. Dynamic vehicle routing with time windows in theory and practice.

    Science.gov (United States)

    Yang, Zhiwei; van Osta, Jan-Paul; van Veen, Barry; van Krevelen, Rick; van Klaveren, Richard; Stam, Andries; Kok, Joost; Bäck, Thomas; Emmerich, Michael

    2017-01-01

    The vehicle routing problem is a classical combinatorial optimization problem. This work is about a variant of the vehicle routing problem with dynamically changing orders and time windows. In real-world applications often the demands change during operation time. New orders occur and others are canceled. In this case new schedules need to be generated on-the-fly. Online optimization algorithms for dynamical vehicle routing address this problem but so far they do not consider time windows. Moreover, to match the scenarios found in real-world problems adaptations of benchmarks are required. In this paper, a practical problem is modeled based on the procedure of daily routing of a delivery company. New orders by customers are introduced dynamically during the working day and need to be integrated into the schedule. A multiple ant colony algorithm combined with powerful local search procedures is proposed to solve the dynamic vehicle routing problem with time windows. The performance is tested on a new benchmark based on simulations of a working day. The problems are taken from Solomon's benchmarks but a certain percentage of the orders are only revealed to the algorithm during operation time. Different versions of the MACS algorithm are tested and a high performing variant is identified. Finally, the algorithm is tested in situ: In a field study, the algorithm schedules a fleet of cars for a surveillance company. We compare the performance of the algorithm to that of the procedure used by the company and we summarize insights gained from the implementation of the real-world study. The results show that the multiple ant colony algorithm can get a much better solution on the academic benchmark problem and also can be integrated in a real-world environment.

  9. Dynamic vehicle routing problems: Three decades and counting

    DEFF Research Database (Denmark)

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

    2016-01-01

    Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing areal explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy...... linkages of methodology to technological advances and analysis of worst case or average case performance of heuristics....

  10. Dynamic Vehicle Routing for Data Gathering in Wireless Networks

    CERN Document Server

    Çelik, Güner D

    2010-01-01

    We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). The collector is responsible for receiving these messages via wireless communication by dynamically adjusting its position in the network. Our goal is to utilize a combination of wireless transmission and controlled mobility to improve the delay performance in such networks. We show that the necessary and sufficient condition for the stability of such a system (in the bounded average number of messages sense) is given by {\\rho}<1 where {\\rho} is the average system load. We derive fundamental lower bounds for the delay in the system and develop policies that are stable for all loads {\\rho}<1 and that have asymptotically optimal delay scaling. Furthermore, we extend our analysis to the case of multiple collectors in the network. We show that the combination of mobility and wireless transmission results in a delay scaling of {\\The...

  11. The Dynamic Multi-Period Vehicle Routing Problem

    DEFF Research Database (Denmark)

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

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

  12. The dynamic multi-period vehicle routing problem

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

    Science.gov (United States)

    Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

    2016-05-01

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

  14. Adaptive and Distributed Algorithms for Vehicle Routing in a Stochastic and Dynamic Environment

    Science.gov (United States)

    2010-11-18

    underlying mathematical model is static and fits within the framework of the Vehicle Routing Problem (see [7] for a thorough introduction to the VRP ...iii) the goal is to compute a set of routes that optimizes the cost of servicing (according to some quality of service metric) the demands. The VRP ...occur- rence in practical problems, the VRP is often a static approx- imation to problems that are in reality dynamic, and therefore it fails to be an

  15. Dynamic Vehicle Routing for Robotic Networks (Workshop Briefing Charts)

    Science.gov (United States)

    2010-06-29

    Computation: Numerical Methods. Athena Scientific, 1997 4 S. Mart́ınez, F. Bullo, J. Cortés, and E. Frazzoli. On synchronous robotic networks – Part I...29jun10 @ Baltimore, ACC 1 / 24 Motivation for Team Forming Group of vehicles monitoring a region Several different sensing modalities: electro- optical

  16. Vehicle Routing in Practice

    OpenAIRE

    Hasle, Geir

    2010-01-01

    Solving the Vehicle Routing Problem (VRP) is a key to efficiency in transportation and supply chain management. The VRP is a computationally hard problem that comes in many guises. The VRP literature contains thousands of papers, and VRP research is regarded as one of the great successes of OR. In industry and the public sector, vehicle routing tools provide substantial savings every day. An industry of routing tool vendors has emerged. Exact optimization methods of today cannot consistently ...

  17. Express company’s vehicle routing optimization by multiple-dynamic saving algorithm

    Directory of Open Access Journals (Sweden)

    Junchao Liu

    2014-05-01

    Full Text Available Purpose: According to the disorder in circulation commuting and crossover commuting of SF company which is the China’s largest private express delivery service provider, the study uses the Saving Algorithm to make the vehicle routing and resources optimized, on this basis, proposes innovative improvements with Saving Algorithm and then applies it in every distribution center of SF forming a "multi-dynamic" type of Saving Algorithm to ensure both cost savings and timeliness. This method can be generalized for all express company to get the vehicle routing optimized.Design/methodology/approach: As the special transportation requirements of express companies, this study optimizes the vehicle route based on Saving Algorithm, uses multiple-dynamic Saving Algorithm, and considers the timeliness requirements of the express company to achieve a balance of cost and timeliness.Findings: The main finding is that a new method proposed which there can be a balance improvement for both cost and timeliness to optimize the vehicle route of express company. Calculation example validates the effectiveness of the model established and solving method.Practical implications: It is a widespread practice that by setting up model and parameters for the objectives, express company can maintain the balances between cost and timeliness and achieve the optimized vehicle route.Originality/value: It proposes innovative improvements, takes SF express company as an example, with Saving Algorithm which can be applied in every distribution center of express company to ensure the balance improvement for both cost and timeliness, and has a great practical significance to the transportation network and path optimization of express companies.

  18. Cumulative Vehicle Routing Problems

    OpenAIRE

    Kara, &#;mdat; Kara, Bahar Yeti&#;; Yeti&#;, M. Kadri

    2008-01-01

    This paper proposes a new objective function and corresponding formulations for the vehicle routing problem. The new cost function defined as the product of the distance of the arc and the flow on that arc. We call a vehicle routing problem with this new objective function as the Cumulative Vehicle Routing Problem (CumVRP). Integer programming formulations with O(n2) binary variables and O(n2) constraints are developed for both collection and delivery cases. We show that the CumVRP is a gener...

  19. Vehicle Routing Problem Models

    Directory of Open Access Journals (Sweden)

    Tonči Carić

    2004-01-01

    Full Text Available The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal capacity and start from a single warehouse, suitable tosolve problems in cases with up to 50 users.

  20. Dynamic programming algorithm for the vehicle routing problem with time windows and EC social legislation

    NARCIS (Netherlands)

    Kok, A. Leendert; Meyer, C. Manuel; Kopfer, Herbert; Schutten, J. Marco J.

    2009-01-01

    In practice, apart from the problem of vehicle routing, schedulers also face the problem of nding feasible driver schedules complying with complex restrictions on drivers' driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a

  1. A dynamic programming heuristic for the vehicle routing problem with time windows and EC social legislation

    NARCIS (Netherlands)

    Kok, A. Leendert; Meyer, C. Manuel; Kopfer, Herbert; Schutten, J. Marco J.

    2009-01-01

    In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers' driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose

  2. Industrial Vehicle Routing

    OpenAIRE

    Hasle, Geir

    2008-01-01

    Solving the Vehicle Routing Problem (VRP) is a key to efficiency in transportation and supply chain management. The VRP is a computationally hard problem that comes in many guises. The VRP literature contains thousands of papers, and VRP research is regarded as one of the great successes of OR. An industry of routing tool vendors has emerged. Exact optimization methods of today cannot consistently solve VRP instances with more than 50-100 customers in reasonable time, which is generally a sma...

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

    Science.gov (United States)

    Davis, L. C.

    2017-07-01

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

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

    CERN Document Server

    Davis, L C

    2016-01-01

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

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

  6. A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.; Zijm, W.H.M.

    2010-01-01

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

  7. A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks.

    NARCIS (Netherlands)

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

    2010-01-01

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

  8. 动态车辆路径问题研究综述%Overview on Dynamic Vehicle Routing Problems

    Institute of Scientific and Technical Information of China (English)

    韩娟娟; 李永先

    2015-01-01

    The paper reviewed dynamic vehicle routing problem .DVRP was classified into SVRP and FVRP . The paper introduced research in recent years on models ,algorithms and simulationg of dynamic vehicle rou‐ting problems ,and summarizes characteristics of dynamic vehicle routing problem .Finally ,the paper pros‐pected future research orientations of dynamic vehicle routing problem .%指出了动态车辆路径问题是运筹学和组合优化领域的前沿研究方向,研究动态车辆路径问题具有重要的理论和现实意义。阐述了动态车辆问题(DVRP),根据动态信息的特征将动态车辆路径问题分为随机车辆路径问题(SVRP)和模糊车辆路径问题(FVRP)。从动态车辆路径问题的建模、算法和仿真优化三个方面分析了其研究成果,对现有研究的不足进行了探讨,提出了动态车辆路径问题的进一步研究方向。

  9. Mutation Ant Colony Algorithm of Milk-Run Vehicle Routing Problem with Fastest Completion Time Based on Dynamic Optimization

    Directory of Open Access Journals (Sweden)

    Jianhua Ma

    2013-01-01

    Full Text Available The objective of vehicle routing problem is usually to minimize the total traveling distance or cost. But in practice, there are a lot of problems needed to minimize the fastest completion time. The milk-run vehicle routing problem (MRVRP is widely used in milk-run distribution. The mutation ACO is given to solve MRVRP with fastest completion time in this paper. The milk-run VRP with fastest completion time is introduced first, and then the customer division method based on dynamic optimization and split algorithm is given to transform this problem into finding the optimal customer order. At last the mutation ACO is given and the numerical examples verify the effectiveness of the algorithm.

  10. A dynamic programming heuristic for the vehicle routing problem with time windows and European Community social legislation

    NARCIS (Netherlands)

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

    2010-01-01

    In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers' driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose

  11. Implementing Vehicle Routing Algorithms

    Science.gov (United States)

    1975-09-01

    Multiple Depot Vehicle Dispatch Problem," presented at the URSA/TIMS meeting San Juan, Puerto Rico, Oct. 1974. 28. Gillett, B., and Miller, L., " A Heuristic Algorithm for...45. Lam, T., "Comments on a Heuristic Algorithm for the Multiple Terminal Delivery Problem," Transportation Science, Vol. 4, No. 4, Nov. 1970, p. 403

  12. Overview of Stochastic Vehicle Routing Problems

    Institute of Scientific and Technical Information of China (English)

    郭耀煌; 谢秉磊; 郭强

    2002-01-01

    Stochastic vehicle routing problems (VRPs) play important roles in logistics, though they have not been studied systematically yet. The paper summaries the definition, properties and classification of stochastic VRPs, makes further discussion about two strategies in stochastic VRPs, and at last overviews dynamic and stochastic VRPs.

  13. Stochastic Vehicle Routing with Recourse

    CERN Document Server

    Goertz, Inge Li; Saket, Rishi

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization 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 lambda. We present an O(log^2 n log(n lambda))-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 orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based omega(1) hardness of approximation for StochVRP, even on star-like metrics on which our algorithm achieves a logarithmic approximation.

  14. Stochastic vehicle routing with recourse

    DEFF Research Database (Denmark)

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

    2012-01-01

    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...... orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based ω(1) hardness of approximation for StochVRP, even on star-like metrics on which our...

  15. Vehicle Routing with Uncertain Demand

    NARCIS (Netherlands)

    R. Spliet (Remy)

    2013-01-01

    textabstractIn distribution networks a supplier transports goods from a distribution center to customers by means of vehicles with limited capacity. Drivers will drive routes on which they visit multiple customers to make deliveries. Typically, deliveries are made regularly and a fixed schedule is m

  16. The Consistent Vehicle Routing Problem

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2009-01-01

    In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time.

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

    DEFF Research Database (Denmark)

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

    The vehicle routing problem with time windows and temporal dependencies (VRPTWTD) is an extension of the vehicle routing problem with time windows (VRPTW). Given is a fixed set of customers with individual demands and with time windows specifying when each customer accepts service. The objective...... is to find routes for a number of vehicles, all starting and ending at a central depot in such a way that the total distance is minimized. The extension that we present here is concerned with temporal dependencies between customers. A temporal dependency which is often encountered in practical instances...... assignment and routing problem with synchronization constraints. The problem has been solved by column generation. The synchronized vehicle dispatching problem (SVDP), which is a dynamic vehicle routing problem with synchronization between vehicles. Constraint programming and local search are applied...

  18. Shortest Paths and Vehicle Routing

    DEFF Research Database (Denmark)

    Petersen, Bjørn

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

  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. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

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

  1. Vehicle Routing With User Generated Trajectory Data

    DEFF Research Database (Denmark)

    Ceikute, Vaida; Jensen, Christian S.

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

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

  3. Combination of vehicle routing models and dynamic traffic simulation for city logistics applications

    OpenAIRE

    Grzybwska, Hanna

    2012-01-01

    The urban network is a highly dynamic system. Thus, a modern and efficient fleet management in urban areas should account for dynamics of traffic conditions, variability in travel times, changes in demand and fleet availability. All these factors significantly affect the distribution of goods and the provision of services. As a consequence, the freight operations optimizing approaches should be based on the time-dependent travel time estimates rather than on the average static values commonly...

  4. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    OpenAIRE

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

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

    DEFF Research Database (Denmark)

    Mu, Q; Fu, Z; Lysgaard, Jens

    2011-01-01

    This paper introduces a new class of problem, the disrupted vehicle routing problem (VRP), which deals with the disruptions that occur at the execution stage of a VRP plan. The paper then focuses on one type of such problem, in which a vehicle breaks down during the delivery and a new routing...

  6. The price of commitment in online stochastic vehicle routing

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV

    2009-01-01

    This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers. Early work has focused on very flexible routing settings where the decision to assign a vehicle to a customer is delayed until a vehicle is actually deployed to the customer. Motivated by real applications that require stability in the decision making, this paper considers a setting where the decision to assign a customer request to a vehicle must be taken when that request is accepted. Experimental results suggest that this constraint severely degrades the performance of existing algorithms. However, the paper shows how the use of stochastic information for vehicle assignment and request acceptance improves decision quality considerably. Moreover, the use of resource augmentation quantifies precisely the cost of commitment in online vehicle routing.

  7. Optimum Route Selection for Vehicle Navigation

    Directory of Open Access Journals (Sweden)

    Dalip

    2016-02-01

    Full Text Available The objective of Optimum Route Selection for Vehicle Navigation System (ORSVNS article is to develop a system, which provides information about real time alternate routes to the drivers and also helps in selecting the optimal route among all the alternate routes from an origin to destination. Two types of query systems, special and general, are designed for drivers. Here, the criterion for route selection is introduced using primary and secondary road attributes. The presented methodology helps the drivers in better decision making to choose optimal route using fuzzy logic. For experimental results ORSVNS is tested over 220 km portion of Haryana state in India.

  8. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

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

  9. Approximation algorithms for some vehicle routing problems

    OpenAIRE

    Bazgan, Cristina; Hassin, Refael; Monnot, Jérôme

    2005-01-01

    We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is either to minimize the total distance traveled by vehicles or to minimize the number of vehicles used. We design constant differential approximation algorithms for kVRP. Note that, using the differential bound for METRIC 3VRP, we obtain the randomized standard ratio . This is an improvement of the best-known bound of 2 given by Haimovich et al. (Vehicle Ro...

  10. Route selection for vehicle navigation and control

    OpenAIRE

    G. Pang; Chu, MH

    2007-01-01

    This paper presents an application of neural-fuzzy methodology for the problem of route selection in a typical vehicle navigation and control system. The idea of the primary attributes of a route is discussed, and a neural-fuzzy system is developed to help a user to select a route out of the many possible routes from an origin to the destination. The user may not adopt the recommendation provided by the system and choose an alternate route. One novel feature of the system is that the neural-f...

  11. 动态车辆路径问题的分区灵活分批TSP策略%Flexible nTSP strategy of dynamic vehicle routing problems

    Institute of Scientific and Technical Information of China (English)

    熊浩

    2013-01-01

    Dynamic vehicle routing problem(DVRP) is emerging topical issue for the vehicle routing problem, but its real-time optimization still needs to be improved. Therefore, the mod nTSP strategy is proposed based on the flexible nTSP strategy. And the competitive analysis of the new strategy shows the reason of the improvement. Finally, the simulation results show that the new strategy can reduce the average distance between the adjacent customers on the routing of vehicle while keeping the other system time constant, and the average customer system time can be reduced.%动态车辆路径问题是当前车辆路径问题的新兴热门问题,但其实时优化策略研究仍然有较大的改进空间。鉴于此,在一般分区分批旅行商问题(TSP)策略的基础上,提出了分区灵活分批TSP策略,并对策略有效性进行了分析。最后进行了实例仿真验证,结果表明,所提出策略能够减少车辆服务顾客的平均行驶距离,从而减少顾客的平均系统时间。

  12. Visibility-constrained routing of unmanned aerial vehicles

    Science.gov (United States)

    Buck, Keith R.; Gassner, Richard R.; Poore, Aubrey B.; Yan, Xin

    1999-07-01

    Standard vehicle routing problems have been studied for decades in fields such as transportation, manufacturing, and commodity distribution. In this work, we proposed a variation of these problems that arise in routing Unmanned Aerial Vehicles (UAV's) in the presence of terrain obscuration. Specifically, the UAV must visit a location from which the object on the ground in mountainous regions can be viewed without actually flying over the object. Numerical results are presented for near optimal and real time algorithms which have been developed using Lagrangian relaxation techniques. Directions for future work that include priorities, time windows, and routing multiple UAV's with periodic and dynamic changes in the object locations are discussed.

  13. 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...... found in many optimal solutions to CVRP instances. An optimal solution to the PCVRP may therefore be useful in itself as a heuristic solution to the CVRP. Further, an attempt can be made to find an even better CVRP solution by solving a TSP, possibly leading to a non-pyramidal route, for each...... of the routes in the PCVRP solution. This paper develops an exact branch-and-cut-and-price (BCP) algorithm for the PCVRP. At the pricing stage, elementary routes can be computed in pseudo-polynomial time in the PCVRP, unlike in the CVRP. We have therefore implemented pricing algorithms that generate only...

  14. Optimizing departure times in vehicle routes

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.

    2011-01-01

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

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

  16. Electric Vehicle Green Routing with Possible En-Route Recharging

    OpenAIRE

    BAOUCHE, Fouad; BILLOT, Romain; Trigui, Rochdi; EL FAOUZI, Nour Eddin

    2014-01-01

    The deployment of Electric Vehicles (EVs) is constrained mainly by the restricted autonomy, the lack of charging stations, the battery recharge time and recuperation capability (e.g. braking phases or downhill). In this study we aim to develop a green routing tool to encourage the use of EV. To overcome the autonomy limitation we propose a methodology for the EV that includes a charging stations location model, an energy graph construction for EV routing and a resolution scheme for the routin...

  17. Rich Vehicle Routing Problems and Applications

    DEFF Research Database (Denmark)

    Wen, Min

    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 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...... given to various extensions of the VRP that arise in real life. These extensions are often called Rich Vehicle Routing Problems (RVRPs). In contrast to the research of classical VRP that focuses on the idealized models with unrealistic assumptions, the research of RVRPs considers those complicated...

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

    Science.gov (United States)

    Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

    2015-06-12

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

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

    Directory of Open Access Journals (Sweden)

    Jisheng Zhang

    2015-06-01

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

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

    Science.gov (United States)

    Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

    2015-01-01

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

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

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

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

  3. 突发事件下车辆路径问题的动态规划算法%Dynamic Programming Algorithm of Vehicle Routing Problems under Emergencies

    Institute of Scientific and Technical Information of China (English)

    欧微; 焦丽萍

    2011-01-01

    突发事件下的车辆运输具有紧迫性、动态性和随机不确定性等特点.本文研究了突发事件下动态车辆路径问题的数学模型,构建了一种基于混沌优化的动态规划算法,为此通过路径计算和动态规划两个模块来实现车辆路径的动态规划.为实现从混沌运动空间向问题可行解空间的有效映射,提出了相应的编码方法和操作算子.最后进行仿真,通过对静态环境、道路受损和道路拥塞三种情况的分析,验证了实时修订路经的有效性和实用性,为突发事件提供参考.%The vehicle transportation under emergencies is a kind of emergent, dynamic and random problems. The mathematics model of Dynamic Vehicle Routing Problems (DVRP) under emergencies is proposed, and an ap-proach solving DVRP based on chaos optimization is formulated, in which a route computing module and a dynamic programming module are introduced, and the corresponding coding method and operators are proposed to mapping the chaos space to feasible solution space. Finally, three cases of initial - state, road - damaged and road - congested are analyzed separately to demonstrate the necessary of real - time route adjusting and the efficiency of the proposed algorithm by computer simulations.

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

  5. A Generalized Assignment Heuristic for Vehicle Routing

    Science.gov (United States)

    1979-08-01

    1977), 517-524. 20. Shuster, K. A. and D. A. Schur.- "A Heuristic Approach to Routing Solid Waste Collection Vehicles," U.S. Environmental Protection...this problem by ( VRP ). L. . . . .. i -3- Formulation of the Vehicle Routing Problem ( VRP ) min Z c X. (1)ijk 1) i jk S.t. Z aiYik < bk , k ,...,K (2) 1...developing a sophisticated solution theory for the traveling salesman and generalized assignment models embedded within ( VRP ). By con- trast

  6. A Survey of Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Cao Wujun

    2017-01-01

    Full Text Available In recent years, vehicle routing problem (VRP has become an important content in logistics management research, and has been widely used in transportation system, logistics distribution system and express delivery system. In this paper, we discuss the classification of VRP, and summarize the common constraints of VRP, model algorithm and the main research results in recent years. Finally, we analyzes the future of VRP, and it is considered that the intelligent vehicle routing problem and intelligent heuristic algorithm will be an important field of future research.

  7. A Sweep Coverage Scheme Based on Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Li Shu

    2013-04-01

    Full Text Available As an emerging coverage problem in wireless sensor networks, sweep coverage which introducing mobile sensors to cover points of interest within certain time interval can satisfy monitoring request in some particular application scenarios with less number of nodes than the conventional static coverage approach. In this work, aiming to support dynamical POI coverage and data delivery simultaneously, a novel sweep coverage scheme, named VRPSC(Vehicle Routing Problem based Sweep Coverage, is proposed by modeling the minimum number of required sensors problem in sweep coverage as a Vehicle Routing Problem (VRP. In VRPSC, an insertion algorithm is first introduced to create the initial scanning routes for POIs, and then the Simulated Annealing is employed to optimize these routes. The simulation results show that the VRPSC scheme achieves better performance than existing schemes. 

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

  9. Analytical Analysis of Vehicle Routing and Inventory Routing Problems

    Science.gov (United States)

    2007-11-02

    The objective of the project is to perform analytical analyses of heuristics for the Vehicle Routing Problem ( VRP ) and apply the results in models...asymptotic optimal solution value of the VRP with capacity and time window constraints and used it to develop a new and efficient algorithm. (2) Obtained a...characterization of the effectiveness of set partitioning formulations for VRPs . (3) Characterized the worst case behavior of the linear programming

  10. Fast 3D route-planning approach for air vehicle

    Science.gov (United States)

    Tu, Jilin; Ding, Mingyue; Zhou, Chengping; Ai, Haojun

    1997-06-01

    A fast 3-D route planning method for unmanned air vehicle is proposed which can generate physically realizable 3-D route within a reasonable time. Our method includes two steps: First, 2-D route planning generates a route which satisfies turning radius constraint(abbreviated as R-constrained below); second, 3-D route planning generates 3-D route in vertical profile of the 2-D route. To make 2-D route R-constrained, a method is proposed by supposing 2-D route of air vehicle is composed of a sequence of arc route segments and tangential points between neighboring arcs are searching nodes. 3 -D route planning is considered as optimal control problem, and its route can be determined by applying motion equations of air vehicle. The experiments show that our method can produce feasible 3-D routes within a reasonable time, and ensure the planned 3-D routes satisfy aerodynamics constraints of air vehicle.

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

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

  13. Vehicle routing problem and capacitated vehicle routing problem frameworks in fund allocation problem

    Science.gov (United States)

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

    2016-11-01

    Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence of the assets. As a result, total investment risk is minimized by this sequence.

  14. Locating Depots for Capacitated Vehicle Routing

    DEFF Research Database (Denmark)

    Gørtz, Inge Li; Nagarajan, Viswanath

    2011-01-01

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

  15. Vehicle Routing Algorithms for Local Delivery at Naval Supply Centers.

    Science.gov (United States)

    1981-03-01

    the purpose of selecting a vehicle routing algorithm that can be automated. This investigation led the author to a survey of " vehicle routing problem " (also...the vehicle routing problem model is described and solution techniques are sur- veyed. Additionally, computational experience that operations...researchers have had with these solution techniques is pre- sented. There are several classical and theoretical problems related to the vehicle routing problem . These

  16. Vehicle routing with cross-docking

    DEFF Research Database (Denmark)

    Wen, Min; Larsen, Jesper; Clausen, Jens

    2009-01-01

    Over the past decade, cross-docking has emerged as an important material handling technology in transportation. A variation of the well-known Vehicle Routing Problem (VRP), the VRP with Cross-Docking (VRPCD) arises in a number of logistics planning contexts. This paper addresses the VRPCD, where...... a set of homogeneous vehicles are used to transport orders from the suppliers to the corresponding customers via a cross-dock. The orders can be consolidated at the cross-dock but cannot be stored for very long because the cross-dock does not have long-term inventory-holding capabilities. The objective...

  17. Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles

    Science.gov (United States)

    2008-12-01

    Vehicle Routing Problem , VRP 16. PRICE CODE 17. SECURITY CLASSIFICATION OF REPORT Unclassified 18. SECURITY CLASSIFICATION OF THIS PAGE...23 B. VEHICLE ROUTING PROBLEM ........................................................ 26 C. ORIENTEERING PROBLEM AND PRIZE...Team Orienteering Problem TSP Traveling Salesman Problem VRP Vehicle Routing Problem VRPPD VRP with Pick-Up And Delivering VRPTW VRP with Time

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

    DEFF Research Database (Denmark)

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

    assignment and routing problem with synchronization constraints. The problem has been solved by column generation. The synchronized vehicle dispatching problem (SVDP), which is a dynamic vehicle routing problem with synchronization between vehicles. Constraint programming and local search are applied...... to arrive at high-quality feasible solutions. A problem from the Port of Singapore, where technicians are allocated to service jobs has previously been studied. For each job, a certain combination of technicians with individual skills is needed. The technicians must be present at the same time, and hence...... the schedule for each technician must respect a number of synchronization constraints with other schedules. The problem is solved using metaheuristics. Another application with synchronization between visits is in ground handling at airports. Teams drive around at the airport and are assigned tasks...

  19. Waste Collection Vehicle Routing Problem: Literature Review

    Directory of Open Access Journals (Sweden)

    Hui Han

    2015-08-01

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

  20. Real Time Route for Dynamic Road Congestions

    Directory of Open Access Journals (Sweden)

    A. M. Riad

    2012-05-01

    Full Text Available Minimizing service delivery and travel time during rush hours downtown is strategic target for several organizations, especially the emergency organizations. This paper presents an On-line and Real-time Dynamic Route System (ORDRS which benefits from the advantages and integration between information system and communications technology. It utilizes Global Positioning System (GPS, Geographical Information Systems (GIS, and Global System for Mobile communications (GSM; for producing the real time routes for vehicles. GPS-Tracker is the main input device for ORDRS. It is fixated in a vehicle, sends vehicle's movement data (Geo-info to the control center wirelessly through either Short Message Service (SMS or General Packet Radio Service (GPRS. Geo-info includes time, date, longitude, latitude, speed, and etc., these data is classified over time during weekdays into interval time slices, each slice is 30 minutes. Speeds are treated by GIS tools to determine historical and real time speeds for each street segment in the road network which is being used for calculating time impedance (cost matrix for each street segment dynamically. ORDRS uses a cost matrix of the current time slice for determining the best route to each vehicle in duty attached. Several algorithms was used to calculate the shortest route, a comparison between Dijekstra and Yen algorithms was studied.

  1. Full truckload vehicle routing problem with profits

    Directory of Open Access Journals (Sweden)

    Jian Li

    2014-04-01

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

  2. The Balanced Billing Cycle Vehicle Routing Problem

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2009-01-01

    Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.

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

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

    OpenAIRE

    Jisheng Zhang; Limin Jia; Shuyun Niu; Fan Zhang; Lu Tong; Xuesong Zhou

    2015-01-01

    It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs) start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and no...

  5. Routing and Allocation of Unmanned Aerial Vehicles with Communication Considerations

    Science.gov (United States)

    Sabo, Chelsea

    solution. The algorithm is a cluster-first, route-second approach, but differs from conventional Vehicle Routing Problem (VRP) solutions in that the number of clusters is not necessarily equal to the number of vehicles. Because of this, a unique approach to clustering is adopted to form clusters using hierarchical agglomerative clustering and fuzzy logic. Based on a detailed Monte Carlo analysis, the heuristic algorithm showed near-optimal (within ˜5%) results calculable in real-time (allowing it to be used in dynamic scenarios too) and scaled to much larger problem sizes. Furthermore, the performance was analyzed under varying degrees of dynamism and arrival rates. Results showed good performance, and found the boundaries for the regions of light and heavy load cases for a single vehicle to be about 0.3 and 4 requests an hour, respectively. Finally, both static and dynamic cases were validated in flight testing, highlighting the usability of this approach.

  6. A Survey on Routing Mechanism and Techniques in Vehicle to Vehicle Communication (VANET

    Directory of Open Access Journals (Sweden)

    Yugal Kumar

    2011-02-01

    Full Text Available Now a day, one of the most attractive research topics in the area of Intelligent Traffic Control is Intervehiclecommunication. In V2V communication or we can also called VANET i.e. vehicular ad-hocnetwork; a vehicle can communicate to its neighboring vehicles even in the absence of a central BaseStation. The concept of this direct communication is to send vehicle safety messages one-to-one or oneto-many vehicles via wireless connection. Such messages are usually short in length and have very shortlifetime in which they must reach at the destination. The Inter-vehicle communication system is an adhocnetwork with high mobility and changing number of nodes, where mobile nodes dynamically createtemporary networks and transferring messages from one node to others by using multiple hops due tolimitation of short range. The routing in vehicular Ad hoc Networks (VANET has attracted manyattentions during the last few years. So in this paper we are focusing on the routing concept for theVANET i.e. principles for routing, decomposition of the routing function and requirement. The datadelivery through Vehicular Ad-hoc Networks is challenging since it must efficiently handle rapidtopology changes and a fragmented network.

  7. A New Route Maintenance in Dynamic Source Routing Protocol

    CERN Document Server

    Shukla, Ashish

    2010-01-01

    Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi hop packet switched network. A number of routing protocols for MANETs have been proposed in recent years. Dynamic Source Routing (DSR) protocol is one of the most popular routing protocol for ad hoc networks. This paper presents a novel method to enhance route maintenance part of DSR protocol. Our proposed route maintenance significantly increases the efficiency of the protocol at the time of route failures.

  8. Vehicle Dynamics and Control

    CERN Document Server

    Rajamani, Rajesh

    2012-01-01

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

  9. Using Tabu Search Heuristics in Solving the Vehicle Routing ...

    African Journals Online (AJOL)

    Nafiisah

    Routing Problem with Time Windows where the capacity of vehicle has been taken ... The optimal routes of the delivery of frozen chicken were found and it ... messages, people or goods from one place to another (Toth and Vigo, 2000). VRP.

  10. Model and Two-stage Algorithm on Dynamic Vehicle Routing Problem%一类动态车辆路径问题模型和两阶段算法

    Institute of Scientific and Technical Information of China (English)

    饶卫振; 金淳; 刘锋; 杨磊

    2015-01-01

    In order to effectively solve dynamic vehicle routing problem (DVRP), this paper analyzes the substantial effect of four main categories of dynamic information on classical vehicle routing problem, and transform DVRP into multiple static fleet size and mixed open vehicle routing problems (FSMOVRP). And FSMOVRP could be further converted to multiple capacitated vehicle routing problems (CVRP). The model based on CVRP is built up for DVRP. After that a two-stage algorithm is proposed to solve DVRP model according to the analysis of DVRP characteristics. In the first stage, a fast construction algorithm with merely O(nlogn) complexity is proposed on the basis of delivery region cutting strategy by K-d trees method. In the second stage, a hybrid local search algorithm is designed by analysis of structural principal of algorithm’s solution searching space. Finally for the purpose of algorithm verification, we design and solve 36 DVRP instances generated from 12 large scale CVRP benchmark instances. The results demonstrate the effectiveness of the model and two-stage solving algorithm.%针对一类动态车辆路径问题,分析4种主要类型动态信息对传统车辆路径问题的本质影响,将动态车辆路径问题(Dynamic Vehicle Routing Problem, DVRP)转化为多个静态的多车型开放式车辆路径问题(The Fleet Size and Mixed Open Vehicle Routing Problem, FSMOVRP),并进一步转化为多个带能力约束车辆路径问题(Capacitated Vehicle Routing Problem, CVRP),基于CVRP模型建立了DVRP模型;然后,在分析DVRP问题特点基础上,提出两阶段算法,第一阶段基于利用K-d trees对配送区域进行分割的策略,提出了复杂度仅为O(nlogn)的快速构建型算法,第二阶段通过分析算法搜索解空间结构原理,设计混合局部搜索算法;最后,基于现有12个大规模CVRP标准算例,设计并求解36个DVRP算例。求解结果表明了模型和两阶段算法的有效性。

  11. Open Vehicle Routing Problem by Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Er. Gurpreet Singh

    2014-01-01

    Full Text Available Vehicle routing problem (VRP is real-world combinatorial optimization problem which determine the optimal route of a vehicle. Generally, toprovide the efficientvehicle serving to the customer through different services by visiting the number of cities or stops. The VRP follows the Travelling Salesman Problem (TSP, in which each of vehicle visiting a set of cities such that every city is visited by exactly one vehicle only once. This work proposes the Ant Colony Optimization (ACO-TSP algorithm to eliminate the tour loop for Open Vehicle routing Problem (OVRP. A key aspect of this algorithm is to plan the routes of buses that must pick up and deliver the school students from various bus stops on time, especially in the case of far distance covered by the vehicle in a rural area and find out the efficient and safe vehicle route.

  12. A survey on multi trip vehicle routing problem

    OpenAIRE

    2008-01-01

    The vehicle routing problem (VRP) and its variants are well known and greatly explored in the transportation literature. The vehicle routing problem can be considered as the scheduling of vehicles (trucks) to a set of customers under various side constraints. In most studies, a fundamental assumption is that a vehicle dispatched for service finishes its duty in that scheduling period after it returns back to the depot. Clearly, in many cases this assumption may not hold. Thus, in the last dec...

  13. Genetic Algorithms for multiple objective vehicle routing

    CERN Document Server

    Geiger, Martin Josef

    2008-01-01

    The talk describes a general approach of a genetic algorithm for multiple objective optimization problems. A particular dominance relation between the individuals of the population is used to define a fitness operator, enabling the genetic algorithm to adress even problems with efficient, but convex-dominated alternatives. The algorithm is implemented in a multilingual computer program, solving vehicle routing problems with time windows under multiple objectives. The graphical user interface of the program shows the progress of the genetic algorithm and the main parameters of the approach can be easily modified. In addition to that, the program provides powerful decision support to the decision maker. The software has proved it's excellence at the finals of the European Academic Software Award EASA, held at the Keble college/ University of Oxford/ Great Britain.

  14. The vehicle routing problem with backhauls

    Energy Technology Data Exchange (ETDEWEB)

    Goetschalckx, M.; Jacobs-Blecha, C.

    1989-09-05

    The Vehicle Routing Problem with Backhauls is a pickup/delivery problem where on each route all deliveries must be made before any pickups. A two-phased solution methodology is proposed. In the first phase, a high quality initial feasible solution is generated based on spacefilling curves. In the second phase, this solution is improved based on optimization of the subproblems identified in a mathematical model of the problem. An extensive computational analysis of several initial solution algorithms is presented, which identifies the tradeoffs between solution quality and computational requirements. The class of greedy algorithms is capacity oriented, while K-median algorithms focus on distance. It is concluded that the greedy and K-median algorithms generate equivalent tour lengths, but that the greedy procedure reduces the required number of trucks and increases the truck utilization. The effect of exchange improvement procedures as well as optimal procedures on solution quality and run time is demonstrated. Comparisons with the Clark-Wright method adapted to backhauls are also given. 4 figs., 26 refs.

  15. Integration of Predictive Routing Information with Dynamic Traffic Signal Control

    Science.gov (United States)

    1994-05-01

    vehicles without the on-board guidance aid (Harris, S., Rabone , A., et.al., 1992). The simulation developed was called ROute GUidance Simulation (ROGUS...Florida. Harris, S., Rabone , A., et.al. 1992. ROGUS: A Simulation of Dynamic Route Guidance Systems. Traffic Engineering and Control(33)327-329

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

    NARCIS (Netherlands)

    Meyer, Christoph Manuel; Kopfer, Herbert; Kok, Adrianus Leendert; Schutten, Marco; Kreowski, Hans-Jörg; Scholz-Reiter, Bernd; Thoben, Klaus-Dieter

    2011-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 plann

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

    NARCIS (Netherlands)

    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 plann

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

  19. OPTIMIZATION OF CAPACITATED VEHICLE ROUTING PROBLEM USING PSO

    Directory of Open Access Journals (Sweden)

    S.R.VENKATESAN

    2011-10-01

    Full Text Available This paper presents solution techniques for Capacitated Vehicle Routing Problem (CVRP using metaheuristics. Capacitated Vehicle Routing Problem is divided into set of customers called cluster, and find optimum travel distance of vehicle route. The CVRP is a combinatorial optimization problem; particle swarm optimization(PSO technique is adapted in this paper to solve this problem. The main problem is divided into subprograms/clusters and each subprogram is treated as travelling salesman problem and solved by usingparticle swarm optimization techniques (PSO. This paper presents a sweep, Clark and wright algorithm to form the clusters. This model is then solved by using a particle swarm optimization (PSO method to find optimum travel distance of vehicle route. Our analysis suggests that the proposed model enables users to establish route to serve all given customers with minimum distance of vehicles and maximum capacity.

  20. Intelligent emission-sensitive routing for plugin hybrid electric vehicles.

    Science.gov (United States)

    Sun, Zhonghao; Zhou, Xingshe

    2016-01-01

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

  1. Dynamic Weather Routes Architecture Overview

    Science.gov (United States)

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

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

  2. Dynamics of aerospace vehicles

    Science.gov (United States)

    Schmidt, David K.

    1991-01-01

    The focus of this research was to address the modeling, including model reduction, of flexible aerospace vehicles, with special emphasis on models used in dynamic analysis and/or guidance and control system design. In the modeling, it is critical that the key aspects of the system being modeled be captured in the model. In this work, therefore, aspects of the vehicle dynamics critical to control design were important. In this regard, fundamental contributions were made in the areas of stability robustness analysis techniques, model reduction techniques, and literal approximations for key dynamic characteristics of flexible vehicles. All these areas are related. In the development of a model, approximations are always involved, so control systems designed using these models must be robust against uncertainties in these models.

  3. Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP)

    OpenAIRE

    2005-01-01

    This research studies a new class of dynamic problem MTVRP where n vehicles are routed in real time in a fast varying environment to pickup and deliver m passengers when both n and m are big. The problem is very relevant to future transportation options involving large scale real-time routing of shared-ride fleet transit vehicles. Traditionally, dynamic routing solutions were found as static approximations for smaller-scale problems or using local heuristics for the larger-scale ones. General...

  4. Vehicle routing with multiple use of vehicles. Publication No. 95-19, and Publication No. 964

    Energy Technology Data Exchange (ETDEWEB)

    Taillard, E.D.; Gendreau, M.; Laporte, G.

    1995-10-01

    The vehicle routing problem is a central problem in distribution management. A variant of the standard problem with multiple use of vehicles involves the same vehicle being assigned to several routes during a given planning period. This paper develops a tabu search heuristic for this variant problem. The algorithm and computational results on a series of test problems are presented.

  5. Congestion avoidance and break scheduling within vehicle routing

    NARCIS (Netherlands)

    Kok, Adrianus Leendert

    2010-01-01

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

  6. Congestion avoidance and break scheduling within vehicle routing

    NARCIS (Netherlands)

    Kok, A.L.

    2010-01-01

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

  7. Meta Heuristic Algorithms for Vehicle Routing Problem with Stochastic Demands

    Directory of Open Access Journals (Sweden)

    Geetha Shanmugam

    2011-01-01

    Full Text Available Problem statement: The shipment of goods from manufacturer to the consumer is a focal point of distribution logistics. In reality, the demand of consumers is not known a priori. This kind of distribution is dealt by Stochastic Vehicle Routing Problem (SVRP which is a NP-hard problem. In this proposed work, VRP with stochastic demand is considered. A probability distribution is considered as a random variable for stochastic demand of a customer. Approach: In this study, VRPSD is resolved using Meta heuristic algorithms such as Genetic Algorithm (GA, Particle Swarm Optimization (PSO and Hybrid PSO (HPSO. Dynamic Programming (DP is used to find the expected cost of each route generated by GA, PSO and HPSO. Results: The objective is to minimize the total expected cost of a priori route. The fitness value of a priori route is calculated using DP. In proposed HPSO, the initial particles are generated based Nearest Neighbor Heuristic (NNH. Elitism is used in HPSO for updating the particles. The algorithm is implemented using MATLAB7.0 and tested with problems having different number of customers. The results obtained are competitive in terms of execution time and memory usage. Conclusion: The computational time is reduced as polynomial time as O(nKQ time and the memory required is O(nQ. The ANOVA test is performed to compare the proposed HPSO with other heuristic algorithms.

  8. A Tabu Search Heuristic for the Vehicle Routing Problem

    OpenAIRE

    1994-01-01

    The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical test...

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

  10. Microcomputer-based vehicle routing and scheduling: An overview

    Energy Technology Data Exchange (ETDEWEB)

    Klein, A.J.

    1987-08-01

    Commercially available vehicle-routing and scheduling packages were surveyed to assess capabilities, categorize key characteristics, compare individual packages, and select candidate software for additional testing. Among the key characteristics addressed were backhauling, distance and vehicle travel-time calculation, geocoding, speed zones, natural barriers, time-window constraints, vehicle/stop matching constraints, and other constraints such as vehicle/driver operating costs. The survey included review of vendor literature, telephone interviews, site visits to review software, and the testing of demonstration packages on a set of sample distribution networks. Thirteen packages were reviewed; these were categorized by price and performance as follows; (1) inexpensive packages (costing $2000 or less), which solve the basic vehicle-routing problem but are somewhat limited in their ability to handle large numbers of vehicles and stops; (2) medium-priced systems (from $5000 to $20,000), which offer more capability to handle constraints such as multiple pickup and delivery, time windows, and multiple depots and provide manual intervention capability and enhanced graphics; (3) very expensive systems (from $50,000 to about $150,000), which can handle real-time situations in scheduling last-minute route changes and employ sophisticated graphics tools to change route schedules interactively. Out of the 13 packages, four demonstration vehicle-routing packages were obtained for testing of 4 sample networks; two of the packages were found to be capable of solving most vehicle-routing problem constraints for two versions of 21-city and 30-city networks.

  11. Vehicle dynamics theory and application

    CERN Document Server

    Jazar, Reza N

    2017-01-01

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

  12. A Dynamic Travel Time Estimation Model Based on Connected Vehicles

    Directory of Open Access Journals (Sweden)

    Daxin Tian

    2015-01-01

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

  13. Dynamic Routing of Short Transfer Baggage

    DEFF Research Database (Denmark)

    Clausen, Tommy; Pisinger, David

    of dispatch. Computational results are presented for real-life passenger data with stochastic bag arrival times and travel times. The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running...... times, the algorithm is suitable for dynamic dispatching. Investigations on the impact of uncertainty and fleet size make it possible to support a trade-off between fleet size and expected service level.......We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags...

  14. Rail vehicle dynamics

    CERN Document Server

    Knothe, Klaus

    2017-01-01

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

  15. The vehicle routing problem latest advances and new challenges

    CERN Document Server

    Golden, Bruce L; Wasil, Edward A

    2008-01-01

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

  16. Cobweb heuristic for multi-objective vehicle routing problem

    OpenAIRE

    Joseph Okitonyumbe Y. F; Berthold Ulungu E.-L; Joel Kapiamba Nt.

    2015-01-01

    Solving a classical vehicle routing problem (VRP) by exact methods presents many difficulties for large dimension problem. Consequently, in multi-objective framework, heuristic or metaheuristic methods are required. Due to particular VRP structure, it seems that a dedicated heuristicis more suitable than a metaheuristic. The aim of this article is to collapse different heuristics solving classical VRP and adapt them for to solve the multi-objective vehicle routing problem (MOVRP). The so-call...

  17. Cobweb Heuristic for solving Multi-Objective Vehicle Routing Problem

    OpenAIRE

    Okitonyumbe Y.F., Joseph; Ulungu, Berthold E.-L.; Kapiamba Nt., Joel

    2015-01-01

    Abstract Solving a classical vehicle routing problem (VRP) by exact methods presents many difficulties for large dimension problem. Consequently, in multi-objective framework, heuristic or metaheuristic methods are required. Due to particular VRP structure, it seems that a dedicated heuristic is more suitable than a metaheuristic. The aim of this article is to collapse different heuristics solving classical VRP and adapt them for to solve the multi-objective vehicle routing problem (MOVRP)...

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

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

  20. Heuristic for vehicle routing problem with release and due dates

    Science.gov (United States)

    Johar, Farhana; Potts, Chris; Bennell, Julia

    2014-06-01

    This research is classifies as non-classical Vehicle Routing Problem (VRP) where the maximum release date of customer's demand of the route determine the vehicle departure time. Thus, there could be lateness on the delivery process from awaiting all customers' demand of the route to be released. A mathematical formulation is developed to represent the problem studied. Insertion method based on the cheapest cost is used to generate an initial solution. Then, Local Search technique is applied to improve the solution in term of minimization of total traveling and tardiness cost.

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

  2. Multicriteria vehicle routing problem solved by artificial immune system

    Directory of Open Access Journals (Sweden)

    Bogna MRÓWCZYŃSKA

    2015-09-01

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

  3. Hybrid Ant Algorithm and Applications for Vehicle Routing Problem

    Science.gov (United States)

    Xiao, Zhang; Jiang-qing, Wang

    Ant colony optimization (ACO) is a metaheuristic method that inspired by the behavior of real ant colonies. ACO has been successfully applied to several combinatorial optimization problems, but it has some short-comings like its slow computing speed and local-convergence. For solving Vehicle Routing Problem, we proposed Hybrid Ant Algorithm (HAA) in order to improve both the performance of the algorithm and the quality of solutions. The proposed algorithm took the advantages of Nearest Neighbor (NN) heuristic and ACO for solving VRP, it also expanded the scope of solution space and improves the global ability of the algorithm through importing mutation operation, combining 2-opt heuristics and adjusting the configuration of parameters dynamically. Computational results indicate that the hybrid ant algorithm can get optimal resolution of VRP effectively.

  4. Parallelization of the Vehicle Routing Problem with Time Windows

    OpenAIRE

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

  5. The Dynamic Multi-objective Multi-vehicle Covering Tour Problem

    Science.gov (United States)

    2013-06-01

    Routing Problem VEGA Vector Evaluated Genetic Algorithm VRP Vehicle Routing Problem VRPTW Vehicle routing problem with time windows xiv THE DYNAMIC MULTI...the TSP, CTP and Vehicle Routing Problem ( VRP ). Reviews of work in this area include [16, 39, 89, 90]. Recent developments enabling real-time...version of the VRP . Jozefowiez, et al. [85] study a bi-objective CTP which minimizes the total route cost ( f1(R)) and the distance from the nodes to be

  6. Dynamic information routing in complex networks

    Science.gov (United States)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-01-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function. PMID:27067257

  7. Dynamic information routing in complex networks

    Science.gov (United States)

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

    2016-04-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function.

  8. Electric Vehicle Routing Problem with Charging Time and Variable Travel Time

    Directory of Open Access Journals (Sweden)

    Sai Shao

    2017-01-01

    Full Text Available An electric vehicle routing problem with charging time and variable travel time is developed to address some operational issues such as range limitation and charging demand. The model is solved by using genetic algorithm to obtain the routes, the vehicle departure time at the depot, and the charging plan. Meanwhile, a dynamic Dijkstra algorithm is applied to find the shortest path between any two adjacent nodes along the routes. To prevent the depletion of all battery power and ensure safe operation in transit, electric vehicles with insufficient battery power can be repeatedly recharged at charging stations. The fluctuations in travel time are implemented to reflect a dynamic traffic environment. In conclusion, a large and realistic case study with a road network in the Beijing urban area is conducted to evaluate the model performance and the solution technology and analyze the results.

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

  10. Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms

    CERN Document Server

    Nallusamy, R; Dhanalaksmi, R; Parthiban, P

    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 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 various heuristic 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 Algorit...

  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. A Subpath Ejection Method for the Vehicle Routing Problem

    OpenAIRE

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

  13. Partial Path Column Generation for the Vehicle Routing Problem

    DEFF Research Database (Denmark)

    Jepsen, Mads Kehlet; Petersen, Bjørn

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

  14. An Effective Hybrid 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 important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. A hybrid algorithm was developed to solve the problem, in which an artificial immune clonal algorithm (AICA) makes use of the global search ability to search the optimal results and simulated annealing (SA) algorithm employs certain probability to avoid becoming trapped in a local optimum. The results obtained from the computational study show that the proposed algorithm is a feasible and effective method for capacitated vehicle routing problem.

  15. Solving the Vehicle Routing Problem using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Abdul Kadar Muhammad Masum

    2011-08-01

    Full Text Available The main goal of this research is to find a solution of Vehicle Routing Problem using genetic algorithms. The Vehicle Routing Problem (VRP is a complex combinatorial optimization problem that belongs to the NP-complete class. Due to the nature of the problem it is not possible to use exact methods for large instances of the VRP. Genetic algorithms provide a search technique used in computing to find true or approximate solution to optimization and search problems. However we used some heuristic in addition during crossover or mutation for tuning the system to obtain better result.

  16. Parallelization of the Vehicle Routing Problem with Time Windows

    DEFF Research Database (Denmark)

    Larsen, Jesper

    1999-01-01

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

  17. Capacitated Vehicle Routing with Non-Uniform Speeds

    CERN Document Server

    Gortz, Inge Li; Nagarajan, Viswanath; Ravi, R

    2010-01-01

    The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple vehicles having non-uniform speeds (that we call Heterogenous CVRP), and present a constant-factor approximation algorithm. The technical heart of our result lies in achieving a constant approximation to the following TSP variant (called Heterogenous TSP). Given a metric denoting distances between vertices, a depot r containing k vehicles with possibly different speeds, the goal is to find a tour for each vehicle (starting and ending at r), so that every vertex is covered in some tour and the maximum completion time is minimized. This problem is precisely Heterogenous CVRP when vehicles are uncapacitated. The presence of non-uniform speeds introduces difficulties for employing standard tour-splitting techniques. In order to get a better understanding of this technique in our con...

  18. Dynamic information routing in complex networks

    CERN Document Server

    Kirst, Christoph; Battaglia, Demian

    2015-01-01

    Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this generic mechanism specifically for oscillatory dynamics and analyze how individual unit properties, the network topology and external inputs coact to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine non-local network-wide communication. These results help...

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

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens

    2007-01-01

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

  20. Opportunity costs calculation in agent-based vehicle routing and scheduling

    NARCIS (Netherlands)

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

    2006-01-01

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

  1. Opportunity costs calculation in agent-based vehicle routing and scheduling

    NARCIS (Netherlands)

    Mes, Martijn; Heijden, van der Matthieu; Schuur, Peter

    2006-01-01

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

  2. Electric Vehicle Routing Problems : models and solution approaches

    OpenAIRE

    Montoya, Jose-Alejandro

    2016-01-01

    Electric vehicles (evs) are one of the most promising technologies to reduce the greenhouse gas emissions. For this reason, the use of evs in service operations has dramatically increased in recent years. Despite their environmental benefits, evs still face technical constraints such as short autonomy and long charging times. Taking into account these constraints when planning ev operations leads to a new breed of vehicle routing problems (vrps), known as electricVrps (evrps). In addition, to...

  3. Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints

    Directory of Open Access Journals (Sweden)

    David Levy

    2014-01-01

    Full Text Available This paper addresses a multiple depot, multiple unmanned vehicle routing problem with fuel constraints. The objective of the problem is to find a tour for each vehicle such that all the specified targets are visited at least once by some vehicle, the tours satisfy the fuel constraints, and the total travel cost of the vehicles is a minimum. We consider a scenario where the vehicles are allowed to refuel by visiting any of the depots or fuel stations. This is a difficult optimization problem that involves partitioning the targets among the vehicles and finding a feasible tour for each vehicle. The focus of this paper is on developing fast variable neighborhood descent (VND and variable neighborhood search (VNS heuristics for finding good feasible solutions for large instances of the vehicle routing problem. Simulation results are presented to corroborate the performance of the proposed heuristics on a set of 23 large instances obtained from a standard library. These results show that the proposed VND heuristic, on an average, performed better than the proposed VNS heuristic for the tested instances.

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

    Directory of Open Access Journals (Sweden)

    İsmail Karaoğlan

    2015-06-01

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

  5. Launch Vehicle Dynamics Demonstrator Model

    Science.gov (United States)

    1963-01-01

    Launch Vehicle Dynamics Demonstrator Model. The effect of vibration on launch vehicle dynamics was studied. Conditions included three modes of instability. The film includes close up views of the simulator fuel tank with and without stability control. [Entire movie available on DVD from CASI as Doc ID 20070030984. Contact help@sti.nasa.gov

  6. Time-dependent Single Vehicle Routing Problem and Dynamic Programming Algorithm with Greed Dispatching Restriction%时变单车路径优化模型及动态规划算法

    Institute of Scientific and Technical Information of China (English)

    彭勇; 殷树才

    2014-01-01

    车辆路径问题由于其广泛的应用领域及经济价值而成为学术研究热点。然而,在已有的研究文献中,车辆的速度时变与服务多任务特性很少被关注。本文讨论了具有这两个特性的单车路径优化问题。建立了以送货完成时间最早为优化目标的时变单车送货路径优化模型。由于很难获得该模型的精确解,本文提出了一种贪婪补货策略压缩原问题解空间,设计动态规划算法给出了车辆行驶时间满足FIFO规则的送货顺序近似最优解。数值算例验证了该算法所得到的解仅是原问题的近似最优解这一结论。算例同时表明优化配送时间随着车辆装载能力的增大而缩短,并在车辆装载能力超过所有客户配送总需求时实现最短配送时间,即,使用较大装载能力车辆能节约更多配送时间。%Vehicle routing problems have been extensively studied due to its extensive application and great value on economy.However, two constraints receive less attention , i.e., vehicle speed will be changed with time , and vehicle can service more than one trip .This paper discusses single vehicle routing problem with these two constraints .A mathematic model the optimal object of which is to find the route schedule which has the earliest task completion time is established .It's hard to achieve exact solutions of the problem .So the paper proposes a greed dispatching strategy for the model to compress solution space , and provides a dynamic programming algo-rithm with FIFO rule .The numerical examples demonstrate that for our model , the solution provided by dynamic programming algorithm is only a satisfactory solution .The numerical examples also indicate the optimal dispatc-hing time decreases while the vehicle load capacity increases , and it gets the minimum when the vehicle load ca-pacity is larger than customers total demand .That is, using larger capacity vehicle will save more dispatching

  7. Path inequalities for the vehicle routing problem with time windows

    DEFF Research Database (Denmark)

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

    2007-01-01

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

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

  9. Route-Based Control of Hybrid Electric Vehicles: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Gonder, J. D.

    2008-01-01

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

  10. Fast ejection chain algorithms for vehicle routing with time windows

    NARCIS (Netherlands)

    Sontrop, Herman; Blesa, M.J.; Blum, C.; van der Horn, Pieter; Uetz, Marc Jochen; Roli, A.; Sampels, M.

    This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejection chains create powerful compound moves within Local Search algorithms. Their potential to yield state of the art algorithms has

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

  12. Dynamic Routing of Short Transfer Baggage

    OpenAIRE

    2010-01-01

    We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags that arrive continuously during the day. We present an IP model of the problem and describe the problem as a case study from a real life setting. We present a weighted greedy algorithm for dispatching ...

  13. 多阶段动态车辆路径问题实时优化策略%Real-Time Optimization Strategy of the Multi-Period Dynamic Vehicle Routing Problems

    Institute of Scientific and Technical Information of China (English)

    熊浩; 鄢慧丽; 周和平; 柳伍生

    2013-01-01

    针对多阶段动态车辆路径单决策和多决策问题,分别提出了平均距离策略和分区分批旅行商策略.前者优先安排不能延迟的顾客,然后根据路径的平均顾客距离选择可延迟顾客;后者根据阶段内决策的时间界限只在最后一次决策才考虑拒绝和延迟,实例仿真结果表明,新策略都具有较好的优化效果.%The multi-period dynamic vehicle routing problem(MPDVRP) belongs to the emerging problem of dynamic vehicle routing problem, which can be divided into single decision-making problem and multi-decision-making problem. Average distance strategy and cutting-and-batch TSP strategy were constructed for these two types of problems. The average distance strategy gives priority to customers those cannot be delayed, and then selects the customers those can be delayed according to the average path distance. In cutting-and-batch TSP strategy, the customers will be delayed or refused only in the last decision according to decision-making time limit. Simulations of the two strategies were carried out, and the numerical results show that the two strategies are both better than the existing strategies.

  14. Genetic Algorithm for Vehicle Routing Problem with Backhauls

    Directory of Open Access Journals (Sweden)

    W.Nurfahizul Ifwah. WA

    2012-07-01

    Full Text Available The Vehicle Routing Problem with Backhauls (VRPB is an extension of the classical Vehicle Routing Problem (VRP that includes both a set of customers to whom products are to be delivered and a set of suppliers whose goods need to be transported back to the distribution center. In addition, on each route all deliveries have to be made before any goods can be picked up to avoid rearranging the loads on the vehicle. The main objective for VRPB is to determine the network route to minimize the total cost, distance or time. There are a few methods that can be identified to solve this VRPB. The objective of this research is to present a heuristic method, called Genetic Algorithm (GA, for the VRPB. In brief, GA is a system developing methods that use the natural principle of a genetic population and involved three main processes that is crossover, mutation and inversion. GA implementation on the 68 nodes problems taken from Goetschalckx and Jacobs- Blecha is done by using Microsoft C++ Programming. Solutions to the problem are presented and performance comparison is conducted with the existing best solution. Several parameters in GA will be tested such as population size, crossover point and also the choice of operators used.

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

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

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

  18. Inventory routing for dynamic waste collection

    NARCIS (Netherlands)

    Mes, Martijn R.K.; Schutten, Johannes M.J.; Perez Rivera, Arturo Eduardo

    2013-01-01

    We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense

  19. Inventory routing for dynamic waste collection

    NARCIS (Netherlands)

    Mes, Martijn R.K.; Schutten, Johannes M.J.; Perez Rivera, Arturo Eduardo

    2014-01-01

    We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense

  20. Implementasi Algoritma Clarke And Wright’s Savings Dalam Menyelesaikan Capacitated Vehicle Routing Problem (CVRP)

    OpenAIRE

    Damanik, Donna

    2016-01-01

    Model to choose vehicle route is known as Vehicle Routing Problem (VRP). VRP is related to optimal routing problem that involve more than one vehicle of each capacity to serve costumer’s demand. Capacitated Vehicle Routing Problem is one of VRP form which each of vehicle has finite capacity. Solution in this research use Clarke and Wright’s Savings Algorithm. This algorithm may get a route depand to vehicle capacity and customer’s demand. Data that use in this research is di...

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

    DEFF Research Database (Denmark)

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

    2012-01-01

    A service provided by the liner shipping companies is the transport of containers by truck between the terminal and customers. These transports consist of import orders and export orders. Even though these transports concern containers and, therefore, each order is a full load, an import...... and an export order can be combined in one trip where the container is emptied at an import customer and taken to an export customer to be filled. Finding a set of optimal vehicle routes allowing these combinations is NP-hard. However, exploring the fact that the number of possible routes is small...

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

    OpenAIRE

    I Nyoman Sutapa; I Gede Agus Widyadana; Christine Christine

    2003-01-01

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

  3. A Cost Assessment of the Dayton Public Schools Vehicle Routing Problem

    Science.gov (United States)

    2009-03-01

    A COST ASSESMENT OF THE DAYTON PUBLIC SCHOOLS VEHICLE ROUTING PROBLEM THESIS...PUBLIC SCHOOLS VEHICLE ROUTING PROBLEM THESIS Presented to the Faculty Department of Operational Sciences Graduate School of... VEHICLE ROUTING PROBLEM Frankie L. Woods Jr., BS Captain, USAF Approved: ____________________________________ Dr

  4. A novel heuristic algorithm for capacitated vehicle routing problem

    Science.gov (United States)

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

    2017-02-01

    The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several specifically designed operators and features to solve the capacitated vehicle routing problem (CVRP). The effectiveness of the proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large-scaled instances and gained advantage in terms of CPU time. In addition, we solved a real-life CVRP using the proposed algorithm and found the encouraging results by comparison with the current situation that the company is in.

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

  6. The vehicle routing problem with two classes of vehicles and a limit on the number of vehicles in each class

    Energy Technology Data Exchange (ETDEWEB)

    Martins, P.; Gouveia, L.

    1994-12-31

    In this talk we discuss several linear integer programming formulations for a particular case of the Vehicle Routing Problem, where several classes of vehicles are considered and a fixed number of vehicles is imposed in each class. We also present a set of valid inequalities which lead to significant improvements on the lower bounds. Some heuristics are also discussed. We present computational results taken from a set of tests with the number of clients ranging from 13 to 75.

  7. A Parallel Algorithm for the Vehicle Routing Problem

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2011-01-01

    The vehicle routing problem (VRP) is a dicult and well-studied combinatorial optimization problem. We develop a parallel algorithm for the VRP that combines a heuristic local search improvement procedure with integer programming. We run our parallel algorithm with as many as 129 processors and are able to quickly nd high-quality solutions to standard benchmark problems. We assess the impact of parallelism by analyzing our procedure's performance under a number of dierent scenarios.

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

  9. New exact algorithms for the vehicle routing problem

    Energy Technology Data Exchange (ETDEWEB)

    Mingozzi, A.; Galdacci, R.; Christofides, N.; Hadjiconstantinou, E.

    1994-12-31

    We consider the problem in which a fleet of M vehicles stationed at a central depot is to be optimally routed to supply customers with known demands subject to vehicle capacity constraints. This problem is referred as the Vehicle Routing Problem (VRP). In this paper we present two exact branch and bound algorithms for solving the VRP based on a Set Partitioning formulation of the problem. The first algorithm is based on a bounding procedure that finds a heuristic solution of the dual of the LP-relaxation of the Set Partitioning formulation without generating the entire set partitioning matrix. The dual solution obtained is then used to limit the set of the feasible routes containing the optimal VRP solution. The resulting Set Partitioning problem is solved by using a branch and bound method. The second algorithm is based on a lower bound that makes use of a new surrogate relaxation of the Set Partitioning problem. The two algorithms can solve both symmetric and asymmetric VRPS. Computational results are presented for a number of problems derived from the literature.

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

  11. Dynamic Routing during Disaster Events

    NARCIS (Netherlands)

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

    2015-01-01

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

  12. Periodic Sweep Coverage Scheme Based on Periodic Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Li Shu

    2014-03-01

    Full Text Available We provide a sweep coverage algorithm for routing mobile sensors that communicate with a central data sink. This algorithm improves on its predecessors by reducing the number of unnecessary scans when different points of interest (POIs have different requirements for the time interval within which they must be scanned (sweep period. Most sweep coverage algorithms seek to minimize the number of sensors required to cover a given collection of POIs. When POIs have different sweep period requirements, existing algorithms will produce solutions in which sensors visit some POIs much more frequently than is necessary. We define this as the POI Over-Coverage problem. In order to address this problem we develop a Periodic Sweep Coverage (PSC scheme based on a well-known solution to the Periodic Vehicle Routing Problem (PVRP. Our algorithm seeks a route for the mobile sensors that minimizes the number of unnecessary visits to each POI. To verify and test the proposed scheme we implemented a C++ simulation and ran scenarios with a variety of POI topologies (number and distribution of the POIs and the speed at which sensors could travel. The simulation results show that the PSC algorithm outperforms other sweep coverage algorithms such as CSweep and Vehicle Routing Problem Sweep Coverage (VRPSC on both the average number of sensors in a solution and in the computational time required to find a solution. Our results also demonstrate that the PSC scheme is more suitable for the sweep coverage scenarios in which higher speed mobile sensors are used.

  13. Variable Dynamic Testbed Vehicle: Dynamics Analysis

    Science.gov (United States)

    Lee, A. Y.; Le, N. T.; Marriott, A. T.

    1997-01-01

    The Variable Dynamic Testbed Vehicle (VDTV) concept has been proposed as a tool to evaluate collision avoidance systems and to perform driving-related human factors research. The goal of this study is to analytically investigate to what extent a VDTV with adjustable front and rear anti-roll bar stiffnesses, programmable damping rates, and four-wheel-steering can emulate the lateral dynamics of a broad range of passenger vehicles.

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

  15. Route Sanitizer: Connected Vehicle Trajectory De-Identification Tool

    Energy Technology Data Exchange (ETDEWEB)

    2017-03-01

    Route Sanitizer is ORNL's connected vehicle moving object database de-identification tool and a graphical user interface to ORNL's connected vehicle de-identification algorithm. It uses the Google Chrome (soon to be Electron) platform so it will run on different computing platforms. The basic de-identification strategy is record redaction: portions of a vehicle trajectory (e.g. sequences of precise temporal spatial records) are removed. It does not alter retained records. The algorithm uses custom techniques to find areas within trajectories that may be considered private, then it suppresses those in addition to enough of the trajectory surrounding those locations to protect against "inference attacks" in a mathematically sound way. Map data is integrated into the process to make this possible.

  16. Phone Routing using the Dynamic Memory Model

    DEFF Research Database (Denmark)

    Bendtsen, Claus Nicolaj; Krink, Thiemo

    2002-01-01

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

  17. Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints

    OpenAIRE

    2016-01-01

    In this paper, we introduce and study the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. To the best of our knowledge, it is the first time that axle weight restrictions are incorporated in a vehicle routing model. The aim of this paper is to demonstrate that incorporating axle weight restrictions in a vehicle routing model is possible and necessary for a feasible route planning. Axle weight limits impose a great challenge for transportatio...

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

  19. Particle Swarm Optimization with Genetic Operators for Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    P. V. PURANIK

    2012-07-01

    Full Text Available Vehicle Routing Problem (VRP is to find shortest route thereby minimizing total cost. VRP is a NP-hard and Combinatorial optimization problem. Such problems increase exponentially with the problem size. Various derivative based optimization techniques are employed for optimization. Derivative based optimization techniques are difficult to evaluate. Therefore parallel search algorithm emerged to solve VRP. In this work, a particle swarm optimization (PSO algorithm and Genetic algorithm (GA with crossover and mutation operator are applied to two typical functions to deal with the problem of VRP efficiently using MATLAB software. Before solving VRP, optimization of functions using PSO and GA are checked. In this paper capacitate VRP with time window (CVRPTW is proposed. The computational result shows generation of input for VRP, optimization of Rastrigin function, Rosenbrock function using PSO and GA.

  20. Um estudo de impactos do roteamento dinâmico de veículos em atividades de prestação de serviço A study of impacts of dynamic vehicle routing on services production activities

    Directory of Open Access Journals (Sweden)

    Vitória Pureza

    2010-12-01

    Full Text Available Neste trabalho, é analisado o impacto da utilização de métodos de roteamento dinâmico de veículos em ambientes de prestação de serviço, onde a satisfação dos prazos de atendimento do cliente é prioritária. Com esse objetivo, é proposta uma heurística construtiva/desconstrutiva, que, quando acionada por um módulo de despacho de veículos, elabora rotas em tempo real. O impacto da aplicação da heurística é medido frente a outros métodos, utilizando- se conjuntos de instâncias geradas aleatoriamente, com base em dados fornecidos por uma empresa do setor de bebidas do interior do Estado de São Paulo. Os resultados indicam benefícios substanciais em termos de nível de serviço oferecido.In this paper we evaluate the impacts resulting from the incorporation of dynamic vehicle routing and scheduling in service production systems where due dates for service are a priority issue. We propose a constructive/deconstructive heuristic, which is activated by a dispatcher module in order to obtain routes in real time. The relative impact of the heuristic application to other methods is analyzed by means of sets of randomly generated instances, based on the data supplied by a drinks company in São Paulo State. The results indicate significant gains in terms of service level.

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

  2. Robust Optimisation Approach for Vehicle Routing Problems with Uncertainty

    Directory of Open Access Journals (Sweden)

    Liang Sun

    2015-01-01

    Full Text Available We formulated a solution procedure for vehicle routing problems with uncertainty (VRPU for short with regard to future demand and transportation cost. Unlike E-SDROA (expectation semideviation robust optimisation approach for solving the proposed problem, the formulation focuses on robust optimisation considering situations possibly related to bidding and capital budgets. Besides, numerical experiments showed significant increments in the robustness of the solutions without much loss in solution quality. The differences and similarities of the robust optimisation model and existing robust optimisation approaches were also compared.

  3. Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

    Directory of Open Access Journals (Sweden)

    Qian Wang

    2014-01-01

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

  4. Effects of Vehicle Number Feedback in Multi-Route Intelligent Traffic Systems

    Science.gov (United States)

    Dong, Chuanfei; Ma, Xu; Wang, Binghong

    We first study dynamics of traffic flow with real-time information and the influence of a new feedback strategy named Vehicle Number Feedback Strategy (VNFS) in a multi-route scenario in which dynamic information can be generated and displayed on the board (the board refers to a variable message sign where information on the routes is displayed) to guide road users to make a choice. In a multi-route scenario, our model incorporates the effects of adaptability into the cellular automaton models of traffic flow and simulation results adopting vehicle number feedback strategy have demonstrated high efficiency in controlling spatial distribution of traffic patterns compared with the other three information feedback strategies, i.e. Travel Time Feedback Strategy (TTFS), Mean Velocity Feedback Strategy (MVFS) and Congestion Coefficient Feedback Strategy (CCFS). We also discuss the influence of expected arrival rate (Vp) at the entrance on the average flux of each route, and we find that the flux adopting VNFS is always the largest at each Vp value among these four feedback strategies.

  5. A Branch-and-Price Algorithm for Two Multi-Compartment Vehicle Routing Problems

    DEFF Research Database (Denmark)

    Mirzaei, Samira; Wøhlk, Sanne

    2016-01-01

    Despite the vast body of literature on vehicle routing problems, little attention has been paid to multi-compartment vehicle routing problems that investigate transportation of different commodities on the same vehicle, but in different compartments. In this project, we present two strategically...

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

  7. The vehicle routing problem with time windows: State-of-the-art exact solution methods

    DEFF Research Database (Denmark)

    Desaulniers, Guy; Desrosiers, Jacques; Spoorendonk, Simon

    2011-01-01

    The vehicle routing problem with time windows (VRPTW) consists of finding least-cost vehicle routes to service given customers exactly once each while satisfying the vehicle capacity and customer time windows. The VRPTW has been widely studied. We present here a short survey on the successful exact...

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

    Directory of Open Access Journals (Sweden)

    Huey-Kuo Chen

    2011-01-01

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

  9. Equilibria in Dynamic Selfish Routing

    Science.gov (United States)

    Anshelevich, Elliot; Ukkusuri, Satish

    In both transportation and communication networks we are faced with “selfish flows”, where every agent sending flow over the network desires to get it to its destination as soon as possible. Such flows have been well studied in time-invariant networks in the last few years. A key observation that must be taken into account in defining and studying selfish flow, however, is that a flow can take a non-negligible amount of time to travel across the network from the source to destination, and that network states like traffic load and congestion can vary during this period. Such flows are called dynamic flows (a.k.a. flows over time). This variation in network state as the flow progresses through the network results in the fundamentally different and significantly more complex nature of dynamic flow equilibria, as compared to those defined in static network settings.

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

  11. Vehicle routing for the last mile of power system restoration

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory; Coffrin, Carleton [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV.

    2010-11-23

    This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

  12. Integrated consensus-based frameworks for unmanned vehicle routing and targeting assignment

    Science.gov (United States)

    Barnawi, Waleed T.

    Unmanned aerial vehicles (UAVs) are increasingly deployed in complex and dynamic environments to perform multiple tasks cooperatively with other UAVs that contribute to overarching mission effectiveness. Studies by the Department of Defense (DoD) indicate future operations may include anti-access/area-denial (A2AD) environments which limit human teleoperator decision-making and control. This research addresses the problem of decentralized vehicle re-routing and task reassignments through consensus-based UAV decision-making. An Integrated Consensus-Based Framework (ICF) is formulated as a solution to the combined single task assignment problem and vehicle routing problem. The multiple assignment and vehicle routing problem is solved with the Integrated Consensus-Based Bundle Framework (ICBF). The frameworks are hierarchically decomposed into two levels. The bottom layer utilizes the renowned Dijkstra's Algorithm. The top layer addresses task assignment with two methods. The single assignment approach is called the Caravan Auction Algorithm (CarA) Algorithm. This technique extends the Consensus-Based Auction Algorithm (CBAA) to provide awareness for task completion by agents and adopt abandoned tasks. The multiple assignment approach called the Caravan Auction Bundle Algorithm (CarAB) extends the Consensus-Based Bundle Algorithm (CBBA) by providing awareness for lost resources, prioritizing remaining tasks, and adopting abandoned tasks. Research questions are investigated regarding the novelty and performance of the proposed frameworks. Conclusions regarding the research questions will be provided through hypothesis testing. Monte Carlo simulations will provide evidence to support conclusions regarding the research hypotheses for the proposed frameworks. The approach provided in this research addresses current and future military operations for unmanned aerial vehicles. However, the general framework implied by the proposed research is adaptable to any unmanned

  13. Driver's workload comparison in waste collection vehicle routing problem

    Science.gov (United States)

    Benjamin, Aida Mauziah; Abdul-Rahman, Syariza

    2016-10-01

    This paper compares the workload of the drivers for a waste collection benchmark problem. The problem involves ten data sets with different number of customers to be served and different number of disposal facilities available. Previous studies proposed a heuristic algorithm, namely Different Initial Customer (DIC) to solve the problem by constructing initial vehicles routes for the drivers with two main objectives; to minimize the total distance travelled and to minimize the total number of vehicles needed to collect the waste. The results from DIC compared well with other solutions in the literature. However, the balance of the workload among the vehicle drivers is not considered in the solutions. Thus in this paper, we evaluate the quality of the solutions in terms of the total number of customers served by each driver. Then the computational result is compared in terms of the total distance travelled which have been presented in a previous study. Comparison results show that the workload of the drivers are unbalance in terms of these two factors that may cause dissatisfaction among the drivers as well as to the managament.

  14. Vehicle Routing Problems with Fuel Consumption and Stochastic Travel Speeds

    Directory of Open Access Journals (Sweden)

    Yanling Feng

    2017-01-01

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

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

  16. A Comparison of Homogeneous and Heterogeneous Vehicle Fleet Size in Green Vehicle Routing Problem

    OpenAIRE

    Moutaoukil, Abdelhamid; Neubert, Gilles; Derrouiche, Ridha

    2014-01-01

    Part 1: Knowledge-Based Sustainability; International audience; To balance a fragmented logistics organization, Small and Medium Enterprises have to find collective solutions to decrease their environmental impact. Especially when the demand at each producer takes the form of small packages and low quantities this paper examines the effect of the introduction of a consolidation center on the environmental issue. Therefore, the Fleet Size and Mix Vehicle Routing Problem (FSMVRP) was adapted in...

  17. Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

    OpenAIRE

    Yousefikhoshbakht, Majid; Khorram, Esmaile

    2012-01-01

    The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called s...

  18. Automated Flight Routing Using Stochastic Dynamic Programming

    Science.gov (United States)

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

    2010-01-01

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

  19. TSP based Evolutionary optimization approach for the Vehicle Routing Problem

    Science.gov (United States)

    Kouki, Zoulel; Chaar, Besma Fayech; Ksouri, Mekki

    2009-03-01

    Vehicle Routing and Flexible Job Shop Scheduling Problems (VRP and FJSSP) are two common hard combinatorial optimization problems that show many similarities in their conceptual level [2, 4]. It was proved for both problems that solving techniques like exact methods fail to provide good quality solutions in a reasonable amount of time when dealing with large scale instances [1, 5, 14]. In order to overcome this weakness, we decide in the favour of meta heuristics and we focalize on evolutionary algorithms that have been successfully used in scheduling problems [1, 5, 9]. In this paper we investigate the common properties of the VRP and the FJSSP in order to provide a new controlled evolutionary approach for the CVRP optimization inspired by the FJSSP evolutionary optimization algorithms introduced in [10].

  20. Variable neighbourhood simulated annealing algorithm for capacitated vehicle routing problems

    Science.gov (United States)

    Xiao, Yiyong; Zhao, Qiuhong; Kaku, Ikou; Mladenovic, Nenad

    2014-04-01

    This article presents the variable neighbourhood simulated annealing (VNSA) algorithm, a variant of the variable neighbourhood search (VNS) combined with simulated annealing (SA), for efficiently solving capacitated vehicle routing problems (CVRPs). In the new algorithm, the deterministic 'Move or not' criterion of the original VNS algorithm regarding the incumbent replacement is replaced by an SA probability, and the neighbourhood shifting of the original VNS (from near to far by k← k+1) is replaced by a neighbourhood shaking procedure following a specified rule. The geographical neighbourhood structure is introduced in constructing the neighbourhood structures for the CVRP of the string model. The proposed algorithm is tested against 39 well-known benchmark CVRP instances of different scales (small/middle, large, very large). The results show that the VNSA algorithm outperforms most existing algorithms in terms of computational effectiveness and efficiency, showing good performance in solving large and very large CVRPs.

  1. Assessment of the forest landscape along selected motor vehicle routes

    Directory of Open Access Journals (Sweden)

    Janeczko Emilia

    2016-03-01

    Full Text Available This paper presents the results of research that aims to analyse and evaluate the attractiveness of the forest landscape in the vicinity of selected motor vehicle routes that differ in terms of technical parameters, such as motorways, regional roads and local (municipal roads. The diversity of landscape units was used as the measure of landscape attractiveness. Landscape diversity analysis allows to establish the details related to specific parts of the road and the options for configuring the road environment. These options relate to the way the forest is managed and mainly involve aspects of infrastructure and cultivation. They include activities such as afforestation work and rebuilding the species composition of forest stands. According to the research, the lower the technical class of a road, the greater is the need to take action to adapt the structural-tree stand system to meet the safety requirements of road users.

  2. Dynamics of vehicle-road coupled system

    CERN Document Server

    Yang, Shaopu; Li, Shaohua

    2015-01-01

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

  3. Ant Colony Optimization for Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    H. V. Seow

    2012-01-01

    Full Text Available Problem statement: The Capacitated Vehicle Routing Problem (CVRP is a well-known combinatorial optimization problem which is concerned with the distribution of goods between the depot and customers. It is of economic importance to businesses as approximately 10-20% of the final cost of the goods is contributed by the transportation process. Approach: This problem was tackled using an Ant Colony Optimization (ACO combined with heuristic approaches that act as the route improvement strategies. The proposed ACO utilized a pheromone evaporation procedure of standard ant algorithm in order to introduce an evaporation rate that depends on the solutions found by the artificial ants. Results: Computational experiments were conducted on benchmark data set and the results obtained from the proposed algorithms shown that the application of combination of two different heuristics in the ACO had the capability to improve the ants’ solutions better than ACO embedded with only one heuristic. Conclusion: ACO with swap and 3-opt heuristic has the capability to tackle the CVRP with satisfactory solution quality and run time. It is a viable alternative for solving the CVRP.

  4. Dynamic Route Guidance Using Improved Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Zhanke Yu

    2013-01-01

    Full Text Available This paper presents an improved genetic algorithm (IGA for dynamic route guidance algorithm. The proposed IGA design a vicinity crossover technique and a greedy backward mutation technique to increase the population diversity and strengthen local search ability. The steady-state reproduction is introduced to protect the optimized genetic individuals. Furthermore the junction delay is introduced to the fitness function. The simulation results show the effectiveness of the proposed algorithm.

  5. Speeding up the solution process for the Vehicle Routing Problem with Time Windows using structural information

    DEFF Research Database (Denmark)

    Larsen, Jesper

    2002-01-01

    Two ideas for using structural information for solving the Vehicle Routing Problem with Time Windows (VRPTW) is presented. The VRPTW is a generalization of the well known capacity constrained Vehicle Routing Problem (VRP). Both techniques are based on solving the VRPTW using a Branch...

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

    DEFF Research Database (Denmark)

    Christiansen, Christian Holk; Lysgaard, Jens

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

  7. Reliable dynamic in-vehicle navigation

    OpenAIRE

    Kaparias, I.

    2008-01-01

    Having started off from luxury makes and models, in-vehicle navigation systems are now gradually spreading through the entire vehicle fleet, as drivers appreciate their usefulness. Increasingly sophisticated systems are being developed, having much more advanced functions than simple driving directions. This thesis presents a new approach for in-vehicle navigation, in which travel time reliability is incorporated in the route finding component of the navigation system. Based on historical tra...

  8. Design of Vehicle Routing by Integrating Optimization and Simulated Annealing Approach

    Institute of Scientific and Technical Information of China (English)

    Chwen-Tzeng; Su; Chikong; Hwang

    2002-01-01

    The vehicle routing problem (VRP) can be described as the problem of designing the optimal delivery or collection routes from one or several depots to a number of geographically scattered customers, subject to load constraints. The routing decision involves determining which of the demand s will be satisfied by each vehicle and what route each vehicle will follow in s erving its assigned demand in order to minimize total delivery cost. In this pap er, a methodology for the design of VRP by integrating...

  9. A Hybrid TCNN Optimization Approach for the Capacity Vehicle Routing Problem

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A novel approximation algorithm was proposed for the problem of finding the minimum total cost of all routes in Capacity Vehicle Routing Problem (CVRP). CVRP can be partitioned into three parts: the selection of vehicles among the available vehicles, the initial routing of the selected fleet and the routing optimization. Fuzzy Cmeans (FCM) can group the customers with close Euclidean distance into the same vehicle according to the principle of similar feature partition. Transiently chaotic neural network (TCNN) combines local search and global search, possessing high search efficiency. It will solve the routes to near optimality. A simple tabu search (TS)procedure can improve the routes to more optimality. The computations on benchmark problems and comparisons with other results in literatures show that the proposed algorithm is a viable and effective approach for CVRP.

  10. Dynamics and Control of a Maglev Vehicle

    Directory of Open Access Journals (Sweden)

    Won ko

    2006-06-01

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

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

    OpenAIRE

    Washington Alves Oliveira; Antonio Carlos Moretti; Ednei Felix Reis

    2015-01-01

    ABSTRACT In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek routes that guarantee visibility, as this has a sizable impact on the community perceived safety, allowing quick emergency responses and providing surveillance of selected sites (e.g., hospitals, schools). The planning is restricted to the availability of vehicles and strives to achieve balanced routes. We study an adaptation of the model for the multi-vehicle covering t...

  12. Inventory routing for dynamic waste collection.

    Science.gov (United States)

    Mes, Martijn; Schutten, Marco; Rivera, Arturo Pérez

    2014-09-01

    We consider the problem of collecting waste from sensor equipped underground containers. These sensors enable the use of a dynamic collection policy. The problem, which is known as a reverse inventory routing problem, involves decisions regarding routing and container selection. In more dense networks, the latter becomes more important. To cope with uncertainty in deposit volumes and with fluctuations due to daily and seasonal effects, we need an anticipatory policy that balances the workload over time. We propose a relatively simple heuristic consisting of several tunable parameters depending on the day of the week. We tune the parameters of this policy using optimal learning techniques combined with simulation. We illustrate our approach using a real life problem instance of a waste collection company, located in The Netherlands, and perform experiments on several other instances. For our case study, we show that costs savings up to 40% are possible by optimizing the parameters. Copyright © 2014 Elsevier Ltd. All rights reserved.

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-08-15

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

  14. Vehicle Routing Optimization in Logistics Distribution Using Hybrid Ant Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Chengming Qi

    2013-09-01

    Full Text Available The Vehicle Routing Problem (VRP is an important management problem in the field of physical distribution and logistics. Good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. The Capacitated Vehicle Routing Problem (CVRP constrained by the capacity of a vehicle is the extension of VRP. Our research applies a two-phase algorithm to address CVRP. It takes the advantages of Simulated Annealing (SA and ant colony optimization for solving the capacitated vehicle routing problem. In the first phase of proposed algorithm, simulated annealing provides a good initial solution for ant colony optimization. In the second phase, Iterative Local Search (ILS method is employed to seeking the close-to-optimal solution in local scope based on the capacity of the vehicle. Experimental results show that the proposed algorithm is superior to original ant colony optimization and simulated annealing separately reported on partial benchmark problems.

  15. Constraint Embedding for Vehicle Suspension Dynamics

    Directory of Open Access Journals (Sweden)

    Jain Abhinandan

    2016-06-01

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

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

    Directory of Open Access Journals (Sweden)

    Alireza Goli

    2015-09-01

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

  17. 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...... the sum of arrival times at the customers. A branch-and-cut-and-price algorithm for obtaining optimal solutions to the problem is proposed. Computational results based on a set of standard CVRP benchmarks are presented....

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

    Science.gov (United States)

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

    2014-03-01

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

  19. Combination of nearest neighbor and heuristics algorithms for sequential two dimensional loading capacitated vehicle routing problem

    Science.gov (United States)

    Sarwono, A. A.; Ai, T. J.; Wigati, S. S.

    2017-01-01

    Vehicle Routing Problem (VRP) is a method for determining the optimal route of vehicles in order to serve customers starting from depot. Combination of the two most important problems in distribution logistics, which is called the two dimensional loading vehicle routing problem, is considered in this paper. This problem combines the loading of the freight into the vehicles and the successive routing of the vehicles along the route. Moreover, an additional feature of last-in-first-out loading sequencesis also considered. In the sequential two dimensional loading capacitated vehicle routing problem (sequential 2L-CVRP), the loading must be compatible with the trip sequence: when the vehicle arrives at a customer i, there must be no obstacle (items for other customers) between the item of i and the loading door (rear part) of the vehicle. In other words, it is not necessary to move non-i’s items whenever the unloading process of the items of i. According with aforementioned conditions, a program to solve sequential 2L-CVRP is required. A nearest neighbor algorithm for solving the routing problem is presented, in which the loading component of the problem is solved through a collection of 5 packing heuristics.

  20. Potential air pollutant emission from private vehicles based on vehicle route

    Science.gov (United States)

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

    2017-06-01

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

  1. Dynamic Equilibrium Assignment Convergence by En-route Flow Smoothing

    NARCIS (Netherlands)

    Pel, A.J.; Bliemer, M.C.J.; Hoogendoorn, S.P.

    2010-01-01

    An essential feature in many dynamic traffic assignment (DTA) models used for planning purposes is to compute the (dynamic) equilibrium assignment, where travellers follow user-optimal routes, leading to minimal experienced route travel times. To compute these time-varying route flows in the equilib

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

    DEFF Research Database (Denmark)

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

    2016-01-01

    -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......Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes...... detours to recharging stations necessary, thus requiring efficient tour planning mechanisms in order to sustain the competitiveness of electric vehicles compared to conventional vehicles. We introduce the Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations (E...

  3. Literature Review of Dynamic Unmanned Aerial System Routing Problems and Proposals For Future Studies of UASs

    Directory of Open Access Journals (Sweden)

    Cihan Ercan

    2013-02-01

    Full Text Available Outwith the technological developments made with Unmanned Aerial Vehicles (UAV; other important issues for the users like effective planning and re-planning; providing the clear, concise and timely information to the decision makers is part of the Network Enabled Capability. Significant improvements to the Communication and Information systems have made it possible to find dynamic solutions for Vehicle Routing Problems. In this context, "Vehicle Routing" applications for UAVs in reconnaissance missions are increasing exponentially. This study investigates the literature in "dynamic route planning", defining the scope and identifying shortcomings for future studies in Unmanned Aerial Systems. Using this approach not only reduces stagnant travel time to target time but increases the usable times spent on targets.

  4. Goal-programming model of the stochastic vehicle-routing problem

    Energy Technology Data Exchange (ETDEWEB)

    Zare-Mehrjerdi, Y.

    1986-01-01

    This research proposes a Goal Programming (GP) model of the Stochastic Vehicle Routing Problem (SVRP). The SVRP examined considers the multiple-vehicle, single-depot-node routing problem in which customer demand and travel and unload times are random variables having known distribution functions. The problem formulation of the SVRP is divided into two major stages which are referred to as Route Construction Stage (RCS) and Route Improvement Stage (RIS). The RCS of the SVRP is required in order to partition a set of stations into feasible sets of routes, one for each vehicle, using an appropriate heuristic approach. The RIS of the problem is required in order to sequence the stations on each vehicle route to meet the customer's and decision maker's requirements by applying a GP method. Two problems discuss the GP formulation of the RIS, which is used for improving the arrangement of stations on each vehicle route based on the customer's and decision maker's criteria. The formulation of the RCS of the problem is divided into two sections according to the type of criteria that is to be minimized. A substantial improvement in the results of the SVRP can be obtained by integrating the customer's and decision maker's requirements with the SVRP in order to determine the final arrangement of stations for each vehicle route.

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

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

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

    DEFF Research Database (Denmark)

    Larsen, Jesper

    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 the customers and fulfill their demands. 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) with respect to the above mentioned constraints. Currently the best approaches for determining optimal solutions are based on column generation and Branch......-and-Bound, also known as Branch-and-Price. This paper presents two ideas for run-time improvements of the Branch-and-Price framework for the Vehicle Routing Problem with Time Windows. Both ideas reveal a significant potential for using run-time refinements when speeding up an exact approach without compromising...

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

  9. State estimation for integrated vehicle dynamics control

    NARCIS (Netherlands)

    Zuurbier, J.; Bremmer, P.

    2002-01-01

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

  10. Adaptive search techniques for problems in vehicle routing, part II: A numerical comparison

    Directory of Open Access Journals (Sweden)

    Kritzinger Stefanie

    2015-01-01

    Full Text Available Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems. In this first part of the survey, we present an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing.

  11. Adaptive search techniques for problems in vehicle routing, part I: A survey

    Directory of Open Access Journals (Sweden)

    Kritzinger Stefanie

    2015-01-01

    Full Text Available Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems. In this first part of the survey, we present an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing.

  12. Vehicle dynamics theory and application

    CERN Document Server

    Jazar, Reza N

    2014-01-01

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

  13. MODELING AND SOLVING A RICH VEHICLE ROUTING PROBLEM FOR THE DELIVERY OF GOODS IN URBAN AREAS

    OpenAIRE

    José Ferreira de Souza Neto; Vitória Pureza

    2016-01-01

    ABSTRACT This work addresses a vehicle routing problem that aims at representing delivery operations of large volumes of products in dense urban areas. Inspired by a case study in a drinks producer and distributor, we propose a mathematical programming model and solution approaches that take into account costs with own and chartered vehicles, multiple deliverymen, time windows in customers, compatibility of vehicles and customers, time limitations for the circulation of large vehicles in city...

  14. Improving Operational Acceptability of Dynamic Weather Routes Through Analysis of Commonly Use Routings

    Science.gov (United States)

    Evans, Antony D.; Sridhar, Banavar; McNally, David

    2016-01-01

    The Dynamic Weather Routes (DWR) tool is a ground-based trajectory automation system that continuously and automatically analyzes active in-flight aircraft in en route airspace to find simple modifications to flight plan routes that can save significant flying time, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. Trials of the DWR system have shown that significant delay savings are possible. However, some DWR advised routes are also rejected by dispatchers or modified before being accepted. Similarly, of those sent by dispatchers to flight crews as proposed route change requests, many are not accepted by air traffic control, or are modified before implementation as Center route amendments. Such actions suggest that the operational acceptability of DWR advised route corrections could be improved, which may reduce workload and increase delay savings. This paper analyzes the historical usage of different flight routings, varying from simple waypoint pairs to lengthy strings of waypoints incorporating jet routes, in order to improve DWR route acceptability. An approach is developed that can be incorporated into DWR, advising routings with high historical usage and savings potential similar to that of the nominal DWR advisory. It is hypothesized that modifying a nominal DWR routing to one that is commonly used, and nearby, will result in more actual savings since common routings are generally familiar and operationally acceptable to air traffic control. The approach allows routing segments with high historical usage to be concatenated to form routes that meet all DWR constraints. The relevance of a route's historical usage to its acceptance by dispatchers and air traffic control is quantified by analyzing historical DWR data. Results indicate that while historical usage may be less of a concern to flight dispatchers accepting or rejecting DWR advised route corrections, it may be

  15. Dynamic Analysis of a Military- Tracked Vehicle

    Directory of Open Access Journals (Sweden)

    V. Balamurugan

    2000-04-01

    Full Text Available 'The ride dynamic characteristics of a typical medium weight, high speed military-tracked vehicle for negotiating rough cross-counlry terrain have been studied. The vehicle is modelled using finiteelement simulation method with beam and shell elements. An eigenvalue analysis has been done to estimate natural modes ofNibration of the vehicle. The dynamic response of certain salient locations is obtained by carrying out a transient dynamic analysis using implicit Newmark beta method. A constant forwar vehicle speed and non-deformable sinusoidal terrain profile are assumed.

  16. Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows

    OpenAIRE

    2016-01-01

    The multi Vehicle Routing Problem with Pickup and Delivery with Time Windows is a challenging version of the Vehicle Routing Problem. In this paper, by embedding many complex assignment routing constraints through constructing a multi dimensional network, we intend to reach optimality for local clusters derived from a reasonably large set of passengers on real world transportation networks. More specifically, we introduce a multi vehicle state space time network representation in which only t...

  17. Dynamic Route Shortening and Route Repairing Mechanism for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    T. R. Rangaswamy

    2012-01-01

    Full Text Available Problem statement: Ad hoc Networks are wireless networks without any fixed infrastructure. The network topology changes frequently and unpredictably due to the random movement of the nodes. The ad hoc on Demand Distant Vector Routing (AODV protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network topology of ad hoc networks, if other routes with less hop count become available, the network topology is not able to adapt until the route break occurs. Hence in the route shortening scheme is some redundant nodes in the active route is replaced with a node that is not on the active route. When there is any link failure between any two nodes, the alternative route with optimum route to be constructed and not sending RRER message to the source node to initiate the route discovery process again. Approach: This study proposes a new routing protocol called, Dynamic Route Shortening and Repairing mechanism (DRSR. The route shortening is incorporated with route repairing mechanism, to improve the performance of the AODV. The route shortening scheme works by replacing some redundant nodes in the active route, with a node that is not on the active route. If there is a link failure between the two nodes, the route repairing mechanism repairs the route, by using the nodes that are close enough to the route to overhear the message. Whenever the links go down, the DRSR replaces the failed links with the optimum route that is adjacent to the main route and not sending and RRER message to the source node to initiate the route discovery process again. The alternative route construction process could be initiated at any time, not just when a route has failed. The dynamically constructed alternative route’s information is passed on to the upstream nodes, which then determine by themselves when to direct their packets to the Normal 0 false false false EN-US X

  18. The Optimal Approach of Vehicle Route with Time Window Based on Genetic Algorithm: Dynamic Partition of Demand%基于需求划分的带软时间窗的路径优化方法

    Institute of Scientific and Technical Information of China (English)

    魏俊华; 王安麟; 童毅

    2005-01-01

    针对带有时间窗约束的车辆路径问题(Vehicle Routing Problem With Time Windows,VRPTW)的NP特征,以非完全连通配送网络为研究对象,用带有软时间窗约束的整体配送费用最小为目标,提出了一种基于需求的城市动态划分方法,有效的减少了路径的组合规模,并且用遗传算法将其实现,通过改进的Dijkstra算法求取其基于动态划分的最优配送路径集,最后计算示例验证了本文方法的有效性.

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

    Directory of Open Access Journals (Sweden)

    Yong Zhang

    2017-01-01

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

  20. Capacitated Vehicle Routing with Non-Uniform Speeds

    DEFF Research Database (Denmark)

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

    2011-01-01

    vehicles having speeds {λ i } i = 1 k , the goal is to find a tour for each vehicle (starting and ending at r), so that every vertex is covered in some tour and the maximum completion time is minimized. This problem is precisely Heterogenous CVRP when vehicles are uncapacitated. The presence of non...

  1. The relationship between vehicle routing and scheduling and green logistics - a literature survey

    OpenAIRE

    Sbihi, A.; Eglese, R W

    2007-01-01

    The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling including discussion of the environmental objectives that should be considered. Particular consideration i...

  2. The Relationship between Vehicle Routing & Scheduling and Green Logistics - A Literature Survey

    OpenAIRE

    Sbihi, Abdelkader; W. Eglese, Richard

    2007-01-01

    The basic Vehicle Routing and Scheduling Problem (VRSP) is described followed by an outline of solution approaches. Different variations of the basic VRSP are examined that involve the consideration of additional constraints or other changes in the structure of the appropriate model. An introduction is provided to Green Logistics issues that are relevant to vehicle routing and scheduling including discussion of the environmental objectives that should be considered. Particular consideration i...

  3. An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing

    OpenAIRE

    2014-01-01

    In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier. In this variant of the Vehicle Routing Problem, orders are either delivered by an outside carrier, the common carrier, which receives an order specific price for this or by the own fleet, the priv...

  4. A new approach on auxiliary vehicle assignment in capacitated location routing problem

    Science.gov (United States)

    Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan

    2016-03-01

    The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  7. A savings based method for real-life vehicle routing problems

    NARCIS (Netherlands)

    A. Poot; G. Kant; A.P.M. Wagelmans (Albert)

    1999-01-01

    textabstractThis paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on real-life data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing

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

    OpenAIRE

    Ling-Yuan Hsu; Tsung-Lin Chen

    2012-01-01

    This paper presents a vehicle dynamics prediction system, which consists of a sensor fusion system and a vehicle parameter identification system. This sensor fusion system can obtain the six degree-of-freedom vehicle dynamics and two road angles without using a vehicle model. The vehicle parameter identification system uses the vehicle dynamics from the sensor fusion system to identify ten vehicle parameters in real time, including vehicle mass, moment of inertial, and road friction coefficie...

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

    DEFF Research Database (Denmark)

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

    2015-01-01

    In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real...

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

    DEFF Research Database (Denmark)

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

    2006-01-01

    This paper considers the vehicle routing problem with time windows, where the service of each customer must start within a specified time interval. We consider the Lagrangian relaxation of the constraint set requiring that each customer must be served by exactly one vehicle yielding a constrained...

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

    DEFF Research Database (Denmark)

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

    freight magnitude and the distribution of goods in the old city centre. Based on the survey, analysis of possible UCC locations was carried out using simulation. Distribution from the UCC is assumed to be conducted with electric vehicles (EVs) as they are considered suitable for the overall aim. However......, compared to conventional distribution vehicles they have a limited driving range and a limited freight capacity. In this work, an Electric Vehicle Routing Problem with Time Windows (EVRPTW) is addressed. The EVs are allowed to recharge at certain customers or replenishment stations in order to continue...... a tour. Furthermore, intelligent location of these recharging points is considered. The objective is to find a least cost plan for routing and recharging the vehicles so that each customer is serviced by exactly one vehicle within its time windows and the vehicle capacity and driving range constraints...

  12. Solving the Generalized Vehicle Routing Problem with an ACS-based Algorithm

    Science.gov (United States)

    Pop, Petrica Claudiu; Pintea, Camelia; Zelina, Ioana; Dumitrescu, Dan

    2009-04-01

    Ant colony system is a metaheuristic algorithm inspired by the behavior of real ants and was proposed by Dorigo et al. as a method for solving hard combinatorial optimization problems. In this paper we show its successful application to solving a network design problem: Generalized Vehicle Routing Problem. The Generalized Vehicle Routing Problem (GVRP) is the problem of designing optimal delivery or collection routes, subject to capacity restrictions, from a given depot to a number of predefined, mutually exclusive and exhaustive clusters. Computational results for several benchmark problems are reported.

  13. A heuristic approach based on Clarke-Wright algorithm for open vehicle routing problem.

    Science.gov (United States)

    Pichpibul, Tantikorn; Kawtummachai, Ruengsak

    2013-01-01

    We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route postimprovement. Computational results show that the proposed CW is competitive and outperforms classical CW in all directions. Moreover, the best known solution is also obtained in 97% of tested instances (60 out of 62).

  14. Node Sensing & Dynamic Discovering Routes for Wireless Sensor Networks

    CERN Document Server

    Nanda, Arabinda; Rout, Saroj Kumar

    2010-01-01

    The applications of Wireless Sensor Networks (WSN) contain a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the correctness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a dynamic discover routing method for communication between sensor nodes and a base station in WSN. This method tolerates failures of arbitrary individual nodes in the network (node failure) or a small part of the network (area failure). Each node in the network does only local routing preservation, needs to record only its neighbor nodes' information, and incurs no extra routing overhead during failure free periods. It dynamically discovers new routes when an in...

  15. Developing a Direct Search Algorithm for Solving the Capacitated Open Vehicle Routing Problem

    Science.gov (United States)

    Simbolon, Hotman

    2011-06-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 strategy of releasing nonbasic variables from their bounds, combined with the "active constraint" method and the notion of superbasics, has been developed for efficiently requirements; this strategy is used to force the appropriate non-integer basic variables to move to their neighborhood integer points. A study of criteria for choosing a nonbasic variable to work with in the integerizing strategy has also been made.

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

  17. Using Grey Wolf Algorithm to Solve the Capacitated Vehicle Routing Problem

    Science.gov (United States)

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

    2015-05-01

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

  18. Heuristic methods for a refuse collection vehicle routing problem

    Energy Technology Data Exchange (ETDEWEB)

    Mourao, M.C.; Almeida, M.T.

    1994-12-31

    The problem of generating the set of routes that minimizes the total time required to collect the household refuse in a particular quarter of Lisbon can be formulated as a Capacitated Arc Routing Problem with some side constraints. Our aim is to obtain approximate solutions, as the problem is known to be NP-hard. We present heuristic methods to generate feasible solutions and report their performance over a set of test problems.

  19. A VEHICLE ROUTING PLANNING SYSTEM FOR GOODS DISTRIBUTION IN URBAN AREAS USING GOOGLE MAPS AND GENETIC ALGORITHM

    Directory of Open Access Journals (Sweden)

    Teodor Dimitrov Berov

    2016-06-01

    Full Text Available This article presents a system aimed at generating optimized vehicles routes - the vehicle routing problem with time windows (VRPTW based on using a Google Maps™ network data and imperialist competitive algorithm meta-heuristic. The vehicle routing problem with time windows is an important problem in the supply chain management. It copes with route scheduling and the distribution of goods from the distribution center to geographically dispersed customers in urban areas by a fleet of vehicles with constrained capacities. The system was tested for urban goods distribution in Sofia, Bulgaria - 35 retailers, warehouse, two types of vehicles (capacity and a working day.

  20. EXTENDED DYNAMIC SOURCE ROUTING PROTOCOL FOR AD HOC NETWORK

    Directory of Open Access Journals (Sweden)

    Puja Kumari Sharma

    2012-07-01

    Full Text Available MANET is a collection of self-configurable mobile nodes. Several routing protocols are proposed for ad hoc network among which DSR and AODV On demand routing protocols are mostly used. Existing Dynamic source routing protocol is not suitable for large network because packet size gets increased according to the number of nodes travelled by route discovery packet. In this paper, extended DSR routing protocol is proposed to eliminate the above limitation of existing DSR. Proposed protocol will be suitable for small and large both types of networks.

  1. Two-Phase Heuristic for the Vehicle Routing Problem with Time Windows

    Directory of Open Access Journals (Sweden)

    Sándor Csiszár

    2007-08-01

    Full Text Available The subject of the paper is a complete solution for the vehicle routing problemwith time windows, an industrial realization of an NP hard combinatorial optimizationproblem. The primary objective –the minimization of the number of routes- is aimed in thefirst phase, the secondary objective –the travel distance minimization- is going to berealized in the second phase by tabu search. The initial route construction applies aprobability density function for seed selection. Guided Route Elimination procedure wasalso developed. The solution was tested on the Solomon Problem Set and seems to be verycompeitive with the best heuristics published in the latest years (2003-2005.

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

    DEFF Research Database (Denmark)

    Christensen, Jonas Mark; Røpke, Stefan

    The Vehicle Routing Problem with Time Windows (VRPTW) consist of determining a set of feasible vehicle routes to deliver goods to a set of customers using a hierarchical objective; first minimising the number of vehicles used and, second, the total driving distance. A three-stage method is proposed...

  3. Northwest passage: Trade route for large air cushion vehicles

    Science.gov (United States)

    Anderson, J. L.

    1973-01-01

    A conceptual vehicle and powerplant (10,000-ton) nuclear-powered air-cushion vehicle (ACV) that could open the Northwest Passage and other Arctic passages to commercial traffic is identified. The report contains a description of the conceptual vehicle, including the powerplant and operations, an assessment of technical feasibility, estimates of capital and operating costs, and identification of eligible cargo and markets. A comparison of the nuclear ACV freighter with nuclear container ships shows that for containerized or roll-on/roll-off cargo the ACV would provide greatly reduced transit time between North Atlantic and North Pacific ports at a competitive cost.

  4. Vehicle lateral dynamics stabilization using active suspension

    Directory of Open Access Journals (Sweden)

    Drobný V.

    2008-12-01

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

  5. Delay of Vehicle Motion in Traffic Dynamics

    CERN Document Server

    Bando, M; Nakanishi, K; Nakayama, A; Bando, Masako; Hasebe, Katsuya; Nakanishi, Ken; Nakayama, Akihiro

    1996-01-01

    We demonstrate that in Optimal Velocity Model (OVM) delay times of vehicles coming from the dynamical equation of motion of OVM almost explain the order of delay times observed in actual traffic flows without introducing explicit delay times. Delay times in various cases are estimated: the case of a leader vehicle and its follower, a queue of vehicles controlled by traffic lights and many-vehicle case of highway traffic flow. The remarkable result is that in most of the situation for which we can make a reasonable definition of a delay time, the obtained delay time is of order 1 second.

  6. Hierarchical Routing over Dynamic Wireless Networks

    CERN Document Server

    Tschopp, Dominique; Grossglauser, Matthias

    2009-01-01

    Wireless network topologies change over time and maintaining routes requires frequent updates. Updates are costly in terms of consuming throughput available for data transmission, which is precious in wireless networks. In this paper, we ask whether there exist low-overhead schemes that produce low-stretch routes. This is studied by using the underlying geometric properties of the connectivity graph in wireless networks.

  7. Coherent Route Cache In Dynamic Source Routing For Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Sofiane Boukli Hacene

    2012-02-01

    Full Text Available Ad hoc network is a set of nodes that are able to move and can be connected in an arbitrary manner. Each node acts as a router and communicates using a multi-hop wireless links. Nodes within ad hoc networks need efficient dynamic routing protocols to facilitate communication. An Efficient routing protocol can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Several routing protocols exist allowing and facilitating communication between mobile nodes. One of the promising routing protocols is DSR (Dynamic Source Routing. This protocol presents some problems. The major problem in DSR is that the route cache contains some inconsistence routing information; this is due to node mobility. This problem generates longer delays for data packets. In order to reduce the delays we propose a technique based on cleaning route caches for nodes within an active route. Our approach has been implemented and tested in the well known network simulator GLOMOSIM and the simulation results show that protocol performance have been enhanced.

  8. A Meteheuristic Method for the Multi Trip Vehicle Routing Problem

    OpenAIRE

    2012-01-01

    International audience; In recent years the number of passengers and freight vehicles increased in urban areas causing traffic congestion and increasing air and noise pollution. The need of an efficient distribution system that takes into account distribution cost, but at the same time considers environmental aspects aims the concept of city logistics. Vehicles could have limited capacity, due to laws restriction imposed and the narrowness of streets that characterize historical parts of down...

  9. A Metaheuristic Method for the Multi Trip Vehicle Routing Problem

    OpenAIRE

    2012-01-01

    National audience; In recent years the number of passengers and freight vehicles increased in urban areas causing traffic congestion and increasing air and noise pollution. The need of an efficient distribution system that takes into account distribution cost, but at the same time considers environmental aspects aims the concept of city logistics. Vehicles could have limited capacity, due to laws restriction imposed and the narrowness of streets that characterize historical parts of downtowns...

  10. An exact algorithm for the vehicle routing problem with stochastic demands

    Energy Technology Data Exchange (ETDEWEB)

    Louveaux, F.

    1994-12-31

    The classical deterministic Vehicle Routing Problem (VRP) can be defined as follows. Let G = (V, E) be an undirected graph where V = {l_brace}v{sub 1}, {center_dot}{center_dot}, v{sub n}{r_brace} is a set of vertices representing cities or customers, and E = {l_brace}(v{sub i}, V{sub j}) : i < j; v{sub i}, v{sub j} {element_of} V{r_brace} is an edge set. With each vertex v{sub i}(i {>=} 2) (v{sub i}, v{sub j}) is associated a non-negative cost (distance, travel time) c{sub ij}. Vertex v{sub 1} represents a depot at which are based m identical vehicle of capacity Q > 0. Depending on the version of the problem considered, the value of m is either fixed, or bounded above by a constant {<=} m. The VRP consists of determining vehicle routes in such a way that (i) all routes start and end at the depot; (ii) each vertex other than the depot is visited exactly once; (iii) the total demand of any given route does not exceed Q; (iv) the total distance traveled by all vehicles is minimized. In the Stochastic Vehicle Routing Problem (SVRP), the demand associated with vertex v{sub i} is a random variable {xi}{sub i}. As a result, it is no longer possible to assume that vehicle routes may be followed as planned. The SRVP is modeled in two stages. In the first stage, a priori vehicle routes satisyfing conditions (i) and (ii) are constructed, without full information on the demands. In the second stage, when this information becomes available, routes are followed as planned, until the accumulated demand attains or exceeds the vehicle capacity. In this case, failure is said to occur and a recourse action is taken: the vehicle returns to the depot to unload, and resumes its visits at the point of failure. The SVRP consists of determining an a priori set of routes so as to minimize the expected cost of the second stage solution. The corresponding model can be solved using the relaxation approach in Laporte and Louveaux.

  11. Distributed stochastic multi-vehicle routing in the Euclidean plane with no communications

    Science.gov (United States)

    Pietrabissa, Antonio

    2016-08-01

    This paper presents an algorithm for the multi-vehicle routing problem with no communications among the vehicles. The scenario consists in a convex Euclidean mission space, where targets are generated according to a Poisson distribution in time and to a generic continuous spatial distribution. The targets must be visited by the vehicles, which, therefore, must act in coordination. Even if no communications are required, the proposed routing strategy succeeds in effectively partitioning the mission space among the vehicles: at low target generation rates, the algorithm leads to the well-known centroidal Voronoi tessellation, whereas at high target generation rates, simulation results show that it has better performances with respect to a reference algorithm with no communications among vehicles.

  12. Route Assessment for Unmanned Aerial Vehicle Based on Cloud Model

    Directory of Open Access Journals (Sweden)

    Xixia Sun

    2014-01-01

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

  13. ROUTE OPTIMIZATION TO INCREASE ENERGY EFFICIENCY AND REDUCE FUEL CONSUMPTION OF COMMUNAL VEHICLES

    Directory of Open Access Journals (Sweden)

    Nebojša M Jovičić

    2010-01-01

    Full Text Available Collection and transportation within the system of solid waste management may account more than 60% of the overall budget, most of which is for fuel costs. Furthermore, municipal vehicles have great environmental impact through exhaust gases emissions. The aim of this research was to estimate the potential for reduction of fuel consumption and thus the emission of CO2 through the communal vehicles route optimization. General methodology for route optimization is also presented. For the area under study, detailed field experimental research in the City of Kragujevac was conducted. Using GIS and GPS technology, whole municipally infrastructure for waste collection was scanned and all paths of communal tracks was recorded and allocated in developed database. Based on experimental and numerical results, one typical municipal vehicle route was analyzed by using ArcGis software. The obtained result indicates 2700 km of possible savings per year concerning one communal vehicle. In addition, the most fuel-economical route was extracted and compared with the original route, and with the routes extracted from criterions concerning the traffic time and shortest distance. According to available information for the City of Kragujevac and the results from this study, it was estimated that the total savings could be 20% in costs and the associated emissions.

  14. Lateral dynamic features of a railway vehicle

    DEFF Research Database (Denmark)

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

    2016-01-01

    The lateral dynamic features of a railway vehicle are investigated using two similar wheel/rail contact models: the Vermeulen-Johnson and the Shen-Hedrick-Elkins models. The symmetric/asymmetric bifurcation behaviour and chaotic motions of the railway vehicle are investigated in great detail...... by varying the speed and using the resultant bifurcation diagram' method. It is found that multiple solution branches exist and they can lead to more steady states in the dynamic behaviour of the railway vehicle. The coexistence of multiple steady states can lead to jumps in the amplitude of oscillations...

  15. MODELING AND SOLVING A RICH VEHICLE ROUTING PROBLEM FOR THE DELIVERY OF GOODS IN URBAN AREAS

    Directory of Open Access Journals (Sweden)

    José Ferreira de Souza Neto

    Full Text Available ABSTRACT This work addresses a vehicle routing problem that aims at representing delivery operations of large volumes of products in dense urban areas. Inspired by a case study in a drinks producer and distributor, we propose a mathematical programming model and solution approaches that take into account costs with own and chartered vehicles, multiple deliverymen, time windows in customers, compatibility of vehicles and customers, time limitations for the circulation of large vehicles in city centers and multiple daily trips. Results with instances based on real data provided by the company highlight the potential of applicability of some of the proposed methods.

  16. Unmanned Aerial Vehicle Route Planning in the Presence of a Threat Environment Based on a Virtual Globe Platform

    Directory of Open Access Journals (Sweden)

    Ming Zhang

    2016-10-01

    Full Text Available Route planning is a key technology for an unmanned aerial vehicle (UAV to fly reliably and safely in the presence of a threat environment. Existing route planning methods are mainly based on the simulation scene, whereas approaches based on the virtual globe platform have rarely been reported. In this paper, a new planning space for the virtual globe and the planner is proposed and a common threat model is constructed for threats including a no-fly zone, hazardous weather, radar coverage area, missile killing zone and dynamic threats. Additionally, an improved ant colony optimization (ACO algorithm is developed to enhance route planning efficiency and terrain masking ability. Our route planning methods are optimized on the virtual globe platform for practicability. A route planning system and six types of planners were developed and implemented on the virtual globe platform. Finally, our evaluation results demonstrate that our optimum planner has better performance in terms of fuel consumption, terrain masking, and risk avoidance. Experiments also demonstrate that the method and system described in this paper can be used to perform global route planning and mission operations.

  17. Dynamic Routing Protocol for Computer Networks with Clustering Topology

    Institute of Scientific and Technical Information of China (English)

    1999-01-01

    This paper presents a hierarchical dynamic routing protocol (HDRP) based on the discrete dynamic programming principle. The proposed protocol can adapt to the dynamic and large computer networks (DLCN) with clustering topology. The procedures for realizing routing update and decision are presented in this paper. The proof of correctness and complexity analysis of the protocol are also made. The performance measures of the HDRP including throughput and average message delay are evaluated by using of simulation. The study shows that the HDRP provides a new available approach to the routing decision for DLCN or high speed networks with clustering topology.

  18. U32: Vehicle Stability and Dynamics: Longer Combination Vehicles

    Energy Technology Data Exchange (ETDEWEB)

    Petrolino, Joseph [National Transportation Research Center (NTRC); Spezia, Tony [National Transportation Research Center (NTRC); Arant, Michael [Clemson University; Broshears, Eric [Auburn University, Auburn, Alabama; Chitwood, Caleb [Battelle; Colbert, Jameson [Auburn University, Auburn, Alabama; Hathaway, Richard [Western Michigan University; Keil, Mitch [Western Michigan University; LaClair, Tim J [ORNL; Pape, Doug [Battelle; Patterson, Jim [Hendrickson; Pittro, Collin [Battelle

    2011-01-01

    This study investigated the safety and stability of longer combination vehicles (LCVs), in particular a triple trailer combination behind a commercial tractor, which has more complicated dynamics than the more common tractor in combination with a single semitrailer. The goal was to measure and model the behavior of LCVs in simple maneuvers. Example maneuvers tested and modeled were single and double lane changes, a gradual lane change, and a constant radius curve. In addition to test track data collection and a brief highway test, two computer models of LCVs were developed. One model is based on TruckSim , a lumped parameter model widely used for single semitrailer combinations. The other model was built in Adams software, which more explicitly models the geometry of the components of the vehicle, in terms of compliant structural members. Among other results, the models were able to duplicate the experimentally measured rearward amplification behavior that is characteristic of multi-unit combination vehicles.

  19. A Method of Vehicle Route Prediction Based on Social Network Analysis

    Directory of Open Access Journals (Sweden)

    Ning Ye

    2015-01-01

    Full Text Available A method of vehicle route prediction based on social network analysis is proposed in this paper. The difference from proposed work is that, according to our collected vehicles’ past trips, we build a relationship model between different road segments rather than find the driving regularity of vehicles to predict upcoming routes. In this paper, firstly we depend on graph theory to build an initial road network model and modify related model parameters based on the collected data set. Then we transform the model into a matrix. Secondly, two concepts from social network analysis are introduced to describe the meaning of the matrix and we process it by current software of social network analysis. Thirdly, we design the algorithm of vehicle route prediction based on the above processing results. Finally, we use the leave-one-out approach to verify the efficiency of our algorithm.

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

  1. Vehicle Routing Problem Using Savings-Insertion and Reactive Tabu with a Variable Threshold

    Directory of Open Access Journals (Sweden)

    Moussa Bagayoko

    2016-12-01

    Full Text Available This paper focuses on how the competitiveness of companies is impacted by products distribution and transportation costs, especially in the context of exports. This paper uses our two steps approach, consisting in building a good initial solution and then improving it to solve vehicle routing problem. To that end, first, our mathematical model is adapted; secondly, our Savings-insertion builds a good initial solution, and thirdly, our Reactive tabu with a variable threshold improves the initial solution. The objective is the minimization of the total distance of transport by respecting the specified time window and the demand of all customers, which are important for some transportation companies’. Finally, the experimental results obtained with our methodology for Solomon 100 customers 56 vehicle routing problems are provided and discussed. Our methodology provides the best solutions for problems types R2 and RC2. Therefore, using our methodology reduces the total distance for long-haul vehicle routing problems.

  2. A Learning Automata Based Algorithm For Solving Capacitated Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Mir Mohammad Alipour

    2012-03-01

    Full Text Available This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP is an NP-hard problem and capacitated vehicle routing problem variant (CVRP is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distributed learning automata that is a general searching tool and is a solving tool for variety of NP-complete problems, is used to solve this problem and tested on fourteen benchmark problems. Our results were compared to the best known results. The results of comparison have shown the efficiency of the proposed algorithm.

  3. A Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems

    Directory of Open Access Journals (Sweden)

    Yucheng Kao

    2012-01-01

    Full Text Available The vehicle routing problem (VRP is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence (SI approaches, ant colony optimization (ACO and particle swarm optimization (PSO, for solving capacitated vehicle routing problems (CVRPs. In the proposed algorithm, each artificial ant, like a particle in PSO, is allowed to memorize the best solution ever found. After solution construction, only elite ants can update pheromone according to their own best-so-far solutions. Moreover, a pheromone disturbance method is embedded into the ACO framework to overcome the problem of pheromone stagnation. Two sets of benchmark problems were selected to test the performance of the proposed algorithm. The computational results show that the proposed algorithm performs well in comparison with existing swarm intelligence approaches.

  4. Optimization of min-max vehicle routing problem based on genetic algorithm

    Science.gov (United States)

    Liu, Xia

    2013-10-01

    In some cases, there are some special requirements for the vehicle routing problem. Personnel or goods geographically scattered, should be delivered simultaneously to an assigned place by a fleet of vehicles as soon as possible. In this case the objective is to minimize the distance of the longest route among all sub-routes. An improved genetic algorithm was adopted to solve these problems. Each customer has a unique integer identifier and the chromosome is defined as a string of integers. Initial routes are constructed randomly, and then standard proportional selection incorporating elitist is chosen to guarantee the best member survives. New crossover and 2-exchange mutation is adopted to increase the diversity of group. The algorithm was implemented and tested on some instances. The results demonstrate the effectiveness of the method.

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

    Directory of Open Access Journals (Sweden)

    Washington Alves de Oliveira

    2015-12-01

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

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

    Directory of Open Access Journals (Sweden)

    T.A. Yakovleva

    2011-05-01

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

  7. The vehicle routing problem with edge set costs

    DEFF Research Database (Denmark)

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

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

  8. A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Arif Imran

    2013-01-01

    Full Text Available The multi-depot vehicle routing problem (MDVRP is addressed using an adaptation of the variable neighborhood search (VNS. The proposed VNS algorithm besides using several neighborhoods and a number of local searches has a number of additional features. These include a scheme for identifying borderline customers, a diversivication procedure and a mechanism that aggregates and disaggregates routes between depots. The proposed algorithm is tested on the data instances from the literature and produces competitive results.

  9. Layered Formulation for the Robust Vehicle Routing Problem with Time Windows

    OpenAIRE

    2012-01-01

    International audience; This paper studies the vehicle routing problem with time windows where travel times are uncertain and belong to a predetermined polytope. The objective of the problem is to find a set of routes that services all nodes of the graph and that are feasible for all values of the travel times in the uncertainty polytope. The problem is motivated by maritime transportation where delays are frequent and must be taken into account. We present an extended formulation for the veh...

  10. A savings based method for real-life vehicle routing problems

    OpenAIRE

    1999-01-01

    textabstractThis paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on real-life data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the "visual attractiveness" of the plan. Computational results show that, in general, the Savings Based al...

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

  12. The electric vehicle routing problem with non-linear charging functions

    OpenAIRE

    2015-01-01

    International audience; The use of electric vehicles (EVs) in freight and passenger transportation gives birth to a new family of vehicle routing problems (VRPs), the so-called electric VRPs (e-VRPs). As their name suggests, e-VRPs extend classical VRPs to account (mainly) for two constraining EV features: the short driving range and the long battery charging time. As a matter of fact, routes performed by EVs usually need to include time-consuming detours to charging stations. Most of the exi...

  13. 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...... new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented....

  14. A new memetic algorithm for solving split delivery vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Ali Bozorgi-Amiri

    2015-11-01

    Full Text Available Split delivery vehicle routing problem is one of the traditional types of routing problems in which the demand of different points can be divided among vehicles and the objective is to minimize the path length, which vehicles travel. In this paper, fuel cost of vehicles which is assumed to be dependent on their traveled path and load is considered as the objective functions. Namely, the cost of the consumed fuel is proportionate to the unit of load carried per unit of distance. In order to solve the proposed model a new memetic algorithm is developed which has two rows. The performance of the proposed algorithm for 21 standard problems is compared with the optimum solutions obtained from mathematical programming standard solver and the solutions of the same algorithm with single row solution representation. The results express the efficiency of developed algorithm.

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

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

    Science.gov (United States)

    Azis, Zainal; Mawengkang, Herman

    2017-09-01

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

  17. Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

    Science.gov (United States)

    Yousefikhoshbakht, Majid; Khorram, Esmaile

    2012-08-01

    The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.

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

  19. A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

    OpenAIRE

    Mehdi Alinaghian; Zahra Kaviani; Siyavash Khaledan

    2015-01-01

    A significant portion of Gross Domestic Production (GDP) in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG). In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (GCW) for Vehicle Routing Problem regarding to fuel consumption is presented. The objective function ...

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

  1. Optimal Routing and Charging of Electric Ride-Pooling Vehicles in Urban Networks

    OpenAIRE

    2016-01-01

    In this project, we study an Electric Vehicle Routing Problem with Pick-ups and Deliveries, Time Windows, and Recharging Stations on New York City Taxicab data. In order to solve this problem, we divide the problems into three phases: (i) grouping similar customer requests by identifying geographic zones and time slots; (ii) determine groups of passengers to be transported together; (iii) complete the vehicle itinerary between these groups of passengers. The first phase uses the clustering me...

  2. Routing in Highly Dynamic Ad Hoc Networks: Issues and Challenges

    Directory of Open Access Journals (Sweden)

    Varun G Menon

    2016-04-01

    Full Text Available The aim of this research paper is to analyze the various issues and challenges involved in routing of data packets in highly mobile ad hoc networks. Routing in ad hoc networks has always been a challenging and tough task due to the dynamic topology and error prone wireless channel. There are a number of issues like lack of centralized control, constantly moving nodes etc that has to be considered while routing a data packet from the source to the destination in the ad hoc network. Routing of data packets becomes much more difficult with increased mobility of nodes. This paper analyses the various issues in routing of data packets from the source to the destination node and also lists down the parameters that has to be considered while designing and selecting a routing protocol for highly mobile ad hoc networks.

  3. Routing Autonomous Vehicles in the Improving Initial Task Assignment and Avoiding Deadlock Method

    Science.gov (United States)

    Morihiro, Yusuke; Miyamoto, Toshiyuki; Kumagai, Sadatoshi

    This paper discusses an on-line Tasks Assignment and Routing Problem (TARP) for Autonomous Transportation Systems (ATSs) in manufacturing systems. The TARP is a constrained version of the Pickup and Delivery Problem with Time Windows (PDPTW). In our former study, a cooperative algorithm, called the triple loop method, with autonomous distributed agents has been proposed. The Improving initial Task Assignment and Avoiding Deadlock method (ITAAD) is a faster algorithm than the triple loop method. In this paper, we propose a new vehicle routing method for the ITAAD. Results of computational experiments show effectiveness of the proposed routing method.

  4. A Cluster Based Scatter Search Heuristic for the Vehicle Routing Problem

    OpenAIRE

    Wendolsky, Rolf; Scheuerer, Stephan

    2006-01-01

    The Vehicle Routing Problem (VRP) is one of the most studied problems in the field of Operations Research. Closely related to the VRP is the Capacitated Clustering Problem (CCP). The VRP can be considered as an 'extension' of the CCP in the way that for each cluster in the CCP solution, additionally a route through all cluster customers and the depot has to be constructed to generate the routing information. In a previous study the Scatter Search methodology was used to solve the CCP. This al...

  5. Heuristics for Improving Operational Performance of Permutation Circulati on-type Vehicle Routing System

    Institute of Scientific and Technical Information of China (English)

    Hiroshi; KISE; Mingzhe; LU; Guiyan; HU; Tan; LI

    2002-01-01

    This paper discusses an optimization of operating a p ermutation circulation-type vehicle routing system (PCVRS, for short), in w hich several stages are located along by a single loop, and a fleet of vehicles travels on the loop unidirectionally and repeatedly. Traveling on the loop, each vehicle receives an object from the loading stage and then carries it to a cert ain processing stage, or receives an object from a certain processing stage and then carries it to the unloading stage per a turnaround...

  6. An approximation algorithm for the pickup and delivery vehicle routing problem on trees

    OpenAIRE

    Katoh, Naoki; Yano, Taihei

    2006-01-01

    This paper presents an approximation algorithm for a vehicle routing problem on a tree-shaped network with a single depot where there are two types of demands, pickup demand and delivery demand. Customers are located on nodes of the tree, and each customer has a positive demand of pickup and/or delivery. Demands of customers are served by a fleet of identical vehicles with unit capacity. Each vehicle can serve pickup and delivery demands. It is assumed that the demand of a customer is splitta...

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

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

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

    DEFF Research Database (Denmark)

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

    2008-01-01

    This paper presents a branch-and-cut-and-price algorithm for the vehicle-routing problem with time windows. The standard Dantzig-Wolfe decomposition of the arc flow formulation leads to a set-partitioning problem as the master problem and an elementary shortest-path problem with resource...

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

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

    OpenAIRE

    Sala Reixach, Joan

    2012-01-01

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

  13. An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing

    NARCIS (Netherlands)

    Huijink, S.; Kant, G.; Peeters, M.J.P.

    2014-01-01

    In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier.

  14. THREE-DIMENSIONAL LOADING VEHICLE ROUTING PROBLEM SOLUTION WITH SET-PARTITIONING-BASED METHOD

    OpenAIRE

    2013-01-01

    The article considers the optimization problem of vehicle routing with three-dimensional loading constraints. Several practical loading constraints encountered in freight transportation are formalized. The efficiency of using the set-partitioning approach to improve heuristic solution is shown by means of computational experiment.

  15. Intention-Aware Routing to Minimise Delays at Electric Vehicle Charging Stations

    NARCIS (Netherlands)

    De Weerdt, M.M.; Gerding, E.H.; Stein, S.; Robu, V.; Jennings, N.R.

    2013-01-01

    En-route charging stations allow electric vehicles to greatly extend their range. However, as a full charge takes a considerable amount of time, there may be significant waiting times at peak hours. To address this problem, we propose a novel navigation system, which communicates its intentions (i.

  16. An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing

    NARCIS (Netherlands)

    Huijink, S.; Kant, G.; Peeters, M.J.P.

    2014-01-01

    In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier.

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

    Directory of Open Access Journals (Sweden)

    Zhengyu Duan

    2015-11-01

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

  18. Determining which Orders to Outsource in the Vehicle Routing Problem with Order Outsourcing

    NARCIS (Netherlands)

    Huijink, Sybren; Kant, Goos; Peeters, Rene

    2015-01-01

    In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier.

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

    NARCIS (Netherlands)

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.; Zijm, W.H.M.

    2010-01-01

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

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

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

    Science.gov (United States)

    2015-01-01

    subsection 4 provides an overview of the benchmark data sets for the SDVRP. 3 2.1 SDVRP Formulation According to Aleman et al. (2010), the...variants of the vehicle routing problem. 24 References Aleman , R.E., Zhang, X., Hill, R. R., 2010. An adaptive memory algorithm for the split

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

    NARCIS (Netherlands)

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

    2010-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Guillermo González Vargas

    2010-04-01

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

  4. Determining which Orders to Outsource in the Vehicle Routing Problem with Order Outsourcing

    NARCIS (Netherlands)

    Huijink, Sybren; Kant, Goos; Peeters, Rene

    2015-01-01

    In practice, many package transportation companies lower their costs by hiring outside carriers to serve orders that cannot be served efficiently by their own trucks. The problem which takes the order outsource option into account is the Vehicle Routing Problem with Private Fleet and Common Carrier.

  5. The In-Transit Vigilant Covering Tour Problem of Routing Unmanned Ground Vehicles

    Science.gov (United States)

    2012-08-01

    15 Figure 2. A classic VRP ...17 Figure 3. Solution for a VRP ........................................................................................18 Figure 4. Solution...of NP-hard problems, such as the Traveling Salesman Problem (TSP), Vehicle Routing Problem ( VRP ), and Covering Salesman Problem (CSP) etc. We will

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

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

  8. Modelling of the optimal vehicle route in terrain in emergency situations using GIS data

    Science.gov (United States)

    Rybansky, M.

    2014-02-01

    Most navigation systems in transport are oriented towards the search for optimal paths (shortest or fastest), using vector GIS data. At the time of natural disasters and emergency situations is necessary to consider roads and terrain for transport. This article is focused on finding optimal routes in terrain, which contains a number of point, line and area obstacles. The most frequent point obstacles are trees in the forest. The paper analyzes the typical structure of tree stands in the forest, their characteristics in GIS databases, as well as dimensional parameters of vehicles moving in the forest. The quality of these data is a prerequisite for finding routes between point obstacles. Searching for the fastest or shortest route of the vehicle described in this article is based on the use of the relationship between the Delaunay triangulation and Voronoi graph, the application of Dijkstra's algorithm and the optimization of fractional line. The above-mentioned methods are also exploitable for searching for the shortest route of movement among line obstructions and area obstructions, such route can be apprehended as the joining of points defining impassable terrain. In such a case, the condition must be met that the distance of terminal points of joins has to be adjusted to the extent that it will be shorter than a vehicle width increased by safe margin.

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

    Science.gov (United States)

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

    2014-04-01

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

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

    Science.gov (United States)

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

    2009-06-30

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

  11. AUTOMATED GUIDED VEHICLE (AGV SYSTEMS AND ROUTING PROBLEM IN DEPOT MAINTENANCE

    Directory of Open Access Journals (Sweden)

    Fatih YİĞİT

    2003-02-01

    Full Text Available When full automation is realized in factory automation, material handing systems (MHS have a fairly important role. The most technological development among MHS's has been concentrated on Automated Guided Vehicle (AGV systems. An AGV is an unmanned vehicle capable of following an external guidance signal to deliver a unit load from destination to destination. Nowadays, there are a lot of applications lie along service sector to industrial sector because of flexibilities of AGVs. In this study, these subjects have been applied on the Army Aviation Depot Maintenance where aircraft's and aircraft parts can be maintained and overhauled is an application fields of AGV, requiring AGV numbers and AGV routing. The AGV routing problem and traveling sales person (TSP problems are identical problems; where the AGV routing problem is formulated as a zero one integer programming. Examples are presented to demonstrate the approach and LINGO has been used to solve the example.

  12. Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

    Directory of Open Access Journals (Sweden)

    Filip Taner

    2012-07-01

    Full Text Available This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW and shows that implementing algorithms for solving various instances of VRPs can significantly reduce transportation costs that occur during the delivery process. Two metaheuristic algorithms were developed for solving VRPTW: Simulated Annealing and Iterated Local Search. Both algorithms generate initial feasible solution using constructive heuristics and use operators and various strategies for an iterative improvement. The algorithms were tested on Solomon’s benchmark problems and real world vehicle routing problems with time windows. In total, 44 real world problems were optimized in the case study using described algorithms. Obtained results showed that the same distribution task can be accomplished with savings up to 40% in the total travelled distance and that manually constructed routes are very ineffective.

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

    Directory of Open Access Journals (Sweden)

    Joseph Y.J. Chow

    2016-10-01

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

  14. Vehicle Dynamics Approach to Driver Warning

    Directory of Open Access Journals (Sweden)

    Youssef A. Ghoneim

    2013-01-01

    Full Text Available This paper discusses a concept for enhanced active safety by introducing a driver warning system based on vehicle dynamics that predicts a potential loss of control condition prior to stability control activation. This real-time warning algorithm builds on available technologies such as the Electronic Stability Control (ESC. The driver warning system computes several indices based on yaw rate, side-slip velocity, and vehicle understeer using ESC sensor suite. An arbitrator block arbitrates between the different indices and determines the status index of the driving vehicle. The status index is compared to predetermined stability levels which correspond to high and low stability levels. If the index exceeds the high stability level, a warning signal (haptic, acoustic, or visual is issued to alert the driver of a potential loss of control and ESC activation. This alert will remain in effect until the index is less than the low stability level at which time the warning signal will be terminated. A vehicle speed advisory algorithm is integrated with the warning algorithm to provide a desired vehicle speed of a vehicle traveling on a curve. Simulation results and vehicle tests were conducted to illustrate the effectiveness of the warning algorithm.

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

    Science.gov (United States)

    Lamdjaya, T.; Jobiliong, E.

    2017-01-01

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

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

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

  18. A generalized multi-depot vehicle routing problem with replenishment based on LocalSolver

    Directory of Open Access Journals (Sweden)

    Ying Zhang

    2015-01-01

    Full Text Available In this paper, we consider the multi depot heterogeneous vehicle routing problem with time windows in which vehicles may be replenished along their trips. Using the modeling technique in a new-generation solver, we construct a novel formulation considering a rich series of constraint conditions and objective functions. Computation results are tested on an example comes from the real-world application and some cases obtained from the benchmark problems. The results show the good performance of local search method in the efficiency of replenishment system and generalization ability. The variants can be used to almost all kinds of vehicle routing problems, without much modification, demonstrating its possibility of practical use.

  19. Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm

    Directory of Open Access Journals (Sweden)

    Zhang Jiashan

    2015-01-01

    Full Text Available The capacitated vehicle routing problems (CVRP are NP-hard. Most approaches can solve small-scale case studies to optimality. Furthermore, they are time-consuming. To overcome the limitation, this paper presents a novel three-phase heuristic approach for the capacitated vehicle routing problem. The first phase aims to identify sets of cost-effective feasible clusters through an improved ant-clustering algorithm, in which the adaptive strategy is adopted. The second phase assigns clusters to vehicles and sequences them on each tour. The third phase orders nodes within clusters for every tour and genetic algorithm is used to order nodes within clusters. The simulation indicates the algorithm attains high quality results in a short time.

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

    Directory of Open Access Journals (Sweden)

    Kui-Ting CHEN

    2015-12-01

    Full Text Available 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 the CVRPPD in this paper. The proposed AMSPSO employs multiple PSO algorithms and an adaptive algorithm with punishment mechanism to search the optimal solution, which can deal with large-scale optimization problems. The simulation results prove that the proposed AMSPSO can solve the CVRPPD with the least number of vehicles and less transportation cost, simultaneously.

  1. Benefits Analysis of Multi-Center Dynamic Weather Routes

    Science.gov (United States)

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

    2014-01-01

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

  2. Dynamic analysis of rail vehicle axle

    Indian Academy of Sciences (India)

    Ferhat Dikmen; Meral Bayraktar; Rahmi Guclu

    2013-04-01

    In this paper, in order to obtain the dynamic forces on the passenger coach axle, a full rail vehicle model with 19-dof (degrees of freedom) has been considered. For a specific example, the variations of these dynamic forces with velocity of the passenger coach, suspension characteristics and way conditions have been examined. Dynamic forces found in the resonance regions at the range of 2–5 m/s (7.2–18 km/h) has been discussed. Theoretical results obtained for the dynamic forces have been successfully compared with the experimental results of German Railways (Deutsche Bahn-DB).

  3. Dynamics of Railway Vehicles and Rail/Wheel Contact

    DEFF Research Database (Denmark)

    True, Hans

    2007-01-01

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

  4. Spatial, temporal, and hybrid decompositions for large-scale vehicle routing with time windows

    Energy Technology Data Exchange (ETDEWEB)

    Bent, Russell W [Los Alamos National Laboratory

    2010-01-01

    This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehicle-based decompositions that partitions the vehicles across the subproblems. The subproblems can then be optimized independently and merged easily. This paper argues that vehicle-based decompositions, although very effective on various problem classes also have limitations. In particular, they do not accommodate temporal decompositions and may produce spatial decompositions that are not focused enough. This paper then proposes customer-based decompositions which generalize vehicle-based decouplings and allows for focused spatial and temporal decompositions. Experimental results on class R2 of the extended Solomon benchmarks demonstrates the benefits of the customer-based adaptive decomposition scheme and its spatial, temporal, and hybrid instantiations. In particular, they show that customer-based decompositions bring significant benefits over large neighborhood search in contrast to vehicle-based decompositions.

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

    OpenAIRE

    Simanullang, Herlin

    2013-01-01

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

  6. Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

    Science.gov (United States)

    Yang, Xi; Ramamurthy, Byrav

    2005-03-01

    Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes,allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters,receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.

  7. Operational Evaluatioin of Dynamic Weather Routes at American Airlines

    Science.gov (United States)

    McNally, David; Sheth, Kapil; Gong, Chester; Borchers, Paul; Osborne, Jeff; Keany, Desmond; Scott, Brennan; Smith, Steve; Sahlman, Scott; Lee, Chuhan; hide

    2013-01-01

    Dynamic Weather Routes (DWR) is a search engine that continuously and automatically analyzes inflight aircraft in en route airspace and proposes simple route amendments for more efficient routes around convective weather while considering sector congestion, traffic conflicts, and active Special Use Airspace. NASA and American Airlines (AA) are conducting an operational trial of DWR at the AA System Operations Center in Fort Worth, TX. The trial includes only AA flights in Fort Worth Center airspace. Over the period from July 31, 2012 through August 31, 2012, 45% of routes proposed by DWR and evaluated by AA users - air traffic control coordinators and flight dispatchers - were rated as acceptable as proposed or with some modifications. The wind-corrected potential flying time savings for these acceptable routes totals 470 flying min, and results suggest another 1,500 min of potential savings for flights not evaluated due to staffing limitations. A sector congestion analysis shows that in only two out of 83 DWR routes rated acceptable by AA staff were the flights predicted to fly through a congested sector inside of 30 min downstream of present position. This shows that users considered sector congestion data provided by DWR automation and in nearly all cases did not accept routes through over-capacity sectors. It is estimated that 12 AA flights were given reroute clearances as a direct result of DWR for a total savings of 67 flying min.

  8. Vehicle dynamics modeling and simulation

    CERN Document Server

    Schramm, Dieter; Bardini, Roberto

    2014-01-01

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

  9. Dynamic wireless charging of electric vehicles on the move with Mobile Energy Disseminators

    Directory of Open Access Journals (Sweden)

    Leandros A. Maglaras

    2015-06-01

    Full Text Available Dynamic wireless charging of electric vehicles (EVs is becoming a preferred method since it enables power exchange between the vehicle and the grid while the vehicle is moving. In this article, we present mobile energy disseminators (MED, a new concept, that can facilitate EVs to extend their range in a typical urban scenario. Our proposed method exploits Inter-Vehicle (IVC communications in order to eco-route electric vehicles taking advantage of the existence of MEDs. Combining modern communications between vehicles and state of the art technologies on energy transfer, vehicles can extend their travel time without the need for large batteries or extremely costly infrastructure. Furthermore, by applying intelligent decision mechanisms we can further improve the performance of the method.

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

    Science.gov (United States)

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

    2017-02-15

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

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

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2014-12-01

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

  12. DYNAMIC ANALYSIS OF A VEHICLE CLUTCH

    Directory of Open Access Journals (Sweden)

    Emin GÜLLÜ

    2003-03-01

    Full Text Available In this study as a first step of an ongoing investigation, a dynamic model was developed to analyse motion and power transmission phenomen in mechanical clutches used commonly in motor vehicles . The control of a driver on clutch and speed pedals was reflected in the model. The movement of clutch disk with constant speed and acceleration can be investigated by using the model. In addition, the control of speeding by driver was included to the model via a certain scenario. During clutch engagement and after, the effects of loading torques in different gears on the time of perfect engagement and on the speed of the vehicle were investigated.

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

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

    DEFF Research Database (Denmark)

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

    In Copenhagen, Denmark, the preliminary steps of introducing an Urban Consolidation Centre (UCC) in the perimeter of the city centre has been taken. By implementing a UCC, interests of customers and distributors, as well as improvement of the local urban environment are sought considered [1...... a tour. Furthermore, intelligent location of these recharging points is considered. The objective is to find a least cost plan for routing and recharging the vehicles so that each customer is serviced by exactly one vehicle within its time windows and the vehicle capacity and driving range constraints......]. The UCC service aims to consolidate urban freight, as well as implement additional aspects such as off-peak delivery and utilisation of alternatively fuelled vehicles. In the specific case of Copenhagen, a comprehensive traffic survey was conducted in May 2011. The aim of the survey was to estimate...

  15. An Improved Spatially Aware Routing Algorithm for Mobile Ad Hoc Network in Inter-Vehicle Communication

    Institute of Scientific and Technical Information of China (English)

    HAN Lu; ZHOU Man-li; TIAN Jing; KURT Rothermel

    2004-01-01

    A new algorithm called spatially aware routing algorithm with enhanced learning (SAREL) is proposed to guarantee the rationality of route selecting in inter-vehicle communication scenario. Firstly, the traffic model is discussed and set up by using Poisson distribution. Then we analyze the process of traffic evaluation with enhanced learning, and exploit movement estimation to assist state memorization. The improvement of algorithm is provided at last compared with our previous work. Simulation results show that SAREL algorithm could achieve better performance in packet delivery ratio, especially when network connection ratio is average.

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

    Directory of Open Access Journals (Sweden)

    Juan Camilo Paz

    2018-01-01

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

  17. A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing

    CERN Document Server

    Das, Aparna

    2008-01-01

    In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, and wish to find a minimum length collection of tours, each starting from the depot and visiting at most k customers, whose union covers all the customers. We give a quasi-polynomial time approximation scheme for the setting where the customers and the depot are on the plane, and distances are given by the Euclidean metric.

  18. Dynamic Routing Algorithm for Increasing Robustness in Satellite Networks

    Institute of Scientific and Technical Information of China (English)

    LI Dong-ni; ZHANG Da-kun

    2008-01-01

    In low earth orbit(LEO)and medium earth orbit(MEO)satellite networks,the network topology changes rapidly because of the high relative speed movement of satellites.When some inter-satellite links (ISLs)fail,they can not be repaired in a short time.In order to increase the robustness for LEO/MEO satellite networks,an effective dynamic routing algorithm is proposed.All the routes to a certain node are found by constructing a destination oriented acyclic directed graph(DOADG)with the node as the destination.In this algorithm,multiple routes are provided,loop-free is guaranteed,and as long as the DOADG maintains,it is not necessary to reroute even if some ISLs fail.Simulation results show that comparing to the conventional routing algorithms,it is more efficient and reliable,costs less transmission overhead and converges faster.

  19. Dynamic Routing of IP Traffic Based on QOS Parameters

    Directory of Open Access Journals (Sweden)

    Martin Kriška

    2014-07-01

    Full Text Available The article looks into the current state of the art of dynamic routing protocols with respect to their possibilities to react to changes in the Quality of Service when selecting the best route towards a destination network. New options that could leverage information about the ever changing QoS parameters for data communication are analysed and a Cisco Performance Routing solution is described more in detail. The practical part of this work focuses on a design and implementation of a test bed that provides ascalable laboratory architecture to manipulate QoS parameters of different data communications flowing through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing optimization capabilities in different scenarios.

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

    Directory of Open Access Journals (Sweden)

    Wang Li-ying

    2015-11-01

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

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

  2. Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests

    Science.gov (United States)

    Sombuntham, Pandhapon; Kachitvichyanukul, Voratas

    2010-10-01

    This paper considers a multi-depot vehicle routing problem with pickup and delivery requests. In the problem of interest, each location may have goods for both pickup and delivery with multiple delivery locations that may not be the depots. These characteristics are quite common in industrial practice. A particle swarm optimization algorithm with multiple social learning structures is proposed for solving the practical case of multi-depot vehicle routing problem with simultaneous pickup and delivery and time window. A new decoding procedure is implemented using the PSO class provided in the ETLib object library. Computational experiments are carried out using the test instances for the pickup and delivery problem with time windows (PDPTW) as well as a newly generated instance. The preliminary results show that the proposed algorithm is able to provide good solutions to most of the test problems.

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2000-12-01

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

  5. Lagrangean Duality Applied on Vehicle Routing with Time Windows - Experimental Results

    DEFF Research Database (Denmark)

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

    2001-01-01

    This report presents the results of the application of a non-differentiable optimization method in connection with the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is an extension of the Vehicle Routing Problem. In the VRPTW the service at each customer must start within...... an associated time window. The Shortest Path decomposition of the VRPTW by Lagrangian relaxation require the finding of the optimal Lagrangian multipliers. This problem is a convex non-differentiable optimization problem. The optimal multipliers are found using the non-differentiable method denoted the proximal...... bundle- and Dantzig-Wolfe algorithm has been tested on the well-known Solomon VRPTW benchmark problems and a range of extended Solomon problems. Since we have succeded in solving 14 previously unsolved problems and an extended Solomon problem with 1000 customers, which is the largest problem ever solved...

  6. Penerapan Algoritma Differential Evolution untuk Penyelesaian Permasalahan Vehicle Routing Problem with Delivery and Pick-up

    Directory of Open Access Journals (Sweden)

    Ika Ayu Fajarwati

    2012-09-01

    Full Text Available Vehicle Routing Problem (VRP merupakan permasalahan optimasi kombinatorial kompleks yang memiliki peranan penting dalam manajemen sistem distribusi dengan tujuan meminimalkan biaya yang diperlukan, dimana penentuan biaya berkaitan dengan jarak dari rute yang ditempuh oleh armada distribusi. Ciri dari VRP yaitu penggunaan armada dengan kapasitas tertentu dan kegiatannya berpusat pada satu titik depot untuk melayani pelanggan pada titik-titik tertentu dengan jumlah permintaan yang diketahui. Kasus distribusi yang menggabungkan aktifitas pengiriman dan pengambilan produk termasuk dalam salah satu jenis VRP yaitu Vehicle Routing Problem Delivery and Pick-Up (VRP-DP. Banyak metode yang dapat digunakan untuk menyelesaikan permasalahan VRP-DP, salah satunya adalah metode optimasi metaheuristik yaitu Algoritma Differential Evolution yang akan diperkenalkan dalam penelitian ini. Hasil yang diharapkan nantinya adalah rute distribusi optimal untuk armada perusahaan sehingga menghasilkan jarak tempuh dan tentunya total biaya yang minimal dalam memenuhi semua permintaan pelanggan

  7. Vehicle dynamic prediction systems with on-line identification of vehicle parameters and road conditions.

    Science.gov (United States)

    Hsu, Ling-Yuan; Chen, Tsung-Lin

    2012-01-01

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

  8. A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands

    Science.gov (United States)

    Erbao, Cao; Mingyong, Lai

    2009-09-01

    In this paper, the vehicle routing problem with fuzzy demands (VRPFD) is considered, and a fuzzy chance constrained program model is designed, based on fuzzy credibility theory. Then stochastic simulation and differential evolution algorithm are integrated to design a hybrid intelligent algorithm to solve the fuzzy chance constrained program model. Moreover, the influence of the dispatcher preference index on the final objective of the problem is discussed using stochastic simulation, and the best value of the dispatcher preference index is obtained.

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

  10. The vehicle routing problem: State of the art classification and review

    OpenAIRE

    Braekers, Kris; Ramaekers, Katrien; Van Nieuwenhuyse, Inneke

    2016-01-01

    Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever more popular in the academic literature. Yet, the problem characteristics and assumptions vary widely and few literature reviews have made an effort to classify the existing articles accordingly. In this article, we present a taxonomic review of the VRP literature published between 2009 and June 2015. Based on an adapted version of an existing comprehensive taxonomy, we classify 277 articles and analyze ...

  11. A Group Theoretic Tabu Search Methodology for Solving the Theater Distribution Vehicle Routing and Scheduling Problem

    Science.gov (United States)

    2002-06-01

    Assignment Heurisitic for Vehicle Routing,” Networks: 11, 109-124 (1981). Fraleigh , John B. A First Course in Abstract Algebra, Addison-Wesley...Infantry Officer, and attended the Infantry Officer Basic Course and Ranger School. His first tour was with the 25th Infantry Division, Schofield...James Moore, for his guidance and support throughout the course of this research effort. I would also like to thank my committee members Dr. Barnes

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

  13. GREEDY NON-DOMINATED SORTING IN GENETIC ALGORITHM-II FOR VEHICLE ROUTING PROBLEM IN DISTRIBUTION

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Vehicle routing problem in distribution (VRPD) is a widely used type of vehicle routing problem (VRP), which has been proved as NP-Hard, and it is usually modeled as single objective optimization problem when modeling. For multi-objective optimization model, most researches consider two objectives. A multi-objective mathematical model for VRP is proposed, which considers the number of vehicles used, the length of route and the time arrived at each client. Genetic algorithm is one of the most widely used algorithms to solve VRP. As a type of genetic algorithm (GA), non-dominated sorting in genetic algorithm-Ⅱ(NSGA-Ⅱ) also suffers from premature convergence and enclosure competition. In order to avoid these kinds of shortage, a greedy NSGA-Ⅱ (GNSGA-Ⅱ) is proposed for VRP problem. Greedy algorithm is implemented in generating the initial population, cross-over and mutation. All these procedures ensure that NSGA-Ⅱ is prevented from premature convergence and refine the performance of NSGA-Ⅱ at each step. In the distribution problem of a distribution center in Michigan, US, the GNSGA-Ⅱ is compared with NSGA-Ⅱ. As a result, the GNSGA-II is the most efficient one and can get the most optimized solution to VRP problem. Also, in GNSGA-II, premature convergence is better avoided and search efficiency has been improved sharply.

  14. Nonlinear Dynamic Characteristics of the Railway Vehicle

    Science.gov (United States)

    Uyulan, Çağlar; Gokasan, Metin

    2017-06-01

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

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

    Science.gov (United States)

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

    2015-03-01

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

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

    DEFF Research Database (Denmark)

    Tiesyte, Dalia; Jensen, Christian Søndergaard

    2008-01-01

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

  17. A Novel Heuristic Algorithm Based on Clark and Wright Algorithm for Green Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    Mehdi Alinaghian

    2015-08-01

    Full Text Available A significant portion of Gross Domestic Production (GDP in any country belongs to the transportation system. Transportation equipment, in the other hand, is supposed to be great consumer of oil products. Many attempts have been assigned to the vehicles to cut down Greenhouse Gas (GHG. In this paper a novel heuristic algorithm based on Clark and Wright Algorithm called Green Clark and Wright (GCW for Vehicle Routing Problem regarding to fuel consumption is presented. The objective function is fuel consumption, drivers, and the usage of vehicles. Being compared to exact methods solutions for small-sized problems and to Differential Evolution (DE algorithm solutions for large-scaled problems, the results show efficient performance of the proposed GCW algorithm.

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

  19. Longitudinal dynamic stability of a shuttle vehicle.

    Science.gov (United States)

    Vinh, N. X.; Laitone, E. V.

    1972-01-01

    Analytical study of the longitudinal dynamic stability of a nonrolling, lifting vehicle gliding at hypersonic speeds. The analysis applies to shuttle vehicles designed for operating up to the rim of a planetary atmosphere. A general nondimensional time transformation is introduced to derive a unified second-order linear differential equation for the angle of attack, valid for all types of reentry of a general type of vehicle. The stability of motion is discussed for two fundamental regimes of flight that are based on widely different assumptions. For near ballistic entry along a straight line trajectory, the equation reduces to a confluent hypergeometric equation, the solution of which can be expressed in terms of Whittaker's function. Using a theorem in the theory of stability of differential equations, criteria for damped oscillations are derived. It is shown that the aerodynamic criteria for stability are the same as for the case of ballistic entry. In addition, for each vehicle configuration, and specified planetary atmosphere, there exists an altitude range where the angle of attack frequency is nearly equal to the orbital frequency causing instability in pitch. This resonance instability is due to the ellipticity of the orbit. Criteria for eccentricity instability are derived.

  20. 军事配送式后勤车辆路径问题研究%Research on Military Distribution Logistics Vehicle Routing

    Institute of Scientific and Technical Information of China (English)

    郝瑞卿; 闫莉

    2015-01-01

    In order to improve the distribution efficiency of military logistics vehicles and realize the quick response ,a multi-objective dynamic military logistics vehicle routing model with a single time window was established based on the analysis of the characteristics of military logistics vehicle routing . And then a Genetic Ant Colony Hybrid Algorithm of two stages was designed for the model . The simulation results show that the hybrid algorithm overcomes the lower efficiency of the genetic algorithm and the premature convergence of the Ant colony algorithm .It can effectively optimize the dynamic routing of the military logistics distribution vehicles .%为提高军事后勤车辆的配送效率,实现快速响应,文中在分析军事后勤车辆路径问题特点的基础上,建立了单时间窗多目标动态军事后勤车辆路径模型,设计了遗传-蚁群混合算法对模型进行两阶段求解。仿真实验结果表明,该算法解决了遗传算法求解效率低及蚁群算法收敛过早的问题,可有效解决军事后勤车辆动态路径优化问题。

  1. Modeling municipal solid waste collection: A generalized vehicle routing model with multiple transfer stations, gather sites and inhomogeneous vehicles in time windows.

    Science.gov (United States)

    Son, Le Hoang; Louati, Amal

    2016-06-01

    Municipal Solid Waste (MSW) collection is a necessary process in any municipality resulting in the quality-of-life, economic aspects and urban structuralization. The intrinsic nature of MSW collection relates to the development of effective vehicle routing models that optimize the total traveling distances of vehicles, the environmental emission and the investment costs. In this article, we propose a generalized vehicle routing model including multiple transfer stations, gather sites and inhomogeneous vehicles in time windows for MSW collection. It takes into account traveling in one-way routes, the number of vehicles per m(2) and waiting time at traffic stops for reduction of operational time. The proposed model could be used for scenarios having similar node structures and vehicles' characteristics. A case study at Danang city, Vietnam is given to illustrate the applicability of this model. The experimental results have clearly shown that the new model reduces both total traveling distances and operational hours of vehicles in comparison with those of practical scenarios. Optimal routes of vehicles on streets and markets at Danang are given. Those results are significant to practitioners and local policy makers.

  2. Dynamic Air Route Open-Close Problem for Airspace Management

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Dynamic airspace management plans and assigns airspace resources to airspace users on demand to increase airspace capacity. Although many studies of air traffic flow management (ATFM) have sought to optimally allocate air traffic to get the best use of given airspace resources, few studies have focused on how to build an efficient air traffic network or how to adjust the current network in real time. This paper presents an integer program model named the dynamic air route open-close problem (DROP). DROP has a cost-based objective function which takes into account constraints such as the shortest occupancy time of routes, which are not considered in ATFM models. The aim of DROP is to determine which routes will be opened to a certain user during a given time period. Simulation results show that DROP can facilitate utilization of air routes. DROP, a simplified version of an air traffic network constructing problem, is the first step towards realizing dynamic airspace management. The combination of ATFM and DROP can facilitate decisions toward more reasonable, efficient use of limited airspace resources.

  3. Congested Link Inference Algorithms in Dynamic Routing IP Network

    Directory of Open Access Journals (Sweden)

    Yu Chen

    2017-01-01

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

  4. Decentralized Control of Dynamic Routing with a Neural Network Algorithm

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    A state-dependent routing algorithm based on the neural network model, which takes advantage of other dynamic routing algorithm for circuit-switched network, is given in [1]. But, the Algorithm in [1] is a centralized control model with complex O (N7), therefore, is difficult to realize by hardware. A simplified algorithm is put forward in this paper, in which routing can be controlled decentralizedly, and its complexity is reduced to O (10N3). Computer simulations are made in a fully connected test network with eight nodes. The results show that the centralized control model has very effective performance that can match RTNR, and the centralized control model is not as good as the centralized one but better than DAR-1.

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

  6. On the Miller-Tucker-Zemlin Based Formulations for the Distance Constrained Vehicle Routing Problems

    Science.gov (United States)

    Kara, Imdat

    2010-11-01

    Vehicle Routing Problem (VRP), is an extension of the well known Traveling Salesman Problem (TSP) and has many practical applications in the fields of distribution and logistics. When the VRP consists of distance based constraints it is called Distance Constrained Vehicle Routing Problem (DVRP). However, the literature addressing on the DVRP is scarce. In this paper, existing two-indexed integer programming formulations, having Miller-Tucker-Zemlin based subtour elimination constraints, are reviewed. Existing formulations are simplified and obtained formulation is presented as formulation F1. It is shown that, the distance bounding constraints of the formulation F1, may not generate the distance traveled up to the related node. To do this, we redefine the auxiliary variables of the formulation and propose second formulation F2 with new and easy to use distance bounding constraints. Adaptation of the second formulation to the cases where new restrictions such as minimal distance traveled by each vehicle or other objectives such as minimizing the longest distance traveled is discussed.

  7. A two-stage heuristic method for vehicle routing problem with split deliveries and pickups

    Institute of Scientific and Technical Information of China (English)

    Yong WANG; Xiao-lei MA; Yun-teng LAO; Hai-yan YU; Yong LIU

    2014-01-01

    The vehicle routing problem (VRP) is a well-known combinatorial optimization issue in transportation and logistics network systems. There exist several limitations associated with the traditional VRP. Releasing the restricted conditions of traditional VRP has become a research focus in the past few decades. The vehicle routing problem with split deliveries and pickups (VRPSPDP) is particularly proposed to release the constraints on the visiting times per customer and vehicle capacity, that is, to allow the deliveries and pickups for each customer to be simultaneously split more than once. Few studies have focused on the VRPSPDP problem. In this paper we propose a two-stage heuristic method integrating the initial heuristic algorithm and hybrid heuristic algorithm to study the VRPSPDP problem. To validate the proposed algorithm, Solomon benchmark datasets and extended Solomon benchmark datasets were modified to compare with three other popular algorithms. A total of 18 datasets were used to evaluate the effectiveness of the proposed method. The computational results indicated that the proposed algorithm is superior to these three algorithms for VRPSPDP in terms of total travel cost and average loading rate.

  8. Enhanced Direction Based Hazard Routing Protocol for Smooth Movement of Vehicles

    Directory of Open Access Journals (Sweden)

    Needhi Lathar

    2016-02-01

    Full Text Available Vehicular Ad hoc Network involves the movement of vehicles and the communication between them for their security. VANETs have many application areas. One of main applications of VANETs is to improve the driving safety. In various safety related applications, vehicular nodes constantly communicate with roadside equipments. Road Side Units (RSUs can sense the real time information about road conditions, animals straying and road blocks and passes all this hazardous related information to the vehicles approaching in its range. These alert messages enable the driver to take timely decisions in preventing from accidents or delays in information delivery. In this paper, Enhanced Direction based Hazard Routing Protocol and Ad Hoc On-demand Distance Vector protocols are used to avoid prevent vehicles from collision and to increase the coverage range of VANETs. These issues are resolved by bypass routing and a synchronized clock maintained with the RSUs respectively. To solve the issues and make the system more reliable we propose the roadside wireless sensor nodes along with vehicular nodes in the network. The RSUs are fixed at some distances and communicate with wireless sensors attached at vehicular nodes.

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

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

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

    DEFF Research Database (Denmark)

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

    2006-01-01

    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 traditional Lagrangean relaxation over q-routes, the other defined by bound, degree and capacity constraints. This is equivalent to a linear program with exponentially many variables and constraints that can lead to lower bounds that are superior to those given by previous methods. The resulting branch......-and-cut-and-price algorithm can solve to optimality all instances from the literature with up to 135 vertices. This more than doubles the size of the instances that can be consistently solved....

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

    Science.gov (United States)

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

    2015-08-27

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

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

    Directory of Open Access Journals (Sweden)

    GK Rand

    2009-12-01

    Full Text Available Forty five years ago, an academic and practitioner from the north of England published a method of tackling the vehicle routing problem (VRP in an American journal. Little could they have realised how the method they devised would still be a significant part of the research agenda nearly half a century later. Adaptations of their method are significant components in the analysis of the many different extensions to the problem that have been investigated. This paper provides the historical background to the development of the savings method and subsequent proposed variations to the basic savings formula and other improvements, and then charts the role the savings method has played in the investigation of VRPs with additional constraints. Some interesting examples of practical applications of the savings method are reported. Finally, comments are made on the use of the savings method in commercial routing packages.

  14. The pitch-heave dynamics of transportation vehicles

    Science.gov (United States)

    Sweet, L. M.; Richardson, H. H.

    1975-01-01

    The analysis and design of suspensions for vehicles of finite length using pitch-heave models is presented. Dynamic models for the finite length vehicle include the spatial distribution of the guideway input disturbance over the vehicle length, as well as both pitch and heave degrees-of-freedom. Analytical results relate the vehicle front and rear accelerations to the pitch and heave natural frequencies, which are functions of vehicle suspension geometry and mass distribution. The effects of vehicle asymmetry and suspension contact area are evaluated. Design guidelines are presented for the modification of vehicle and suspension parameters to meet alternative ride quality criteria.

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

    CERN Document Server

    Taghavifar, Hamid

    2017-01-01

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

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

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

    DEFF Research Database (Denmark)

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

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

  20. Vehicle Routing Problem Solving Method for a Cooperative Logistics Network by Using Multi-Stage GA

    Science.gov (United States)

    Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setsuo; Komoda, Norihisa

    A GA applied VRP (Vehicle Routing Problem) solving-method which realizes optimization of a cooperative logistics network is proposed. For this optimization a VRP solving-method that can obtain human expert-level solution, which realizes steady logistics operation, in interactive response time is required. The multi-stage GA enables to obtain the accurate solution under both hard and weak time constraints in interactive response time. Moreover, to realize the stable logistics operation, the daily fluctuation of shipping volume is taken into the fitness value of each individual in GA. The experimental result reveals the proposed method obtains the accurate solution that realizes the stable operation in interactive response time.

  1. 车辆路径优化文献综述%Review on Vehicle Routing Optimizations

    Institute of Scientific and Technical Information of China (English)

    肖建辉

    2010-01-01

    车辆调度问题(VRP,Vehicle Routing Problem)是现代物流系统研究中的一项重要内容.选取合适的运输路线,可以加快对客户需求的响应速度,提高服务质量,降低服务商的运营成本.本文就车辆路径问题的模型和求解方法对前人的研究成果进行回顾与梳理.

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

    Directory of Open Access Journals (Sweden)

    Yi-xiang Yue

    2015-01-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

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

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

    for defining the edge sets are discussed and formulated. Both the multigraph case and the direct path case are described, and mixed-integer-programming formulations of the problem are presented for both cases. A solution method based on branch-price-and-cut is applied to the direct path case. The computational......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 versions...

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

    DEFF Research Database (Denmark)

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

    2015-01-01

    In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real......-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....

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

    Directory of Open Access Journals (Sweden)

    N. Rincon-Garcia

    2017-01-01

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

  8. Dynamic formation control for autonomous underwater vehicles

    Institute of Scientific and Technical Information of China (English)

    燕雪峰; 古锋; 宋琛; 胡晓琳; 潘毅

    2014-01-01

    Path planning and formation structure forming are two of the most important problems for autonomous underwater vehicles (AUVs) to collaborate with each other. In this work, a dynamic formation model was proposed, in which several algorithms were developed for the complex underwater environment. Dimension changeable particle swarm algorithm was used to find an optimized path by dynamically adjusting the number and the distribution of the path nodes. Position relationship based obstacle avoidance algorithm was designed to detour along the edges of obstacles. Virtual potential point based formation-keeping algorithm was employed by incorporating dynamic strategies which were decided by the current states of the formation. The virtual potential point was used to keep the formation structure when the AUV or the formation was deviated. Simulation results show that an optimal path can be dynamically planned with fewer path nodes and smaller fitness, even with a concave obstacle. It has been also proven that different formation-keeping strategies can be adaptively selected and the formation can change its structure in a narrow area and restore back after passing the obstacle.

  9. Optimizing Gear Shifting Strategy for Off-Road Vehicle with Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Xinxin Zhao

    2014-01-01

    Full Text Available Gear shifting strategy of vehicle is important aid for the acquisition of dynamic performance and high economy. A dynamic programming (DP algorithm is used to optimize the gear shifting schedule for off-road vehicle by using an objective function that weighs fuel use and trip time. The optimization is accomplished through discrete dynamic programming and a trade-off between trip time and fuel consumption is analyzed. By using concave and convex surface road as road profile, an optimal gear shifting strategy is used to control the longitudinal behavior of the vehicle. Simulation results show that the trip time can be reduced by powerful gear shifting strategy and fuel consumption can achieve high economy with economical gear shifting strategy in different initial conditions and route cases.

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

    DEFF Research Database (Denmark)

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

    2012-01-01

    In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...... show that re-routing strategies can lower CO2 emissions compared to the basic energy source routing scheme, and a lower re-routing threshold achieves more savings. The increased blocking probability brought by using re-routing schemes can be compensated by applying load balancing criteria. A trade...

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

    CERN Document Server

    Markiewicz, Michal

    2017-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Kenan Karagül

    2014-07-01

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

  13. Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows.

    Science.gov (United States)

    Jawarneh, Sana; Abdullah, Salwani

    2015-01-01

    This paper presents a bee colony optimisation (BCO) algorithm to tackle the vehicle routing problem with time window (VRPTW). The VRPTW involves recovering an ideal set of routes for a fleet of vehicles serving a defined number of customers. The BCO algorithm is a population-based algorithm that mimics the social communication patterns of honeybees in solving problems. The performance of the BCO algorithm is dependent on its parameters, so the online (self-adaptive) parameter tuning strategy is used to improve its effectiveness and robustness. Compared with the basic BCO, the adaptive BCO performs better. Diversification is crucial to the performance of the population-based algorithm, but the initial population in the BCO algorithm is generated using a greedy heuristic, which has insufficient diversification. Therefore the ways in which the sequential insertion heuristic (SIH) for the initial population drives the population toward improved solutions are examined. Experimental comparisons indicate that the proposed adaptive BCO-SIH algorithm works well across all instances and is able to obtain 11 best results in comparison with the best-known results in the literature when tested on Solomon's 56 VRPTW 100 customer instances. Also, a statistical test shows that there is a significant difference between the results.

  14. Machine Learning-Based Parameter Tuned Genetic Algorithm for Energy Minimizing Vehicle Routing Problem

    Directory of Open Access Journals (Sweden)

    P. L. N. U. Cooray

    2017-01-01

    Full Text Available During the last decade, tremendous focus has been given to sustainable logistics practices to overcome environmental concerns of business practices. Since transportation is a prominent area of logistics, a new area of literature known as Green Transportation and Green Vehicle Routing has emerged. Vehicle Routing Problem (VRP has been a very active area of the literature with contribution from many researchers over the last three decades. With the computational constraints of solving VRP which is NP-hard, metaheuristics have been applied successfully to solve VRPs in the recent past. This is a threefold study. First, it critically reviews the current literature on EMVRP and the use of metaheuristics as a solution approach. Second, the study implements a genetic algorithm (GA to solve the EMVRP formulation using the benchmark instances listed on the repository of CVRPLib. Finally, the GA developed in Phase 2 was enhanced through machine learning techniques to tune its parameters. The study reveals that, by identifying the underlying characteristics of data, a particular GA can be tuned significantly to outperform any generic GA with competitive computational times. The scrutiny identifies several knowledge gaps where new methodologies can be developed to solve the EMVRPs and develops propositions for future research.

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

    Directory of Open Access Journals (Sweden)

    Ligang Cui

    2013-01-01

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

  16. An Inverse Robust Optimisation Approach for a Class of Vehicle Routing Problems under Uncertainty

    Directory of Open Access Journals (Sweden)

    Liang Sun

    2016-01-01

    Full Text Available There is a trade-off between the total penalty paid to customers (TPC and the total transportation cost (TTC in depot for vehicle routing problems under uncertainty (VRPU. The trade-off refers to the fact that the TTC in depot inevitably increases when the TPC decreases and vice versa. With respect to this issue, the vehicle routing problem (VRP with uncertain customer demand and travel time was studied to optimise the TPC and the TTC in depot. In addition, an inverse robust optimisation approach was proposed to solve this kind of VRPU by combining the ideas of inverse optimisation and robust optimisation so as to improve both the TPC and the TTC in depot. The method aimed to improve the corresponding TTC of the robust optimisation solution under the minimum TPC through minimising the adjustment of benchmark road transportation cost. According to the characteristics of the inverse robust optimisation model, a genetic algorithm (GA and column generation algorithm are combined to solve the problem. Moreover, 39 test problems are solved by using an inverse robust optimisation approach: the results show that both the TPC and TTC obtained by using the inverse robust optimisation approach are less than those calculated using a robust optimisation approach.

  17. Ride Dynamics of a Tracked Vehicle with a Finite Element Vehicle Model

    Directory of Open Access Journals (Sweden)

    S. Jothi

    2016-01-01

    Full Text Available Research on tracked vehicle dynamics is by and large limited to multi-rigid body simulation. For realistic prediction of vehicle dynamics, it is better to model the vehicle as multi-flexible body. In this paper, tracked vehicle is modelled as a mass-spring system with sprung and unsprung masses of the physical tracked vehicle by Finite element method. Using the equivalent vehicle model, dynamic studies are carried out by imparting vertical displacement inputs to the road wheels. Ride characteristics of the vehicle are captured by modelling the road wheel arms as flexible elements using Finite element method. In this work, a typical tracked vehicle test terrain viz., Trapezoidal blocks terrain (APG terrain is considered. Through the simulations, the effect of the road wheel arm flexibility is monitored. Result of the analysis of equivalent vehicle model with flexible road wheel arms, is compared with the equivalent vehicle model with rigid road wheel arms and also with the experimental results of physical tracked vehicle. Though there is no major difference in the vertical bounce response between the flexible model and the rigid model, but there is a visible difference in the roll condition. Result of the flexible vehicle model is also reasonably matches with the experimental result.Defence Science Journal, Vol. 66, No. 1, January 2016, pp. 19-25, DOI: http://dx.doi.org/10.14429/dsj.66.9201

  18. Jerk analysis in rail vehicle dynamics

    Directory of Open Access Journals (Sweden)

    Sunil Kumar Sharma

    2016-09-01

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    1995-09-01

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

  20. Optimum Design of 1st Gear Ratio for 4WD Vehicles Based on Vehicle Dynamic Behaviour

    OpenAIRE

    M. H. Shojaeefard; Talebitooti,R.; Sadegh Yarmohammadi Satri

    2013-01-01

    This paper presents an approach that allows optimizing gear ratio and vehicle dimension to achieve optimum gear transmission. Therefore, augmented Lagrangian multiplier method, defined as classical method, is utilized to find the optimum gear ratios and the corresponding number of gear teeth applied to all epicyclical gears. The new method is able to calculate and also to optimize the gear ratio based on dynamics of 4WD vehicles. Therefore, 4WD vehicles dynamic equations are employed assuming...

  1. A Dynamic Programming Approach to the Daily Routing of Aeromedical Evacuation System Missions

    Science.gov (United States)

    1989-06-08

    this purpose. Routinj Literature The vehicle routing problem (VRP) is a variant of the traveling salesman problem (TSP). The objective of the TSP is...constrained vehicle routing problem (TCVRP) 12:266). Included in their discussion are computational results. Solomon describes several heuristic algorithms for...Their formulation of the single vehicle routing problem with time constraints is as follows: 2n 2n+1 Min Z= Z E Dij xij (1) i=O J=1 n s.t. Z x0 j

  2. Effect of the Longitudinal Contact Location on Vehicle Dynamics Simulation

    NARCIS (Netherlands)

    Burgelman, N.; Li, Z.; Dollevoet, R.

    2016-01-01

    This paper investigates the effect of the calculation of the longitudinal location of a wheel rail contact point on the wheelset’s motion in a vehicle dynamic simulation. All current vehicle dynamic software programs assume that the contact between wheel and rail takes place in the vertical plane th

  3. Column Generation for a Multitrip Vehicle Routing Problem with Time Windows, Driver Work Hours, and Heterogeneous Fleet

    Directory of Open Access Journals (Sweden)

    Michel Povlovitsch Seixas

    2013-01-01

    Full Text Available This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can perform multiple routes per day, all starting and ending at a single depot, and it is assigned to a single driver whose total work hours are limited. A column generation algorithm is proposed. The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performing multiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.

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

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

    Science.gov (United States)

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

    2017-01-17

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

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

    Science.gov (United States)

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

    2017-01-01

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

  7. Effect of the Longitudinal Contact Location on Vehicle Dynamics Simulation

    Directory of Open Access Journals (Sweden)

    N. Burgelman

    2016-01-01

    Full Text Available This paper investigates the effect of the calculation of the longitudinal location of a wheel rail contact point on the wheelset’s motion in a vehicle dynamic simulation. All current vehicle dynamic software programs assume that the contact between wheel and rail takes place in the vertical plane through the wheelset’s rolling axis. However, when the yaw angle of the wheelset is nonzero, the contact point is situated up to 10 mm from that plane. This difference causes a difference in the yaw moment on the wheelset which is used in the vehicle dynamic simulation. To such an end, an existing analytical method to determine the longitudinal method was validated using a numerical approach. Then vehicle dynamic simulations with both the classic and the new contact location were performed, concluding that using a more accurate contact point location results in a smaller wheelset yaw angle in a vehicle dynamic simulation, although the effect is small.

  8. A Computational Study of Genetic Crossover Operators for Multi-Objective Vehicle Routing Problem with Soft Time Windows

    CERN Document Server

    Geiger, Martin Josef

    2008-01-01

    The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with soft time windows. The work is motivated by the question, if and how the problem structure influences the effectiveness of different configurations of the genetic algorithm. Computational results are presented for different classes of vehicle routing problems, varying in their coverage with time windows, time window size, distribution and number of customers. The results are compared with a simple, but effective local search approach for multi-objective combinatorial optimization problems.

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

    Science.gov (United States)

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

    2012-05-01

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

  10. Dynamics of Motorized Vehicle Flow under Mixed Traffic Circumstance*

    Institute of Scientific and Technical Information of China (English)

    GUO nong-Wei; GAO Zi-You; ZHAO Xiao-Mei; XIE Dong-Fan

    2011-01-01

    To study the dynamics of mixed traffic flow consisting of motorized and non-motorized vehicles, a carfollowing model based on the principle of collision free and cautious driving is proposed.Lateral friction and overlapping driving are introduced to describe the interactions between motorized vehicles and non-motorized vehicles.By numerical simulations, the flux-density relation, the temporal-spatial dynamics, and the velocity evolution are investigated in detail.The results indicate non-motorized vehicles have a significant impact on the motorized vehicle flow and cause the maximum flux to decline by about 13%.Non-motorized vehicles can decrease the motorized vehicle velocity and cause velocity oscillation when the motorized vehicle density is low.Moreover, non-motorized vehicles show a significant damping effect on the oscillating velocity when the density is medium and high, and such an effect weakens as motorized vehicle densityincreases.The results also stress the necessity for separating motorized vehicles from non-motorized vehicles.

  11. Model Vehicle Routing Problem dengan Karakteristik Rute Majemuk, Multiple Time Windows, Multiple Products dan Heterogeneous Fleet untuk Depot Tunggal

    Directory of Open Access Journals (Sweden)

    Ary Arvianto

    2014-01-01

    Full Text Available In this paper we developed a VRP model for multiple routes, multiple time windows for multiple products and heterogeneous vehicles. The solution were constructed using a heuristic approach, i.e, a sequential insertion algorithm. Additionally, this model is applied to solve fuel distributions for eight customers in East Nusa Tenggara. It needs two tankers with capacity of 4700 kilo liters, so that those distributions can be accomplished with a minimum number of vehicles, total completion time, and range of completion time. The result of this study shows that for a heterogeneous vehicles problem, a vehicle with the largest capacity may not necessarily be the vehicle that provides an optimal solution. Moreover, advance trials should be conducted by providing a limited number of tankers for each tanker capacity, so the description of heterogeneous vehicles becomes more visible. In the future research, the solution will be improved by utilizing relocation techniques.

  12. Developing a chaotic pattern of dynamic Hazmat routing problem

    Directory of Open Access Journals (Sweden)

    Abbas Mahmoudabadi

    2014-03-01

    Full Text Available The present paper proposes an iterative procedure based on chaos theory on dynamic risk definition to determine the best route for transporting hazardous materials (Hazmat. In the case of possible natural disasters, the safety of roads may be seriously affected. So the main objective of this paper is to simultaneously improve the travel time and risk to satisfy the local and national authorities in the transportation network. Based on the proposed procedure, four important risk components including accident information, population, environment, and infrastructure aspects have been presented under linguistic variables. Furthermore, the extent analysis method was utilized to convert them to crisp values. To apply the proposed procedure, a road network that consists of fifty nine nodes and eighty two-way edges with a pre-specified affected area has been considered. The results indicate that applying the dynamic risk is more appropriate than having a constant risk. The application of the proposed model indicates that, while chaotic variables depend on the initial conditions, the most frequent path will remain independent. The points that would help authorities to come to the better decision when they are dealing with Hazmat transportation route selection.

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

    Directory of Open Access Journals (Sweden)

    Liu Chaoran

    2017-01-01

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

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

    solution methods to the DM-TDVRPTW are based on (meta-)heuristics. The decomposition of an arc-based formulation leads to a setpartitioning problem as the master problem, and a time-dependent shortest path problem with resource constraints as the pricing problem. The master problem is solved by 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 instances......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...

  15. Approximability of the d-dimensional Euclidean capacitated vehicle routing problem

    Science.gov (United States)

    Khachay, Michael; Dubinin, Roman

    2016-10-01

    Capacitated Vehicle Routing Problem (CVRP) is the well known intractable combinatorial optimization problem, which remains NP-hard even in the Euclidean plane. Since the introduction of this problem in the middle of the 20th century, many researchers were involved into the study of its approximability. Most of the results obtained in this field are based on the well known Iterated Tour Partition heuristic proposed by M. Haimovich and A. Rinnoy Kan in their celebrated paper, where they construct the first Polynomial Time Approximation Scheme (PTAS) for the single depot CVRP in ℝ2. For decades, this result was extended by many authors to numerous useful modifications of the problem taking into account multiple depots, pick up and delivery options, time window restrictions, etc. But, to the best of our knowledge, almost none of these results go beyond the Euclidean plane. In this paper, we try to bridge this gap and propose a EPTAS for the Euclidean CVRP for any fixed dimension.

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

    DEFF Research Database (Denmark)

    Kallehauge, Brian

    2008-01-01

    In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for the VRPTW are in many aspects inherited from work on the traveling salesman problem (TSP). In recognition of this fact...... this paper is structured relative to four seminal papers concerning the formulation and exact solution of the TSP, i.e. the arc formulation, the arc-node formulation, the spanning tree formulation, and the path formulation. We give a detailed analysis of the formulations of the VRPTW and a review...... with the analysis of the polyhedral structure of the VRPTW. We conclude by examining possible future lines of research in the area of the VRPTW....

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

  18. Multi-trip vehicle routing and scheduling problem with time window in real life

    Science.gov (United States)

    Sze, San-Nah; Chiew, Kang-Leng; Sze, Jeeu-Fong

    2012-09-01

    This paper studies a manpower scheduling problem with multiple maintenance operations and vehicle routing considerations. Service teams located at a common service centre are required to travel to different customer sites. All customers must be served within given time window, which are known in advance. The scheduling process must take into consideration complex constraints such as a meal break during the team's shift, multiple travelling trips, synchronisation of service teams and working shifts. The main objective of this study is to develop a heuristic that can generate high quality solution in short time for large problem instances. A Two-stage Scheduling Heuristic is developed for different variants of the problem. Empirical results show that the proposed solution performs effectively and efficiently. In addition, our proposed approximation algorithm is very flexible and can be easily adapted to different scheduling environments and operational requirements.

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

    Science.gov (United States)

    Koloch, Grzegorz; Kaminski, Bogumil

    2010-10-01

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

  20. A sequential insertion heuristic for the initial solution to a constrained vehicle routing problem

    Directory of Open Access Journals (Sweden)

    JW Joubert

    2006-06-01

    Full Text Available The Vehicle Routing Problem (VRP is a well-researched problem in the Operations Research literature. It is the view of the authors of this paper that the various VRP variants have been researched in isolation. This paper embodies an attempt to integrate three specific variants of the VRP, namely the VRP with multiple time windows, the VRP with a heterogeneous fleet, and the VRP with double scheduling, into an initial solution algorithm. The proposed initial solution algorithm proves feasible for the integration, while the newly introduced concept of time window compatibility decreases the computational burden when using benchmark data sets from literature as a basis for efficiency testing. The algorithm also improves the quality of the initial solution for a number of problem classes.

  1. A Library of Local Search Heuristics for the Vehicle Routing Problem

    Energy Technology Data Exchange (ETDEWEB)

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2010-01-01

    The vehicle routing problem (VRP) is a difficult and well-studied combinatorial optimization problem. Real-world instances of the VRP can contain hundreds and even thousands of customer locations and can involve many complicating constraints, necessitating the use of heuristic methods. We present a software library of local search heuristics that allow one to quickly generate good solutions to VRP instances. The code has a logical, object-oriented design and uses efficient data structures to store and modify solutions. The core of the library is the implementation of seven local search operators that share a similar interface and are designed to be extended to handle additional options with minimal code change. The code is well-documented, is straightforward to compile, and is freely available for download at http://sites.google.com/site/vrphlibrary/ . The distribution of the code contains several applications that can be used to generate solutions to instances of the capacitated VRP.

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

    Directory of Open Access Journals (Sweden)

    Marc Reimann

    2014-05-01

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

  3. Research and Simulation of the Electrical Vehicle Based Dynamical System

    Directory of Open Access Journals (Sweden)

    Ko-Chun Chen

    2015-01-01

    Full Text Available This study developed a dynamic model of electric vehicle system by using the MATLAB/Simulink tool. The vehicle model comprises two system components: an electrical system and a suspension system. This study also designed various road conditions for simulating the motion of vehicle traveling along a road. The results show that the electrical and suspension system parameters can be adjusted immediately to enhance passenger comfort. The findings of this research have practical teaching applications. Students can modify the vehicle model parameters byes using the MATLAB graphical user interface, allowing them to observe the motion of vehicle under various road conditions.

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

    Energy Technology Data Exchange (ETDEWEB)

    Cai, Y.; Chen, S.S.

    1995-11-01

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

  5. A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem

    Science.gov (United States)

    Chen, Xianshun; Feng, Liang; Ong, Yew Soon

    2012-07-01

    In this article, we proposed a self-adaptive memeplex robust search (SAMRS) for finding robust and reliable solutions that are less sensitive to stochastic behaviours of customer demands and have low probability of route failures, respectively, in vehicle routing problem with stochastic demands (VRPSD). In particular, the contribution of this article is three-fold. First, the proposed SAMRS employs the robust solution search scheme (RS 3) as an approximation of the computationally intensive Monte Carlo simulation, thus reducing the computation cost of fitness evaluation in VRPSD, while directing the search towards robust and reliable solutions. Furthermore, a self-adaptive individual learning based on the conceptual modelling of memeplex is introduced in the SAMRS. Finally, SAMRS incorporates a gene-meme co-evolution model with genetic and memetic representation to effectively manage the search for solutions in VRPSD. Extensive experimental results are then presented for benchmark problems to demonstrate that the proposed SAMRS serves as an efficable means of generating high-quality robust and reliable solutions in VRPSD.

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

  7. QDSR: QoS-aware Dynamic Source Routing Protocol for Mobile Ad Hoc Network

    Institute of Scientific and Technical Information of China (English)

    SHIMinghong; YAOYinxiong; BAIYingcai

    2004-01-01

    QoS routing in wireless ad hoc networks faces many technical challenges due to time varying link and random mobility of nodes in these dynamic networks.In this paper, we design a QoS-aware dynamic source routing protocol (QDSR), based on DSR . QDSR uses minimum cost as the constraint, modifies route discovery, route reply and route maintenance mechanisms in DSR, adds the capability of path testing and initial resource reservation.The results of robustness and stability and performances imulations demonstrate that it suits the fluctuation of dynamic environment very well.

  8. Scoped Bellman-Ford Geographic Routing for Large Dynamic Wireless Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Xue Zhang; Jue Hong; Sang-Lu Lu; Li Xie; Jian-Nong Cao

    2008-01-01

    Routing is a fundamental problem in wireless sensor networks. Most previous routing protocols are challenged when used in large dynamic networks as they suffer from either poor scalability or the void problem. In this paper, we propose a new geographic routing protocol, SBFR (Scoped Bellman-Ford Routing), for large dynamic wireless sensor networks. The basic idea is that each node keeps a view scope of the network by computing distance vectors using the distributed BellmanFord method, and maintains a cost for routing to the sink. When forwarding a packet, a node picks the node with minimum cost in its routing table as a temporary landmark. While achieving good scalability, it also solves the void problem in an efficient manner through the combination of Bellman-Ford routing and cost-based geographic routing. Analytical and simulation results show that SBFR outperforms other routing protocols not only because of its robustness and scaiability but also its practicality and simplicity.

  9. A time-slotted on-demand routing protocol for mobile ad hoc unmanned vehicle systems

    Science.gov (United States)

    Forsmann, J. Hope; Hiromoto, Robert E.; Svoboda, John

    2007-04-01

    Successful deployment of Unmanned Vehicle Systems (UVS) in military operations has increased their popularity and utility. The ability to sustain reliable mobile ad hoc formations dramatically enhances the usefulness and performance of UVS. Formation movement increases the amount of ground coverage in less time, decreases fuel consumption of the individual nodes, and provides an avenue for mission expansion through cooperative maneuvers such as refueling. In this paper, we study the wireless communication demands that arise from formation and maintenance of UVS within the context of a mobile ad hoc network (MANET). A MANET in formation is typically characterized by tradeoffs between network congestion and the ability to maintain useable communication bandwidth. Maintenance of UVS formations requires each node in the network to be peer-aware, which places a heavy demand on inner node communication. In order to mitigate the inner node network congestion, we introduce a time-slotted communication protocol. The protocol assigns time-slots and allows the designated nodes to communicate directly with other peer-nodes. This approach has been introduced within the context of the Time-Slotted Aloha protocol for station-to-station communication. The approach taken here is to embed the time-slotted reservation protocol into a standard on-demand routing protocol to also address the need to reactively and proactively respond to formation maintenance. The time-slotted on-demand routing protocol is shown to eliminate collisions due to route determination and, therefore, enhance quality of service as well as ensure necessary support for formation movement. A worst-case scenario is described and simulations performed to comparatively demonstrate the advantages of the new protocol.

  10. Extensions to the Dynamic Aerospace Vehicle Exchange Markup Language

    Science.gov (United States)

    Brian, Geoffrey J.; Jackson, E. Bruce

    2011-01-01

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

  11. An Optimization Model for the Vehicle Routing Problem in Multi-product Frozen Food Delivery

    Directory of Open Access Journals (Sweden)

    Y. Zhang

    2014-04-01

    Full Text Available This paper addresses a vehicle scheduling problem encountered in the cold chain logistics of the frozen food delivery industry. Unlike the single product delivery scenario, we propose an optimization model that manages the delivery of a variety of products. In this scenario, a set of customers make requests for a variety of frozen foods which are being loaded together. The objective is to find the routes that represent the minimum delivery cost for a fleet of identical vehicles that, departing from a depot, visiting all customers only once and returning to the depot. The delivery cost includes the transportation cost, the cost of refrigeration, the penalty cost and cargo damage cost based on the characteristics of different frozen food products. Apart from the usual constraints of time windows and loading weight, the study also takes into account the constraints of loading volume related to the unit volume of different frozen foods. We then propose a Genetic Algorithm (GA method for the model. Computational tests with real data from a case validate the feasibility and rationality of the model and show the efficient combinations of parameter values of the GA method.

  12. A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking

    Directory of Open Access Journals (Sweden)

    Sanae Larioui

    2015-11-01

    Full Text Available In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respecting time window constraints of suppliers and customers and a time horizon for the whole transportation operation. Rummaging through all the work of literature on vehicle routing problems with cross-docking, there is no work that considers that customer will receive its requests from several suppliers; this will be the point of innovation of this work. A heuristic and a memetic algorithm are used to solve the problem. The proposed algorithms are implemented and tested on data sets involving up to 200 nodes (customers and suppliers. The first results show that the memetic algorithm can produce high quality solutions.

  13. Tabu search heuristic for the vehicle routing problem with stochastic demands and customers -- rev. revised edition. Publication No. 987

    Energy Technology Data Exchange (ETDEWEB)

    Gendreau, M.; Seguin, R.; Laporte, G.

    1995-10-01

    This paper considers a version of the stochastic vehicle routing problem where customers are present with some probability and have random demands. A tabu search heuristic is developed for this problem. Comparisons with known optimal solutions indicate that the heuristic solves the problem to optimality in the vast majority of cases and deviations from optimality are almost always small.

  14. Simultaneous Vehicle and Crew Routing and Scheduling for Partial- and Full-Load Long-Distance Road Transport

    Directory of Open Access Journals (Sweden)

    Michael Drexl

    2013-11-01

    Full Text Available This paper studies a simultaneous vehicle and crew routing and scheduling problem arising in long-distance road transport in Europe: Pickup-and-delivery requests have to be fulfilled over a multi-period planning horizon by a heterogeneous fleet of trucks and drivers. Typically, in the vehicle routing literature, a fixed assignment of a driver to a truck is assumed. In our approach, we abandon this assumption and allow truck/driver changes at geographically dispersed relay stations. This offers greater planning flexibility and allows a better utilization of trucks, but also creates intricate interdependencies between trucks and drivers and requires the synchronization of their routes. A solution heuristic based on a two-stage decomposition of the problem is developed, taking into account European Union social legislation for drivers, and computational experiments using real-world data provided by a major German forwarder are presented and analyzed. The obtained results suggest that for the vehicle and driver cost structure prevalent in Western Europe and for transport requests that are not systematically acquired to complement one another, no cost savings are possible through simultaneous vehicle and crew routing and scheduling, although no formal proof of this fact is possible.

  15. Dynamic Control and Formal Models of Multi-Agent Interactions and Behaviors

    Science.gov (United States)

    2005-05-01

    accommodate adaptation to incomplete and unknown knowledge. 3.1 Starvation and Waiting Times for a Distributed and Dynamic Vehicle Routing Problem 3.1.1...particular type of stochastic and dynamic vehicle routing problem (see [20] for a recent survey on deterministic vehicle routing problems as well as...locations, future decisions of vehicles, and previously serviced demands by vehicles. MAV-DTRP is a particular type of Dynamic Vehicle Routing Problem (DVRP

  16. Analysis of vehicle dynamics under sadden cross wind

    Science.gov (United States)

    Walczak, S.

    2016-09-01

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

  17. The Secure Dynamic Source Routing Protocol in MANET using MD5 Hash Function

    Directory of Open Access Journals (Sweden)

    Radha S. Savankar

    2012-06-01

    Full Text Available Dynamic Source Routing (DSR is a routing protocol designed specifically for use in mobile ad hoc networks. The protocol allows nodes to dynamically discover a source route across multiple network hops to any destination in the ad hoc network. The protocol is composed of the two mechanisms of Route Discovery and Route Maintenance, which work together to allow nodes to discover and maintain source routes to arbitrary destinations in the ad hoc network. When using source routing, each packet to be routed carries in its header the complete, ordered list of nodes through which the packet must pass. A key advantage of source routing is that intermediate hops do not need to maintain routing information in order to route the packets they receive, since the packets themselves already contain all of the necessary routing information. This, coupled with the dynamic, on-demand nature of Route Discovery, completely eliminates the need for periodic router advertisements and link status packets, reducing the overhead of DSR, especially during periods when the network topology is stable and these packets serve only as keep-alives

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

    Directory of Open Access Journals (Sweden)

    Osman ELDOĞAN

    1995-01-01

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

  19. Genetic and artificial bee colony algorithms for scheduling of multi-skilled manpower in combined manpower-vehicle routing problem

    Directory of Open Access Journals (Sweden)

    Hany Seidgar

    2016-01-01

    Full Text Available This paper investigates a scheduling combined manpower-vehicle routing problem with a central depot in and a set of multi-skilled manpower for serving to customers. Teams are in different range of competencies that it will affect the service time duration. Vehicles are in different moving speeds and costs and not all the vehicles are capable to move toward all the customers’ sites. The objective is to minimize the total cost of servicing, routing, and lateness penalties. This paper presents a mixed integer programming model and two meta-heuristic approaches of genetic algorithm (GA and artificial bee colony algorithm (ABC are developed to solve the generated problems. Furthermore, Taguchi experimental design method is applied to set the proper values of parameters. The available results show the higher performance of proposed GA compared with ABC, in quality of solutions.

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

    Directory of Open Access Journals (Sweden)

    Zelenka J.

    2007-11-01

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

  1. Optimum Design of 1st Gear Ratio for 4WD Vehicles Based on Vehicle Dynamic Behaviour

    Directory of Open Access Journals (Sweden)

    M. H. Shojaeefard

    2013-01-01

    Full Text Available This paper presents an approach that allows optimizing gear ratio and vehicle dimension to achieve optimum gear transmission. Therefore, augmented Lagrangian multiplier method, defined as classical method, is utilized to find the optimum gear ratios and the corresponding number of gear teeth applied to all epicyclical gears. The new method is able to calculate and also to optimize the gear ratio based on dynamics of 4WD vehicles. Therefore, 4WD vehicles dynamic equations are employed assuming that the rear wheels or the front wheels are at the point of slip. In addition, a genetic algorithm is modified to preserve feasibility of the encountered solutions. The basic dimension of a sample commercial vehicle (2009 hummer H3 4dr AWD SUV and its gearbox are optimized, and then the effects of changing slip angle, wheel base, and engine torque on optimum vehicle dimension are analyzed.

  2. Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

    Science.gov (United States)

    Archer, Charles Jens; Musselman, Roy Glenn; Peters, Amanda; Pinnow, Kurt Walter; Swartz, Brent Allen; Wallenfelt, Brian Paul

    2010-03-16

    A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

  3. Trusted Routing Based on Dynamic Trust Mechanism in Mobile Ad-Hoc Networks

    Science.gov (United States)

    Peng, Sancheng; Jia, Weijia; Wang, Guojun; Wu, Jie; Guo, Minyi

    Due to the distributed nature, mobile ad-hoc networks (MANETs) are vulnerable to various attacks, resulting in distrusted communications. To achieve trusted communications, it is important to build trusted routes in routing algorithms in a self-organizing and decentralized fashion. This paper proposes a trusted routing to locate and to preserve trusted routes in MANETs. Instead of using a hard security mechanism, we employ a new dynamic trust mechanism based on multiple constraints and collaborative filtering. The dynamic trust mechanism can effectively evaluate the trust and obtain the precise trust value among nodes, and can also be integrated into existing routing protocols for MANETs, such as ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). As an example, we present a trusted routing protocol, based on dynamic trust mechanism, by extending DSR, in which a node makes a routing decision based on the trust values on its neighboring nodes, and finally, establish a trusted route through the trust values of the nodes along the route in MANETs. The effectiveness of our approach is validated through extensive simulations.

  4. Dynamic Performance of Subway Vehicle with Linear Induction Motor System

    Science.gov (United States)

    Wu, Pingbo; Luo, Ren; Hu, Yan; Zeng, Jing

    The light rail vehicle with Linear Induction Motor (LIM) bogie, which is a new type of urban rail traffic tool, has the advantages of low costs, wide applicability, low noise, simple maintenance and better dynamic behavior. This kind of vehicle, supported and guided by the wheel and rail, is not driven by the wheel/rail adhesion force, but driven by the electromagnetic force between LIM and reaction plate. In this paper, three different types of suspensions and their characteristic are discussed with considering the interactions both between wheel and rail and between LIM and reaction plate. A nonlinear mathematical model of the vehicle with LIM bogie is set up by using the software SIMPACK, and the electromechanical model is also set up on Simulink roof. Then the running behavior of the LIM vehicle is simulated, and the influence of suspension on the vehicle dynamic performance is investigated.

  5. Observable dynamics and coordinate systems for vehicle tracking

    CERN Document Server

    Altendorfer, Richard

    2010-01-01

    We investigate several coordinate systems and dynamical vector fields for target tracking to be used in driver assistance systems. We show how to express the discrete dynamics of maneuvering target vehicles in arbitrary coordinates starting from the target's and the own (ego) vehicle's assumed dynamical model in global coordinates. We clarify the notion of "ego compensation" and show how non-inertial effects are to be included when using a body-fixed coordinate system for target tracking. We finally compare the tracking error of different combinations of target tracking coordinates and dynamical vector fields for simulated data.

  6. Dynamic Data Driven Methods for Self-aware Aerospace Vehicles

    Science.gov (United States)

    2015-04-08

    AFRL-OSR-VA-TR-2015-0127 Dynamic Data Driven Methods for Self-aware Aerospace Vehicles Karen Willcox MASSACHUSETTS INSTITUTE OF TECHNOLOGY Final...Methods for Self-aware Aerospace Vehicles 5a. CONTRACT NUMBER 5b. GRANT NUMBER FA9550-11-1-0339 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Karen E...Back (Rev. 8/98) Dynamic Data Driven Methods for Self-aware Aerospace Vehicles Grant # FA9550-11-1-0339 Final Report Participating Institutions

  7. Power and Mobility-Aware Adaptive Dynamic Source Routing in Mobile Ad Hoc Network

    Institute of Scientific and Technical Information of China (English)

    XULi; ZHENGBaoyu; YANGZhen

    2005-01-01

    MANET (Mobile ad hoc network) is characterized by a highly dynamic network topology. This makes routing discovery and maintenance challenging for routing protocol design. On the other hand, energy efficient routing may be another important design criterion for MANET since most of nodes are usually powered by battery with limited capacity. With optimization of DSR (Dynamic source routing) protocol, this paper proposes Power and mobility-aware adaptive dynamic source routing (PMADSR). The new routing protocol can be aware of the mobility and remaining battery capacity of nodes. Performance simulation results show that the proposed PMADSR protocol can dynamically balance the traffic load inside the whole network, so as to prolong the network lifetime, as well as achieve higher throughput.

  8. Multi-Objective Forest Vehicle Routing Using Savings-Insertion and Reactive Tabu with a Variable Threshold

    Directory of Open Access Journals (Sweden)

    Moussa Bagayoko

    2016-12-01

    Full Text Available This paper focuses on how the competitiveness of forestry companies in Canada is impacted by forest products distribution and transportation costs, especially in the context of exports. We propose a new two steps approach, consisting in building a good initial solution and then improving it to solve multi-objective forest vehicle routing problem. The main objective of this paper is to solve a multi-objective forest vehicle routing problem using the Savings-insertion, followed by the Reactive tabu, with a variable threshold. To that end, first, a mathematical model is established; secondly, our new Savings-insertion builds a good initial solution, and thirdly, our new Reactive tabu with a variable threshold improves the initial solution. The three main objectives are the minimization of number of routes, the minimization of total distance and the minimization of total time by respecting the specified time window and the demand of all customers, which are sometimes important in this field. Finally, the experimental results obtained with our methodology for the named vehicle routing problem are provided and discussed.

  9. Dynamic multicast routing scheme in WDM optical network

    Science.gov (United States)

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

    2007-11-01

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

  10. Vehicle Dynamics due to Magnetic Launch Propulsion

    Science.gov (United States)

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

    2000-01-01

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

  11. Vehicle Route Replanning for Fruit and Vegetable Delivery%果蔬运输车辆路径再规划

    Institute of Scientific and Technical Information of China (English)

    黄华芳; 王以忠; 李达; 门建婷; 张平; 黄国全

    2012-01-01

    果蔬具有易腐性,在销售、消费时存在很强的时效性,这就要求合理规划果蔬运输车辆的配送路径.在果蔬配送途中,当某运输车遇到特殊情况无法按时送达配送点时,应当对其他运输车进行路径再规划.给出了带时间窗的果蔬运输车辆路径再规划的数学模型,并采用改进蚁群算法进行了求解.仿真试验结果表明,模型及算法可以有效地优化果蔬配送新路线,为降低果蔬腐烂损失、提高销售收入、有效控制运作成本提供了理论支持.%Since fruit and vegetable are highly perishable, and have strong timeliness in selling and consuming, the delivery routes of transport vehicles must be planned reasonably. On the path of fruit and vegetable delivery, a transport vehicle may encounter some unusual circumstances and may not arrive at the next distribution site in time. In this case, the vehicle routes of other transport vehicles should be replanned. A mathematical model for vehicle route replanning with time windows for fruit and vegetable delivery was established, and an improved ant colony algorithm was used to resolve the model. Simulation experiment results showed that the new dispatching routing of fruit and vegetable could be optimized efficiently by using the proposed model and adopted algorithm. This research could provide theoretical support for enterprises which hoped to decrease rot loss of fruit and vegetable, increase sales income and control operating cost effectively.

  12. On line routing per mobile phone

    DEFF Research Database (Denmark)

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

    2009-01-01

    On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology. Addition...

  13. Polynomial Size Formulations for the Distance and Capacity Constrained Vehicle Routing Problem

    Science.gov (United States)

    Kara, Imdat; Derya, Tusan

    2011-09-01

    The Distance and Capacity Constrained Vehicle Routing Problem (DCVRP) is an extension of the well known Traveling Salesman Problem (TSP). DCVRP arises in distribution and logistics problems. It would be beneficial to construct new formulations, which is the main motivation and contribution of this paper. We focused on two indexed integer programming formulations for DCVRP. One node based and one arc (flow) based formulation for DCVRP are presented. Both formulations have O(n2) binary variables and O(n2) constraints, i.e., the number of the decision variables and constraints grows with a polynomial function of the nodes of the underlying graph. It is shown that proposed arc based formulation produces better lower bound than the existing one (this refers to the Water's formulation in the paper). Finally, various problems from literature are solved with the node based and arc based formulations by using CPLEX 8.0. Preliminary computational analysis shows that, arc based formulation outperforms the node based formulation in terms of linear programming relaxation.

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

    Directory of Open Access Journals (Sweden)

    Wanfeng Liu

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Jingling Zhang

    2012-01-01

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

  16. APLIKASI PARALEL BRANCH AND BOUND UNTUK MENYELESAIKAN VEHICLE ROUTING PROBLEM MENGGUNAKAN PUSTAKA MPICH DAN GLPK

    Directory of Open Access Journals (Sweden)

    F.X. Arunanto

    2011-01-01

    Full Text Available Vehicle Routing Problem (VRP merupakan permasalahan optimasi dalam Riset Operasional, yaitu permasalahan melakukan pengantaran barang (komoditas dari sebuah depot ke sejumlah pelanggan dengan lokasi dan jumlah permintaan barang yang diketahui. Karakteristik VRP yang diimplementasikan adalah VRP yang mempunyai kapasitas kendaraan sama, jumlah kendaraan tetap, batasan jarak dan meminimalkan jarak tempuh semua kendaraan sebagai tujuan. Untuk penyelesaian VRP, diimplementasikan algoritma paralel branch and bound yang dapat dijalankan oleh beberapa komputer untuk mendapatkan solusi eksak dengan waktu komputasi yang lebih cepat. Langkah-langkah penyelesaian VRP dengan algoritma paralel branch and bound dimulai dengan tahap inisialisasi, yang menghasilkan subproblem yang berupa program linear pada search tree, kemudian dilakukan pembagian subproblem ke sejumlah komputer untuk dikerjakan masing-masing komputer. Setelah proses komputasi selesai, diperoleh solusi optimal beserta informasi rute terbaik yang ditemukan. Uji coba dan evaluasi dilakukan dengan data yang dihasilkan secara acak, untuk jumlah pelanggan sebanyak 15-40, dengan menggunakan 1, 2, 4, dan 8 komputer. Dari hasil pengukuran waktu komputasi, didapat bahwa penambahan jumlah komputer pada proses komputasi dapat mempercepat waktu komputasi, bahkan dapat mencapai superlinear speedup terutama untuk jumlah pelanggan yang besar, akan tetapi pada suatu saat penambahan jumlah komputer malah memperlambat waktu komputasi, karena overhead waktu komunikasi yang semakin besar.

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

    Directory of Open Access Journals (Sweden)

    Alberto Ochoa-Ortíz

    2015-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Weizhen Rao

    2016-01-01

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

  19. A New Dynamic Route Discovery Mechanism for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Humaira Nishat

    2012-11-01

    Full Text Available Nodes in a mobile ad hoc network have limited battery power for their operation. Energy efficient routing protocol such as Min-Max Battery Cost Routing (MMBCR selects a path with nodes having maximum battery capacity for transmission of data packets from source to destination. Though MMBCR considers individual node battery power during route discovery process, the route selected does not change unless any node in that route is exhausted completely resulting in link failure. This paper proposes a new dynamic route discovery mechanism which adapts a new route periodically resulting in decreasing the probability of link failure and increasing the lifetime of the network. The proposed routing protocol is named Dynamic Route Discovery (DRD protocol. In this DRD protocol, the energy and cost function of each node is computed periodically by initializing route discovery process at regular intervals. Simulation results show that the proposed algorithm not only increases the lifetime of the network but also gives better throughput, packet delivery ratio and delay performance at the cost of increased routing overhead and normalized routing load compared to the existing MMBCR protocol.

  20. An improved global dynamic routing strategy for scale-free network with tunable clustering

    Science.gov (United States)

    Sun, Lina; Huang, Ning; Zhang, Yue; Bai, Yannan

    2016-08-01

    An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

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

    Directory of Open Access Journals (Sweden)

    Behrouz Afshar-Nadjafi

    2017-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Xiaobing Gan

    2012-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Rong-xia Xia

    2016-01-01

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

  4. Integrated and Dynamic Vehicle and Crew Scheduling

    NARCIS (Netherlands)

    D. Huisman (Dennis)

    2004-01-01

    textabstractDue to increased competition in the public transport market and the pressure on governments to cut expenses, increasing attention has been paid to cost reductions in public transportation. Since the main resources used in public transportation are vehicles and crews, producing efficient

  5. On the problems of non-smooth railway vehicle dynamics

    DEFF Research Database (Denmark)

    Thomsen, Per Grove; True, Hans

    2005-01-01

    Railway vehicle dynamics is inherently a problem of nonlinear dynamics. The unavoidable nonlinearities stem from the rail/wheel contact geometry and the stress/strain velocity relation in the rail/wheel contact surface. In addition motion delimiters and dry friction contact between elements...

  6. Application of Improved Genetic Algorithm in Vehicle Routing Problem%改进遗传算法在车辆路径问题中的应用

    Institute of Scientific and Technical Information of China (English)

    张华庆; 张喜

    2012-01-01

    The mathematical model of Vehicle Routing Problem is developed in this paper. To improve the search rate of genetic algorithm and avoid the premature phenomenon of population, an improved genetic algorithm, in which the fitness function is defined with dynamic linear method and its cross-operator is improved to adopt a large variation of operation for Vehicle Routing Problem, is designed, and the detailed computation steps of the genetic algorithm are given. Finally, the genetic algorithm is applied to a numerical example. The results indicate that the genetic algorithm is better than the genetic algorithm designed in the existing reference literature over the computational performance. Furthermore, the improved strategies of the genetic algorithm are not only simple but also effective in solving the Vehicle Routing Problem.%建立了车辆路径问题的数学模型.为了提高遗传算法的搜索速率,避免种群出现“早熟”现象,对适应度函数采用动态线性标定方式,改进交叉算子,采用大变异操作,设计出了求解车辆路径问题的改进遗传算法并给出了具体的计算步骤.应用该遗传算法进行了实例计算,取得了比较满意的结果.计算结果表明,该遗传算法在计算性能上优于参考文献中设计的遗传算法.同时也表明,对遗传算法的改进策略不仅简单而且对求解VRP问题是有效的.

  7. Flight Dynamics and Control of Elastic Hypersonic Vehicles Uncertainty Modeling

    Science.gov (United States)

    Chavez, Frank R.; Schmidt, David K.

    1994-01-01

    It has been shown previously that hypersonic air-breathing aircraft exhibit strong aeroelastic/aeropropulsive dynamic interactions. To investigate these, especially from the perspective of the vehicle dynamics and control, analytical expressions for key stability derivatives were derived, and an analysis of the dynamics was performed. In this paper, the important issue of model uncertainty, and the appropriate forms for representing this uncertainty, is addressed. It is shown that the methods suggested in the literature for analyzing the robustness of multivariable feedback systems, which as a prerequisite to their application assume particular forms of model uncertainty, can be difficult to apply on real atmospheric flight vehicles. Also, the extent to which available methods are conservative is demonstrated for this class of vehicle dynamics.

  8. Trust-Based Route Selection in Dynamic Source Routin

    DEFF Research Database (Denmark)

    Jensen, Christian D.; Connell, Paul O

    2006-01-01

    Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Nodes rely on each other to route packets to other mobile nodes or toward stationary nodes that may act as a gateway to a fixed network. Mobile nodes are generally assumed to participate as routers......, which selects the route based on a local evaluation of the trustworthiness of all known intermediary nodes (routers) on the route to the destination. We have implemented this mechanism in an existing ad hoc routing protocol, and we show how trust can be built from previous experience and how trust can...

  9. Trust-Based Route Selection in Dynamic Source Routin

    DEFF Research Database (Denmark)

    Jensen, Christian D.; Connell, Paul O

    2006-01-01

    Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Nodes rely on each other to route packets to other mobile nodes or toward stationary nodes that may act as a gateway to a fixed network. Mobile nodes are generally assumed to participate as routers......, which selects the route based on a local evaluation of the trustworthiness of all known intermediary nodes (routers) on the route to the destination. We have implemented this mechanism in an existing ad hoc routing protocol, and we show how trust can be built from previous experience and how trust can...

  10. A Study of Maglev Vehicle Dynamics Using a Reduced-Scale Vehicle Model Experiment Apparatus

    Science.gov (United States)

    Suzuki, Erimitsu; Watanabe, Ken; Hoshino, Hironori; Yonezu, Takenori; Nagai, Masao

    An experiment apparatus using a 1/12 scale model of a train car body was constructed to study the characteristics of vehicle dynamics of magnetically levitated high speed surface transport (Maglev) systems that differ from conventional railway systems. Consisting of six-axis parallel link motion bases to reproduce bogie motions, an aluminum car body, and secondary suspension units, this apparatus is expected to be useful in examinations of control methods to reduce vehicle vibrations and to generate data useful in eventually improving the precision of computer simulations. This report provides an overview of the Maglev vehicle model experiment apparatus and results of initial tests examining its fundamental characteristics.

  11. A cloud theory-based particle swarm optimization for multiple decision maker vehicle routing problems with fuzzy random time windows

    Science.gov (United States)

    Ma, Yanfang; Xu, Jiuping

    2015-06-01

    This article puts forward a cloud theory-based particle swarm optimization (CTPSO) algorithm for solving a variant of the vehicle routing problem, namely a multiple decision maker vehicle routing problem with fuzzy random time windows (MDVRPFRTW). A new mathematical model is developed for the proposed problem in which fuzzy random theory is used to describe the time windows and bi-level programming is applied to describe the relationship between the multiple decision makers. To solve the problem, a cloud theory-based particle swarm optimization (CTPSO) is proposed. More specifically, this approach makes improvements in initialization, inertia weight and particle updates to overcome the shortcomings of the basic particle swarm optimization (PSO). Parameter tests and results analysis are presented to highlight the performance of the optimization method, and comparison of the algorithm with the basic PSO and the genetic algorithm demonstrates its efficiency.

  12. Performance Evaluation of Ad Hoc Routing Protocols in a Swarm of Autonomous Unmanned Aerial Vehicles

    Science.gov (United States)

    2007-03-01

    demand Distance Vector Routing ( AODV ) Like DSDV, the AODV protocol uses sequence numbers to prevent routing loops. Originally presented by Perkins...DSR, though as with most demand-driven routing protocols , path discovery causes some latency at the start of each data session. Unlike DSR, AODV ...research in mobile, ad hoc routing protocols . Broch, et al. performed a simulation comparison of the DSDV, DSR, AODV and Temporally-Ordered

  13. NOC: QOS Metrics Modelling And Analysis Based On Dynamic Routing

    Directory of Open Access Journals (Sweden)

    Abdelkader SAADAOUI

    2012-04-01

    Full Text Available Increasing heterogeneous software and hardware blocks constitute complex ICs known as System on Chip (SoC. These blocks are conceived as intellectual property (IP cores. Designers are developing SoCs by using IP cores reuse, which include interconnection architecture and interface to peripheral devices.Because of the SoC growing complexity, some researchers tend to concentrate more on the communication rather than the computation aspect. This area of research has leading to the Network on Chip (NoC Concepts.The research domain of NoC has many applications needing high communication performances. Therefore NoC offers attractive solutions to these applications.One of the goals of NoC technology is to maintain a required Quality of Service (QoS, defined in terms of acceptable parameters values.This paper proposes a presentation of QoS metrics model based on QoS parameters such as Endto-End Delays (EED and throughputs (Thp, for different applications. This study is based on dynamic routing simulation of a 4x4 mesh NoC behaviour under three communications processes namely TCP, VBR and CBR.

  14. 基于车辆任务可靠性的协同车辆路径问题%Collaborative vehicle route problem based on vehicle task reliability

    Institute of Scientific and Technical Information of China (English)

    孙博; 魏明; 姚娟

    2013-01-01

    研究一类属于不同公司的配送中心共享车队、仓储等资源为客户协同配送货物的协同车辆路径问题,将之视为“部分客户被一车辆访问”的集合划分问题.考虑车辆容量、车辆行驶最大里程、车辆配送任务的可靠性概率、时间窗等约束条件,建立以车辆配送总费用最小为目标的混合整数规划模型,并设计了求解该问题的遗传算法求解该问题.最后,通过一个算例验证了模型的正确性和合理性.%This paper studied the collaborative vehicle routing problem (CVRP),which depots belonged to different companies served their customers by sharing motorcades and warehousing to optimize total cost of collaborative transport,treated as a "some customers are serviced by a vehicle" set-partitioning problem.Considerihg some constraints such as vehicle' s capacity,maximum mileages of different vehicles,reliability of vehicle' s delivery and time window etc.,it built a mixed integer programming model for collaborative vehicles routing to optimize total cost of dispatching.The model was solved by genetic algorithm (GA).Finally,an example shows the correctness and effectiveness of the model.

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

    OpenAIRE

    Khanian, Seyed Mohammad Shafi

    2007-01-01

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

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

    OpenAIRE

    Selçuk K. İşleyen; Ö. Faruk Baykoç

    2008-01-01

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

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

    DEFF Research Database (Denmark)

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

    2013-01-01

    of electric vehicles in a market environment. From the perspective of vehicle operators participating in the electricity spot market, the problem is to optimally charge and discharge the vehicles in response to spot market prices. We consider the case of a vehicle owner who is a price......With the integration of fluctuating renewable production into the electricity system, electric-drive vehicles may contribute to the resulting need for flexibility, given that the market conditions provide sufficient economic incentive. To investigate this, we consider the short-term management......-taker and that of a fleet operator who can influence prices. In both cases, we show how the problem is amenable to dynamic programming with respectively linear and quadratic costs. With discretization of the state space, however, the problem of fleet operation is prone to suffer from the curse of dimensionality and...

  18. A possibilistic programming approach for the location problem of multiple cross-docks and vehicle routing scheduling under uncertainty

    Science.gov (United States)

    Meysam Mousavi, S.; Tavakkoli-Moghaddam, Reza; Jolai, Fariborz

    2013-10-01

    This article considers the design of cross-docking systems under uncertainty in a model that consists of two phases: (1) a strategic-based decision-making process for selecting the location of cross-docks to operate, and (2) an operational-based decision-making process for vehicle routing scheduling with multiple cross-docks. This logistic system contains three echelons, namely suppliers, cross-docks and retailers, in an uncertain environment. In the first phase, a new multi-period cross-dock location model is introduced to determine the minimum number of cross-docks among a set of location sites so that each retailer demand should be met. Then, in the second phase, a new vehicle routing scheduling model with multiple cross-docks is formulated in which each vehicle is able to pickup from or deliver to more than one supplier or retailer, and the pickup and delivery routes start and end at the corresponding cross-dock. This article is the first attempt to introduce an integrated model for cross-docking systems design under a fuzzy environment. To solve the presented two-phase mixed-integer programming (MIP) model, a new fuzzy mathematical programming-based possibilistic approach is used. Furthermore, experimental tests are carried out to demonstrate the effectiveness of the presented model. The computational results reveal the applicability and suitability of the developed fuzzy possibilistic two-phase model in a variety of problems in the domain of cross-docking systems.

  19. Vehicle Routing Problem with Soft Time Windows Based on Improved Genetic Algorithm for Fruits and Vegetables Distribution

    Directory of Open Access Journals (Sweden)

    Peiqing Li

    2015-01-01

    Full Text Available Fresh fruits and vegetables, perishable by nature, are subject to additional deterioration and bruising in the distribution process due to vibration and shock caused by road irregularities. A nonlinear mathematical model was developed that considered not only the vehicle routing problem with time windows but also the effect of road irregularities on the bruising of fresh fruits and vegetables. The main objective of this work was to obtain the optimal distribution routes for fresh fruits and vegetables considering different road classes with the least amount of logistics costs. An improved genetic algorithm was used to solve the problem. A fruit delivery route among the 13 cities in Jiangsu Province was used as a real analysis case. The simulation results showed that the vehicle routing problem with time windows, considering road irregularities and different classes of toll roads, can significantly influence total delivery costs compared with traditional VRP models. The comparison between four models to predict the total cost and actual total cost in distribution showed that the improved genetic algorithm is superior to the Group-based pattern, CW pattern, and O-X type cross pattern.

  20. Structural dynamic and aeroelastic considerations for hypersonic vehicles

    Science.gov (United States)

    Cazier, F. W., Jr.; Doggett, Robert V., Jr.; Ricketts, Rodney H.

    1991-01-01

    The specific geometrical, structural, and operational environment characteristics of hypersonic vehicles are discussed with particular reference to aerospace plane type configurations. A discussion of the structural dynamic and aeroelastic phenomena that must be addressed for this class of vehicles is presented. These phenomena are in the aeroservothermoelasticity technical area. Some illustrative examples of recent experimental and analytical work are given. Some examples of current research are pointed out.