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
• 财政年份: 2013
• 资助国家: 加拿大
• 起止时间: 2013-01-01 至 2014-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=533334
• 关键词: 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).

本研究计划旨在研究几类具有同步约束的车辆路径问题，提出建模方法和高效的精确启发式算法。值得注意的是，我们考虑了换乘车辆路径问题和多梯队车辆路径问题。这些类别的车辆路径问题有一个共同的特征：由于转运点或合并点的同步，潜在的计时问题在确定给定解决方案的效率方面起着至关重要的作用。事实上，如果计时问题处理不当，最终可能会得到一种在行驶时间方面可能更便宜的解决方案，但在总行驶时间方面（包括由于不正确的同步而导致的死区时间）却要昂贵得多。