Vehicle Routeing with Multiple Use of Vehicles
Journal of the Operational Research SocietyPublished 1 August 1996
Éric D. Taillard, Gilbert Laporte, Michel Gendreau
Citations222
SJR quartileQ1
SJR score0.92
SNIP1.26
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A tabu search heuristic is developed for the vehicle routeing problem with multiple use of vehicles and is shown to produce high quality solutions on a series of test problems.
Abstract
AbstractThe vehicle routeing problem with multiple use of vehicles is a variant of the standard vehicle routeing problem in which the same vehicle may be assigned to several routes during a given planning period. A tabu search heuristic is developed for this problem. It is shown to produce high quality solutions on a series of test problems.Keywords: Vehicle Routeing ProblemHeuristicTabu Search
Keywords
Computer ScienceEngineering
European Journal of Operational ResearchThe vehicle routing problem: An overview of exact and approximate algorithms
1,701 Citations1992Gilbert Laporte
In this paper, some of the main known results relative to the Vehicle Routing Problem are surveyed.
PolyPublie (École Polytechnique de Montréal)A Tabu Search Heuristic for the Vehicle Routing Problem
1,231 Citations1994Michel Gendreau, Alain Hertz +1 more
Journal of HeuristicsProbabilistic diversification and intensification in local search for vehicle routing
893 Citations1995Yves Rochat, Éric D. Taillard
A probabilistic technique to diversify, intensify, and parallelize a local search adapted for solving vehicle routing problems and local searches is presented.
NetworksParallel iterative search methods for vehicle routing problems
593 Citations1993Éric D. Taillard
Two partition methods that speed up iterative search methods applied to vehicle routing problems including a large number of vehicles, based on the arborescence built from the shortest paths from any city to the depot are presented.
Operations ResearchOptimal Solution of Vehicle Routing Problems Using Minimum K-Trees
512 Citations1994Marshall L. Fisher
This work shows that the vehicle routing problem can be modeled as the problem of finding a minimum cost K-tree with two K edges incident on the depot and subject to some side constraints that impose vehicle capacity and the requirement that each customer be visited exactly once.
INFORMS journal on computingThe Vehicle Routing Problem with Time Windows Part II: Genetic Search
403 Citations1996Jean‐Yves Potvin, Samy Bengio
This paper is the second part of a work on the application of new search techniques for the vehicle routing problem with time windows and describes GENEROUS, the GENEtic ROUting System, which is based on the natural evolution paradigm.
Annals of Operations ResearchRouting problems: A bibliography
315 Citations1995Gilbert Laporte, Ibrahim H. Osman
This bibliography contains 500 references on four classical routing problems: the Traveling Salesman problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the Rural Postman problem.
Journal of the Operational Research SocietyAn Integer Programming Approach to the Vehicle Scheduling Problem
221 Citations1976B. A. Foster, David M. Ryan
This paper describes an integer programming formulation of the vehicle scheduling problem and illustrates how such a formulation can be extended to incorporate restrictions on work load, coverage and service that occur in real world vehicle scheduling problems.
Journal of the Operational Research SocietyAn Improved Petal Heuristic for the Vehicle Routeing Problem
114 Citations1996Jacques Renaud, Fayez F. Boctor +1 more
The algorithm proposed in this paper yields solutions almost as good as those produced by tabu search adaptations, but at only a small fraction of their computing time.
Journal of the Operational Research SocietyExtensions of the Petal Method for Vehicle Routeing
86 Citations1993David M. Ryan, Curt Hjorring +1 more
By extending the definition of a petal route, more general forms of vehicle route can be generated without invalidating the important underlying property that optimal petal solutions can be produced very easily.