• Corpus ID: 1155258

Revisiting Cluster First , Route Second for the Vehicle Routing Problem

@inproceedings{akr2015RevisitingCF,
  title={Revisiting Cluster First , Route Second for the Vehicle Routing Problem},
  author={Fahrettin Çakır and William Nick Street and Barrett W. Thomas},
  year={2015}
}
While clustering was important to the development of early routing algorithms, modern solution methods rely on metaheuristics. In this paper, we take advantage of clustering research from other domains to revisit clustering approaches to routing. We propose a two-stage, shape-based clustering approach. Our solution technique is based on creating clusters of customers that form certain shapes with respect to the depot. We obtain a routing solution by ordering all customers in every cluster… 

Figures and Tables from this paper

A Cluster-First Route-Second Heuristic Approach to Solve The Multi-Trip Periodic Vehicle Routing Problem
TLDR
The implementation of the heuristic CFRS to solve the real problem faced by the LPG distributor shows that the procedure could provide a better routing solution.
An efficient metaheuristic algorithm for solving capacitated vehicle routing problem
The growing of industry sector has lead various problem in distribution of logistics and supply chain management. Increment of industry scale has effect in increasing the cost of the transportation
Development of a Vehicle Routing System for Delivery Services
TLDR
A pairing of clustering and routing algorithms that solve the travelling salesman problem the best was found and shows that using k-means as the clustering algorithm and a genetic algorithm with some modifications yield the best route recommendations in terms of total cost and processing time.
Cluster-First, Route-Second Heuristic for EV Scheduling in On-Demand Public Transit
TLDR
A hybrid methodology is proposed, which exploits parallel computing techniques using a clustering algorithm to decompose a large problem into smaller sub-problems, which are subsequently solved using a genetic algorithm to improve speed of computation and quality of results compared to the state-of-the-art.
Comparison of Dbscan and K-means clustering methods in the selection of representative clients for a vehicle routing model
This research presents the management, analysis and debugging of a database with more than 2.2 million records concerning the delivery of products by a 4PL logistics operator in Colombia, in charge

References

SHOWING 1-10 OF 43 REFERENCES
A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
TLDR
A two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW) and indicates that it is highly competitive with all existing heuristics, and very promising for solving problems of large size.
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
TLDR
The applied metaheuristic combines the strengths of the well-known guided local search and evolution strategies metaheuristics into an iterative two-stage procedure that provides the best-known solutions to 70 test instances.
A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
TLDR
Two VNS variants, which differ in the order the diversification and Dijkstra's algorithm are used, are implemented and appear to be competitive and produce new best results when tested on the data sets from the literature.
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
TLDR
An efficient variable neighborhood search heuristic for the capacitated vehicle routing problem to design least cost routes for a fleet of identically capacitated vehicles to service geographically scattered customers with known demands is presented.
A REVISED SIMULATED ANNEALING AND CLUSTER-FIRST ROUTE-SECOND ALGORITHM APPLIED TO THE VEHICLE ROUTING PROBLEM
TLDR
This paper presents a simplified version of the simulated annealing (SA) algorithm together with the cluster-first route-second heuristic for the vehicle routing problem and there is evidence that the simple algorithm can be improved upon by applying additional strategies to various aspects of the problem.
A sweep-based algorithm for the fleet size and mix vehicle routing problem
TLDR
Results on a set of benchmark test problems show that the proposed heuristic produces excellent solutions in short computing times, and produced new best-known solutions for three of the test problems.
A new ILP-based refinement heuristic for Vehicle Routing Problems
TLDR
This paper extends the Sarvanov-Doroshko method to DCVRP, and generalizes it, which involves a procedure to generate a large number of new sequences through the extracted nodes, as well as a more sophisticated ILP model for the reallocation of some of these sequences.
A VEHICLE ROUTING PROBLEM WITH BACKHAULS AND TIME WINDOWS: A GUIDED LOCAL SEARCH SOLUTION
This paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer
A Location Based Heuristic for General Routing Problems
TLDR
This work presents a general framework for modeling routing problems based on formulating them as a traditional location problem called the capacitated concentrator location problem and shows that the heuristic performs well for both problems and outperforms all published heuristics on a set of standard test problems.
Classical and modern heuristics for the vehicle routing problem
TLDR
This article is a survey of heuristics for the Vehicle Routing Problem which contains well-known schemes such as, the savings method, the sweep algorithm and various two-phase approaches and tabu search heuristic which have proved to be the most successful metaheuristic approach.
...
1
2
3
4
5
...