Scholarlink

<p>Synchronization of operations is key in today’s logistics systems where quick responsiveness in supply-chains is rewarded. In this article, we study the traveling salesman problem with synchronized visits and blocking, which arises when creating a set of transportation routes in a traveling tourist problem. In this problem, a fleet of vehicles has to visit a predefined set of nodes, each with a minimum required capacity and a maximum allowed capacity that has to be fulfilled simultaneously. This feature enforces vehicles’ spatial and temporal synchronization constraints. The problem calls for determining a set of routes that minimize the total time so that each vehicle visits each node and obeys minimum and maximum nodes capacities at all times. We propose a mathematical integer programming (MIP) model based on the discretization of the planning horizon and a constructive heuristic to solve the problem for larger instances. Our MIP model manages to solve 10 out of the 28 instances optimally within three hours, while our proposed heuristic managed to obtain efficient solutions to all instances within seconds. The methodologies can be embedded in recommender systems and help travel agencies to develop efficient daily tours packages.</p>

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

Traveling salesman problem with synchronized visits and blocking

  • 期刊论文

  • 发表日期：

    2025年9月1日

查看全文
  • Maichel M. Aguayo,
  • Rosa Medina Durán,
  • Daniel A. Neira,
  • Camila Rebolledo D.

摘要

Synchronization of operations is key in today’s logistics systems where quick responsiveness in supply-chains is rewarded. In this article, we study the traveling salesman problem with synchronized visits and blocking, which arises when creating a set of transportation routes in a traveling tourist problem. In this problem, a fleet of vehicles has to visit a predefined set of nodes, each with a minimum required capacity and a maximum allowed capacity that has to be fulfilled simultaneously. This feature enforces vehicles’ spatial and temporal synchronization constraints. The problem calls for determining a set of routes that minimize the total time so that each vehicle visits each node and obeys minimum and maximum nodes capacities at all times. We propose a mathematical integer programming (MIP) model based on the discretization of the planning horizon and a constructive heuristic to solve the problem for larger instances. Our MIP model manages to solve 10 out of the 28 instances optimally within three hours, while our proposed heuristic managed to obtain efficient solutions to all instances within seconds. The methodologies can be embedded in recommender systems and help travel agencies to develop efficient daily tours packages.