Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

7-2013

Abstract

Real-life vehicle routing problems comprise of a number of complexities that are not considered by the classical models found in vehicle routing literature. I present, in this paper, a two-stage sweep-based heuristic to find good solutions to a real-life Vehicle Routing Problem (VRP). The problem I shall consider, will deal with some non-standard constraints beyond those normally associated with the classical VRP. Other than considering the capacity constraints for vehicles and the time windows for deliveries, I shall introduce four additional non-standard constraints: merging of customer orders, controlling the maximum number of drop points, matching orders to vehicle types, and controlling mixed-load permutations between goods. My algorithm has been successfully implemented in a Third-Party Logistics (3PL) managed distribution operations of dairy products with reasonably good results and response time.

Keywords

Logistics, Distribution, Heuristic, Sweep method, Vehicle routing

Discipline

Databases and Information Systems | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Information Systems and Management

Publication

Proceedings of the World Congress on Engineering, WCE 2013, July 3-5, London

First Page

432

Last Page

437

ISBN

9789881925107

Publisher

International Association of Engineers

Embargo Period

3-27-2022

Copyright Owner and License

Authors

Additional URL

http://www.iaeng.org/publication/WCE2013/WCE2013_pp432-437.pdf

Download

Share

COinS