Time-dependent routing amounts to design "best" routes in a graph in which arc traversal times may vary over the planning horizon. In the last decade, a number of technological advances have stimulated an increased interest in this field. We survey the research in the area and present a com...
(2007). A queueing framework for routing problems with time-dependent travel times. Journal of Mathematical Modelling and Algorithms, 6(1):151-173.Tom Van Woensel,Laoucine Kerbache,Herbert Peremans,Nico Vandaele.A Queueing Framework for Routing Problems with Time-dependent Travel Times[J]. ...
The benefits of time-dependent vehicle routing and scheduling systems are demonstrated by using real-world data for the road network in the north west of England. Introduction There has been considerable research to provide techniques for solving vehicle routing and scheduling problems (see, for ...
Time-dependent vehicle routing problem Path flexibility Geographical graph Stochastic travel time City logistics 摘要 Conventionally, vehicle routing problems are defined on a network in which the customer locations and arcs are given. Typically, these arcs somehow represent the distances or expected travel...
The time-dependent vehicle routing problem Daskin. 1992. Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation Science 26(3) 185-200... Ilic,Irena 被引量: 3发表: 2012年 Two-echelon vehicle routing problems: A literature review Mathematical formulati...
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 ...
Considering time-dependent travel times as well as information regarding demands that arise in real time in solving vehicle routing problems can reduce the costs of ignoring the changing environment. While considerable research has been devoted to the general traveling salesman problem and vehicle ...
Simulated annealing algorithm for the vehicle routing problem with time window under time-dependent The vehicle routing problem with time window(VRPTW) is one of the routing optimization problems with capacity and time window constraints.Most of the liter... S Yang,H Ma,T Gu - 《Or Transactions...
Also he recently proposed new replicable problems for time dependent routing problems with hard time windows with a new algorithm to solve the problem (Figliozzi, 2012). Kritzinger et al. (2012) used efficient traffic data in order to develop a variable neighborhood search (VNS) to solve the ...
Several authors have suggested time-dependent variants of the most commonly encountered vehicle routing problems. In these papers, however, time-dependency is usually defined on customer-based graphs. Thus, one major impact of travel time variations is missed: in an urban environment, not only do ...