A heuristic for the vehicle routing problem with due times

Authors:
Kyung Hwan Kang;Byung Ki Lee;Yoon Ho Lee;Young Hoon Lee
Affiliations:
Department of Information and Industrial Engineering, Yonsei University, 134 Shinchon-Dong, Seodaemun-Gu, Seoul 120-749, Republic of Korea;System Technology Part, Dongbu Electronics, Inc., 222-1, Dodang-Dong, Wonmi-Gu, Bucheon, Gyeonggi-Do 420-712, Republic of Korea;Department of Information and Industrial Engineering, Yonsei University, 134 Shinchon-Dong, Seodaemun-Gu, Seoul 120-749, Republic of Korea;Department of Information and Industrial Engineering, Yonsei University, 134 Shinchon-Dong, Seodaemun-Gu, Seoul 120-749, Republic of Korea
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 4
Cited 3

A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds

Computers and Industrial Engineering
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows

Computers and Operations Research
A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows

Computers and Operations Research
The vehicle routing problem with flexible time windows and traveling times

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University

Hybrid heuristic for vehicle routing problem with due times

CAR'10 Proceedings of the 2nd international Asia conference on Informatics in control, automation and robotics - Volume 1
A heuristic method for the inventory routing problem with time windows

Expert Systems with Applications: An International Journal
Data envelopment analysis for evaluating the efficiency of genetic algorithms on solving the vehicle routing problem with soft time windows

Computers and Industrial Engineering

Quantified Score

Hi-index	0.02

Visualization

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.