  


Efficient and EasytoImplement MixedInteger Linear Programs for the Traveling Salesperson Problem with Time Windows
Philipp Hungerländer (philipp.hungerlaenderaau.at) Abstract: The NPhard Traveling Salesperson Problem with Time Windows (TSPTW) is concerned with visiting a given set of customers within their assigned time windows such that a given objective function is minimized. In contrast to traditional problems, where each customer gets assigned its own time window, in modern webbased systems the supplying company defines a set of time windows, from which the customer can then choose one of them. Therefore, by design, typically several customers are assigned to the same time window. Motivated by this de velopment and the fact that practitioners seek for formulations that can easily and quickly be implemented, we introduce two mixedinteger linear programs (MILPs) for the asymmetric TSPTW that allow to computationally exploit the structure of the time windows and are also applicable for asymmetric travel times, for which the triangle inequalities do not hold. In particular we analyze and exploit the relations between time windows in order to reduce the number of binary variables in our MILPs. For the special case of nonoverlapping time windows we can further simplify the constraint set and also reduce the number of continuous variables needed. Finally, we demonstrate the efficiency of our MILPs on benchmark instances related to an online shopping application Keywords: Traveling Salesperson problem; time windows; mixedinteger linear programs; easytoimplement; exploiting structure; preprocessing Category 1: Integer Programming ((Mixed) Integer Linear Programming ) Category 2: Applications  OR and Management Sciences (Transportation ) Citation: Download: [PDF] Entry Submitted: 02/12/2018 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  