Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

4th International Conference on Operational Research

Juliandri, Dedy^1 ; Mawengkang, Herman^2 ; Bu'Ulolo, F.^2

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

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

关键词: Combinatorial optimization problems;    Combined method;    Discrete optimization;    Mixed-integer programs;    Pickup and delivery;    Routing and scheduling;    Vehicle routing problem;    Vehicle Routing Problems;   

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

来源: IOP

【 摘 要 】

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers' demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.