An agent approach to improving radio frequency identification enabled Returnable Transport Equipment

Returnable transport equipment (RTE) such as pallets form an integral part of the supply chain and poor management leads to costly losses. Companies often address this matter by outsourcing the management of RTE to logistics service providers (LSPs). LSPs are faced with the task to provide logistical expertise to reduce RTE related waste, whilst differentiating their own services to remain competitive. In the current challenging economic climate, the role of the LSP to deliver innovative ways to achieve competitive advantage has never been so important. It is reported that radio frequency identification (RFID) application to RTE enables LSPs such as DHL to gain competitive advantage and offer clients improvements such as loss reduction, process efficiency improvement and effective security. However, the increased visibility and functionality of RFID enabled RTE requires further investigation in regards to decision‐making. The distributed nature of the RTE network favours a decentralised decision‐making format. Agents are an effective way to represent objects from the bottom‐up, capturing the behaviour and enabling localised decision‐making. Therefore, an agent based system is proposed to represent the RTE network and utilise the visibility and data gathered from RFID tags. Two types of agents are developed in order to represent the trucks and RTE, which have bespoke rules and algorithms in order to facilitate negotiations. The aim is to create schedules, which integrate RTE pick‐ups as the trucks go back to the depot. The findings assert that: - agent based modelling provides an autonomous tool, which is effective in modelling RFID enabled RTE in a decentralised utilising the real‐time data facility. ‐ the RFID enabled RTE model developed enables autonomous agent interaction, which leads to a feasible schedule integrating both forward and reverse flows for each RTE batch. ‐ the RTE agent scheduling algorithm developed promotes the utilisation of RTE by including an automatic return flow for each batch of RTE, whilst considering the fleet costs andutilisation rates. ‐ the research conducted contributes an agent based platform, which LSPs can use in order to assess the most appropriate strategies to implement for RTE network improvement for each of their clients.

Development of operational performance models for truck-lane restrictions on freeway corridors

Highways are generally designed to serve a mixed traffic flow that consists of passenger cars, trucks, buses, recreational vehicles, etc. The fact that the impacts of these different vehicle types are not uniform creates problems in highway operations and safety. A common approach to reducing the impacts of truck traffic on freeways has been to restrict trucks to certain lane(s) to minimize the interaction between trucks and other vehicles and to compensate for their differences in operational characteristics. ^ The performance of different truck lane restriction alternatives differs under different traffic and geometric conditions. Thus, a good estimate of the operational performance of different truck lane restriction alternatives under prevailing conditions is needed to help make informed decisions on truck lane restriction alternatives. This study develops operational performance models that can be applied to help identify the most operationally efficient truck lane restriction alternative on a freeway under prevailing conditions. The operational performance measures examined in this study include average speed, throughput, speed difference, and lane changes. Prevailing conditions include number of lanes, interchange density, free-flow speeds, volumes, truck percentages, and ramp volumes. ^ Recognizing the difficulty of collecting sufficient data for an empirical modeling procedure that involves a high number of variables, the simulation approach was used to estimate the performance values for various truck lane restriction alternatives under various scenarios. Both the CORSIM and VISSIM simulation models were examined for their ability to model truck lane restrictions. Due to a major problem found in the CORSIM model for truck lane modeling, the VISSIM model was adopted as the simulator for this study. ^ The VISSIM model was calibrated mainly to replicate the capacity given in the 2000 Highway Capacity Manual (HCM) for various free-flow speeds under the ideal basic freeway section conditions. Non-linear regression models for average speed, throughput, average number of lane changes, and speed difference between the lane groups were developed. Based on the performance models developed, a simple decision procedure was recommended to select the desired truck lane restriction alternative for prevailing conditions. ^

Dynamic Behavior and Fatigue Life of Highway Bridges Due to Doubling Heavy Vehicles

An increase in the demand for the freight shipping in the United States has been predicted for the near future and Longer Combination Vehicles (LCVs), which can carry more loads in each trip, seem like a good solution for the problem. Currently, utilizing LCVs is not permitted in most states of the US and little research has been conducted on the effects of these heavy vehicles on the roads and bridges. In this research, efforts are made to study these effects by comparing the dynamic and fatigue effects of LCVs with more common trucks. Ten Steel and prestressed concrete bridges with span lengths ranging from 30’ to 140’ are designed and modeled using the grid system in MATLAB. Additionally, three more real bridges including two single span simply supported steel bridges and a three span continuous steel bridge are modeled using the same MATLAB code. The equations of motion of three LCVs as well as eight other trucks are derived and these vehicles are subjected to different road surface conditions and bumps on the roads and the designed and real bridges. By forming the bridge equations of motion using the mass, stiffness and damping matrices and considering the interaction between the truck and the bridge, the differential equations are solved using the ODE solver in MATLAB and the results of the forces in tires as well as the deflections and moments in the bridge members are obtained. The results of this study show that for most of the bridges, LCVs result in the smallest values of Dynamic Amplification Factor (DAF) whereas the Single Unit Trucks cause the highest values of DAF when traveling on the bridges. Also in most cases, the values of DAF are observed to be smaller than the 33% threshold suggested by the design code. Additionally, fatigue analysis of the bridges in this study confirms that by replacing the current truck traffic with higher capacity LCVs, in most cases, the remaining fatigue life of the bridge is only slightly decreased which means that taking advantage of these larger vehicles can be a viable option for decision makers.

Earth Day in New York City

Inscriptions: Verso: [stamped] Photograph by Freda Leinwand. [463 West Street, Studio 229G, New York, NY 10014].

Climate change and the long-term viability of the World’s busiest heavy haul ice road

Climate models project that the northern high latitudes will warm at a rate in excess of the global mean. This will pose severe problems for Arctic and sub-Arctic infrastructure dependent on maintaining low temperatures for structural integrity. This is the case for the economically important Tibbitt to Contwoyto Winter Road (TCWR)—the world’s busiest heavy haul ice road, spanning 400 km across mostly frozen lakes within the Northwest Territories of Canada. In this study, future climate scenarios are developed for the region using statistical downscaling methods. In addition, changes in lake ice thickness are projected based on historical relationships between measured ice thickness and air temperatures. These projections are used to infer the theoretical operational dates of the TCWR based on weight limits for trucks on the ice. Results across three climate models driven by four RCPs reveal a considerable warming trend over the coming decades. Projected changes in ice thickness reveal a trend towards thinner lake ice and a reduced time window when lake ice is at sufficient thickness to support trucks on the ice road, driven by increasing future temperatures. Given the uncertainties inherent in climate modelling and the resultant projections, caution should be exercised in interpreting the magnitude of these scenarios. More certain is the direction of change, with a clear trend towards winter warming that will reduce the operation time window of the TCWR. This illustrates the need for planners and policymakers to consider future changes in climate when planning annual haulage along the TCWR.

Untersuchungen Gewichtsreduktionspotentiale Gegengewichtsgabelstapler

Die Masse eines Gegengewichtstaplers beeinflusst den Energieverbrauch beim Fahren maßgeblich. Steigende Energiepreise und steigendes Umweltbewusstsein führen zu grünen Trends in Logistik. Durch Reduktion der Gesamtmasse eines Gabelstaplers können große Einsparungen erreicht werden. Eine Machbarkeitsstudie soll mithilfe der numerischen Simulationen zeigen, dass neuartige Fahrzeuge mit aktiven Systemen trotz geringerer Masse hinreichend hohe Standsicherheit aufweisen können. In diesem Beitrag sollen die ersten Ergebnisse dieses Forschungsvorhabens vorgestellt werden.

Modulares Prognosemodell für den einsatzspezifischen Energieverbrauch von Gabelstaplern

Flurförderzeuge leisten einen wesentlichen Beitrag zu den Treibhausgasemissionen in der EU. Aktuell wird ihr Verbrauch in Deutschland in der Regel per VDI-Zyklus prognostiziert. Dieser hat allerdings keinen Bezug zu dem tatsächlichen Nutzungsprofil eines konkreten Flurförderzeugs. Es soll untersucht werden, inwiefern ein modularer Aufbau, der sich einsatzspezifisch anpassen lässt, eine verbesserte Prognose der Verbräuche ermöglicht. Zudem soll analysiert werden, wie viel Mehraufwand diese verbesserte Möglichkeit der Vorhersage für die Hersteller bzw. die Nutzer bedeutet. Am MTL ist ein Messsystem aufgebaut worden, welches neben dem Energieverbrauch auch die Einflussparameter aufnimmt. Es werden exemplarische Messungen vorgestellt.

Investigation of the Impact of Dual-Lane Axle Spacing on Lateral Load Distribution, 2016

The spacing of adjacent wheel lines of dual-lane loads induces different lateral live load distributions on bridges, which cannot be determined using the current American Association of State Highway and Transportation Officials (AASHTO) Load and Resistance Factor Design (LRFD) or Load Factor Design (LFD) equations for vehicles with standard axle configurations. Current Iowa law requires dual-lane loads to meet a five-foot requirement, the adequacy of which needs to be verified. To improve the state policy and AASHTO code specifications, it is necessary to understand the actual effects of wheel-line spacing on lateral load distribution. The main objective of this research was to investigate the impact of the wheel-line spacing of dual-lane loads on the lateral load distribution on bridges. To achieve this objective, a numerical evaluation using two-dimensional linear elastic finite element (FE) models was performed. For simulation purposes, 20 prestressed-concrete bridges, 20 steel bridges, and 20 slab bridges were randomly sampled from the Iowa bridge database. Based on the FE results, the load distribution factors (LDFs) of the concrete and steel bridges and the equivalent lengths of the slab bridges were derived. To investigate the variations of LDFs, a total of 22 types of single-axle four-wheel-line dual-lane loads were taken into account with configurations consisting of combinations of various interior and exterior wheel-line spacing. The corresponding moment and shear LDFs and equivalent widths were also derived using the AASHTO equations and the adequacy of the Iowa DOT five-foot requirement was evaluated. Finally, the axle weight limits per lane for different dual-lane load types were further calculated and recommended to complement the current Iowa Department of Transportation (DOT) policy and AASHTO code specifications.

Investigation of the Effect of Speed on the Dynamic Impact Factor for Bridges with Different Entrance Conditions, 2016

The dynamic interaction of vehicles and bridges results in live loads being induced into bridges that are greater than the vehicle’s static weight. To limit this dynamic effect, the Iowa Department of Transportation (DOT) currently requires that permitted trucks slow to five miles per hour and span the roadway centerline when crossing bridges. However, this practice has other negative consequences such as the potential for crashes, impracticality for bridges with high traffic volumes, and higher fuel consumption. The main objective of this work was to provide information and guidance on the allowable speeds for permitted vehicles and loads on bridges .A field test program was implemented on five bridges (i.e., two steel girder bridges, two pre-stressed concrete girder bridges, and one concrete slab bridge) to investigate the dynamic response of bridges due to vehicle loadings. The important factors taken into account during the field tests included vehicle speed, entrance conditions, vehicle characteristics (i.e., empty dump truck, full dump truck, and semi-truck), and bridge geometric characteristics (i.e., long span and short span). Three entrance conditions were used: As-is and also Level 1 and Level 2, which simulated rough entrance conditions with a fabricated ramp placed 10 feet from the joint between the bridge end and approach slab and directly next to the joint, respectively. The researchers analyzed and utilized the field data to derive the dynamic impact factors (DIFs) for all gauges installed on each bridge under the different loading scenarios.

Optimization models and methods for real-time transportation planning in forestry

Lors du transport du bois de la forêt vers les usines, de nombreux événements imprévus peuvent se produire, événements qui perturbent les trajets prévus (par exemple, en raison des conditions météo, des feux de forêt, de la présence de nouveaux chargements, etc.). Lorsque de tels événements ne sont connus que durant un trajet, le camion qui accomplit ce trajet doit être détourné vers un chemin alternatif. En l’absence d’informations sur un tel chemin, le chauffeur du camion est susceptible de choisir un chemin alternatif inutilement long ou pire, qui est lui-même "fermé" suite à un événement imprévu. Il est donc essentiel de fournir aux chauffeurs des informations en temps réel, en particulier des suggestions de chemins alternatifs lorsqu’une route prévue s’avère impraticable. Les possibilités de recours en cas d’imprévus dépendent des caractéristiques de la chaîne logistique étudiée comme la présence de camions auto-chargeurs et la politique de gestion du transport. Nous présentons trois articles traitant de contextes d’application différents ainsi que des modèles et des méthodes de résolution adaptés à chacun des contextes. Dans le premier article, les chauffeurs de camion disposent de l’ensemble du plan hebdomadaire de la semaine en cours. Dans ce contexte, tous les efforts doivent être faits pour minimiser les changements apportés au plan initial. Bien que la flotte de camions soit homogène, il y a un ordre de priorité des chauffeurs. Les plus prioritaires obtiennent les volumes de travail les plus importants. Minimiser les changements dans leurs plans est également une priorité. Étant donné que les conséquences des événements imprévus sur le plan de transport sont essentiellement des annulations et/ou des retards de certains voyages, l’approche proposée traite d’abord l’annulation et le retard d’un seul voyage, puis elle est généralisée pour traiter des événements plus complexes. Dans cette ap- proche, nous essayons de re-planifier les voyages impactés durant la même semaine de telle sorte qu’une chargeuse soit libre au moment de l’arrivée du camion à la fois au site forestier et à l’usine. De cette façon, les voyages des autres camions ne seront pas mo- difiés. Cette approche fournit aux répartiteurs des plans alternatifs en quelques secondes. De meilleures solutions pourraient être obtenues si le répartiteur était autorisé à apporter plus de modifications au plan initial. Dans le second article, nous considérons un contexte où un seul voyage à la fois est communiqué aux chauffeurs. Le répartiteur attend jusqu’à ce que le chauffeur termine son voyage avant de lui révéler le prochain voyage. Ce contexte est plus souple et offre plus de possibilités de recours en cas d’imprévus. En plus, le problème hebdomadaire peut être divisé en des problèmes quotidiens, puisque la demande est quotidienne et les usines sont ouvertes pendant des périodes limitées durant la journée. Nous utilisons un modèle de programmation mathématique basé sur un réseau espace-temps pour réagir aux perturbations. Bien que ces dernières puissent avoir des effets différents sur le plan de transport initial, une caractéristique clé du modèle proposé est qu’il reste valable pour traiter tous les imprévus, quelle que soit leur nature. En effet, l’impact de ces événements est capturé dans le réseau espace-temps et dans les paramètres d’entrée plutôt que dans le modèle lui-même. Le modèle est résolu pour la journée en cours chaque fois qu’un événement imprévu est révélé. Dans le dernier article, la flotte de camions est hétérogène, comprenant des camions avec des chargeuses à bord. La configuration des routes de ces camions est différente de celle des camions réguliers, car ils ne doivent pas être synchronisés avec les chargeuses. Nous utilisons un modèle mathématique où les colonnes peuvent être facilement et naturellement interprétées comme des itinéraires de camions. Nous résolvons ce modèle en utilisant la génération de colonnes. Dans un premier temps, nous relaxons l’intégralité des variables de décision et nous considérons seulement un sous-ensemble des itinéraires réalisables. Les itinéraires avec un potentiel d’amélioration de la solution courante sont ajoutés au modèle de manière itérative. Un réseau espace-temps est utilisé à la fois pour représenter les impacts des événements imprévus et pour générer ces itinéraires. La solution obtenue est généralement fractionnaire et un algorithme de branch-and-price est utilisé pour trouver des solutions entières. Plusieurs scénarios de perturbation ont été développés pour tester l’approche proposée sur des études de cas provenant de l’industrie forestière canadienne et les résultats numériques sont présentés pour les trois contextes.

Estimates of Total Fuel Consumption in Transporting Grain from Iowa to Major Grain-Importing Countries by Alternative Modes and Routes, 1985

This study measured fuel consumption in transporting grain from Iowa origins to Japan and Amsterdam by alternative routes and modes of transport and applied these data to construct equations for fuel consumption from Iowa origins to alternative final destinations. Some of the results are as follows: (1) The metered tractor-trailer truck averaged 186.6 gross ton-miles per gallon and 90.5 net ton-miles per gallon when loaded 50% of total miles. (2) The 1983 fuel consumption of seven trucks taken from company records was 82.4 net ton-miles per gallon at 67.5% loaded miles and 68.6 net ton-miles per gallon at 50% loaded miles. (3) Unit grain trains from Iowa to West Coast ports averaged 437.0 net ton-miles per gallon whereas unit grain trains from Iowa to New Orleans averaged 640.1 net ton-miles per gallon--a 46% advantage for the New Orleans trips. (4) Average barge fuel consumption on the Mississippi River from Iowa to New Orleans export grain elevators was 544.5 net ton-miles per gallon, with a 35% backhaul rate. (5) Ocean vessel net ton-miles per gallon varies widely by size of ship and backhaul percentage. With no backhaul, the average net ton-miles per gallon were as follows: for 30,000 dwt ship, 574.8 net ton-miles per gallon; for 50,000 dwt ship, 701.9; for 70,000 dwt ship, 835.1; and for 100,000 dwt ship, 1,043.4. (6) The most fuel efficient route and modal combination to transport grain from Iowa to Japan depends on the size of ocean vessel, the percentage of backhaul, and the origin of the grain. Alternative routes and modal combinations in shipping grain to Japan are ranked in descending order of fuel efficiencies.

Distribuição de conteúdos em redes veiculares usando mecanismos de comunicação tolerantes ao atraso

The last couple of decades have been the stage for the introduction of new telecommunication networks. It is expected that in the future all types of vehicles, such as cars, buses and trucks have the ability to intercommunicate and form a vehicular network. Vehicular networks display particularities when compared to other networks due to their continuous node mobility and their wide geographical dispersion, leading to a permanent network fragmentation. Therefore, the main challenges that this type of network entails relate to the intermittent connectivity and the long and variable delay in information delivery. To address the problems related to the intermittent connectivity, a new concept was introduced – Delay Tolerant Network (DTN). This architecture is built on a Store-Carry-and-Forward (SCF) mechanism in order to assure the delivery of information when there is no end-to-end path defined. Vehicular networks support a multiplicity of services, including the transportation of non-urgent information. Therefore, it is possible to conclude that the use of a DTN for the dissemination of non-urgent information is able to surpass the aforementioned challenges. The work developed focused on the use of DTNs for the dissemination of non-urgent information. This information is originated in the network service provider and should be available on mobile network terminals during a limited period of time. In order to do so, four different strategies were deployed: Random, Least Number of Hops First (LNHF), Local Rarest Bundle First (LRBF) e Local Rarest Generation First (LRGF). All of these strategies have a common goal: to disseminate content into the network in the shortest period of time and minimizing network congestion. This work also contemplates the analysis and implementation of techniques that reduce network congestion. The design, implementation and validation of the proposed strategies was divided into three stages. The first stage focused on creating a Matlab emulator for the fast implementation and strategy validation. This stage resulted in the four strategies that were afterwards implemented in the DTNs software Helix – developed in a partnership between Instituto de Telecomunicac¸˜oes (IT) and Veniam R , which are responsible for the largest operating vehicular network worldwide that is located in Oporto city. The strategies were later evaluated on an emulator that was built for the largescale testing of DTN. Both emulators account for vehicular mobility based on information previously collected from the real platform. Finally, the strategy that presented the best overall performance was tested on a real platform – in a lab environment – for concept and operability demonstration. It is possible to conclude that two of the implemented strategies (LRBF and LRGF) can be deployed in the real network and guarantee a significant delivery rate. The LRBF strategy has the best performance in terms of delivery. However, it needs to add a significant overhead to the network in order to work. In the future, tests of scalability should be conducted in a real environment in order to confirm the emulator results. The real implementation of the strategies should be accompanied by the introduction of new types of services for content distribution.

Avaliação do potencial de Tillandsia recurvata (L.) L., Bromeliaceae, como bioindicadora da poluição atmosférica urbana

Air pollution can threat the environment and public health, and is assess by pollutant ́s concentration measurements in order to verify whether the limits set by environmental agencies are being respected. However, these measures do not indicate immediately the impacts to living beings. To faced this problem, plants are been investigated as potential bioindicators of air pollution and, among them, stand out bromeliads Tillandsia genus which colonize various substrates,. obtaining water and nutrients from the atmosphere directly. In this context, this research assessed the potential of epiphytic bromeliad Tillandsia recurvata (L.) L. found in urbanized areas of the city of Curitiba - PR as a bioindicator of urban air pollution. According to vehicle traffic, five sample points were selected and classified. Points P1 and P2 were classified as high-traffic vehicle due presenting trucks and urban transport; point P3 was classified as moderate traffic due the predominance of private vehicles and urban transport; and points P4 and P5 were classified as low-traffic, presenting circulation of private vehicles only. There were analyzed the abundance of T. recurvata, morphophysiological parameters (leaf area, leaf specific area, sclerophylly index, percentage dry weight / fresh weight, chlorophyll (a + b), analysis of structural mesophyll organization) and the heavy metals accumulation (Fe, Cd, Cr, Cu, Pb and Zn). The abundance analysis and the results obtained for metals analysis were correlated with the intensity of vehicular traffic, directing the sampling points P1 > P2 = P3 > P4 = P5. This result demonstrate that the abundance of T. recurvata is greater in urban air pollution impacted areas, thus indicating that T. recurvata absorbs and accumulates metals and can be used in biomonitoring of urban air pollution in areas impacted by vehicular traffic. Morphophysiological parameters analyzed shows that the internal plant ́s structure is not significantly impacted by urban air pollution due plant ́s adptations. The presence of absorbing scales, the CAM metabolism pathway and it ́s store water ability, among other features, demonstrate their potential as bio-indicator in urban areas, especially regarding heavy metals accumulation .

Optimization models and methods for real-time transportation planning in forestry

Lors du transport du bois de la forêt vers les usines, de nombreux événements imprévus peuvent se produire, événements qui perturbent les trajets prévus (par exemple, en raison des conditions météo, des feux de forêt, de la présence de nouveaux chargements, etc.). Lorsque de tels événements ne sont connus que durant un trajet, le camion qui accomplit ce trajet doit être détourné vers un chemin alternatif. En l’absence d’informations sur un tel chemin, le chauffeur du camion est susceptible de choisir un chemin alternatif inutilement long ou pire, qui est lui-même "fermé" suite à un événement imprévu. Il est donc essentiel de fournir aux chauffeurs des informations en temps réel, en particulier des suggestions de chemins alternatifs lorsqu’une route prévue s’avère impraticable. Les possibilités de recours en cas d’imprévus dépendent des caractéristiques de la chaîne logistique étudiée comme la présence de camions auto-chargeurs et la politique de gestion du transport. Nous présentons trois articles traitant de contextes d’application différents ainsi que des modèles et des méthodes de résolution adaptés à chacun des contextes. Dans le premier article, les chauffeurs de camion disposent de l’ensemble du plan hebdomadaire de la semaine en cours. Dans ce contexte, tous les efforts doivent être faits pour minimiser les changements apportés au plan initial. Bien que la flotte de camions soit homogène, il y a un ordre de priorité des chauffeurs. Les plus prioritaires obtiennent les volumes de travail les plus importants. Minimiser les changements dans leurs plans est également une priorité. Étant donné que les conséquences des événements imprévus sur le plan de transport sont essentiellement des annulations et/ou des retards de certains voyages, l’approche proposée traite d’abord l’annulation et le retard d’un seul voyage, puis elle est généralisée pour traiter des événements plus complexes. Dans cette ap- proche, nous essayons de re-planifier les voyages impactés durant la même semaine de telle sorte qu’une chargeuse soit libre au moment de l’arrivée du camion à la fois au site forestier et à l’usine. De cette façon, les voyages des autres camions ne seront pas mo- difiés. Cette approche fournit aux répartiteurs des plans alternatifs en quelques secondes. De meilleures solutions pourraient être obtenues si le répartiteur était autorisé à apporter plus de modifications au plan initial. Dans le second article, nous considérons un contexte où un seul voyage à la fois est communiqué aux chauffeurs. Le répartiteur attend jusqu’à ce que le chauffeur termine son voyage avant de lui révéler le prochain voyage. Ce contexte est plus souple et offre plus de possibilités de recours en cas d’imprévus. En plus, le problème hebdomadaire peut être divisé en des problèmes quotidiens, puisque la demande est quotidienne et les usines sont ouvertes pendant des périodes limitées durant la journée. Nous utilisons un modèle de programmation mathématique basé sur un réseau espace-temps pour réagir aux perturbations. Bien que ces dernières puissent avoir des effets différents sur le plan de transport initial, une caractéristique clé du modèle proposé est qu’il reste valable pour traiter tous les imprévus, quelle que soit leur nature. En effet, l’impact de ces événements est capturé dans le réseau espace-temps et dans les paramètres d’entrée plutôt que dans le modèle lui-même. Le modèle est résolu pour la journée en cours chaque fois qu’un événement imprévu est révélé. Dans le dernier article, la flotte de camions est hétérogène, comprenant des camions avec des chargeuses à bord. La configuration des routes de ces camions est différente de celle des camions réguliers, car ils ne doivent pas être synchronisés avec les chargeuses. Nous utilisons un modèle mathématique où les colonnes peuvent être facilement et naturellement interprétées comme des itinéraires de camions. Nous résolvons ce modèle en utilisant la génération de colonnes. Dans un premier temps, nous relaxons l’intégralité des variables de décision et nous considérons seulement un sous-ensemble des itinéraires réalisables. Les itinéraires avec un potentiel d’amélioration de la solution courante sont ajoutés au modèle de manière itérative. Un réseau espace-temps est utilisé à la fois pour représenter les impacts des événements imprévus et pour générer ces itinéraires. La solution obtenue est généralement fractionnaire et un algorithme de branch-and-price est utilisé pour trouver des solutions entières. Plusieurs scénarios de perturbation ont été développés pour tester l’approche proposée sur des études de cas provenant de l’industrie forestière canadienne et les résultats numériques sont présentés pour les trois contextes.

Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results

In the standard Vehicle Routing Problem (VRP), we route a fleet of vehicles to deliver the demands of all customers such that the total distance traveled by the fleet is minimized. In this dissertation, we study variants of the VRP that minimize the completion time, i.e., we minimize the distance of the longest route. We call it the min-max objective function. In applications such as disaster relief efforts and military operations, the objective is often to finish the delivery or the task as soon as possible, not to plan routes with the minimum total distance. Even in commercial package delivery nowadays, companies are investing in new technologies to speed up delivery instead of focusing merely on the min-sum objective. In this dissertation, we compare the min-max and the standard (min-sum) objective functions in a worst-case analysis to show that the optimal solution with respect to one objective function can be very poor with respect to the other. The results motivate the design of algorithms specifically for the min-max objective. We study variants of min-max VRPs including one problem from the literature (the min-max Multi-Depot VRP) and two new problems (the min-max Split Delivery Multi-Depot VRP with Minimum Service Requirement and the min-max Close-Enough VRP). We develop heuristics to solve these three problems. We compare the results produced by our heuristics to the best-known solutions in the literature and find that our algorithms are effective. In the case where benchmark instances are not available, we generate instances whose near-optimal solutions can be estimated based on geometry. We formulate the Vehicle Routing Problem with Drones and carry out a theoretical analysis to show the maximum benefit from using drones in addition to trucks to reduce delivery time. The speed-up ratio depends on the number of drones loaded onto one truck and the speed of the drone relative to the speed of the truck.