2018
DOI: 10.1016/j.trpro.2018.09.018
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Easy-to-Implement Mixed-Integer Linear Programs for the Traveling Salesperson Problem with Time Windows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 11 publications
0
9
0
Order By: Relevance
“…On the basis of meeting the community needs to the maximum extent, the driving cost of vehicles can be reduced through reasonable planning routing. In our study, cost types are considered including fixed cost, vehicle cost, time cost, and transportation cost [41]. is paper studies the optimal routing planning of M HHC stations and N demand communities and establishes an optimization model of HHC.…”
Section: Basic Modelmentioning
confidence: 99%
“…On the basis of meeting the community needs to the maximum extent, the driving cost of vehicles can be reduced through reasonable planning routing. In our study, cost types are considered including fixed cost, vehicle cost, time cost, and transportation cost [41]. is paper studies the optimal routing planning of M HHC stations and N demand communities and establishes an optimization model of HHC.…”
Section: Basic Modelmentioning
confidence: 99%
“…Overlapping windows are mentioned also in [39], but they are taken into account by using a simple scoring policy based on experience of practitioners, with no guarantee on the violation of the corresponding working times of operators or vehicles. Lastly, [25] presents mixed-integer linear programs to take into account possibly overlapping time windows, and points out that, in the absence of overlaps, the number of variables and constraints can be conveniently reduced, thus simplifying the problem to be solved. As regards the presence of multiple competing objectives, some results are available in the literature [5,12,38,41,49].…”
Section: Literature Reviewmentioning
confidence: 99%
“…• Reference [10] focuses on providing competitive MILP formulations for the Traveling Salesperson Problem with Time Windows.…”
Section: Related Workmentioning
confidence: 99%
“…• Local+TSPTW-improvement: After the Local Search heuristic we additionally use MILPs proposed in our previous paper [10] for optimizing all single tours that have changed since the last improvement step. In [10] we motivated and analyzed the Traveling Salesperson Problem with Time Windows (TSPTW) that is a subproblem of the cVRPTW as each tour of the delivery schedule corresponds to a TSPTW instance. Optimizing the single tours of a schedule to optimality has been proven to be critical to ensure driver satisfaction.…”
Section: Algorithmic Strategiesmentioning
confidence: 99%