A heuristic for the vehicle routing problem with due times

Kyung Hwan Kang, Byung Ki Lee, Yoon Ho Lee, Young Hoon Lee

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

This paper studies the vehicle routing problem with due times. The vehicles are supposed to visit customers within the due times, and a penalty cost is imposed in case the vehicle arrives past the due times. The objective is to minimize the weighted sum of the traveling time of vehicles and the tardiness of the service customers receive. A mixed integer programming formulation and a heuristic based on the tabu search for a practical use are suggested. Route-perturb and route-improvement method for the neighborhood generation is proposed. Performances are compared with other heuristics appeared in the literature using the bench-mark data set modified to be fit to the model. It is shown that the suggested heuristic gives a good solution in a short computation time.

Original languageEnglish
Pages (from-to)421-431
Number of pages11
JournalComputers and Industrial Engineering
Volume54
Issue number3
DOIs
Publication statusPublished - 2008 Apr 1

Fingerprint

Vehicle routing
Vehicle Routing Problem
Heuristics
Tabu search
Integer programming
Customers
Tardiness
Mixed Integer Programming
Tabu Search
Weighted Sums
Penalty
Vehicle routing problem
Costs
Benchmark
Minimise
Formulation

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

Kang, Kyung Hwan ; Lee, Byung Ki ; Lee, Yoon Ho ; Lee, Young Hoon. / A heuristic for the vehicle routing problem with due times. In: Computers and Industrial Engineering. 2008 ; Vol. 54, No. 3. pp. 421-431.
@article{59c25e1628274525b1381da9afc6f8c9,
title = "A heuristic for the vehicle routing problem with due times",
abstract = "This paper studies the vehicle routing problem with due times. The vehicles are supposed to visit customers within the due times, and a penalty cost is imposed in case the vehicle arrives past the due times. The objective is to minimize the weighted sum of the traveling time of vehicles and the tardiness of the service customers receive. A mixed integer programming formulation and a heuristic based on the tabu search for a practical use are suggested. Route-perturb and route-improvement method for the neighborhood generation is proposed. Performances are compared with other heuristics appeared in the literature using the bench-mark data set modified to be fit to the model. It is shown that the suggested heuristic gives a good solution in a short computation time.",
author = "Kang, {Kyung Hwan} and Lee, {Byung Ki} and Lee, {Yoon Ho} and Lee, {Young Hoon}",
year = "2008",
month = "4",
day = "1",
doi = "10.1016/j.cie.2007.08.004",
language = "English",
volume = "54",
pages = "421--431",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "3",

}

A heuristic for the vehicle routing problem with due times. / Kang, Kyung Hwan; Lee, Byung Ki; Lee, Yoon Ho; Lee, Young Hoon.

In: Computers and Industrial Engineering, Vol. 54, No. 3, 01.04.2008, p. 421-431.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A heuristic for the vehicle routing problem with due times

AU - Kang, Kyung Hwan

AU - Lee, Byung Ki

AU - Lee, Yoon Ho

AU - Lee, Young Hoon

PY - 2008/4/1

Y1 - 2008/4/1

N2 - This paper studies the vehicle routing problem with due times. The vehicles are supposed to visit customers within the due times, and a penalty cost is imposed in case the vehicle arrives past the due times. The objective is to minimize the weighted sum of the traveling time of vehicles and the tardiness of the service customers receive. A mixed integer programming formulation and a heuristic based on the tabu search for a practical use are suggested. Route-perturb and route-improvement method for the neighborhood generation is proposed. Performances are compared with other heuristics appeared in the literature using the bench-mark data set modified to be fit to the model. It is shown that the suggested heuristic gives a good solution in a short computation time.

AB - This paper studies the vehicle routing problem with due times. The vehicles are supposed to visit customers within the due times, and a penalty cost is imposed in case the vehicle arrives past the due times. The objective is to minimize the weighted sum of the traveling time of vehicles and the tardiness of the service customers receive. A mixed integer programming formulation and a heuristic based on the tabu search for a practical use are suggested. Route-perturb and route-improvement method for the neighborhood generation is proposed. Performances are compared with other heuristics appeared in the literature using the bench-mark data set modified to be fit to the model. It is shown that the suggested heuristic gives a good solution in a short computation time.

UR - http://www.scopus.com/inward/record.url?scp=38849183425&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38849183425&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2007.08.004

DO - 10.1016/j.cie.2007.08.004

M3 - Article

AN - SCOPUS:38849183425

VL - 54

SP - 421

EP - 431

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 3

ER -