.png){kind=icon}
.png){kind=icon}
Return
Order-first split-second methods for vehicle routing problems: A review
.png){kind=icon}
PRE
AI
DOI：10.1016/j.trc.2014.01.011.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cluster-first route-second methods like the sweep heuristic (Gillett and Miller, 1974) are well known in vehicle routing. They determine clusters of customers compatible with vehicle capacity and solve a traveling salesman problem for each cluster. The opposite approach, called route-first cluster-second, builds a giant tour covering all customers and splits it into feasible trips. Cited as a curiosity for a long time but lacking numerical evaluation, this technique has nevertheless led to successful metaheuristics for various vehicle routing problems in the last decade. As many implementations consider an ordering of customers instead of building a giant tour, we propose in this paper the more general name of ordering-first split-second methods. This article shows how this approach can be declined for different vehicle routing problems and reviews the associated literature, with more than 70 references. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Vehicle routing
Metaheuristic
Route-first cluster-second heuristic
Order-first split-second heuristic
Splitting procedure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.9
Papers:
4.7K
Citations:
3.2W