The arc routing and scheduling problem with transshipment

Transportation Science

Volumn 36, Issue 3, 2002, Pages 301-313

  De Rosa, Barbara ^a   Improta, Gennaro ^a   Ghiani, Gianpaolo ^a   Musmanno, Roberto ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; GARBAGE TRUCKS; HEURISTIC METHODS; SCHEDULING; TRANSPORTATION ROUTES;

ARC ROUTING PROBLEMS;

WATERWAY TRANSPORTATION;

EID: 0036686343     PISSN: 00411655     EISSN: None     Source Type: Journal    
DOI: 10.1287/trsc.36.3.301.7832     Document Type: Article

References (18)

1. The capacitated arc routing problem: Valid inequalities and facets
2. The capacitated arc routing problem: Lower bounds
3. A polyhedral approach to the rural postman problem
4. Arc routing problems, Part 2: The rural postman problem
5. Approximation algorithms for some routing problems
6. A Tabu search heuristic for the vehicle routing problem
7. The capacitated arc routing problem with intermediate facilities
8. Capacitated arc routing problems
9. A Tabu search heuristic for the capacitated arc routing problem
10. Improvement procedures for the undirected rural postman problem
11. Selecting transfer station locations for large solid waste systems
12. Lower bounds and reduction procedures for the bin-packing problem
13. Odd minimum cut-sets and b-matchings
14. Probabilistic diversification and intensification in local search for vehicle routing
15. An approximate procedure for determining the number, capacities and locations of solid waste transfer-stations in an urban region