EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3366. The Twin Rural Postman Problem
Invited abstract in session TC-58: Waste Collection, stream VeRoLog - Vehicle Routing and Logistics.
Tuesday, 12:30-14:00Room: S07 (building: 101)
Authors (first author is the speaker)
| 1. | Marcos José Negreiros
|
| Computer Science, Universitade Estadual do Ceara | |
| 2. | Augusto Palhano
|
| Consulting and Development, GRAPHVS Ltda | |
| 3. | Nelson Maculan
|
| UFRJ-COPPE / PESC, Universidade Federal do Rio de Janeiro |
Abstract
This work shows a new arc routing problem where it is given a strongly connected weighed mixed graph and its required set of links (edges and arcs) and vertices, and a departure/end vertex. The Twin-Rural Postman problem (TRPP) is formed by at least two routes that departs and end at the same vertex v0, in such a way that both cover with minimum cost (distance) all the required links and vertices, and one of the RPP’s route is performed in such a way that the other twin is no more than a maximum distance from the other, once both movements are desirable to be synchronized. This problem appears in the waste collection in suburban areas of Brazilian cites, as in country cities, where a truck collects in a waste generator sector some streets continuously and a laborer perform a walking tour collecting and joining waste in special points where the vehicle will pass. We present the problem as a multi-objective combinatorial optimization problem, propose a procedure to solve it, and evaluate solutions considering what is doing in the field, what can be planned without algorithm support, and finally with algorithm support for the sectors of the cities of Andradina, Jales and São José do Rio Pardo/São Paulo-Brazil.
Keywords
- Vehicle Routing
- Combinatorial Optimization
- Graphs and Networks
Status: accepted
Back to the list of papers