A GRASP × ILS for the vehicle routing problem with time windows, synchronization and precedence constraints

作者：

Highlights：

• New routing problem encountered in the field of Home Health Care is studied.

• Two types of synchronization constraints within a single model are modeled.

• Simultaneously synchronization constraints and patient preferences are handled.

• Our meta-heuristic is able to solve to optimality 23 of 37 benchmark instances.

• Three upper bounds given by Cplex Solver are improved.

摘要

•New routing problem encountered in the field of Home Health Care is studied.•Two types of synchronization constraints within a single model are modeled.•Simultaneously synchronization constraints and patient preferences are handled.•Our meta-heuristic is able to solve to optimality 23 of 37 benchmark instances.•Three upper bounds given by Cplex Solver are improved.

论文关键词：Vehicle routing problem,Synchronization constraints,Precedence constraints,MILP,Metaheuristic

论文评审过程：Received 4 January 2016, Revised 31 August 2016, Accepted 1 September 2016, Available online 6 September 2016, Version of Record 19 September 2016.

论文官网地址：https://doi.org/10.1016/j.eswa.2016.09.002