Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty

Sara Tfaili, Abdelkader Sbihi, Adnan Yassine, Ibrahima Diarrassouba

Abstract

In this paper, we study the capacitated arc routing problem over sparse underlying graphs under travel costs uncertainty. In particular, we work with Multiple-Scenario Min-Max CARP over sparse underlying graphs. We present a mathematical formulation of the problem. A greedy heuristic algorithm and an adapted tabu-search algorithm are developed to solve the problem. The computational experiments show the effectiveness of these two algorithms for different sizes of instances as well for different number of scenarios.

Download


Paper Citation


in Harvard Style

Tfaili S., Sbihi A., Yassine A. and Diarrassouba I. (2018). Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty.In Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-285-1, pages 144-151. DOI: 10.5220/0006751001440151


in Bibtex Style

@conference{icores18,
author={Sara Tfaili and Abdelkader Sbihi and Adnan Yassine and Ibrahima Diarrassouba},
title={Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty},
booktitle={Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2018},
pages={144-151},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006751001440151},
isbn={978-989-758-285-1},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 7th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty
SN - 978-989-758-285-1
AU - Tfaili S.
AU - Sbihi A.
AU - Yassine A.
AU - Diarrassouba I.
PY - 2018
SP - 144
EP - 151
DO - 10.5220/0006751001440151