A column generation approach to the heterogeneous fleet vehicle routing problem

Authors:
Eunjeong Choi;Dong-Wan Tcha
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Guseong-dong, Yuseong-gu, Daejon 305-701, Republic of Korea;Graduate School of Management, Korea Advanced Institute of Science and Technology, 207-43 Cheongryangri-dong, Dongdaemun-gu, Seoul 130-722, Republic of Korea
Venue:
Computers and Operations Research
Year:
2007

Citing 6
Cited 17

Vehicle routing with time windows

Operations Research
A new heuristic for the fleet size and mix vehicle routing problem

Computers and Operations Research
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
A tabu search heuristic for the heterogenous fleet vehicle routing problem

Computers and Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
2-Path Cuts for the Vehicle Routing Problem with Time Windows

Transportation Science

A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

Journal of Heuristics
A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem

Computers and Operations Research
Two memetic algorithms for heterogeneous fleet vehicle routing problems

Engineering Applications of Artificial Intelligence
Heuristics for a multiperiod inventory routing problem with production decisions

Computers and Industrial Engineering
An integrated column generation and lagrangian relaxation for flowshop scheduling problems

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Review: Industrial aspects and literature survey: Fleet composition and routing

Computers and Operations Research
A branch-and-price algorithm for an integrated production and inventory routing problem

Computers and Operations Research
Efficient frameworks for greedy split and new depth first search split procedures for routing problems

Computers and Operations Research
A column generation heuristic for the general vehicle routing problem

LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
A job grouping approach for planning container transfers at automated seaport container terminals

Advanced Engineering Informatics
Modelling the synchronization of transport means in logistics service operations

ICCL'11 Proceedings of the Second international conference on Computational logistics
A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems

Engineering Applications of Artificial Intelligence
New Evolutionary Algorithm Based on 2-Opt Local Search to Solve the Vehicle Routing Problem with Private Fleet and Common Carrier

International Journal of Applied Metaheuristic Computing
An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem

Journal of Heuristics
A column-and-cut generation algorithm for planning of Canadian armed forces tactical logistics distribution

Computers and Operations Research
Vehicle routing problem with a heterogeneous fleet and time windows

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a vehicle routing problem with a heterogeneous fleet of vehicles having various capacities, fixed costs and variable costs. An approach based on column generation (CG) is applied for its solution, hitherto successful only in the vehicle routing problem with time windows. A tight integer programming model is presented, the linear programming relaxation of which is solved by the CG technique. A couple of dynamic programming schemes developed for the classical vehicle routing problem are emulated with some modifications to efficiently generate feasible columns. With the tight lower bounds thereby obtained, the branch-and-bound procedure is activated to obtain an integer solution. Computational experience with the benchmark test instances confirms that our approach outperforms all the existing algorithms both in terms of the quality of solutions generated and the solution time.