Freight Efficiency Strategies: Information Technology

This White Paper presents recommendations for using information technology solutions to increase the efficiency of California\u2019s multi modal freight system. These recommendations resulted from a consensus based process by working group committee members. The authors address two problems: information problems in the goods movement supply chain, and information problems in statewide trucking

On the Unique Features and Benefits of On-Demand Distribution Models

To close the gap between current distribution operations and today’s customer expectations, firms need to think differently about how resources are acquired, managed and allocated to fulfill customer requests. Rather than optimize planned resource capacity acquired through ownership or long- term partnerships, this work focuses on a specific supply-side innovation – on-demand distribution platforms. On-demand distribution systems move, store, and fulfill goods by matching autonomous suppliers\u27 resources (warehouse space, fulfillment capacity, truck space, delivery services) to requests on-demand. On-demand warehousing systems can provide resource elasticity by allowing capacity decisions to be made at a finer granularity (at the pallet-level) and commitment (monthly versus yearly), than construct or lease options. However, such systems are inherently more complex than traditional systems, as well as have varying costs and operational structures (e.g., higher variable costs, but little or no fixed costs). New decision- supporting models are needed to capture these trade-offs

Problema de transporte multiterminal y contenedores MultiSize: dos enfoques metaheurísticos con Python

Este trabajo se centra en el problema del enrutamiento de vehículos como un sistema intermodal de transporte donde se produce movimientos de entrega y recogida de contenedores por camiones y determinadas a priori por el cliente. Este sistema intermodal de transporte se puede identificar como operaciones de drayage y además se verá como parte de un gran objetivo, una cadena de suministro. Las operaciones de drayage se pueden considerar como uno de los elementos que ocupa mayor importancia en cuanto al total de los costes de transporte que presenta una cadena de suministro. En consecuencia, es esencial buscar que estas operaciones se realicen de la forma más eficiente posible tanto en costes como en calidad, para poder así conseguir cada vez más que las empresas puedan expandirse a mayores niveles en el mercado. En el problema básico de recogida y entrega se busca construir un conjunto de rutas para satisfacer unas solicitudes/tareas de entrega y recogida de clientes dispersos geográficamente. Se parte de una flota de vehículos disponible, donde cada vehículo tiene una capacidad dada, un tiempo de operación, un lugar de inicio y un lugar final. En cada solicitud se especifica el tamaño del contenedor a transportar, donde se va a recoger (origen) y donde se va a entregar (destino). Estos contenedores son transportados de su origen a su destino sin transbordo en otros lugares. El objetivo por tanto es de satisfacer todas las solicitudes por los vehículos disponibles generando una solución a coste mínimo, sin olvidar las restricciones adicionales que se definan para el problema. En la literatura se puede encontrar una gran variedad de enfoques posibles de solución para el tipo de problema expuesto. De las posibles metodologías de resolución aplicables relativas al problema de drayage, se eligen dos de ellas: Recocido Simulado y Búsqueda Tabú. La búsqueda tabú es capaz de presentar buenas soluciones para estos problemas, sin embargo, su aplicación es menos popular. En cuanto al recocido simulado, método también bastante conocido y que obtiene resultados considerablemente buenos, se diferencia con la búsqueda tabú en que éste al no verificar el vecindario completo, le permite moverse más rápido entre vecindarios y con ello, realizar mayor número de iteraciones en un tiempo dado. Estos dos enfoques de solución se basan en resolver un problema por búsqueda local, basados en una solución inicial y una estructura de vecindario. En función de observar la aplicación en el mundo real de este trabajo, se procede simular en Spyder, entorno de desarrollo de código para programación científica en lenguaje Python, para generar soluciones en los dos casos posibles, recocido simulado y búsqueda tabú. Se añaden tres escenarios con diferentes parámetros en los dos casos, generando diversos experimentos computacionales para verificar, comparar y así poder concluir las comparaciones en el rendimiento entre métodos y el conjunto de parámetros establecido en cada escenario. Estas comparaciones se basan en el coste total (la distancia total recorrida) y el tiempo computacional que requiere ejecutarlos hasta obtener solución con los parámetros establecidos.Universidad de Sevilla. Máster Universitario en Organización Industrial y Gestión de Empresa

Addressing freight imbalance in the truckload trucking industry through hierarchical planning.

Freight imbalance is a problem that negatively affects drivers and carriers within the truckload trucking industry. One result of this problem is that the industry experiences high annual driver turnover, exceeding 130% annually. The turnover can be attributed in part to driver dissatisfaction due to the inability of the carriers to provide regular driving tours as a result of freight imbalance. However, due to the complexity of the imbalance, carriers have difficulty combating the problem. This dissertation examines three problems addressing freight imbalance from a hierarchical planning perspective. The Weekend Draying Problem focuses is an operational planning approach for addressing weekend truckload dispatching. The application of this methodology to a nationwide trucking network reveals that a carrier can experience significant customer service improvements while at the same time meeting the needs and expectations of their drivers. As a result, more regular driving tours can be established. The Driver Domicile Problem uses tactical planning to examine nationwide driver recruitment strategies. With driver turnover and driver retention imposing significant burdens on the truckload trucking industry, the proposed strategy reveals key locations where a potential driver base could be recruited that would improve the carrier\u27s ability to provide the drivers with more regular tours and frequent get home opportunities. Results highlight which factors contribute to the best design of a nationwide domicile plan. The Distribution Center Location Problem is a strategic plan for the design of various sized distribution networks that minimize trucking costs without affecting delivery requirements. Whereas historical design focused on time and distance minimization, these networks address freight imbalance by focusing on cost minimization. Examination and analysis of these problems is conducted through discrete event system simulation, computer modeling, and mathematical programming. Outcomes from the research of these problems are industrially relevant. The application of these methodologies will assist the truckload trucking carriers in dealing with inherent freight imbalance issues and helping them overcome many challenges they face. Collectively this dissertation demonstrates ways to address freight imbalance both in the short term planning horizon and the long term planning horizon

Routing and Scheduling of Cross-Town Drayage Operations at J.B. Hunt Transport

Cross-town moves, a special type of drayage, occur when intermodal containers require a transfer from one rail ramp to another for continuance of a shipment. The cross-town problem consists of determining driver load assignments and routing and scheduling these drivers such that the maximum number of loads are covered with minimum empty moves. We illustrate how the cross-town problem has special characteristics that require a novel methodology, and we subsequently develop a heuristic solution approach. Our heuristics consider operational constraints, including a high number of loads per driver schedule, driver start times, driver start and end locations, hourly traffic patterns, load time windows, and required driver service hours. The implementation of the cross-town application has positively impacted J.B. Hunt\u27s intermodal drayage operation by automating and enhancing planning work flow for dispatchers, reducing the number of costly outsourced loads, and significantly improving operational efficiency. In addition, J.B. Hunt has documented the annualized cost savings of the cross-town heuristic implementation at $581,000

Routing And Scheduling Of Cross-Town Drayage Operations At J.B. Hunt Transport

Cross-town moves, a special type of drayage, occur when intermodal containers require a transfer from one rail ramp to another for continuance of a shipment. The cross-town problem consists of determining driver load assignments and routing and scheduling these drivers such that the maximum number of loads are covered with minimum empty moves.We illustrate how the cross-town problem has special characteristics that require a novel methodology, and we subsequently develop a heuristic solution approach. Our heuristics consider operational constraints, including a high number of loads per driver schedule, driver start times, driver start and end locations, hourly traffic patterns, load time windows, and required driver service hours. The implementation of the cross-town application has positively impacted J.B. Hunt\u27s intermodal drayage operation by automating and enhancing planning work flow for dispatchers, reducing the number of costly outsourced loads, and significantly improving operational efficiency. In addition, J.B. Hunt has documented the annualized cost savings of the cross-town heuristic implementation at $581,000. © 2013 INFORMS

Massachusetts Domestic and Foreign Corporations Subject to an Excise: For the Use of Assessors (2004)

International audienc