Routing winter gritting vehicles
CO89 Selected papers of the conference on Combinatorial Optimization
A tabu scatter search metaheuristic for the arc routing problem
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A cutting plane algorithm for the capacitated arc routing problem
Computers and Operations Research
Improvement Procedures for the Undirected Rural Postman Problem
INFORMS Journal on Computing
A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem
Transportation Science
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Discrete Applied Mathematics
Vehicle Routing and Scheduling with Full Truckloads
Transportation Science
Solving capacitated arc routing problems using a transformation to the CVRP
Computers and Operations Research
Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem
Operations Research
A deterministic tabu search algorithm for the capacitated arc routing problem
Computers and Operations Research
A variable neighborhood search for the multi-depot vehicle routing problem with loading cost
Expert Systems with Applications: An International Journal
Journal of Mathematical Modelling and Algorithms
Expert Systems with Applications: An International Journal
Hi-index | 0.03 |
Collaborative transportation, as an emerging new mode, represents one of the major developing trends of transportation systems. Focusing on the full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, this paper proposes a mathematical programming model and its corresponding graph theory model, with the objective of minimizing empty vehicle movements. A two-phase greedy algorithm is given to solve practical large-scale problems. In the first phase, a set of directed cycles is created to fulfil the transportation orders. In the second phase, chains that are composed of cycles are generated. Furthermore, a set of local search strategies is put forward to improve the initial results. To evaluate the performance of the proposed algorithms, two lower bounds are developed. Finally, computational experiments on various randomly generated problems are conducted. The results show that the proposed methods are effective and the algorithms can provide reasonable solutions within an acceptable computational time.