Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Journal of Computational Physics
New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Solving real-life vehicle routing problems efficiently using tabu search
Annals of Operations Research - Special issue on Tabu search
Journal of Computational Physics
A tabu search heuristic for the vehicle routing problem
Management Science
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
Computers and Operations Research
Solving the variable size bin packing problem with discretized formulations
Computers and Operations Research
A tabu search approach for the livestock collection problem
Computers and Operations Research
Engineering Applications of Artificial Intelligence
Computers and Industrial Engineering
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Vehicle routing problem with a heterogeneous fleet and time windows
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs, satisfying customers' requirements and visiting each customer exactly once. In this paper a tabu search algorithm is proposed and tested on several benchmark problems. The computational experiments show that the proposed algorithm produces high quality solutions within an acceptable computation time. Four new best solutions are reported for a set of test problems used in the literature.