SOLVING VEHICLE ROUTING PROBLEMS IN THE FRAMEWORK OF THE CONSTRAINT PROGRAMMING PARADIGM

The article is devoted to an analytical survey of the possibilities of solving vehicle routing problems within the framework of the constraint programming paradigm. First, the article provides an overview of the various formulations of the vehicle routing problem. Then, to facilitate understanding, these statements are formulated in the language of integer linear programming. After that, a description of the constraint programming technology is given and typical global constraints are given that are useful in various formulations of the vehicle routing problem. It is concluded that flexibility in the formulation of constraints, the possibility of integration with other optimization methods, as well as the ability to take into account uncertainties make programming in constraints one of the most popular tools for solving vehicle routing problems.