Approximate Solutions to a Dynamic Combinatorial Problem in Space

Robert E. Kuenne
Additional contact information
Robert E. Kuenne: Princeton University

Chapter 11 in General Equilibrium Economics, 1992, pp 258-277 from Palgrave Macmillan

Abstract: Abstract A family of important problems in spatial economics may be particularized in the following terms. A set of vehicles, V, exists with elements i = 1, ..., m, each of which carries a given initial supply of product. We identify a sequence of ‘legs’, t = 0, 1, ..., N, during which we assume (fictitiously) that vehicle movement occurs. Finally, we specify a set of stations, S, with elements j = 1, ..., n, located at coordinates [x j , y j ] on the plane; for convenience, and without loss of generality, we assume that j = 1, ..., f, f ≤ m, are the initial locations of the vehicles, or the stations at which they are located on Leg 0.

Keywords: Feasible Solution; Travelling Salesman Problem; Travel Salesman Problem; Distinct Solution; Inspectional Method (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-1-349-12752-8_12

Ordering information: This item can be ordered from
http://www.palgrave.com/9781349127528

DOI: 10.1007/978-1-349-12752-8_12

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().