The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization

@article{LpezIbez2013TheTS,
  title={The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization},
  author={Manuel L{\'o}pez-Ib{\'a}{\~n}ez and Christian Blum and Jeffrey W. Ohlmann and Barrett W. Thomas},
  journal={Appl. Soft Comput.},
  year={2013},
  volume={13},
  pages={3806-3815}
}
In combinatorial optimization it is not rare to find problems whose mathematical structure is nearly the same, differing only in some aspect related to the motivating application. [...] Key Result Indeed, the results show that the algorithms that we adapt from travel-time minimization to makespan minimization significantly outperform the existing state-of-the-art approaches for makespan minimization.Expand
The traveling salesman problem with time windows in postal services
TLDR
This article presents a multi-objective approach based on a constraint programming formulation of the problem which allows to balance the optimisation of both human and material resources and introduces a cluster/solve/sequence approach that relies on a mathematical programming formulation to sequence the customer visits in the final step. Expand
Makespan Optimization for the Travelling Salesman Problem with Time Windows Using Differential Evolution Algorithm
Travelling salesman problem with time windows (TSPTW) is a well-known NP-hard problem in which the objective is to minimize the total travel cost or makespan when visiting each of a set of customersExpand
A General Variable Neighborhood Search Heuristic for the Traveling Salesman Problem with Time Windows under Completion Time Minimization
We propose a two-phase general variable neighborhood search (GVNS) heuristic to solve the traveling salesman problem with time windows (TSPTW) when the objective is to minimize the completion timeExpand
Evaluation of the size of time windows for the travelling salesman problem in delivery operations
TLDR
The results of this study indicate that a general guideline for business is to allow customers to choose a time window size that is within the cost limit but is sufficiently small to maximize customer satisfaction and optimize delivery routes. Expand
Formulations for Minimizing Tour Duration of the Traveling Salesman Problem with Time Windows
TLDR
For minimizing tour duration, a polynomial size integer linear programming formulation for symmetric and asymmetric TSPTW is proposed separately and optimal solutions of the most of the instances up to 232 nodes are obtained within seconds. Expand
Balanced Task Allocation by Partitioning the Multiple Traveling Salesperson Problem
TLDR
AHP improves a partitions of a graph using a series of transfer and swap operations which are guaranteed to improve the solution's quality and is used as an initial partition for an algorithm, AHP-mTSP, which solves the combined task assignment and routing problems to near optimality. Expand
Computational Intelligence and Combinatorial Optimization Problems in Transportation Science
TLDR
This study provides a comprehensive review of various solution algorithms that have been proposed in literature as possible solutions to many of the complex issues surrounding routing problem management and presents formulation schemes related to basic routing problems and their extensions. Expand
Implementations of TSP-VRP Variants for Distribution Problem
Problems of distributing goods from one or more depots to customers generally become substantial problems for many companies or factories. Those distribution problems have been modeled using TSPExpand
An Improved Augmented $\varepsilon$ -Constraint and Branch-and-Cut Method to Solve the TSP With Profits
TLDR
A new method, AUGMECON2-BC, was developed incorporating an improved version of the augmented $\varepsilon $ -constraint and a Branch and Cut algorithm and it is able to produce the exact Pareto front for the TSPP. Expand
Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times
TLDR
This paper presents an optimal solution approach comprised of three main steps: calculating the optimal amount of total resource required, constructing the tour, and assigning the optimal resource to each connection between vertices using the equivalent load method. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 30 REFERENCES
A modified ant colony system for solving the travelling salesman problem with time windows
TLDR
This study develops a modified ant algorithm, named ACS-TSPTW, based on the ACO technique, which is comparable to that of ACS-Time, an existing ACO scheme for solving the TSPTW problem. Expand
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
TLDR
Computational results for real-world instances with up to 233 nodes are reported, showing that a new model presented in a companion paper outperforms the other two models considered – at least for a special application – and that the heuristics provide acceptable solutions. Expand
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictiveExpand
Beam-ACO for the travelling salesman problem with time windows
TLDR
An extensive experimental evaluation shows that the proposed Beam-ACO algorithm is currently a state-of-the-art technique for the travelling salesman problem with time windows when travel-cost optimization is concerned. Expand
Technical Note - An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
TLDR
The dual of the formulation is shown to be a disjunctive graph model, which is well known from scheduling theory, and a longest path algorithm is used to obtain bounding information for subproblems in a branch and bound solution procedure. Expand
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
TLDR
New elimination tests are presented which greatly enhance the performance of a relatively well established dynamic programming approach and its application to the minimization of the total traveling cost for the traveling salesman problem with time windows. Expand
A Hybrid Exact Algorithm for the TSPTW
TLDR
It is shown with extensive computational results that the synergy between Operations Research optimization techniques embedded in global constraints, and Constraint Programming constraint solving techniques, makes the resulting framework effective in the TSPTW context also if these results are compared with state-of-the-art algorithms from the literature. Expand
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study
TLDR
An implementation of the dynamic-programming algorithm for the general case when the integerk is replaced with city-specific integersk( j),j = 1, . Expand
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
  • M. Solomon
  • Mathematics, Computer Science
  • Oper. Res.
  • 1987
TLDR
This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results. Expand
A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
TLDR
A new two-commodity flow formulation for the traveling salesman problem, where each commodity corresponds to a resource that is either distributed or picked-up along the tour of all nodes. Expand
...
1
2
3
...