Formulation and algorithms for discrete minimum-cost group assembly problem

Fan Peng, Taesung Hwang, Yanfeng Ouyang

Research output: Contribution to journalArticlepeer-review


Formulation and solution algorithms are proposed for a discrete group assembly problem in which a number of arbitrarily located objects in a network need to travel to some assembly points so that the subgraph induced by them contains a spanning tree whose edge lengths are all less than a predetermined distance. The objective of this problem is to find the optimal assembly location for each object so as to minimize the total travel distance of all objects from their initial locations to assembly points. This problem was motivated by several real-world applications in a range of contexts. The problem was formulated into a mixed-integer mathematical program, and effective algorithms such as neighborhood search were developed to obtain near-optimum solutions. Computational results for a number of experimental problem instances show that the proposed algorithms are able to give good solutions in a short amount of time.

Original languageEnglish (US)
Pages (from-to)9-15
Number of pages7
JournalTransportation Research Record
Issue number2333
StatePublished - Jan 12 2013

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Mechanical Engineering


Dive into the research topics of 'Formulation and algorithms for discrete minimum-cost group assembly problem'. Together they form a unique fingerprint.

Cite this