EU/ME - the metaheuristics community

  • Increase font size
  • Default font size
  • Decrease font size

Omega 40(3), 2012

E-mail Print PDF

An investigation into the vehicle routing problem with time windows and link capacity constraints

by  Hong Ma, Brenda Cheang, Andrew Lim, Lei Zhang and  Yi Zhu

Abstract

In this work, we investigate a new, yet practical, variant of the vehicle routing problem called the vehicle routing problem with time windows and link capacity constraints (VRPTWLC). The problem considers new constraints imposed on road links with regard to vehicle passing tonnage, which is motivated by a business project with a Hong Kong transportation company that transports hazardous materials (hazmats) across the city and between Hong Kong and mainland China. In order to solve this computationally challenging problem, we develop a tabu search heuristic with an adaptive penalty mechanism (TSAP) to help manage the company's vehicle fleet. A new data set and its generation scheme are also presented to help validate our solutions. Extensive computational experiments are conducted, showing the effectiveness of the proposed solution approach.

Keywords: Fleet management; Vehicle routing; Link capacity; Hazardous materials; Heuristic; Tabu search.

Read this article now.

@article{ma.cheang.ea:2012,
  title = "An investigation into the vehicle routing problem with time windows and link capacity constraints",
  author = "Hong Ma and Brenda Cheang and Andrew Lim and Lei Zhang and Yi Zhu",  journal = "Omega",
  volume = "40",
  number = "3",
  pages = "336 - 347",
  year = "2012",
  doi = "10.1016/j.omega.2011.08.003"
}

 

 

Last Updated on Friday, 07 October 2011 06:09  

Newsflash

EU/ME 2017

Submit now your abstract.

Metaheuristics Events

<<  May 2017  >>
 Mo  Tu  We  Th  Fr  Sa  Su 
  1  2  3  4  5  6  7
  8  91011121314
152021
25262728
293031    

Who's Online

We have 66 guests online