The Chinese Postman Problem with load-dependent costs

Angel Corberan, Güneş Erdoğan, Gilbert Laporte, Isaac Plana, Jose Maria Sanchis

Research output: Contribution to journalArticle

184 Downloads (Pure)

Abstract

We introduce an interesting variant of the well-known Chinese postman problem (CPP). While in the CPP the cost of traversing an edge is a constant (equal to its length), in the variant we present here the cost of traversing an edge depends on its length and on the weight of the vehicle at the moment it is traversed. This problem is inspired by the perspective of minimizing pollution in transportation, since the amount of pollution emitted by a vehicle not only depends on the travel distance but also on its load, among other factors. We define the problem, study its computational complexity, provide two mathematical programming formulations, and propose two metaheuristics for its solution. Extensive computational experiments reveal the extraordinary difficulty of this problem.

Original languageEnglish
Pages (from-to)370-385
Number of pages16
JournalTransportation Science
Volume52
Issue number2
DOIs
Publication statusPublished - 1 Mar 2018

    Fingerprint

Keywords

  • Arc-routing problems
  • Chinese postman problem
  • Pollution routing

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Cite this