Subscribe Now Subscribe Today
Science Alert
 
Blue
   
Curve Top
Journal of Applied Sciences
  Year: 2006 | Volume: 6 | Issue: 9 | Page No.: 1969-1973
DOI: 10.3923/jas.2006.1969.1973
 
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Nonlinearly Penalized Delays

Kaddour Sadouni

Abstract:
This study presents a tabu search heuristic for solving Heterogeneous Fleet Vehicle Routing Problems with Time windows and Nonlinearly Penalized Delays (HFVRPTWNLPD) in distribution systems. The HFVRPTWNPD can be justified in practice and includes the well-known Vehicle Routing Problem with time windows (VRPTW) as a special case. For HFVRPTWNPD problems the objective cost function is expressed as the weighted sum of the number vehicles used, the total distance travelled and the nonlinear penalty function of delays. Preliminary computational results on well known benchmark test problems indicate that our heuristic is robust and can handle medium to large problems.
PDF Fulltext XML References Citation Report Citation
 RELATED ARTICLES:
  •    A Modified Artificial Bee Colony Algorithm for Vehicle Routing Problems with Time Windows
  •    A New Machine Learning based Approach for Tuning Metaheuristics for the Solution of Hard Combinatorial Optimization Problems
How to cite this article:

Kaddour Sadouni , 2006. Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Nonlinearly Penalized Delays. Journal of Applied Sciences, 6: 1969-1973.

DOI: 10.3923/jas.2006.1969.1973

URL: https://scialert.net/abstract/?doi=jas.2006.1969.1973

COMMENT ON THIS PAPER
 
 
 

 

 
 
 
 
 
 
 
 
 

 
 
 
 
 
 
 

Curve Bottom