Distributed optimization in transportation and logistics networks

K.Y. Michael Wong, David Saad, Chi Ho Yeung

Research output: Contribution to journalArticle

Abstract

Many important problems in communication networks, transportation networks, and logistics networks are solved by the minimization of cost functions. In general, these can be complex optimization problems involving many variables. However, physicists noted that in a network, a node variable (such as the amount of resources of the nodes) is connected to a set of link variables (such as the flow connecting the node), and similarly each link variable is connected to a number of (usually two) node variables. This enables one to break the problem into local components, often arriving at distributive algorithms to solve the problems. Compared with centralized algorithms, distributed algorithms have the advantages of lower computational complexity, and lower communication overhead. Since they have a faster response to local changes of the environment, they are especially useful for networks with evolving conditions. This review will cover message-passing algorithms in applications such as resource allocation, transportation networks, facility location, traffic routing, and stability of power grids.
Original languageEnglish
Pages (from-to)2237-2246
Number of pages20
JournalIEICE Transactions on Communications
VolumeE99-B
Issue number11
DOIs
Publication statusPublished - 1 Nov 2016

Bibliographical note

Copyright © 2016 IEICE. Wong, K. Y. M., Saad, D., & Yeung, C. H. (2016). Distributed optimization in transportation and logistics networks. IEICE Transactions on Communications, E99-B(11), 2237-2246.

Funding: EPSRC (Industrial CASE Studentship 12330048); and Research
Grants Council of Hong Kong (605813).

Keywords

  • message-passing
  • cavity method
  • finite bandwidths
  • facility location
  • power grids

Fingerprint Dive into the research topics of 'Distributed optimization in transportation and logistics networks'. Together they form a unique fingerprint.

  • Cite this