Skip to main content
SpringerLink
Log in

Complexity issues for a redistribution problem

  • Conference paper
Mathematics and Computer Science

Part of the book series: Trends in Mathematics ((TM))

  • 474 Accesses

Abstract

Given a single discrete and non dedicated commodity, we consider the deterministic problem of transporting such commodities from a set of suppliers to a set of customers with one vehicle of limited capacity Q. We give a VRP-like formulation, dimension of associated polytope as well as complex analysis of practical complexity in terms of number of feasible solutions. From a heuristic viewpoint, a dynamic programming algorithm is given to retrieve in polynomial time, the best solution in an exponential neighborhood.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. R. E. Burkard and V. Deĭneko. Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood. Technical Report 1, Technische Universitt Graz, Austria, July 1994.

    Google Scholar 

  2. N. G. de Bruijn, D. E. Knuth, and S. O. Rice. The average height of planted trees, pages 15–22. Academic press, 1972.

    Google Scholar 

  3. M. Dror, D. Fortin, E. Naudin, and C. Roucairol. Heuristics for the redistribution of a single commodity. In MIC’99, July 1999. Angras de Reis, Brazil.

    Google Scholar 

  4. V. Deĭneko and G. J. Woeginger. A study od exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Technical Report 05, Technische Universitt Graz, Austria, July 1997.

    Google Scholar 

  5. Ph. Flajolet and R. Sedgewick. The average case analysis of algorithms:Counting and generating functions. Technical Report RR1888, INRIA Rocquencourt, France, April 1993.

    Google Scholar 

  6. Ph. Flajolet and R. Sedgewick. The average case analysis of algorithms: Mellin transfoem asymptotics. Technical Report RR2956, INRIA Rocquencourt, France, August 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Information System Department, College of Business and Public Administration, University of Arizona, Tucson, Arizona, 85721, USA

    Moshe Dror

  2. Domaine de Voluceau, Rocquencourt, INRIA, B.P. 105, 78153, Le Chesnay Cedex, France

    Dominique Fortin

  3. Laboratoire PRiSM, Université de Versailles-St-Quentinen-Yvelines, 45, av. des Etats-Unis, 78035, Versailles, Cedex, France

    Catherine Roucairol

Authors
  1. Moshe Dror
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominique Fortin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Catherine Roucairol
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Bâtiment Descartes, Université de Versailles-St-Quentin PRISM, 45 avenue des Etats-Unis, 78035, Versailles, Cedex, France

    Danièle Gardy

  2. Département de Mathématiques Bâtiment Fermat, Université de Versailles-St-Quentin, 45 avenue des Etats-Unis, 78035, Versailles, Cedex, France

    Abdelkader Mokkadem

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Basel AG

About this paper

Cite this paper

Dror, M., Fortin, D., Roucairol, C. (2000). Complexity issues for a redistribution problem. In: Gardy, D., Mokkadem, A. (eds) Mathematics and Computer Science. Trends in Mathematics. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8405-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8405-1_14

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9553-8

  • Online ISBN: 978-3-0348-8405-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation