文章基本信息

标题：Mixed Integer Programming Model For A Variant Of Periodic Vehicle Routing Problem
本地全文：下载
作者：Bambang Irawan ; Herman Mawengkang
期刊名称：International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN：2278-1323
出版年度：2014
卷号：3
期号：5
页码：1881-1886
出版社：Shri Pannalal Research Institute of Technolgy
摘要：The paper develops a model for the optimal management of periodic deliveries of a given commodity called Periodic Vehicle Routing Problem (PVRP) incorporated time windows, fleet and driver scheduling, pick-up and delivery in the periodic planning.. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We model the problem as a linear mixed integer program and we propose a feasible neighbourhood search approach to solve the problem.
关键词：Vehicle routing problem; scheduling; integer ; programming; optimal management; neighbourhood search