2017
DOI: 10.1007/978-3-319-59776-8_21
|View full text |Cite
|
Sign up to set email alerts
|

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…The importance of the MTSP as an NP-complete problem came from the vital role which is played in different realtime problems. Solving the MTSP requires transforming the problem into a single TSP or relaxation problem to reduce some of the constraints [3,5].…”
Section: Previous Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The importance of the MTSP as an NP-complete problem came from the vital role which is played in different realtime problems. Solving the MTSP requires transforming the problem into a single TSP or relaxation problem to reduce some of the constraints [3,5].…”
Section: Previous Workmentioning
confidence: 99%
“…Therefore, researchers proposed several non-deterministic approaches either approximation algorithms or heuristic approaches [1]. TSP has several variants which are discussed in the literature review such as TSP with the Drone (TSP-D) [2], TSP with Time Windows (TSPTW) [3], and Multiple Traveling Salesmen Problem (MTSP) [4].…”
Section: Introductionmentioning
confidence: 99%
“…Linear programming approaches have also been used to solve TSP. In [4], a time‐expanded integer linear programming formulation has been proposed. The approach works with carefully designed partially time‐expanded networks, which are used to produce upper as well as lower bounds, and which are iteratively refined until the convergence.…”
Section: Related Workmentioning
confidence: 99%
“…The problem of image sorting is quite similar to the well‐studied ‘travelling salesman problem’ (TSP) [4–6]. TSP refers to the problem of finding the ideal and minimum route for the salesman who, starting at his starting point, should visit a number of cities and then return to the original location so that the total distance of his trip is the minimum possible and with the limitation to visit each city once.…”
Section: Introductionmentioning
confidence: 99%
“…This dilemma can be mitigated by not explicitly creating the whole discretized network. Instead, it is in some cases possible to compute optimal paths using only a partial network (Fischer and Helmberg, 2014;Boland et al, 2017). In any case, if an SPPRC shall be solved exactly and discretization is not an option, one possibility is to formulate it as a mixed-integer program and solve it with LP-based methods.…”
Section: Introductionmentioning
confidence: 99%