Pitu B. Mirchandani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Pitu B. Mirchandani has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Denis Borenstein
Management School, Federal University of Rio Grande do Sul , Porto Alegre, RS 90010-460
2 shared publications Jing‐Quan Li
California PATH, University of California, Berkeley, Richmond, CA, USA
2 shared publicationsAlessandro Agnetis
Dipartimento di Ingegneria dell'Informazione Università di Siena via Roma 56 53100 Siena
1 shared publication- Alessandro Agnetis
Università degli Studi di Siena
1 shared publication Andrea Pacifici
Italy. † ATLAS Center The University of Arizona 85721 Tucson AZ
1 shared publication- Andrea Pacifici
Università di Roma Tor Vergata
1 shared publication
Latest Publications
- Open Access
- 1 February 2010
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 25 (2) , 89-100
Locating a Surveillance Infrastructure in and Near Ports or on Other Planar Surfaces to Monitor Flows
- 1 February 2010
- Published by Elsevier in Computer-Aided Civil and Infrastructure Engineering
- Vol. 25 (2) , 89-100
Open AccessLocating a Surveillance Infrastructure in and Near Ports or on Other Planar Surfaces to Monitor Flows
- 20 August 2008
- Published by Wiley in International Transactions in Operational Research
- Vol. 15 (5) , 565-582
Truck schedule recovery for solid waste collection in Porto Alegre, Brazil
- 20 August 2008
- Published by Wiley in International Transactions in Operational Research
- Vol. 15 (5) , 565-582
Truck schedule recovery for solid waste collection in Porto Alegre, Brazil
- Open Access
The vehicle rescheduling problem: Model and algorithms
When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real‐time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considers modeling, algorithmic, and computational aspects of the single‐depot VRSP. The paper formulates a model for this problem and develops several fast algorithms to solve it, including parallel synchronous auction algorithms. The concept of the common feasible network (CFN) is introduced to find a good set of initial “prices” for speeding up the auction algorithm. Computational experiments on randomly generated problems are described. Computational results show that, for small problems, all of the developed algorithms demonstrate very good computational performances. For large problems, parallel CFN‐based auction algorithms provide the optimal solution with much smaller computation times. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(3), 211–229 2007
Open AccessThe vehicle rescheduling problem: Model and algorithms
When a vehicle on a scheduled trip breaks down, one or more vehicles need to be rescheduled to serve the customers on that trip with minimum operating and delay costs. The problem of reassigning vehicles in real‐time to this cut trip as well as to other scheduled trips with given starting and ending times, is referred to as the vehicle rescheduling problem (VRSP). This paper considers modeling, algorithmic, and computational aspects of the single‐depot VRSP. The paper formulates a model for this problem and develops several fast algorithms to solve it, including parallel synchronous auction algorithms. The concept of the common feasible network (CFN) is introduced to find a good set of initial “prices” for speeding up the auction algorithm. Computational experiments on randomly generated problems are described. Computational results show that, for small problems, all of the developed algorithms demonstrate very good computational performances. For large problems, parallel CFN‐based auction algorithms provide the optimal solution with much smaller computation times. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(3), 211–229 2007
- Open Access
Covering a line segment with variable radius discs
The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, and a variable component that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors in terms of fixed and variable costs, the problem becomes NP-hard. A branch-and-bound algorithm as well as an efficient heuristic are developed. The heuristic very often obtains the optimal solution as shown in extensive computational testing.
Open AccessCovering a line segment with variable radius discs
The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, and a variable component that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors in terms of fixed and variable costs, the problem becomes NP-hard. A branch-and-bound algorithm as well as an efficient heuristic are developed. The heuristic very often obtains the optimal solution as shown in extensive computational testing.
- 1 March 2007
- Published by American Society of Civil Engineers (ASCE) in Journal of Urban Planning and Development
- Vol. 133 (1) , 43-50
Model Reference Adaptive Control Framework for Real-Time Traffic Management under Emergency Evacuation
Recent natural or man-made disasters around the world have provided compelling evidence that transportation system plays a crucial role in the emergency evacuation and have stressed the need for effective evacuation traffic management to maximize the utilization of the transportation system and to minimize fatalities and losses. This paper presents a model reference adaptive control (MRAC) framework for real-time traffic management under emergency evacuation. Distinct from the well-studied evacuation planning, real-time traffic management for evacuation aims to dynamically guide (control) traffic flow under evacuation in such a way that certain system objective (e.g., minimization of fatalities or property losses) could be achieved. The proposed framework is based on both dynamic network modeling techniques and adaptive control theory, by considering the traffic network under evacuation as a dynamic system. First, a prescriptive dynamic traffic assignment model is applied to predict, in a short-term and r...
- 1 March 2007
- Published by American Society of Civil Engineers (ASCE) in Journal of Urban Planning and Development
- Vol. 133 (1) , 43-50
Model Reference Adaptive Control Framework for Real-Time Traffic Management under Emergency Evacuation
Recent natural or man-made disasters around the world have provided compelling evidence that transportation system plays a crucial role in the emergency evacuation and have stressed the need for effective evacuation traffic management to maximize the utilization of the transportation system and to minimize fatalities and losses. This paper presents a model reference adaptive control (MRAC) framework for real-time traffic management under emergency evacuation. Distinct from the well-studied evacuation planning, real-time traffic management for evacuation aims to dynamically guide (control) traffic flow under evacuation in such a way that certain system objective (e.g., minimization of fatalities or property losses) could be achieved. The proposed framework is based on both dynamic network modeling techniques and adaptive control theory, by considering the traffic network under evacuation as a dynamic system. First, a prescriptive dynamic traffic assignment model is applied to predict, in a short-term and r...
- 4 August 2006
- Published by American Society of Civil Engineers (ASCE)
Uses of Airborne Imagery for Microscopic Traffic Analysis
Over the past several years, traffic analysts and researchers have been exploring the use of airborne imagery to understand traffic behavior and to analyze traffic speeds, volumes, densities, delays, queue lengths, and other traffic parameters. As part of the National Consortium on Remote Sensing in Transportation - Flows (NCRST-F), researchers at the University of Arizona have been developing software tools to assist in analyzing traffic behavior, at the level of the individual vehicle (or, "microscopic" traffic behavior). To do this, we have gathered digital video segments taken from a helicopter over traffic facilities, using a digital video camera. The video image sequence is then processed using software TRAVIS (Tracking and Registration of Airborne Video Image Sequence). The software registers the video sequence (eliminating the movement of the aircraft from the image), identifies vehicles in the images, and tracks the vehicles through the video image sequence. The vehicle coordinates in the image sequence can then be transformed into relevant traffic measures: location, speed, acceleration and deceleration, and position in terms of its lane on the roadway. With a large set of video segments, the software has been able to identify and track individual vehicles automatically, thereby significantly reducing the need for manual data reduction for some traffic applications. We also discuss the applications of the data from airborne imagery for understanding microscopic traffic flow and for the development and calibration of traffic simulation models.
- 4 August 2006
- Published by American Society of Civil Engineers (ASCE)
Uses of Airborne Imagery for Microscopic Traffic Analysis
Over the past several years, traffic analysts and researchers have been exploring the use of airborne imagery to understand traffic behavior and to analyze traffic speeds, volumes, densities, delays, queue lengths, and other traffic parameters. As part of the National Consortium on Remote Sensing in Transportation - Flows (NCRST-F), researchers at the University of Arizona have been developing software tools to assist in analyzing traffic behavior, at the level of the individual vehicle (or, "microscopic" traffic behavior). To do this, we have gathered digital video segments taken from a helicopter over traffic facilities, using a digital video camera. The video image sequence is then processed using software TRAVIS (Tracking and Registration of Airborne Video Image Sequence). The software registers the video sequence (eliminating the movement of the aircraft from the image), identifies vehicles in the images, and tracks the vehicles through the video image sequence. The vehicle coordinates in the image sequence can then be transformed into relevant traffic measures: location, speed, acceleration and deceleration, and position in terms of its lane on the roadway. With a large set of video segments, the software has been able to identify and track individual vehicles automatically, thereby significantly reducing the need for manual data reduction for some traffic applications. We also discuss the applications of the data from airborne imagery for understanding microscopic traffic flow and for the development and calibration of traffic simulation models.
- 1 April 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 136 (1) , 229-257
Locating Active Sensors on Traffic Networks
- 1 April 2005
- Published by Springer Nature in Annals of Operations Research
- Vol. 136 (1) , 229-257
Locating Active Sensors on Traffic Networks
- 1 August 2001
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 39 (3) , 227-244
Job Shop Scheduling With Two Jobs And Nonregular Objective Functions
We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O(r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.
- 1 August 2001
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 39 (3) , 227-244
Job Shop Scheduling With Two Jobs And Nonregular Objective Functions
We consider the job shop scheduling problem with two jobs. We consider a broad class of non-regular, quasi-convex functions of the completion time of the two jobs. We show that the optimal solution, for this class of objective functions, can be computed in O(r log r + log H) time, where r is the number of operation pairs using the same machine, and H is the maximum operation processing time.
- 1 January 2001
- Published by Springer Nature
- p. 319-334
An Approach Towards the Integration of Bus Priority, Traffic Adaptive Signal Control, and Bus Information/Scheduling Systems
- 1 January 2001
- Published by Springer Nature
- p. 319-334
An Approach Towards the Integration of Bus Priority, Traffic Adaptive Signal Control, and Bus Information/Scheduling Systems