Proposal of a Strategy of Relax-and-Fix Decomposition Type Based on Adjacent Nodes Applied to the Periodic Capacitated Arc Routing Problem (PCARP)

Authors

  • Jailosn Domingos Oliveira Universidade Federal do Paraná
  • Cassius Tadeu Scarpin, Dr. Universidade Federal do Paraná

Keywords:

Heuristic algorithms, PCARP, relax-and-fix

Abstract

These instructions give you guidelines for preparing papers for IEEE Transactions and Journals. Use this document as a template if you are using Microsoft Word 6.0 or later. Otherwise, use this document as an instruction set. The electronic file of your paper will be formatted further at IEEE. Paper titles should be written in uppercase and lowercase letters, not all uppercase. Avoid writing long formulas with subscripts in the title; short formulas that identify the elements are fine (e.g., "Nd–Fe–B"). Do not write “(Invited)” in the title. Full names of authors are preferred in the author field, but are not required. Put a space between authors’ initials. The abstract must be a concise yet comprehensive reflection of what is in your article. In particular, the abstract must be self-contained, without abbreviations, footnotes, or references. It should be a microcosm of the full article. The abstract must be between 150–250 words. Be sure that you adhere to these limits; otherwise, you will need to edit your abstract accordingly. The abstract must be written as one paragraph, and should not contain displayed mathematical equations or tabular material. The abstract should include three or four different keywords or phrases, as this will help readers to find it. It is important to avoid over-repetition of such phrases as this can result in a page being rejected by search engines. Ensure that your abstract reads well and is grammatically correct.

Downloads

Download data is not yet available.

Published

2020-04-12

How to Cite

Oliveira, J. D., & Scarpin, C. T. (2020). Proposal of a Strategy of Relax-and-Fix Decomposition Type Based on Adjacent Nodes Applied to the Periodic Capacitated Arc Routing Problem (PCARP). IEEE Latin America Transactions, 18(3), 573–580. Retrieved from https://latamt.ieeer9.org/index.php/transactions/article/view/914