Search

Search Results

• 1. [Article] Modeling Carrier Behavior in Sequential Auction Transportation Markets

  Online markets for transportation services, in the form of Internet sites that dynamically match shipments (shippers? demand) and transportation capacity (carriers? offer) through auction mechanisms are ...

  Citation × Citation Citation Abstract Copy Title: Modeling Carrier Behavior in Sequential Auction Transportation Markets Author: Figliozzi, Miguel Andres, Mahmassani, Hani S., Jaillet, Patrick Year: 2003 Online markets for transportation services, in the form of Internet sites that dynamically match shipments (shippers? demand) and transportation capacity (carriers? offer) through auction mechanisms are changing the traditional structure of transportation markets. A general framework for the study of carriers? behavior in a sequential auction transportation marketplace is provided. The unique characteristics of these marketplaces and the sources of difficulty in analyzing the behavior of these marketplaces are discussed. Learning and behavior in a sequential Vickrey auction marketplace is analyzed and simulated. Some results and the overall behavioral framework are also discussed. Title: Modeling Carrier Behavior in Sequential Auction Transportation Markets Author: Figliozzi, Miguel Andres, Mahmassani, Hani S., Jaillet, Patrick Year: 2003 Online markets for transportation services, in the form of Internet sites that dynamically match shipments (shippers? demand) and transportation capacity (carriers? offer) through auction mechanisms are changing the traditional structure of transportation markets. A general framework for the study of carriers? behavior in a sequential auction transportation marketplace is provided. The unique characteristics of these marketplaces and the sources of difficulty in analyzing the behavior of these marketplaces are discussed. Learning and behavior in a sequential Vickrey auction marketplace is analyzed and simulated. Some results and the overall behavioral framework are also discussed. Close

• 2. [Article] Vehicle Routing Problem for Emissions Minimization

  Environmental, social, and political pressures to limit the effects associated with greenhouse gas emissions are mounting. Little research has been done on reducing emissions as the primary objective of ...

  Citation × Citation Citation Abstract Copy Title: Vehicle Routing Problem for Emissions Minimization Author: Figliozzi, Miguel Year: 2010 Environmental, social, and political pressures to limit the effects associated with greenhouse gas emissions are mounting. Little research has been done on reducing emissions as the primary objective of a routing problem despite the growth in use and impact of commercial vehicles. In the capacitated vehicle routing problem (VRP) with time windows, it is traditionally assumed that carriers minimize the number of vehicles as a primary objective and distance traveled as a secondary objective without violating time windows, route durations, or capacity constraints. New research focuses on a different problem: the minimization of emissions and fuel consumption as the primary or secondary objective. This creates the emissions VRP (EVRP). A formulation and solution approaches for the EVRP are presented. Decision variables and properties are stated and discussed. Results obtained with a proposed EVRP solution approach for different levels of congestion are compared and analyzed. Title: Vehicle Routing Problem for Emissions Minimization Author: Figliozzi, Miguel Year: 2010 Environmental, social, and political pressures to limit the effects associated with greenhouse gas emissions are mounting. Little research has been done on reducing emissions as the primary objective of a routing problem despite the growth in use and impact of commercial vehicles. In the capacitated vehicle routing problem (VRP) with time windows, it is traditionally assumed that carriers minimize the number of vehicles as a primary objective and distance traveled as a secondary objective without violating time windows, route durations, or capacity constraints. New research focuses on a different problem: the minimization of emissions and fuel consumption as the primary or secondary objective. This creates the emissions VRP (EVRP). A formulation and solution approaches for the EVRP are presented. Decision variables and properties are stated and discussed. Results obtained with a proposed EVRP solution approach for different levels of congestion are compared and analyzed. Close

• 3. [Article] Planning Approximations to the Average Length of Vehicle Routing Problems with Time Window Constraints

  This paper studies approximations to the average length of vehicle routing problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and ...

  Citation × Citation Citation Abstract Copy Title: Planning Approximations to the Average Length of Vehicle Routing Problems with Time Window Constraints Author: Figliozzi, Miguel Year: 2009 This paper studies approximations to the average length of vehicle routing problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and planning analysis of transportation and logistics problems. Using asymptotic properties of vehicle routing problems and the average probability of successfully sequencing a customer with time windows a new expression to estimate VRP distances is developed. The increase in the number of routes when time constraints are added is modeled probabilistically. This paper introduces the concept of the average probability of successfully sequencing a customer with time windows. It is proven that this average probability is a unique characteristic of a vehicle routing problem. The approximation proposed is tested in instances with different customer spatial distributions, depot locations and number of customers. Regression results indicate that the proposed approximation is not only intuitive but also predicts the average length of VRP problems with a high level of accuracy. Title: Planning Approximations to the Average Length of Vehicle Routing Problems with Time Window Constraints Author: Figliozzi, Miguel Year: 2009 This paper studies approximations to the average length of vehicle routing problems (VRP) with time window, route duration, and capacity constraints. The approximations are valuable for the strategic and planning analysis of transportation and logistics problems. Using asymptotic properties of vehicle routing problems and the average probability of successfully sequencing a customer with time windows a new expression to estimate VRP distances is developed. The increase in the number of routes when time constraints are added is modeled probabilistically. This paper introduces the concept of the average probability of successfully sequencing a customer with time windows. It is proven that this average probability is a unique characteristic of a vehicle routing problem. The approximation proposed is tested in instances with different customer spatial distributions, depot locations and number of customers. Regression results indicate that the proposed approximation is not only intuitive but also predicts the average length of VRP problems with a high level of accuracy. Close