Little's Method with Penalties for the Decision of Capacitated Vehicle Routing Problem

I. F. Borhanov, V. R. Fazylov

Chair of Economic Cybernetics of Kazan State University

Abstract: The paper considers the problem known as Capacitated Vehicle Routing Problem (СVRP). For solving this problem, it is offered to use updated Little's method for traveling salesman problem, in which the cost matrix changes during the solving of a problem according to СVRP conditions.

Keywords: traveling salesman problem, capacitated vehicle routing problem, Little's method.

UDC: 519.17

Received: 11.06.2008

Bibliographic databases:

•