The time-dependent pollution-routing problem. Transp. Res. Part B: Methodol. 56, 265-293.Franceschetti A, Honhon D, Van Woensel T, Bekta ST, Laporte G. The time-dependent pollution-routing problem, Transport Res Part B: Methodol 2013; 56: 265-93....
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 ...
We introduce the time-dependent shortest path and vehicle routing problem. In this problem, a set of homogeneous vehicles is used to visit a set of customer locations dispersed over a very large network where the travel times are time-dependent and therefore the shortest path between two location...
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model several real life problems. Among them, the route planning problem for tourists interested in visiting multiple points of interest (POIs) using public transportation. The main objective of this problem is...
To address this issue, one possible approach is to work directly with the road network and consider travel time (or travel speed) variations on each road segment. In this paper, we propose a solution approach for a time-dependent vehicle routing problem with time windows in which travel ...
An experimental evaluation for the vehicle routing problem with soft time windows with and without time-dependent travel times is performed and it is shown that taking time-dependent travel times into account provides substantial improvements of the considered objective function. 展开 关键词: Vehicle ...
A vehicle routing problem with time-dependent travel times is addressed. • Time dependency is accounted for in each road segment of a network. • The path to go from one customer to the next in the road network is time-dependent. • A tabu search is proposed to solve the problem....
tourism planning; theme park problem; routing problem; time-dependent; partheno-genetic algorithm1. Introduction With the improvement of people’s living standards and material level, people’s daily lives are no longer solely focused on the pursuit of food and clothing but include more spiritual ...
Algorithms for the vehicle routing and scheduling problem with time windows constraints Operations Research, 35 (1987), pp. 254-265 CrossrefView in ScopusGoogle Scholar Tagmouti et al., 2007 M. Tagmouti, M. Gendreau, J.Y. Potvin Arc routing problem with time-dependent service costs European ...
Many mathematical models have been presented for the vehicle routing problem (VRP) in research papers. Most of them assume that the travel speeds are constant, and ignore the fact that travel speeds can change throughout the day. In this research, based on time-dependent travel speeds, an opt...