Being a key element in logistics distribution, vehicle routing problem becomes an importance research topic in management and computation science. Vehicle routing problem (VRP) with time windows is a specialisation of VRP. In this paper, a brief description of VRP is presented. A mixed integer programming (MIP) is utilised to solve the vehicle routing problem with time windows (VRPTW). A novel mathematical model of MIP is formulated and implemented using IBM CPLEX. A novel constraint is designed to optimise the number of vehicle used. The proposed model is used to optimise both transportation cost and number of vehicle used simultaneously. The proposed model is tested on two well-known instances of Solomon's benchmark test problem. Experimental results illustrate that the proposed formulation provides promising solutions in reasonable computation time. The sensitivity analysis of customer nodes is also studied.
No takes yet. Share an insight, caveat, or question.
Aggarwal et al. (2019) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: