Mixed integer programming for vehicle routing problem with time windows

被引：0
|
作者：
Aggarwal D. [1 ]
Kumar V. [1 ]
机构：
[1] Computer Science and Engineering Department, Thapar University, Patiala, Punjab
来源：
International Journal of Intelligent Systems Technologies and Applications | 2019年 / 18卷 / 1-2期
关键词：
CPLEX; MIP; Mixed integer programming; Solomon’s instance; Time windows; Vehicle routing problem; VRP;
D O I：
10.1504/IJISTA.2019.097744
中图分类号：
学科分类号：
摘要：
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. Copyright © 2019 Inderscience Enterprises Ltd.
引用
下载
收藏
页码：4 / 19
页数：15
相关论文
共 50 条
12345