Abstract | ||
---|---|---|
In this paper we suggest a multi-start greedy heuristic for a real-life truck and trailer routing problem. The considered problem is a site dependent heterogeneous fleet truck and trailer routing problem with soft and hard time windows and split deliveries. This problem arises in delivering goods from a warehouse to stores of a big retail company. There are about 400 stores and 100 vehicles for one warehouse. Our heuristic is based on sequential greedy insertion of a customer to a route with further improvement of the solution. The computational experiments are performed for real-life data. We also provide a mixed integer linear programming formulation for precise and clear description of the problem. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.procs.2014.05.328 | Procedia Computer Science |
Keywords | Field | DocType |
real-life problem,truck and trailer routing problem,multi-start heuristic,greedy insertion | Truck,Data mining,Heuristic,Mathematical optimization,Computer science,Greedy algorithm,Integer linear programming formulation,Trailer | Conference |
Volume | ISSN | Citations |
31 | 1877-0509 | 3 |
PageRank | References | Authors |
0.54 | 11 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mikhail Batsyn | 1 | 86 | 10.02 |
Alexander Ponomarenko | 2 | 62 | 3.32 |