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 language||English (US)|
|Number of pages||7|
|Journal||Transportation Research Record|
|State||Published - Jan 12 2013|
ASJC Scopus subject areas
- Civil and Structural Engineering
- Mechanical Engineering