A left-turning vehicle (Subject Vehicle, SV) attempting to cross the path of an oncoming vehicle (Principal Other Vehicle, POV) at an intersection typically does not have the right of way. The main task of the SV driver is to find an adequate opportunity in opposing traffic to initiate the...

This paper describes the results of simulation studies to determine how effectively left-turning drivers can be alerted to imminent conflicts with opposing traffic under difficult operating conditions and with limited detector capabilities. These conditions include approaching vehicles changing...

Though 2-approximation algorithms are available for several Multiple Depot Travelling Salesman Problems (TSPs)and Hamiltonian Path Problems (HPPs), there are no algorithms in the literature for any multiple depot variant of TSP or HPP that has an approximation ratio better than 2. This paper...

This paper shows how to reduce the bullwhip effect by introducing advance demand information (ADI) into the ordering schemes of supply chains. It quantifies the potential costs and benefits of ADI, and demonstrates that they are not evenly distributed across the chain. Therefore, market-based...

This paper analyzes the bullwhip effect in decentralized, linear and time-invariant (LTI) supply chains. It generalizes existing results by broadening the class of policies and customer demand processes under consideration. The supply chain is modeled as a single-input, singleoutput control...

We consider a Generalized, Multiple Depot Hamiltonian Path Problem (GMDHPP) and show that it has an algorithm with an approximation ratio of 3/2 if the costs are symmetric and satisfy the triangle inequality. This improves on the 2-approximation algorithm already available for the same.

At a national level it is common to express the amount of air travel in terms of the number of revenue passenger miles flown or the number of enplaned passengers. This provides a way to resolve the difficulty of how to aggregate measures of air travel in many different markets of many different...

This paper extends the Held-Karp’s lower bound available for a single Travelling Salesman Problem to the following symmetric Multiple Depot, Multiple Travelling Salesman Problem (MDMTSP): Given k salesman that start at di