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

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

Abstract

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
Volume98
DOIs
Publication statusPublished - 15 May 2018
Externally publishedYes

Fingerprint

Logistics
Mathematical models
Routing
Iterated local search
Modeling
Mathematical model
Violations
Competitiveness

Keywords

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

Cite this

@article{e8bbd571a4dd43e3b5c169ea635a7744,
title = "Modeling and solving the non-smooth arc routing problem with realistic soft constraints",
abstract = "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.",
keywords = "Arc routing problem, Biased-randomization, Metaheuristics, Non-smooth optimization, Soft constraints",
author = "{de Armas}, Jesica and Albert Ferrer and Juan, {Angel A.} and Eduardo Lalla-Ruiz",
year = "2018",
month = "5",
day = "15",
doi = "10.1016/j.eswa.2018.01.020",
language = "English",
volume = "98",
pages = "205--220",
journal = "Expert systems with applications",
issn = "0957-4174",
publisher = "Elsevier",

}

Modeling and solving the non-smooth arc routing problem with realistic soft constraints. / de Armas, Jesica (Corresponding Author); Ferrer, Albert; Juan, Angel A.; Lalla-Ruiz, Eduardo.

In: Expert systems with applications, Vol. 98, 15.05.2018, p. 205-220.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

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

AU - de Armas, Jesica

AU - Ferrer, Albert

AU - Juan, Angel A.

AU - Lalla-Ruiz, Eduardo

PY - 2018/5/15

Y1 - 2018/5/15

N2 - 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.

AB - 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.

KW - Arc routing problem

KW - Biased-randomization

KW - Metaheuristics

KW - Non-smooth optimization

KW - Soft constraints

UR - http://www.scopus.com/inward/record.url?scp=85041229781&partnerID=8YFLogxK

U2 - 10.1016/j.eswa.2018.01.020

DO - 10.1016/j.eswa.2018.01.020

M3 - Article

VL - 98

SP - 205

EP - 220

JO - Expert systems with applications

JF - Expert systems with applications

SN - 0957-4174

ER -