ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 6. Vol. 24. 2018

DOI: 10.17587/it.24.387-392

E. M. Bronstein, Professor, e-mail: bro-efim@yandex.ru, Ufa State Aviation Technical University, Ufa, R. V. Gindullin, Assistant Professor, e-mail: gramiz@mail.ru Bashkir State University

Solving Single Vehicle Routing Problem with Pick-Ups and Deliveries with CPLEX

There is considered vehicle touring problem of forming a cycle of minimal length, that ensures delivery of cargo of various mass from producers to consumers with single vehicle. A cargo from a specific producer must be delivered to a specific consumer. Problem is called a single vehicle pickup-delivery problem (SPDP). Such problem can occur in carriage of passengers (e.g. taxi service).
Particular case of the problem is considered, where each cargo must be delivered immediately to a consumer. Formalizations of both general and particular cases of SPDP are offered, and realized in CPLEX. Comparison of the efficiency of proposed formalizations for general case of the problem is conducted on randomly generated instances, and for particular case — on instances from TSPLIB.
Keywords: vehicle routing, cycle, optimization, integer linear programming

To the contents