Sciweavers

5 search results - page 1 / 1
» The Collaborative Carrier Vehicle Routing Problem for Capaci...
Sort
View
GI
2007
Springer
13 years 10 months ago
The Collaborative Carrier Vehicle Routing Problem for Capacitated Traveling Salesman Tours
Abstract: This paper concentrates on a new framework for a post-market reassignment of requests in a Collaborative Carrier Network (CCN). While the framework was applied to a picku...
Susanne Berger, Christian Bierwirth
MP
2006
138views more  MP 2006»
13 years 4 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
COR
2008
95views more  COR 2008»
13 years 4 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
13 years 10 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 4 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...