Modeling and solving the non-smooth arc routing problem with realistic soft constraints

作者：

Highlights：

• A realistic version of the arc routing problem with soft constraints is analyzed.

• Soft constraints might cause non-smooth objective functions challenging to optimize.

• A novel mathematical model for the non-smooth arc routing problem is introduced.

• A heuristic combining biased randomization with iterated local search is proposed.

• We improve previous works, a linearized version of the problem is solved with CPLEX.

摘要

•A realistic version of the arc routing problem with soft constraints is analyzed.•Soft constraints might cause non-smooth objective functions challenging to optimize.•A novel mathematical model for the non-smooth arc routing problem is introduced.•A heuristic combining biased randomization with iterated local search is proposed.•We improve previous works, a linearized version of the problem is solved with CPLEX.

论文关键词：Arc routing problem,Soft constraints,Non-smooth optimization,Biased-randomization,Metaheuristics

论文评审过程：Received 29 July 2017, Revised 12 December 2017, Accepted 13 January 2018, Available online 6 February 2018, Version of Record 6 February 2018.

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