A Spatio-temporal Distance Based Two-Phase Heuristic Algorithms for Vehicle Routing Problem

2009 ◽  
Author(s):  
Qi Ming-yao ◽  
Miao Li-xin ◽  
Shan Jie
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Temporal Distance ◽  
Two Phase ◽  
Routing Problem ◽  
Spatio Temporal

scholarly journals Solving the Tractor and Semi-Trailer Routing Problem Based on a Heuristic Approach

2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
Hongqi Li ◽  
Yue Lu ◽  
Jun Zhang ◽  
Tianyi Wang
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Computational Study ◽  
Two Phase ◽  
Widespread Application ◽  
Routing Problem ◽  
Initial Route ◽  
Duty Time

We study the tractor and semi-trailer routing problem (TSRP), a variant of the vehicle routing problem (VRP). In the TSRP model for this paper, vehicles are dispatched on a trailer-flow network where there is only one main depot, and all tractors originate and terminate in the main depot. Two types of decisions are involved: the number of tractors and the route of each tractor. Heuristic algorithms have seen widespread application to various extensions of the VRP. However, this approach has not been applied to the TSRP. We propose a heuristic algorithm to solve the TSRP. The proposed heuristic algorithm first constructs the initial route set by the limitation of a driver’s on-duty time. The candidate routes in the initial set are then filtered by a two-phase approach. The computational study shows that our algorithm is feasible for the TSRP. Moreover, the algorithm takes relatively little time to obtain satisfactory solutions. The results suggest that our heuristic algorithm is competitive in solving the TSRP.

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 82-92 ◽  
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

Sign in / Sign up

Export Citation Format

Share Document