Heuristic for a Real-life Truck and Trailer Routing Problem | Zendy

Mikhail Batsyn | Zendy; Alexander Ponomarenko | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Heuristic for a Real-life Truck and Trailer Routing Problem

Author(s) -

Mikhail Batsyn,

Alexander Ponomarenko

Publication year - 2014

Publication title -

procedia computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.334

H-Index - 76

ISSN - 1877-0509

DOI - 10.1016/j.procs.2014.05.328

Subject(s) - computer science , truck , trailer , heuristic , vehicle routing problem , greedy algorithm , routing (electronic design automation) , integer programming , operations research , mathematical optimization , computer network , algorithm , artificial intelligence , mathematics , physics , thermodynamics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research