A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew's working time. (June 2018)

• Record Type: Journal Article
• Authors: Tirkolaee, Erfan Babaee; Mahdavi, Iraj; Mehdi Seyyed Esfahani, Mir
• Is Part Of: Waste management. Volume 76(2018)
• Page Start: 138
• Page End: 146
• Publication Date: 2018-06
• Subjects: Waste collection -- Capacitated arc routing problem -- Working time -- Simulated annealing -- Robust optimization; Hazardous wastes -- Periodicals; Refuse and refuse disposal -- Periodicals; 363.728
• DOI: 10.1016/j.wasman.2018.03.015
• Languages: English
• ISSNs: 0956-053X

Abstract

Highlights: Developing a novel mathematical model for the robust Periodic CARP. Considering working time of drivers and crew besides vehicles' capacity constraints. Developing a hybrid SA using a heuristic algorithm and an efficient cooling equation. Abstract: In this paper, a novel mathematical model is developed for robust periodic capacitated arc routing problem (PCARP) considering multiple trips and drivers and crew's working time to study the uncertain nature of demand parameter. The objective function of the proposed model aims to minimize total traversed distance and total usage cost of vehicles over a planning period. To solve the problem, an improved hybrid simulated annealing algorithm (SA) is developed based on a heuristic algorithm and an efficient cooling equation. It has been proved that the performance of the proposed algorithm is acceptable in comparison with the exact solution method. Finally, the results have shown the effects of different uncertainty level of the demand parameter on the problem to be considered as a managerial overview in decision making process under uncertainty.