详情

Dynamic (Time Dependent) Green Vehicle Routing Problem

项目名称：	Dynamic (Time Dependent) Green Vehicle Routing Problem
摘要：	Traditionally, vehicle routing plans are based on the deterministic information about demands, vehicle locations, and travel times on the roads. Especially, they consider that the travel times between nodes depend on distances. However, travel times fluctuate due to a variety of factors, such as accidents, traffic conditions, weather conditions, etc. Ignoring travel time variation can result in route plans that take the vehicles into congested urban traffic conditions. The problem considered in this research is the time-dependent vehicle routing problem (TDVRP), that is an extension of the vehicle routing problem that has deterministic travel times between demand nodes. This problem is defined as follows. �A vehicle fleet of fixed capacities has to serve customers of fixed demands from a central depot. Customers must be assigned to vehicles and the vehicles routed so that the total time spent on the route is minimized. The travel time between two customers or a customer and depot depends on the distance between the points and the time of day. Time windows for serving the customers may also be given as well as a maximum allowable duration of each route (work day of the driver).�
状态：	Completed
资金：	54000
资助组织：	U.S. Department of Transportation
管理组织：	Urban Mobility & Equity Center
项目负责人：	Tucker-Thomas, Dawn
执行机构：	University of Maryland, College Park
主要研究人员：	Haghani, Ali
开始时间：	20170601
预计完成日期：	20180531
实际结束时间：	20190205