One reason for these many empty kilometers is that companies do everything they can to ensure that the competition
does not find out about their own order volume, costs or regular customers. Researchers at the University of Klagenfurt, Austria, are now investigating how the “sharing economy,” or collaborative vehicle routing, could keep the innermost secrets but still change the logistics industry. “The sharing economy is on the rise. Traditional business models need to be adapted and players need to learn how to survive in a world of shared free capacity and digital platforms,” says Margaretha Gansterer from the Department of Production Management & Logistics. She is leading the project entitled “EMIL – Exchange Mechanisms in Logistics,” which is being conducted at the University of Klagenfurt and the University of Vienna and funded by the Austrian Science Fund FWF. SUBSCRIBE TO IO ON TELEGRAM! Want to be inspired 365 days per year? Here’s the opportunity. We offer you one "origin of innovation" a day in a compact Telegram message. Seven days a week, delivered around 8 p.m. CET. Straight from our newsroom. อัตราค่าขนส่ง Subscribe here, it's free! Subscribe! Breaking down barriers “In our project, we focus on horizontal collaboration where companies at the same level of a supply chain share resources with their competitors by exchanging selected transport orders,” explains Margaretha Gansterer. This exchange could happen via digital platforms where transport service providers share information about their orders in a way that avoids empty runs as much as possible. Such platforms already exist but only partially exploit the potential of such collaboration. To optimize this, a number of hurdles still need to be overcome. First, competing companies naturally do not want to share important information. Second, a way must also be found to fairly share costs and also profits. Only when these issues are resolved to everyone’s satisfaction can transportation contracts be efficiently distributed between competing players. Researchers are now working on mechanisms that, on the one hand, can get by with as little information exchange as possible and, on the other hand, can divide up transport orders fairly and at low cost. One way to achieve this goal is auction systems that use a bidding process to allocate existing capacities without requiring companies to disclose sensitive data such as costs or regular customers. Creating incentives In addition, the allocation process should be designed in such a way that as many transport service providers as possible see incentives to participate in a beneficial way, such as ensuring that jointly achieved profits are shared fairly, say the researchers. This means that one of EMIL’s central problems is also how to design such a profit-sharing arrangement. “We want to ultimately increase the overall efficiency of the transportation industry by avoiding costly and environmentally damaging empty runs in the aggregate,” Gansterer says. The goal will be achieved with the help of complex, scientific methods from operations research and game theory. “Because the overall problem is very complex, computational studies are the only way we can analyze the effects of different exchange mechanisms, profit distributions and behavior of the actors*,” the United States of America and the Arab Republic of Egypt signed a memorandum of understanding to facilitate reciprocal provision of military logistic support, supplies, and services. The Acquisition and Cross-Servicing Memorandum of Understanding (ACSMOU) was signed by U.S. Central Command Director of Logistics and Engineering Major General Jeffrey Drushal and Egyptian Assistant Minister of Defense for International Affairs Major General Mohamed Salah at a ceremony at the Ministry of Defense, with U.S. Ambassador to Egypt Jonathan R. Cohen and Senior U.S. Defense Official/Defense Attaché Major General Mark W. Gillette and senior Ministry of Defense officials in attendance.  

Leave a comment

Your email address will not be published. Required fields are marked *