Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the vehicle routing problem
Management Science
Multicriteria pickup and delivery problem with transfer opportunity
Computers and Industrial Engineering
Integer Programming Formulation of Traveling Salesman Problems
Journal of the ACM (JACM)
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Branch-and-bound algorithms for the capacitated VRP
The vehicle routing problem
Tabu Search
A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
INFORMS Journal on Computing
A new branch-and-cut algorithm for the capacitated vehicle routing problem
Mathematical Programming: Series A and B
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
A genetic algorithm for a bi-objective capacitated arc routing problem
Computers and Operations Research
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem
Mathematical Programming: Series A and B
A general heuristic for vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
INFORMS Journal on Computing
Journal of Global Optimization
Mathematical Programming: Series A and B
Expert Systems with Applications: An International Journal
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
Arc routing in a node routing environment
Computers and Operations Research
A GRASP×ELS approach for the capacitated location-routing problem
Computers and Operations Research
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
Computers and Operations Research
Computers and Operations Research
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
The min-max vehicle routing problem VRP is a variant of the classical VRP in which the objective is to minimize the duration of the longest route. Examination of the VRP literature indicates that the min-max VRP has received less attention than other variants have over the years. However, the problem has important practical applications, such as those related to routing school buses. In this setting, in addition to the min-max criterion imposed on the time it takes to complete the longest route, school districts are concerned with the minimization of the total distance traveled, which is the objective of the classical VRP. Hence, the problem is formulated as a bi-objective optimization model that trades off service i.e., the minimization of the longest route and operational cost i.e., the minimization of the total distance traveled. We develop a solution procedure for this problem by applying tabu search within the framework of Multiobjective Adaptive Memory Programming and compare it to an implementation of the Non-dominated Sorting Genetic Algorithm---a well-known approach to multiobjective optimization. We also assess the merit of the solution method by comparing our approximations with solution frontiers obtained with an ε-constraint implementation.