Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm

Yan Sun, Danzhu Wang, Maoxiang Lang, Xuesong Zhou

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers with fixed demands and service time windows have to be served in a sequence of service trips which originate and terminate at a distribution centre, (b) the service trips will be assigned to a fleet of vehicles with fixed capacities and maximum allowable working durations each day, (c) each vehicle can perform more than one service trip, and (d) the link travel times varies with vehicle travel speeds which results from congestion effects during different time of day in urban areas. The aim of the TDMTVRP model is to find an optimal strategy to minimize the vehicle utilized times and their total scheduling time. A continuous piecewise linear function is first introduced to represent the variation and transition of vehicle travel speeds with the time of the day instead of the traditional staircase travel speed function. Then a hybrid solution algorithm is developed by using the nearest-neighbour heuristic to obtain an initial solution and Tabu search heuristic to search the optimal solution. Finally, an experimental case study is used to verify the feasibility of the proposed model and algorithm. The experimental results indicate that compared with the CVRPTW (capacitated vehicle routing problem with time windows) model, the TDMTVRP model proposed in this study can both decrease the vehicle utilized times dramatically and shorten the vehicle travel distances slightly in dealing with the vehicle routing problem.

Original languageEnglish (US)
Pages (from-to)1-12
Number of pages12
JournalCluster Computing
DOIs
StateAccepted/In press - Mar 29 2018

Fingerprint

Vehicle routing
Tabu search
Travel time
Scheduling

Keywords

  • Multi-trip
  • Nearest-neighbour heuristic
  • Tabu search
  • Time window
  • Time-dependent
  • Vehicle routing problem

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications

Cite this

Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm. / Sun, Yan; Wang, Danzhu; Lang, Maoxiang; Zhou, Xuesong.

In: Cluster Computing, 29.03.2018, p. 1-12.

Research output: Contribution to journalArticle

@article{aba4d4a22700489397a1bc37268fcfc1,
title = "Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm",
abstract = "In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers with fixed demands and service time windows have to be served in a sequence of service trips which originate and terminate at a distribution centre, (b) the service trips will be assigned to a fleet of vehicles with fixed capacities and maximum allowable working durations each day, (c) each vehicle can perform more than one service trip, and (d) the link travel times varies with vehicle travel speeds which results from congestion effects during different time of day in urban areas. The aim of the TDMTVRP model is to find an optimal strategy to minimize the vehicle utilized times and their total scheduling time. A continuous piecewise linear function is first introduced to represent the variation and transition of vehicle travel speeds with the time of the day instead of the traditional staircase travel speed function. Then a hybrid solution algorithm is developed by using the nearest-neighbour heuristic to obtain an initial solution and Tabu search heuristic to search the optimal solution. Finally, an experimental case study is used to verify the feasibility of the proposed model and algorithm. The experimental results indicate that compared with the CVRPTW (capacitated vehicle routing problem with time windows) model, the TDMTVRP model proposed in this study can both decrease the vehicle utilized times dramatically and shorten the vehicle travel distances slightly in dealing with the vehicle routing problem.",
keywords = "Multi-trip, Nearest-neighbour heuristic, Tabu search, Time window, Time-dependent, Vehicle routing problem",
author = "Yan Sun and Danzhu Wang and Maoxiang Lang and Xuesong Zhou",
year = "2018",
month = "3",
day = "29",
doi = "10.1007/s10586-018-2637-6",
language = "English (US)",
pages = "1--12",
journal = "Cluster Computing",
issn = "1386-7857",
publisher = "Kluwer Academic Publishers",

}

TY - JOUR

T1 - Solving the time-dependent multi-trip vehicle routing problem with time windows and an improved travel speed model by a hybrid solution algorithm

AU - Sun, Yan

AU - Wang, Danzhu

AU - Lang, Maoxiang

AU - Zhou, Xuesong

PY - 2018/3/29

Y1 - 2018/3/29

N2 - In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers with fixed demands and service time windows have to be served in a sequence of service trips which originate and terminate at a distribution centre, (b) the service trips will be assigned to a fleet of vehicles with fixed capacities and maximum allowable working durations each day, (c) each vehicle can perform more than one service trip, and (d) the link travel times varies with vehicle travel speeds which results from congestion effects during different time of day in urban areas. The aim of the TDMTVRP model is to find an optimal strategy to minimize the vehicle utilized times and their total scheduling time. A continuous piecewise linear function is first introduced to represent the variation and transition of vehicle travel speeds with the time of the day instead of the traditional staircase travel speed function. Then a hybrid solution algorithm is developed by using the nearest-neighbour heuristic to obtain an initial solution and Tabu search heuristic to search the optimal solution. Finally, an experimental case study is used to verify the feasibility of the proposed model and algorithm. The experimental results indicate that compared with the CVRPTW (capacitated vehicle routing problem with time windows) model, the TDMTVRP model proposed in this study can both decrease the vehicle utilized times dramatically and shorten the vehicle travel distances slightly in dealing with the vehicle routing problem.

AB - In this study, we explore a time-dependent multi-trip vehicle routing problem (TDMTVRP) with an improved travel speed model. This problem is set in a scenario that (a) a set of customers with fixed demands and service time windows have to be served in a sequence of service trips which originate and terminate at a distribution centre, (b) the service trips will be assigned to a fleet of vehicles with fixed capacities and maximum allowable working durations each day, (c) each vehicle can perform more than one service trip, and (d) the link travel times varies with vehicle travel speeds which results from congestion effects during different time of day in urban areas. The aim of the TDMTVRP model is to find an optimal strategy to minimize the vehicle utilized times and their total scheduling time. A continuous piecewise linear function is first introduced to represent the variation and transition of vehicle travel speeds with the time of the day instead of the traditional staircase travel speed function. Then a hybrid solution algorithm is developed by using the nearest-neighbour heuristic to obtain an initial solution and Tabu search heuristic to search the optimal solution. Finally, an experimental case study is used to verify the feasibility of the proposed model and algorithm. The experimental results indicate that compared with the CVRPTW (capacitated vehicle routing problem with time windows) model, the TDMTVRP model proposed in this study can both decrease the vehicle utilized times dramatically and shorten the vehicle travel distances slightly in dealing with the vehicle routing problem.

KW - Multi-trip

KW - Nearest-neighbour heuristic

KW - Tabu search

KW - Time window

KW - Time-dependent

KW - Vehicle routing problem

UR - http://www.scopus.com/inward/record.url?scp=85044544999&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044544999&partnerID=8YFLogxK

U2 - 10.1007/s10586-018-2637-6

DO - 10.1007/s10586-018-2637-6

M3 - Article

AN - SCOPUS:85044544999

SP - 1

EP - 12

JO - Cluster Computing

JF - Cluster Computing

SN - 1386-7857

ER -