Mathematical programming techniques for the solution of hard combinatorial optimization problems arising in transportation

用于解决运输中出现的硬组合优化问题的数学编程技术

• 批准号: 435824-2013
• 负责人: ContardoVera, Claudio
• 金额: $ 1.6万
• 依托单位: Université du Québec à Montréal
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2016
• 资助国家: 加拿大
• 起止时间: 2016-01-01 至 2017-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=596771
• 关键词: Mathematical; programming; techniques; solution; hard

This research plan is intended to study several classes of vehicle routing problems with synchronization constraints, to propose modeling approaches and efficient exact and heuristic algorithms. Notably, we consider vehicle routing problems with transfers and multiple-echelon vehicle routing problems. These classes of vehicle routing problems share a common characteristic: either because of synchronization at transfer points or consolidation points, the underlying timing issue plays a crucial role in determining the efficiency of a given solution. Indeed, if the timing issue is not properly handled, one may end with a possibly cheaper solution in terms of traveling time, but much more expensive in terms of total ride time (which includes the dead times due to improper synchronization).

该研究计划旨在研究具有同步约束的几类车辆路由问题，以提出建模方法以及有效的精确和启发式算法。值得注意的是，我们考虑了转移和多回波车辆路由问题的车辆路由问题。这些类别的车辆路由问题具有共同的特征：由于传输点同步或巩固点，基本的时序问题在确定给定解决方案的效率方面起着至关重要的作用。的确，如果定时问题无法正确处理，则可能以更便宜的解决方案在旅行时间方面结束，但是就总乘车时间而言，更昂贵（包括由于不正确的同步而导致的死时间）。