Scholarlink

This work introduces the Trigger Arc Travelling Salesman Problem (TATSP), a variant of the classical TSP that models dynamic arc costs influenced by the solution’s path. It is presented a real-world application that can be modelled through the TATSP, aiming to optimise operations in warehouses with compactable storage systems. An Integer Linear Programming model (ILP) is described and implemented. Finally, the experimental results obtained from a set of generated instances are discussed.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Trigger Arc TSP: Optimise the Picking Process in Warehouses with Compactable Storage Systems

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Carmine Cerrone,
  • Maria Truvolo,
  • Raffaele Dragone,
  • Raffaele Battaglia

摘要

This work introduces the Trigger Arc Travelling Salesman Problem (TATSP), a variant of the classical TSP that models dynamic arc costs influenced by the solution’s path. It is presented a real-world application that can be modelled through the TATSP, aiming to optimise operations in warehouses with compactable storage systems. An Integer Linear Programming model (ILP) is described and implemented. Finally, the experimental results obtained from a set of generated instances are discussed.