The Experts below are selected from a list of 12183 Experts worldwide ranked by ideXlab platform
Sebastien Martin - One of the best experts on this subject based on the ideXlab platform.
-
Tighter MIP models for Barge Container Ship Routing
Omega, 2019Co-Authors: Laurent Alfandari, Fabio Furini, Vladislav Maras, Tatjana Davidović, Ivana Ljubić, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.We also show how to further improve this model by projecting out arc variables for modeling the Shipping of empty containers. Our numerical study indicates that the latter model improves the computing times for the challenging case of unsplittable demands. We also study the impact of the turnaround time optimization on the total profit of the Company.
-
tighter mip models for barge container ship routing
Omega-international Journal of Management Science, 2017Co-Authors: Laurent Alfandari, Tatjana Davidovic, Fabio Furini, Ivana Ljubic, Vladislav Maras, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.
Laurent Alfandari - One of the best experts on this subject based on the ideXlab platform.
-
Tighter MIP models for Barge Container Ship Routing
Omega, 2019Co-Authors: Laurent Alfandari, Fabio Furini, Vladislav Maras, Tatjana Davidović, Ivana Ljubić, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.We also show how to further improve this model by projecting out arc variables for modeling the Shipping of empty containers. Our numerical study indicates that the latter model improves the computing times for the challenging case of unsplittable demands. We also study the impact of the turnaround time optimization on the total profit of the Company.
-
tighter mip models for barge container ship routing
Omega-international Journal of Management Science, 2017Co-Authors: Laurent Alfandari, Tatjana Davidovic, Fabio Furini, Ivana Ljubic, Vladislav Maras, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.
Vladislav Maras - One of the best experts on this subject based on the ideXlab platform.
-
Tighter MIP models for Barge Container Ship Routing
Omega, 2019Co-Authors: Laurent Alfandari, Fabio Furini, Vladislav Maras, Tatjana Davidović, Ivana Ljubić, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.We also show how to further improve this model by projecting out arc variables for modeling the Shipping of empty containers. Our numerical study indicates that the latter model improves the computing times for the challenging case of unsplittable demands. We also study the impact of the turnaround time optimization on the total profit of the Company.
-
tighter mip models for barge container ship routing
Omega-international Journal of Management Science, 2017Co-Authors: Laurent Alfandari, Tatjana Davidovic, Fabio Furini, Ivana Ljubic, Vladislav Maras, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.
Fabio Furini - One of the best experts on this subject based on the ideXlab platform.
-
Tighter MIP models for Barge Container Ship Routing
Omega, 2019Co-Authors: Laurent Alfandari, Fabio Furini, Vladislav Maras, Tatjana Davidović, Ivana Ljubić, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.We also show how to further improve this model by projecting out arc variables for modeling the Shipping of empty containers. Our numerical study indicates that the latter model improves the computing times for the challenging case of unsplittable demands. We also study the impact of the turnaround time optimization on the total profit of the Company.
-
tighter mip models for barge container ship routing
Omega-international Journal of Management Science, 2017Co-Authors: Laurent Alfandari, Tatjana Davidovic, Fabio Furini, Ivana Ljubic, Vladislav Maras, Sebastien MartinAbstract:This paper addresses the problem of optimal planning of a liner service for a barge container Shipping Company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the Shipping Company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the Shipping Company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands.
Anabela Carvalho Alves - One of the best experts on this subject based on the ideXlab platform.
-
hats project for lean and smart global logistic a Shipping Company case study
Manufacturing letters, 2020Co-Authors: Emanuele Frontoni, Roberto Rosetti, Marina Paolanti, Anabela Carvalho AlvesAbstract:Abstract Global logistic activities related to e-commerce have become very time dependent in recent years. International couriers face everyday issues related to pick-up time windows, lead times delays, express/normal deliveries management, security and VAT management. There are supply chain management methodologies that, based on lean thinking principles integrated with industry 4.0 concepts, well address these issues. In this paper, a project developed in an Italian Shipping Company shows the potential of solutions based on these principles and concepts. Main results from this project were lead time reduction and cost reduction, with higher goods security level and a real-time data sharing policy.
