Open Vehicle Routing Problem

被引：0

作者：

Cickova, Zuzana ^{[1
]}

Brezina, Ivan ^{[1
]}

Pekar, Juraj ^{[1
]}

机构：

[1] Univ Econ, Bratislava, Slovakia

来源：

MATHEMATICAL METHODS IN ECONOMICS (MME 2014) | 2014年

关键词：

Open Vehicle Routing Problem; Mixed Integer Programming; Mathematical Model; TIME WINDOWS; OPTIMIZATION; ALGORITHM;

D O I：

暂无

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Routing and scheduling of vehicles are important operational issues in the logistics management. This paper deals with the open vehicle routing problem (OVRP). The OVRP is an extension of classical capacitated vehicle routing problem (CVRP) that is well known in optimization. The goal of the OVRP is to find optimal shortest route for a vehicle (vehicles) with limited capacity in order to serve a given set of customers. The difference between the OVRP and the classical CVRP model is that the vehicle (vehicles) does (do) not need to return to the depot after the service of the last customer. In this paper, we formulate the mathematical models to capture all aspects of that problem based on mixed integer programming (MIP) with linear objective function and constraints. The experiments were provided on the free published instance for CVRP.

引用

页码：124 / 127

页数：4

共 8 条

[1]

Cicková Z, 2013, EKON CAS, V61, P497

[2]

Cicková Z, 2008, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE QUANTITATIVE METHODS IN ECONOMICS (MULTIPLE CRITERIA DECISION MAKING XIV), P40

[3] A NEW OPTIMIZATION ALGORITHM FOR THE VEHICLE-ROUTING PROBLEM WITH TIME WINDOWS [J].