• A Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) is studied. MV-CIRP the extension of Single-Vehicle CIRP (SV-CIRP). mixed integer nonlinear programming model formulated. Simulated Annealing algorithm proposed to solve both SV-CIRP and MV-CIRP. This paper presents a new variant which aims determine subset customers be visited, appropriate number vehicles used, corresponding cycle ti...

A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called twoand three-index formulations, the set partitioning formulation, and various formulations based on extra variables representing the flow of one or more commodities. Until now, there has not been a systematic study of how these formulations relate to each other. An exce...

Nowadays, self-adaptive multi-agent systems are applied in a variety of areas, including transportation, telecommunications, etc. The main challenge in route guidance system is to direct vehicles to their destination in a dynamic traffic situation, with the aim of reducing the traveling time and to ensure and efficient use of available road networks capacity. In this paper we propose a self-ada...

In this paper, we present an exact branch-and-price algorithm for a multi-attribute technician routing and scheduling problem. This problem integrates number of distinctive features from real-world application, like management inventory different parts multiple time windows service. Based on the fact that not all tasks need to be performed, new ternary branching scheme is introduced within algo...