Package org.ddolib.examples.tsptw
package org.ddolib.examples.tsptw
This package implements the acs, astar and ddo models for the Traveling Salesman Problem with Time Window (TSPTW).
The TSPTW (TSP with Time Windows) is
to find the shortest possible route for a salesman to visit
a set of customers (or nodes) exactly once
and return to the starting point, while respecting
specified time windows for each customer.
-
ClassDescriptionRepresents a time window with a start and end time.The Traveling Salesman Problem with Time Windows (TSP with Time Windows) with Acs.The Traveling Salesman Problem with Time Windows (TSP with Time Windows) with AsTar.The Traveling Salesman Problem with Time Windows (TSP with Time Windows) with Anytime Weighted A* (AWA*).The Traveling Salesman Problem with Time Windows (TSP with Time Windows) with Ddo.Dominance relation for the Traveling Salesman Problem with Time Windows (TSPTW).Key used for dominance checking in the Traveling Salesman Problem with Time Windows (TSPTW).Implementation of a fast lower bound for the Traveling Salesman Problem with Time Windows (TSPTW).Entry point for solving the Traveling Salesman Problem with Time Windows (TSPTW) using a Large Neighborhood Search (LNS) approach.Class representing an instance of the Traveling Salesman Problem with Time Windows (TSPTW).Ranking class for states in the Traveling Salesman Problem with Time Windows (TSPTW).Relaxation class for the Traveling Salesman Problem with Time Windows (TSPTW).Represents a state in the dynamic programming model for the Traveling Salesman Problem with Time Windows (TSPTW).Heuristic for computing the width of a layer in the dynamic programming model for the Traveling Salesman Problem with Time Windows (TSPTW).