Add to ORKGEnThe Lane Covering Problem with Time Windows arises in the context of collaborative logistics. Given a set of lanes, it aims at finding a set of tours covering all lanes with the objective of minimizing the total travel cost. The purpose of this paper is to formulate a model for such a problem and to propose a heuristic approach based on Lagrangian relaxation for its solution. The behaviour of this procedure is tested on a set of random instances
International audienceThis work studies a lane reservation problem in a transportation network. It a...
We study a combinatorial optimization problem that is motivated by the scenario of autonomous cars d...
International audienceThis paper studied an optimal lane reservation problem with time-dependent lin...
In collaborative truckload transportation procurement, the collaborating shippers aim to jointly ide...
In collaborative logistics, multiple carriers form an alliance to improve their transportation opera...
Optimization of operations in transportation logistics may often be mathematically modelled as 0-1 i...
We consider the problem of finding the minimum number of vehicles required to visit once a set of no...
Traffic Management and Logistics optimization, when considered separately, are well-known problems w...
In this dissertation we study two integrated logistical models that simultaneously consider both dem...
International audienceThis work studies a lane reservation problem withoptimally grouping tasks, whi...
International audienceWe consider a logistics network design problem with multiple periods, echelons...
In this study, a coordinated production and transportation planning problem is addressed. A fleet of...
We consider a problem in which a given good has to be delivered from some origins (say production pl...
The purpose of this research is to develop a heuristic algorithm to minimize total costs in multi-co...
The rising competition in the logistics sector forces companies to be more economically efficient. O...
International audienceThis work studies a lane reservation problem in a transportation network. It a...
We study a combinatorial optimization problem that is motivated by the scenario of autonomous cars d...
International audienceThis paper studied an optimal lane reservation problem with time-dependent lin...
In collaborative truckload transportation procurement, the collaborating shippers aim to jointly ide...
In collaborative logistics, multiple carriers form an alliance to improve their transportation opera...
Optimization of operations in transportation logistics may often be mathematically modelled as 0-1 i...
We consider the problem of finding the minimum number of vehicles required to visit once a set of no...
Traffic Management and Logistics optimization, when considered separately, are well-known problems w...
In this dissertation we study two integrated logistical models that simultaneously consider both dem...
International audienceThis work studies a lane reservation problem withoptimally grouping tasks, whi...
International audienceWe consider a logistics network design problem with multiple periods, echelons...
In this study, a coordinated production and transportation planning problem is addressed. A fleet of...
We consider a problem in which a given good has to be delivered from some origins (say production pl...
The purpose of this research is to develop a heuristic algorithm to minimize total costs in multi-co...
The rising competition in the logistics sector forces companies to be more economically efficient. O...
International audienceThis work studies a lane reservation problem in a transportation network. It a...
We study a combinatorial optimization problem that is motivated by the scenario of autonomous cars d...
International audienceThis paper studied an optimal lane reservation problem with time-dependent lin...