共查询到20条相似文献,搜索用时 0 毫秒
1.
In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on the time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model. 相似文献
2.
This paper presents a continuous approximation model for the period vehicle routing problem with service choice (PVRP-SC). The PVRP-SC is a variant of the period vehicle routing problem in which the visit frequency to nodes is a decision of the model. This variation can result in more efficient vehicle tours and/or greater service benefit to customers. We present a continuous approximation model to facilitate strategic and tactical planning of periodic distribution systems and evaluate the value of service choice. Further, results from the continuous model can provide guidelines for constructing solutions to the discrete PVRP-SC. 相似文献
3.
Vehicle platooning, a coordinated movement strategy, has been proposed to address a range of current transport challenges such as traffic congestion, road safety, energy consumption and pollution. But in order to form platoons in an ad-hoc manner the vehicles have to ‘speak the same language’, which is in current practice limited to vehicles of particular manufacturers. There is no standard language yet. Also in research, while the current literature focuses on platoon control strategies, intra-platoon communication, or platooning impacts on traffic, the conceptualization of platooning objects and their operations remained unattended. This paper aims to fill this fundamental gap by developing a formal model of platooning concepts. The paper proposes an ontological model of platooning objects and properties and abstract basic building blocks of platoon operations that can then be aggregated to complex platooning behavior. The presented ontological model provides the logical reasoning to support vital decision-making during platoon lifecycles. The ontological model is implemented and demonstrated. 相似文献
4.
Routing and scheduling software is part of the information and technology systems available to support the transport industry, and uses complex algorithms along with geographical representations of the road network to allow better planning of daily collection and delivery schedules. This paper reviews the evolution of routing and scheduling software, the algorithms used along with reported barriers to wider take-up and potential industry-driven improvements that could be made. A survey of transport companies in the U.K. was conducted in order to validate and prioritise the software capabilities that require the most development according to the new challenges that the industry is facing. Responses suggested that companies required improved route optimisation to tackle congestion based on time-dependent data and models, and greater accuracy in the representation of the road network. Not considering congestion leads to the underestimation of travel times and the production of inaccurate schedules. Literature shows that operational research techniques are available to solve problems that represent real-world conditions, but research into the relative merits of using time-dependent models needs to be undertaken. Data might be improved by cooperation between government and private sector. 相似文献
5.
This paper introduces a rolling horizon algorithm to plan the delivery of vehicles to automotive dealers by a heterogeneous fleet of auto-carriers. The problem consists in scheduling the deliveries over a multiple-day planning horizon during which requests for transportation arrive dynamically. In addition, the routing of the auto-carriers must take into account constraints related to the loading of the vehicles on the carriers. The objective is to minimize the sum of traveled distances, fixed costs for auto-carrier operation, service costs, and penalties for late deliveries. The problem is solved by a heuristic that first selects the vehicles to be delivered in the next few days and then optimizes the deliveries by an iterated local search procedure. A branch-and-bound search is used to check the feasibility of the loading. To handle the dynamic nature of the problem, the complete algorithm is applied repeatedly in a rolling horizon framework. Computational results on data from a major European logistics service provider show that the heuristic is fast and yields significant improvements compared to the sequential solution of independent daily problems. 相似文献
6.
The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure. 相似文献
7.
This paper introduces a new vehicle routing problem transferring one commodity between customers with a capacitated vehicle that can visit a customer more than once, although a maximum number of visits must be respected. It generalizes the capacitated vehicle routing problem with split demands and some other variants recently addressed in the literature. We model the problem with a single commodity flow formulation and design a branch-and-cut approach to solve it. We make use of Benders Decomposition to project out the flow variables from the formulation. Inequalities to strengthen the linear programming relaxation are also presented and separated within the approach. Extensive computational results illustrate the performance of the approach on benchmark instances from the literature. 相似文献
8.
Vehicle longitudinal control systems such as (commercially available) autonomous Adaptive Cruise Control (ACC) and its more sophisticated variant Cooperative ACC (CACC) could potentially have significant impacts on traffic flow. Accurate models of the dynamic responses of both of these systems are needed to produce realistic predictions of their effects on highway capacity and traffic flow dynamics. This paper describes the development of models of both ACC and CACC control systems that are based on real experimental data. To this end, four production vehicles were equipped with a commercial ACC system and a newly developed CACC controller. The Intelligent Driver Model (IDM) that has been widely used for ACC car-following modeling was also implemented on the production vehicles. These controllers were tested in different traffic situations in order to measure the actual responses of the vehicles. Test results indicate that: (1) the IDM controller when implemented in our experimental test vehicles does not perceptibly follow the speed changes of the preceding vehicle; (2) strings of consecutive ACC vehicles are unstable, amplifying the speed variations of preceding vehicles; and (3) strings of consecutive CACC vehicles overcome these limitations, providing smooth and stable car following responses. Simple but accurate models of the ACC and CACC vehicle following dynamics were derived from the actual measured responses of the vehicles and applied to simulations of some simple multi-vehicle car following scenarios. 相似文献
9.
Transport demand for containers has been increasing for decades, which places pressure on road transport. As a result, rail transport is stimulated to provide better intermodal freight transport services. This paper investigates mathematical models for the planning of container movements in a port area, integrating the inter-terminal transport of containers (ITT, within the port area) with the rail freight formation and transport process (towards the hinterland). An integer linear programming model is used to formulate the container transport across operations at container terminals, the network interconnecting them, railway yards and the railway networks towards the hinterland. A tabu search algorithm is proposed to solve the problem. The practical applicability of the algorithm is tested in a realistic infrastructure case and different demand scenarios. Our results show the degree by which internal (ITT) and external (hinterland) transport processes interact, and the potential for improvement of overall operations when the integrated optimization proposed is used. Instead, if the planning of containers in the ITT system is optimized as a stand-alone problem, the railway terminals may suffer from longer delay times or additional train cancellations. When planning the transport of 4060 TEU containers within one day, the benefits of the ITT planning without considering railway operations account for 17% ITT cost reduction but 93% railway operational cost growth, while the benefits of integrating ITT and railway account for a reduction of 20% in ITT cost and 44% in railway operational costs. 相似文献
10.
The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet. 相似文献
11.
This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics are built: a Tabu Search and an Adaptive Large Neighborhood Search. We carry out our experiments for well-known problem instances and perform comprehensive analyses on the numerical results in terms of the computational time and the solution quality. Experiments confirm that the proposed procedure is effective to obtain very good solutions to be performed in real-life environment. 相似文献
12.
This paper introduces the fleet size and mix pollution-routing problem which extends the pollution-routing problem by considering a heterogeneous vehicle fleet. The main objective is to minimize the sum of vehicle fixed costs and routing cost, where the latter can be defined with respect to the cost of fuel and CO2 emissions, and driver cost. Solving this problem poses several methodological challenges. To this end, we have developed a powerful metaheuristic which was successfully applied to a large pool of realistic benchmark instances. Several analyses were conducted to shed light on the trade-offs between various performance indicators, including capacity utilization, fuel and emissions and costs pertaining to vehicle acquisition, fuel consumption and drivers. The analyses also quantify the benefits of using a heterogeneous fleet over a homogeneous one. 相似文献
13.
The Pollution-Routing Problem 总被引:1,自引:0,他引:1
The amount of pollution emitted by a vehicle depends on its load and speed, among other factors. This paper presents the Pollution-Routing Problem (PRP), an extension of the classical Vehicle Routing Problem (VRP) with a broader and more comprehensive objective function that accounts not just for the travel distance, but also for the amount of greenhouse emissions, fuel, travel times and their costs. Mathematical models are described for the PRP with or without time windows and computational experiments are performed on realistic instances. The paper sheds light on the tradeoffs between various parameters such as vehicle load, speed and total cost, and offers insight on economies of ‘environmental-friendly’ vehicle routing. The results suggest that, contrary to the VRP, the PRP is significantly more difficult to solve to optimality but has the potential of yielding savings in total cost. 相似文献
14.
Abstract With the growth in population and development of business activities in Hong Kong, the range and level of services provided by Hongkong Post have multiplied. However, the schedule of its postal vehicles, including mail collection and delivery, is still constructed manually on a daily basis, based on the experience of staff and transportation reviews. In this paper, the problem of scheduling a set of n collection points (District Post Offices) from a depot (General Post Office) in Hong Kong Island is addressed. The objectives pursued are the maximization of resource utilization and minimization of operation costs. In other words, the variable cost is expected to be reduced. To achieve these goals, an integer linear programming (IP) model of the vehicle routing problem (VRP) is developed in an effort to obtain optimal solutions. As the model involves computational complexity, a commercial software package CPLEX is used to solve the problems efficiently. The results show that the proposed model can produce optimal vehicle routes and schedules. 相似文献
15.
文章针对带时间窗约束的混合车辆路径问题的特点,建立了带时间窗的混合车辆路径问题的数学模型,并设计了变邻域禁忌搜索算法对该问题进行求解。通过标准算例测试及与现有文献计算结果的比较,验证了该算法的有效性。 相似文献
16.
The idea of deploying unmanned aerial vehicles, also known as drones, for final-mile delivery in logistics operations has vitalized this new research stream. One conceivable scenario of using a drone in conjunction with a traditional delivery truck to distribute parcels is discussed in earlier literature and termed the parallel drone scheduling traveling salesman problem (PDSTSP). This study extends the problem by considering two different types of drone tasks: drop and pickup. After a drone completes a drop, the drone can either fly back to depot to deliver the next parcels or fly directly to another customer for pickup. Integrated scheduling of multiple depots hosting a fleet of trucks and a fleet of drones is further studied to achieve an operational excellence. A vehicle that travels near the boundary of the coverage area might be more effective to serve customers that belong to the neighboring depot. This problem is uniquely modeled as an unrelated parallel machine scheduling with sequence dependent setup, precedence-relationship, and reentrant, which gives us a framework to effectively consider those operational challenges. A constraint programming approach is proposed and tested with problem instances of m-truck, m-drone, m-depot, and hundred-customer distributed across an 8-mile square region. 相似文献
17.
This paper presents an empirical investigation into platooning on two-lane two-way highways. The main objective is to better understand this phenomenon that has important implications on traffic performance and safety. Field data from three study sites in the state of Montana were used in this study. Separate investigations were performed to examine the relationships among platoon-related variables, namely; time headway, travel speed, and platoon size. The study confirmed that interaction between successive vehicles in the traffic stream generally diminishes beyond a time headway threshold value that fell in the range of 5–7 seconds. Also, the study revealed that very short headways (less than one second) are more associated with aggressive driving and higher speeds than with slow-moving platoons due to lack of passing opportunities. Further, the study found that amount of impedance to traffic is proportional to the size of platoon as evidenced by the relative difference between mean speed of various size platoons and the mean speed of unimpeded vehicles. The study provided other valuable insights into the platooning phenomenon on two-lane highways that are essential in developing a better understanding of traffic operation on two-lane highways. 相似文献
18.
Cluster-first route-second methods like the sweep heuristic (Gillett and Miller, 1974) are well known in vehicle routing. They determine clusters of customers compatible with vehicle capacity and solve a traveling salesman problem for each cluster. The opposite approach, called route-first cluster-second, builds a giant tour covering all customers and splits it into feasible trips. Cited as a curiosity for a long time but lacking numerical evaluation, this technique has nevertheless led to successful metaheuristics for various vehicle routing problems in the last decade. As many implementations consider an ordering of customers instead of building a giant tour, we propose in this paper the more general name of ordering-first split-second methods. This article shows how this approach can be declined for different vehicle routing problems and reviews the associated literature, with more than 70 references. 相似文献
19.
Emerging transportation network services, such as customized buses, hold the promise of expanding overall traveler accessibility in congested metropolitan areas. A number of internet-based customized bus services have been planned and deployed for major origin-destination (OD) pairs to/from inner cities with limited physical road infrastructure. In this research, we aim to develop a joint optimization model for addressing a number of practical challenges for providing flexible public transportation services. First, how to maintain minimum loading rate requirements and increase the number of customers per bus for the bus operators to reach long-term profitability. Second, how to optimize detailed bus routing and timetabling plans to satisfy a wide range of specific user constraints, such as passengers’ pickup and delivery locations with preferred time windows, through flexible decision for matching passengers to bus routes. From a space-time network modeling perspective, this paper develops a multi-commodity network flow-based optimization model to formulate a customized bus service network design problem so as to optimize the utilization of the vehicle capacity while satisfying individual demand requests defined through space-time windows. We further develop a solution algorithm based on the Lagrangian decomposition for the primal problem and a space-time prism based method to reduce the solution search space. Case studies using both the illustrative and real-world large-scale transportation networks are conducted to demonstrate the effectiveness of the proposed algorithm and its sensitivity under different practical operating conditions. 相似文献
20.
S. Srivatsa Srinivas 《运输评论》2017,37(5):590-611
Vehicle routing problems (VRPs) whose typical objective is to minimise total travel costs over a tour have evolved over the years with objectives ranging from minimising travel times and distances to minimising pollution and fuel consumption. However, driver behaviour continues to be neglected while planning for vehicle routes. Factors such as traffic congestion levels, monotonous drives and fatigue have an impact on the behaviour of drivers, which in turn might affect their speed-choice and route-choice behaviours. The behaviour of drivers and their subsequent decision-making owing to these factors impact the revenue of transport companies and could lead to huge losses in extreme cases. There have been studies on the behaviour of drivers in isolation, without inclusion of the objectives and constraints of the traditional routing problem. This paper presents a review of existing models of VRP, planner behaviour models in the VRP context and driver behaviour models and provides a motivation to integrate these models in a stochastic traffic environment to produce practical, economic and driver-friendly logistics solutions. The paper provides valuable insights on the relevance of behavioural issues in logistics and highlights the modelling implications of incorporating planner and driver behaviour in the framework of routing problems. 相似文献