Author
L. Bodin
Bio: L. Bodin is an academic researcher. The author has contributed to research in topics: Equal-cost multi-path routing & Policy-based routing. The author has an hindex of 1, co-authored 1 publications receiving 1046 citations.
Papers
More filters
Journal Article•
1,046 citations
Cited by
More filters
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Abstract: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints. Given the intrinsic difficulty of this problem class, approximation methods seem to offer the most promise for practical size problems. After describing a variety of heuristics, we conduct an extensive computational study of their performance. The problem set includes routing and scheduling environments that differ in terms of the type of data used to generate the problems, the percentage of customers with time windows, their tightness and positioning, and the scheduling horizon. We found that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
3,211 citations
TL;DR: In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.
1,737 citations
TL;DR: A review of staff scheduling and rostering, an area that has become increasingly important as business becomes more service oriented and cost conscious in a global environment, and the models and algorithms that have been reported in the literature for their solution.
1,238 citations
01 Jan 1992
TL;DR: Taburoute as mentioned in this paper is a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions, which considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route.
Abstract: The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route, and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions. (A)
1,172 citations
TL;DR: Numerical tests on a set of benchmark problems indicate that tabu search outperforms the best existing heuristics, and TABUROUTE often produces the bes known solutions.
Abstract: The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algorithm considers a sequence of adjacent solutions obtained by repeatedly removing a vertex from its current route and reinserting it into another route. This is done by means of a generalized insertion procedure previously developed by the authors. During the course of the algorithm, infeasible solutions are allowed. Numerical tests on a set of benchmark problems indicate that tabu search out performs the best existing heuristics, and TABUROUTE often produces the best known solutions.
1,100 citations