On-Line Vehicle Routing with Time Windows: Optimization-Based Heuristics Approach for Freight Demands Requested in Real-Time
1998 ◽
Vol 1617
(1)
◽
pp. 171-178
◽
Keyword(s):
The problem of the on-line version of the vehicle routing problem with time windows (VRPTW) differs from the traditional off-line problem in the dynamical arrival of requests and the execution of the partial tour during the run time. The study develops an on-line optimization-based heuristic that combined the concepts of the “on-line algorithm,” “anytime algorithm,” and local search heuristics to solve the on-line version of VRPTW. The solution heuristic is evaluated with modified Solomon’s problems. By comparing with these benchmark problems, the different results between on-line and off-line algorithms are indicated.
Keyword(s):
2016 ◽
Vol 49
(12)
◽
pp. 1198-1203
◽
Keyword(s):
1970 ◽
Vol 24
(4)
◽
pp. 343-351
◽
2015 ◽
Vol 56
◽
pp. 93-109
◽
Keyword(s):
2012 ◽
Vol 48
(3)
◽
pp. 616-636
◽
Keyword(s):
2021 ◽
Keyword(s):