Minimum cost VRP with time-dependent speed data and congestion charge

Abstract

A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver cost and congestion charge. The fuel cost required is influenced by the speed. The speed for a vehicle to travel along any road in the network varies according to the time of travel. The variation in speed is caused by congestion which is greatest during morning and evening rush hours. If a vehicle enters the congestion charge zone at any time, a fixed charge is applied. A benchmark dataset is designed to test the algorithm. The algorithm is also used to schedule a fleet of delivery vehicles operating in the London area.

Optimizing practical orienteering problems with stochastic time-dependent travel times: towards congestion free routes

“…As far as solution methods are concerned, tabu search (TS) is the most commonly applied metaheuristic for the TD-VRP(TW) [66,103,105,119,143,156,159]. Other algorithms that have been developed for the TD-VRP(TW) include a genetic algorithm [62], a heuristic combining route construction and route improvement [26,45,109], a VNS approach [80], an ILS [63] and three ant colony systems (ACS) [12,36,159].…”

“…Zhang et al [159] developed a hybrid algorithm that integrates both ACS and TS algorithms for the time-dependent vehicle routing problem with simultaneous pickup and delivery. Wen and Eglese [156] present a new algorithm for TD-VRPTW inspired by TS and shows how costs for freight distribution may be influenced by traffic conditions using a case study in the London area. Setak et al [119] present the time-dependent vehicle routing problem in a multigraph where one vertex can be accessible from another with more than one arc and proposed a TS solution method for this problem.…”

“…Existing solution methods for the related time-dependent vehicle routing problem (TD-VRP) described in [62,66,78,119,143,159] and the time-dependent vehicle routing problem with time windows (TD-VRPTW) which can be found in [12,26,30,36,45,63,80,98,103,105,109,121,156] provide inspiration on how to efficiently deal with time-dependency and time windows. Most of these works are also mentioned by the survey paper about time-dependent routing problems [58].…”

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

“…In general, the penalty cost is raised from the punctuality of delivery [164,182,183,195], the ability of meeting the demands [187,189,196], the capability of vehicles [184,197], waste of product [193], congestion charge [198], and so forth.…”

“…(v) Fuel consumption: traditional vehicle routing problems often rely on costs related to transportation distance, inventory, or the fixed cost of vehicle usage; nowadays, more and more researchers try to minimize the total fuel consumption, which is not only influenced by distance or vehicles' velocity but also related to the characteristics of each vehicle or even to the vehicle load [198][199][200][201]. In this study, this criterion is merged to the criterion "energy cost" so as to standardize the expression.…”