|
|||||
|
|
An investigation into the vehicle routing problem with time windows and link capacity constraints |
|
| Authors: | Hong MaBrenda Cheang Andrew Lim Lei ZhangYi Zhu |
| Institution: | a Department of Management Science and Engineering, School of Management, Zhejiang University, 866 Yuhangtang Road, Hangzhou, China b School of Management, Huazhong University of Science and Technology, 1037 Luoyu Road, Wuhan, China c Department of Industrial and Manufacturing Systems Engineering, University of Hong Kong, Pokfulam Road, Hong Kong d Department of Management Sciences, College of Business, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong e Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, New York, USA f Synopsis Inc., 700 Middlefield Rd., Mountain View, California, USA |
| 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 |
| 本文献已被 ScienceDirect 等数据库收录！ | |