A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew's working time
Copyright © 2018 Elsevier Ltd. All rights reserved.
| Veröffentlicht in: | Waste management (New York, N.Y.). - 1999. - 76(2018) vom: 27. Juni, Seite 138-146 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | , |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
2018
|
| Zugriff auf das übergeordnete Werk: | Waste management (New York, N.Y.) |
| Schlagworte: | Journal Article Capacitated arc routing problem Robust optimization Simulated annealing Waste collection Working time |
| Zusammenfassung: | Copyright © 2018 Elsevier Ltd. All rights reserved. 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 |
|---|---|
| Beschreibung: | Date Completed 13.08.2018 Date Revised 02.12.2018 published: Print-Electronic Citation Status MEDLINE |
| ISSN: | 1879-2456 |
| DOI: | 10.1016/j.wasman.2018.03.015 |