Skip to main content

A Parallel Grasp for the Data Association Multidimensional Assignment Problem

  • Chapter
Parallel Processing of Discrete Problems

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 106))

Abstract

Data association multidimensional assignment problems appear in many applications such as MultiTarget MultiSensor Tracking, and particle tracking. The problem is characterized by the large input data and is very difficult to solve exactly. A Greedy Randomized Adaptive Search Procedure (GRASP) has been developed and computational results show good quality solutions can be obtained. Furthermore, the efficiency of the GRASP can be easily improved by parallelization of the code in the MPI environment.

This research was funded in part by the United States Air Force, contract F08635–92-C-0032.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Bar-Shalom (Editor). Multitarget,Multisensor Tracking: Advanced Applications. Artech House, Dedham, MA, 1990.

    Google Scholar 

  2. Y. Bar-Shalom (Editor). Multitarget,Multisensor Tracking: Applications and Advances. Artech House, Dedham, MA, 1992.

    Google Scholar 

  3. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  4. Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237–261. American Mathematical Society, 1994.

    Google Scholar 

  5. Y. Li, P.M. Pardalos, and M.G.C. Resende. Algorithm 754: FORTRAN subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software, 22:104–118, 1996.

    Article  MATH  Google Scholar 

  6. T. Mavridou, P. M. Pardalos, L. S. Pitsoulis, and M. G. C. Resende. A GRASP for the biquadratic assignment problem. European Journal of Operations Research, 105(3):613–621, 1998.

    Article  MATH  Google Scholar 

  7. P. M. Pardalos, L. S. Pitsoulis, and M. G. C. Resende. A parallel GRASP implementation for solving the quadratic assignment problem. In A. Ferreira and José D.P. Rolim, editors, Parallel Algorithms for Irregular Problems: State of the Art, pages 115–133. Kluwer Academic Publishers, 1995.

    Google Scholar 

  8. P. M. Pardalos, L. S. Pitsoulis, and M. G. C. Resende. Algorithm 769: FORTRAN subroutines for approximate solution of sparse quadratic assignment problems. ACM Transactions on Mathematical Software, 23:196–208, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  9. K.R. Pattipati, S. Deb, and Y. Bar-Shalom. Passive multisensor data association using a new relaxation algorithm. In Y. Bar-Shalom, editor, Multitarget, Multisensor Tracking: Advanced Applications. Artech House, Dedham, MA, 1990.

    Google Scholar 

  10. A. B. Poore. Multidimensional assignment formulation of data association. Computational Optimization and Applications, 3:27–57, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  11. A. B. Poore and N. Rijavec. Partitioning multiple data sets: multidimensional assignments and lagrangian relaxation. In P.M Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DI-MACS Series on Discrete Mathematics and Theoretical Computer Science, pages 317–342. American Mathematical Society, 1994.

    Google Scholar 

  12. P.M. Pardalos R.A. Murphey and L. Pitsoulis. A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. In P. M. Pardalos and Ding-Zhu Du, editors, Network Design: Connectivity and Facility Location, volume 40 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 277–302. American Mathematical Society, 1997.

    Google Scholar 

  13. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra. MPI: The complete reference. The MIT Press, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Murphey, R.A., Pardalos, P.M., Pitsoulis, L. (1999). A Parallel Grasp for the Data Association Multidimensional Assignment Problem. In: Pardalos, P.M. (eds) Parallel Processing of Discrete Problems. The IMA Volumes in Mathematics and its Applications, vol 106. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-1492-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1492-2_7

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7165-9

  • Online ISBN: 978-1-4612-1492-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics