|
|
|
Title: Formulation and Algorithms for Discrete Minimum-Cost Group Assembly Problem
Accession Number: 01492866
Record Type: Component
Record URL: Availability: Transportation Research Board Business Office 500 Fifth Street, NW Find a library where document is available Abstract: 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.
Monograph Title: Monograph Accession #: 01490598
Report/Paper Numbers: 13-0792
Language: English
Authors: Peng, FanHwang, TaesungOuyang, YanfengPagination: pp 9-15
Publication Date: 2013
ISBN: 9780309263382
Media Type: Print
Features: Figures; References; Tables
TRT Terms: Subject Areas: Operations and Traffic Management; Planning and Forecasting; Transportation (General); I72: Traffic and Transport Planning
Files: TRIS, TRB, ATRI
Created Date: Sep 13 2013 2:20PM
More Articles from this Serial Issue:
|
