A Fuzzy, Heuristic, Interactive Approach to the Optimal Network Problem

Didier Dubois
Additional contact information
Didier Dubois: CERT, Department d’Etudes et de Recherches en Automatique

A chapter in Advances in Fuzzy Sets, Possibility Theory, and Applications, 1983, pp 253-276 from Springer

Abstract: Abstract Among the various problems that have to be solved in the transportation planning field, that of designing optimally a network has focused the attention of many researchers. The network is formally represented as a graph and we must find a subset of the maximal set of links, which are for instance streets or roads. The problem belongs to the combinatorial field, and its optimal solving is impossible for practical-sized sets of data; we are forced to use heuristic methods which are not completely satisfactory by their very nature.

Keywords: Travel Time; Short Path; Fuzzy Number; Transportation Network; Interactive Approach (search for similar items in EconPapers)
Date: 1983
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:spr:sprchp:978-1-4613-3754-6_17

Ordering information: This item can be ordered from
http://www.springer.com/9781461337546

DOI: 10.1007/978-1-4613-3754-6_17

Access Statistics for this chapter

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