Module org.maxicp

Package org.maxicp.cp.examples.raw.tsptw

Class TSPTWSeqVar

java.lang.Object

org.maxicp.cp.examples.raw.tsptw.TSPTWSeqVar

public class TSPTWSeqVar
extends Object

The Traveling Salesman Problem with Time Windows (TSPTW) is a variation of the classic Traveling Salesman Problem (TSP) in which each city must be visited within a specific time interval. More exactly, each city i is associated with a time window [a_i, b_i], meaning the salesman must arrive at that city no earlier than a_i and no later than b_i. If the salesman arrives early, they may wait; arriving after b_i makes the solution infeasible. The objective is to minimize the total travel time. This model makes use of the successor variables. See: Augustin Delcluse, Pierre Schaus, Pascal Van Hentenryck Sequence Variables: A Constraint Programming Computational Domain for Routing and Sequencing https://pschaus.github.io/assets/publi/seqvars.pdf Instances from: https://lopez-ibanez.eu/tsptw-instances

Constructor Summary

Constructors

Constructor	Description
TSPTWSeqVar()

Method Summary

Modifier and Type	Method	Description
static void	main(String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

TSPTWSeqVar

public TSPTWSeqVar()

Method Details

main

public static void main(String[] args)