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

Jesica de Armas* (Corresponding Author), Albert Ferrer, Angel A. Juan, Eduardo Lalla-Ruiz

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)
1 Downloads (Pure)


This paper considers the non-smooth arc routing problem (NS-ARP) with soft constraints in order to capture in more perceptive way realistic constraints violations arising in transportation and logistics. To appropriately solve this problem, a biased-randomized procedure with iterated local search (BRILS) and a mathematical model for this ARP variant is proposed. An extensive computational study is conducted on rich and diverse problem instances. The results highlight the competitiveness of BRILS in terms of quality and time, where it provides high-quality solutions within reasonable computational times. In the context of real-world environments, the performance exhibited by BRILS motivates its incorporation in intelligent and integrative systems where frequent and fast solutions are required.

Original languageEnglish
Pages (from-to)205-220
Number of pages16
JournalExpert systems with applications
Publication statusPublished - 15 May 2018
Externally publishedYes


  • Arc routing problem
  • Biased-randomization
  • Metaheuristics
  • Non-smooth optimization
  • Soft constraints


Dive into the research topics of 'Modeling and solving the non-smooth arc routing problem with realistic soft constraints'. Together they form a unique fingerprint.

Cite this