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.
Logistics, distribution, heuristic, sweep method, vehicle routing
Computer Engineering | Numerical Analysis and Scientific Computing
Proceedings of the World Congress on Engineering & Computer Science
Proceedings of the World Congress on Engineering 2013
City or Country
Imperial College London
Lee, Wee Leong, "Real-Life Vehicle Routing with Non-Standard Constraints" (2013). Research Collection School Of Information Systems (SMU Access Only). Paper 31.
Available at: http://ink.library.smu.edu.sg/sis_research_smu/31