Search results for "Programming"

Solving a large multicontainer loading problem in the car manufacturing industry

2017

Abstract Renault, a large car manufacturer with factories all over the world, has a production system in which not every factory produces all the parts required to assemble a vehicle. Every day, large quantities of car parts are sent from one factory to another, defining very large truck/container transportation problems. The main challenge faced by the Renault logistics platforms is to load the items into trucks and containers as efficiently as possible so as to minimize the number of vehicles sent. Therefore, the problem to be solved is a multicontainer loading problem in which, besides the usual geometric constraints preventing items from overlapping and exceeding the dimensions of the c…

A negotiation protocol to improve long distance truck parking

2017

A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots

2016

International audience; In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequaliti…

Mathematical models for multicontainer loading problems

2017

Abstract This paper deals with the problem of a distribution company that has to serve its customers by putting first the products on pallets and then loading the pallets onto trucks. We approach the problem by developing and solving integer linear models. We start with basic models, that include the essential features of the problem, such as respecting the dimensions of the truck, and not exceeding the total weight capacity and the maximum weigh capacity on each axle. Then, we add progressively new conditions to consider the weight and volume of pallet bases and to include other desirable features for the solutions to be useful in practice, such as the position of the center of gravity and…

Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem

2018

This paper presents a branch-and-price-and-cut algorithm for the exact solution of the active-passive vehicle-routing problem (APVRP). The APVRP covers a range of logistics applications where pickup-and-delivery requests necessitate a joint operation of active vehicles (e.g., trucks) and passive vehicles (e.g., loading devices such as containers or swap bodies). The objective is to minimize a weighted sum of the total distance traveled, the total completion time of the routes, and the number of unserved requests. To this end, the problem supports a flexible coupling and decoupling of active and passive vehicles at customer locations. Accordingly, the operations of the vehicles have to be s…

Suspension system performance optimization with discrete design variables

2013

Published version of an article in the journal: Structural and Multidisciplinary Optimization. Also available from the publisher at: http://dx.doi.org/10.1007/s00158-013-0888-7 Suspension systems on commercial vehicles have become an important feature meeting the requirements from costumers and legislation. The performance of the suspension system is often limited by available catalogue components. Additionally the suspension performance is restricted by the travel speed which highly influences the ride comfort. In this article a suspension system for an articulated dump truck is optimized in sense of reducing elapsed time for two specified duty cycles without violating a certain comfort th…

Mathematical models for Multi Container Loading Problems with practical constraints

2019

Abstract We address the multi container loading problem of a company that serves its customers’ orders by building pallets with the required products and loading them into trucks. The problem is solved by using integer linear models. To be useful in practice, our models consider three types of constraints: geometric constraints, so that pallets lie completely inside the trucks and do not overlap; weight constraints, defining the maximum weights supported by a truck and by each axle, as well as the position of the centre of gravity of the cargo; and dynamic stability constraints. These last constraints forbid empty spaces between pallets to avoid cargo displacement when the truck is moving, …

An ontological infrastructure for the automatic control of freight transport

2008

Currently, freight transport carried through a country or through different countries undergoes many delays due to merchandise controls. Merchandise control is only carried out at some border posts or when the authorities demand it. Such control can be an important problem since there are different laws for the same merchandise, according to the legislation of the country and even within the same country. Nowadays there are vocabularies or languages that describe concepts and structures of data related to transport, but the description is just syntactic, not semantic. Therefore the objective to be reached in this part of the research has been to develop a representation scheme of a particul…

The Multi-period Multi-trip Container Drayage Problem with Release and Due Dates

2021

Abstract The Container Drayage Problem (CDP) aims at routing a fleet of trucks, based at a common terminal, to serve customers while minimizing the total travel distance. Each trip starts from and ends at the terminal, and handles a subset of customers. Each customer requires either that a container is picked up or delivered. We introduce a more realistic variant, i.e., the Multi-trip Multi-period CDP with Release and Due Dates (MM-CDP-RDD), in which the planning horizon is composed of several periods (days). On each day, each truck may perform more than one trip respecting the Release and Due Dates (RDD) associated with customer services, corresponding to the first and the last day on whic…

Adaptation of microphysical and chemical instrumentation to the airborne measuring platform Iljushin I1-18 ‘Cyclone’ and flight regime planning durin…

1997

Abstract In 1993 the joint Russian-German Research Project ‘Arctic Haze’ started (see the Introduction and editorial note of this issue, by Jaenicke, Khattatov, Jaeschke and Leiterer). Besides CAO, four German groups were involved. To the present three airborne measuring campaigns have been performed. In total 251 h of flight within altitudes up to 8.7 km were flown in the western and eastern part of the arctic leading to a comprehensive set of data of the northern arctic hemisphere. The measurements were conducted aboard the Russian research aircraft I1-18 ‘Cyclone’ which was used by CAO in numerous scientific projects mainly in the former USSR. This 4 engined turboprop aircraft is well eq…