Vehicle routing in the 1-skip collection problem

Journal of the Operational Research Society

Volumn 55, Issue 7, 2004, Pages 717-727

  Archetti, C ^a   Speranza, M G ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Heuristic algorithms; Skips; Transportation problem; Vehicle routing; Waste collection

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COSTS; HEURISTIC METHODS; LOADING; TRANSPORTATION; VEHICLES;

HEURISTIC ALGORITHMS; SKIPS; TRANSPORTATION PROBLEM; VEHICLE ROUTING; WASTE COLLECTION;

OPERATIONS RESEARCH;

EID: 3042747320     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601743     Document Type: Conference Paper

References (8)

1. Toth P and Vigo D (eds) (2002). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications: Philadelphia, PA.
2. Cordeau J-F et al (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
3. Ball M, Bodin L, Baldacci R and Mingozzi A (2000). The rollonrolloff vehicle routing problem. Trans Sci 34: 271-288.
4. De Meulemeester L, Laporte G, Louveaux FV and Semet F (1997). Optimal sequencing of skip collections and deliveries. J Opl Res Soc 48: 57-64.
5. Angelelli E and Speranza MG (2002). The application of a vehicle routing model to a waste-collection problem: two case studies. J Opl Res Soc 53: 944-952.
6. Angelelli E and Speranza MG (2002). The periodic vehicle routing problem with intermediate facilities. Ear J Opl Res 137: 233-247.
7. Cordeau J-F, Gendreau M and Laporte G (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30: 105-119.
8. Rosenkrantz DJ, Stearns RE and Lewis PM (1977). An analysis of several heuristics for the traveling salesman problem. SIAM J Compute. 34:563-581.