Mixed integer programming for vehicle routing problem with time windows Online publication date: Thu, 07-Feb-2019
by Divya Aggarwal; Vijay Kumar
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 18, No. 1/2, 2019
Abstract: 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook