Business Management Dynamics

Double Blind Peer Reviewed - Open Access Jounal

Home  |   Contact Us

 

ISSN: 2047-7031

bmd Business and Management Dynamics bmd
ISSN: 2047-7031  
Volume  7   Issue 10  2018  
--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Article Abstract
A mathematical modeling for Periodic Capacitated Arc Routing Problem: a Multiple Tasks Proposal
Keywords:  Periodic Capacitated Arc Routing Problem, PCARP, Multiple Tasks, Mathematical Modeling
Cleverson G. Santos, Cassius T. Scarpin, Izabel C. Zattar, Maria Teresinha A. Steiner and Fernanda M. Assef
The Periodic Capacitated Arc Routing Problem is considered as a generalization of the Capacitated Arc Routing Problem (CARP) due to two characteristics: first for planning period larger than a time unity, as that vehicles make several travels and later by considering the frequency of associated visits to the arcs to be serviced over the planning horizon. In the literature involving periodic routing problems, not only in nodes, but also in arcs within a time horizon do not address the case of multiple tasks with the possibility of simultaneous execution. This paper consists in a modeling proposal which considers that in the passage through the arc more than one task must be developed. Those activities even have different periods that must also be regarded. In this way a new problem and its exact mathematical model is constructed, enounced as multiple tasks Periodic Capacitated Arc Routing Problem. A few new characteristics are presented, such as: multiple tasks to be performed on each edge or edges; different frequencies to accomplish each of the tasks; heterogeneous fleet; and flexibility for more than one vehicle passing through the same edge at the same day. The mathematical model was implemented and examples were generated randomly, in a way that the proposed model could be validated.
27-40   |  View PDF