A bi-objective mixed capacitated arc routing problem based on epsilon constraint algorithm
The classified collection of urban waste by waste collection vehicles involves one-way and two-way roads. At the same time, the capacity of collection vehicles is limited. Therefore, the waste sorting and collection problem is modeled as a mixed capacitated arc routing problem (MCARP), hybrid refers...
Saved in:
| Main Authors | , |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Published |
SPIE
21.07.2023
|
| Online Access | Get full text |
| ISBN | 9781510666573 1510666575 |
| ISSN | 0277-786X |
| DOI | 10.1117/12.2684682 |
Cover
| Summary: | The classified collection of urban waste by waste collection vehicles involves one-way and two-way roads. At the same time, the capacity of collection vehicles is limited. Therefore, the waste sorting and collection problem is modeled as a mixed capacitated arc routing problem (MCARP), hybrid refers to the presence of edge and arc elements, which approximates a real road network and is solved using the Epsilon constraint method. Relative to the existing literature, the model also considers the classified collection of different types of waste and the fairness of the workload of collection workers, and a Bi-objective MCARP model is developed and solved using the Epsilon constraint algorithm method. Finally, a set of cases of different scale is designed to be solved in numerical experiments to determine the solution scale of the model. |
|---|---|
| Bibliography: | Conference Location: Wuhan, China Conference Date: 2023-03-31|2023-04-02 |
| ISBN: | 9781510666573 1510666575 |
| ISSN: | 0277-786X |
| DOI: | 10.1117/12.2684682 |