.png){kind=icon}
.png){kind=icon}
Return
VRP WITH TIME WINDOWS AND OTHER TIME CONSTRAINTS-MODELING AND SOLUTION APPROACHES
.png){kind=icon}
PRE
AI
M
K
DOI：10.17270/J.LOG.001348.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Background: The paper is devoted to the Vehicle Routing Problem with various constraints involving time, including time exclusions. This includes ordinary time windows and the relations between them, excluding the possibility that two or more vehicles meet at the same route point simultaneously. This responds to one of the problems reported by respondents in previous research. Methods: First, the mathematical model of the problem is introduced, based on the idea of transforming it into a multicommodity flow. This concept has been previously studied in the literature for simpler variants of routing problems. Subsequently, utilizing the model that is developed, a heuristic is presented for resolving the issue. Results: Several numerical experiments were performed, and the newly proposed method was tested on randomly generated test problems. The method's performance was measured by comparing the number of routes assigned to all the vehicles. Additionally, several theoretical results are presented to confirm the efficiency of the proposed approach. Conclusions: The problem under consideration is too complex to solve exactly; therefore, approximate solution methods are a viable alternative. The proposed local heuristic enables the quick solution of large instances; however, several limitations could be overcome by using more globally focused methods, such as Variable Neighborhood Search.
Keywords:
exclusionary constraints
transportation
vehicle routing
time windows
Journal
L
IF:
1
Papers:
23
Citations:
402
Organization
Cited Papers