An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

4th International Conference on Operational Research

Susilawati, Enny^1 ; Mawengkang, Herman^2 ; Efendi, Syahril^3

Graduate School of Mathematics, University of Sumatera Utara, Medan, Indonesia^1

Department of Mathematics, University of Sumatera Utara, Medan, Indonesia^2

Faculty of Computer Science and Information Technology, University of Sumatera Utara, Medan, Indonesia^3

关键词: Heterogeneous vehicles;    Heterogenic fleet;    Integer programming models;    Neighbourhood search;    Number of vehicles;    time restricted;    Vehicle routing problem with time windows;    Vehicle Routing Problems;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/300/1/012023/pdf
DOI  :  10.1088/1757-899X/300/1/012023

来源: IOP

【 摘 要 】

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we address a variant of the VRPTW in which the fleet of vehicle is heterogenic due to the different size of demand from customers. The problem, called Heterogeneous VRP (HVRP) also includes service levels. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model.