Pallottino, Stefano
Overview
Works:  38 works in 82 publications in 3 languages and 131 library holdings 

Roles:  Author, Editor 
Classifications:  T57.6, 380 
Publication Timeline
.
Most widely held works by
Stefano Pallottino
Scienze delle decisioni per i trasporti(
Book
)
2 editions published in 1999 in Italian and held by 18 WorldCat member libraries worldwide
2 editions published in 1999 in Italian and held by 18 WorldCat member libraries worldwide
Implicit enumeration of hyperpaths in logit models for transit networks by
Sang Nguyen(
Book
)
8 editions published between 1992 and 1993 in English and held by 12 WorldCat member libraries worldwide
This paper investigates the application of multinomial logit distribution models to urban transit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that the standard multinomial logit model does not lead to a practical algorithmic implementation similar to that obtained for the private vehicle networks and should be replaced with a hierarchical logit
8 editions published between 1992 and 1993 in English and held by 12 WorldCat member libraries worldwide
This paper investigates the application of multinomial logit distribution models to urban transit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that the standard multinomial logit model does not lead to a practical algorithmic implementation similar to that obtained for the private vehicle networks and should be replaced with a hierarchical logit
An efficient algorithm for determining the length of the longest dead path in a "LIFO" branchandbound exploration schema by
Stefano Pallottino(
Book
)
6 editions published between 1979 and 1980 in English and held by 11 WorldCat member libraries worldwide
The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branchandbound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is selfcontained in the sense that it can be externally attached to any LIFO branchandbound program without interfering with its algorithms and data structures. (Author)
6 editions published between 1979 and 1980 in English and held by 11 WorldCat member libraries worldwide
The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branchandbound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we are able to present a particularly attractive procedure for determining of the LLDP. In fact this procedure requires a number of storage variables which is independent of problem size and very small; moreover, the procedure is selfcontained in the sense that it can be externally attached to any LIFO branchandbound program without interfering with its algorithms and data structures. (Author)
Postoptimizing equilibrium flows on large scale networks by
Sang Nguyen(
Book
)
5 editions published in 1993 in English and held by 8 WorldCat member libraries worldwide
5 editions published in 1993 in English and held by 8 WorldCat member libraries worldwide
A modeling framework for the passenger assignment on a transport network with timetables by
Sang Nguyen(
Book
)
6 editions published in 1994 in English and French and held by 8 WorldCat member libraries worldwide
Transit network, passenger assignment, timetable, flow priority, equilibrium model
6 editions published in 1994 in English and French and held by 8 WorldCat member libraries worldwide
Transit network, passenger assignment, timetable, flow priority, equilibrium model
Discrete time dynamic estimation model for passenger origin/destination matrices on transit networks by
Sang Nguyen(
Book
)
3 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
3 editions published in 1986 in English and held by 6 WorldCat member libraries worldwide
Paradoxes in equilibrium traffic assignment and their implications for optimal planning strategies by
Caroline Fisk(
Book
)
4 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
4 editions published in 1980 in English and held by 6 WorldCat member libraries worldwide
Adaptation de l'algorithme de d'EsopoPape pour la détermination de tous les chemins les plus courts : améliorations et
simplifications by
Stefano Pallottino(
Book
)
2 editions published in 1979 in French and held by 5 WorldCat member libraries worldwide
2 editions published in 1979 in French and held by 5 WorldCat member libraries worldwide
Polynomial auction algorithms for shortest paths by
Dimitri P Bertsekas(
Book
)
4 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/all destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this structure to obtain algorithms with O(n.min[m, n log n]) and O(n²) running time. Our initial computational experiments are encouraging, showing that these algorithms outperform their closest competitors on randomly generated dense problems."
4 editions published in 1992 in English and held by 5 WorldCat member libraries worldwide
Abstract: "In this paper we consider strongly polynomial variations of the auction algorithm for the single origin/all destinations shortest path problem. These variations are based on the idea of graph reduction, that is, deleting unnecessary arcs of the graph by using certain bounds naturally obtained in the course of the algorithm. We study the structure of the reduced graph and we exploit this structure to obtain algorithms with O(n.min[m, n log n]) and O(n²) running time. Our initial computational experiments are encouraging, showing that these algorithms outperform their closest competitors on randomly generated dense problems."
Equilibrium traffic assignment for large scale transit networks by
Sang Nguyen(
Book
)
3 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
A major obstacle in developing a passenger routing model for transit networksstems from the difficulty in modelling the passenger route choice behaviourat a transit stop shared by several competitive transit lines. This paperinvestigates the equilibrium traffic assignment methodology for large scaletransit networks. Variational inequality formulations for the equilibriumtraffic assignment are developed using a particular graph structure called ahyperpath. Computational techniques for shortest hyperpaths, as well asalgorithms for computing equilbrium flows are discussed
3 editions published in 1985 in English and held by 4 WorldCat member libraries worldwide
A major obstacle in developing a passenger routing model for transit networksstems from the difficulty in modelling the passenger route choice behaviourat a transit stop shared by several competitive transit lines. This paperinvestigates the equilibrium traffic assignment methodology for large scaletransit networks. Variational inequality formulations for the equilibriumtraffic assignment are developed using a particular graph structure called ahyperpath. Computational techniques for shortest hyperpaths, as well asalgorithms for computing equilbrium flows are discussed
A dual simplex algorithm for finding all shortest paths by
Michael Alexander Florian(
Book
)
3 editions published between 1979 and 1980 in English and held by 4 WorldCat member libraries worldwide
The analysis of flows in transportation and communication networks is often carried out with the aid of steady state models of the flow during a given period of time, commonly known as traffic assignment models. These models are multicommodity flow problems with convex, concave, or linear cost functions. The starting point for the work presented in the paper is the observation made by Gallo in his recent (1977) work on the use of reoptimization procedures for the recomputation of shortest paths, when an origin change is made. The paper presents the formulation of the shortest path problem as a linear program and the dual simplex method is recalled; then the dual simplex method is adapted for the reoptimization of the shortest path tree and the properties of the resulting method are demonstrated; the design and the implementation of an efficient code are presented; and some computational results obtained with the code are reported
3 editions published between 1979 and 1980 in English and held by 4 WorldCat member libraries worldwide
The analysis of flows in transportation and communication networks is often carried out with the aid of steady state models of the flow during a given period of time, commonly known as traffic assignment models. These models are multicommodity flow problems with convex, concave, or linear cost functions. The starting point for the work presented in the paper is the observation made by Gallo in his recent (1977) work on the use of reoptimization procedures for the recomputation of shortest paths, when an origin change is made. The paper presents the formulation of the shortest path problem as a linear program and the dual simplex method is recalled; then the dual simplex method is adapted for the reoptimization of the shortest path tree and the properties of the resulting method are demonstrated; the design and the implementation of an efficient code are presented; and some computational results obtained with the code are reported
Shortest path methods : complexity, interrelations and new propositions by
Stefano Pallottino(
Book
)
2 editions published in 1981 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1981 in English and held by 3 WorldCat member libraries worldwide
Hyperpaths and shortest hyperpaths by
Sang Nguyen(
Book
)
2 editions published between 1986 and 1987 in English and held by 3 WorldCat member libraries worldwide
2 editions published between 1986 and 1987 in English and held by 3 WorldCat member libraries worldwide
Appunti di programmazione matematica by
Paolo Carraresi(
Book
)
1 edition published in 1993 in Italian and held by 3 WorldCat member libraries worldwide
1 edition published in 1993 in Italian and held by 3 WorldCat member libraries worldwide
Paradoxes in equilibrium traffic assignment and their implications for the network design problem by
Caroline Fisk(
Book
)
2 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
The maximum flow problem : a maxpreflow approach by
Giuseppe Mazzoni(
Book
)
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
Shortest path algorithms in transportation models : classical and innovative aspects by
Stefano Pallottino(
)
1 edition published in 1998 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1998 in English and held by 2 WorldCat member libraries worldwide
A New algorithm to find the shortest path between all pairs of nodes by
G Gallo(
Book
)
2 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1979 in English and held by 2 WorldCat member libraries worldwide
Hypergraph models and algorithms for the assembly problem by
G Gallo(
Book
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We consider the problem of finding an optimal set of feasible assembly operations in order to derive a desired product from a given set of parts. We show that optimal solutions, under different objective functions, can be obtained by means of computationally efficient hypergraph algorithms. In particular, we consider the case in which one wants to minimize the duration with an unlimited degree of parallelism. Finally, a new fast algorithm is presented in order to assign operations to robots in an optimal way when the degree of parallelism is bounded."
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Abstract: "We consider the problem of finding an optimal set of feasible assembly operations in order to derive a desired product from a given set of parts. We show that optimal solutions, under different objective functions, can be obtained by means of computationally efficient hypergraph algorithms. In particular, we consider the case in which one wants to minimize the duration with an unlimited degree of parallelism. Finally, a new fast algorithm is presented in order to assign operations to robots in an optimal way when the degree of parallelism is bounded."
The computational complexity of two treeindexing methods by
S Pallottino(
Book
)
2 editions published in 1981 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1981 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Algorithms Auctions AuctionsMathematical models Branch and bound algorithms Bus linesMathematical models City trafficMathematical models Computer algorithms Computer networks Critical path analysis Directed graphs Hypergraphs Local transitMathematical models Logits Mathematical optimization Matrices Robotics Traffic assignmentMathematical models Traffic flowMathematical models Travel time (Traffic engineering)Mathematical models