A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem

Authors:
Xiangyong Li;Stephen C. H. Leung;Peng Tian
Affiliations:
School of Economics & Management, Tongji University, Shanghai 200092, China;Department of Management Sciences, City University of Hong Kong, Hong Kong;Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200052, China
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 6
Cited 3

A tabu search heuristic for the heterogenous fleet vehicle routing problem

Computers and Operations Research
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

Transportation Science
Solving the vehicle routing problem with adaptive memory programming methodology

Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem

Computers and Operations Research
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results

Computers and Operations Research
The open vehicle routing problem with fuzzy demands

Expert Systems with Applications: An International Journal

Applying an adaptive tabu search algorithm to optimize truck-dock assignment in the crossdock management system

Expert Systems with Applications: An International Journal
Survey of Green Vehicle Routing Problem: Past and future trends

Expert Systems with Applications: An International Journal
Open vehicle routing problem with demand uncertainty and its robust strategies

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	12.06

Visualization

Abstract

This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the demands of customers are fulfilled by a fleet of fixed number of vehicles with various capacities and related costs. Moreover, the vehicles start at the depot and terminate at one of the customers. This problem is an important variant of the classical vehicle routing problem and can cover more practical situations in transportation and logistics. We propose a multistart adaptive memory programming metaheuristic with modified tabu search algorithm to solve this new vehicle routing problem. The algorithmic efficiency and effectiveness are experimentally evaluated on a set of generated instances.