Earticle

초록

영어

The time dependent vehicle routing problem (TDVRP) is defined as a vehicle fleet of fixed capacities serves customers of fixed demands from a central depot with consideration of road networks conditions. The travel time between two customers or between customer and the depot depends on the distance of the two points and time of a day. A mathematical model is formulated for the TDVRP problem and a simulated annealing (SA) based improvement method is proposed for solving it. The main objective is to minimize the number of vehicles and the second objective is to minimize the total travel distance of the vehicles. The proposed approach was tested on the 56 test problems with 100 customers from Figliozzi’s benchmark, and results show that the improvement metaheuristic could get better solutions than Figliozzi’s algorithm in the different time dependent speeds function within an accepted computational time.

목차

Abstract
 1. Introduction
  1.1. Time Dependent Vehicle Routing Problem
  1.2. Representation of Dynamic Network
  1.3. Descriptions and Mathematical Models of the TDVRP
 2. Proposed Metaheuristic for the TDVRP
  2.1. Simulated Annealing
  2.2. Initial Solution Generation
  2.3. Local Search Method
  2.4. Parallelization of Simulated Annealing
  2.5 Algorithm Procedure and Pseudocode
 3. Computational Study
  3.1. Testing Environment and Test Problems
  3.2. Parameters Setting
  3.3. Algorithm Performance Analysis
 4. Conclusions and Future Research Directions
 Acknowledgments
 References

키워드

저자

• Qingguo Jiang [ School of Electrical & Electronic Engineering, North China Electric Power University, Beijing 102206, China ]
• Wei Shen [ School of Engineering&Technology, Northeast Forestry University, Harbin 150040, China ]
• Chao Wang [ School of Economics and Management, Beijing University of Technology, Beijing, 100124, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Smart Home

• 간기

  격월간

• pISSN

  1975-4094

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605