Search

International audience; This paper introduces the selective traveling salesman problem with draft limits, an extension of the traveling salesman problem with draft limits, wherein the goal is to design a maximum profit tour respecting draft limit constraints at the visited nodes. We propose a mixed integer linear programming (MILP) formulation for this problem. This MILP model is used to solve—to optimality—small size instances and to assess the quality of solutions obtained using a general variable neighborhood search heuristic that explores several neighborhood structures. Our extensive computational experiments confirm the efficiency of the method and the quality of the reported solutions.

In this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the multiple allocation hub location problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models.. From the perspective of an infrastructure owner, we want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation of the model along with a very efficient matheuristics algorithm for larger size instances.

In this paper, we address the problem of humanitarian aids distribution across refugee camps in war-ridden areas from a network design perspective. We show that the problem can be modeled as a variant of multi-period hub location problem with a particular demand pattern resulted by the user’s behavior. The problem has been motivated by a case study of Lebanese experience in Syrian war refugee accommodation. We elaborate on the complexity and real-life constraints and, propose a compact formulation of a mathematical model of the problem. We then show that modeling the problem using a Benders paradigm drives O ( n 3 ) variables of the original compact model unnecessary in addition to the constraints that are being projected out in a typical Benders decomposition. Additionally, we identify several classes of valid inequalities together with efficient separation procedures leading to a cut-and-Benders approach. Our extensive computational experiments on the case study with real data as well as randomly generated instances proves the performance of proposed solution methods.

A novel mathematical model for the workover rig scheduling.Identifying several classes of valid inequalities.Developed a very efficient hyper-heuristic method.Developed a branch, price and cut algorithm for the problem.Work is based on a case study of Petrobras, Brazilian petroleum company. We take into account a parallel heterogenous machine scheduling problem arising in maintenance planning of heterogeneous wells. This problem particularly arises in the context of workover rig scheduling. The oil wells need regular maintenance to ensure an optimal level of production. After oil production being decreased at some wells, appropriate workover rigs with compatible service capacity, are deployed to serve the wells at discrete locations. Every well needs a certain level of maintenance and rehabilitation services that can only be offered by compatible workover rigs. A new mixed integer linear programming model is propose for this problem that is an arc-time-indexed formulation. We propose a heuristic selection type hyper-heuristic algorithm, which is guided by a learning mechanism resulting in a clever choice of moves in the space of heuristics that are applied to solve the problem. The output is then used to warm start a branch, price and cut algorithm. Our numerical experiments are conducted on instances of a case study of Petrobras, the Brazilian National Petroleum Corporation. The computational experiments prove the efficiency of our hyper-heuristic in searching the right part of the search space using the right alternation among different heuristics and confirms the high quality of solutions obtained by our hyper-heuristic.

Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a time horizon rather than being owned or constructed. For a given discrete planning horizon, service providers must decide on the location of the hub ports (i.e. terminals), the period when the lease contract starts, the period when the existing contracts must be terminated and the flow routing over the entire planning horizon so as to minimize the total operational cost. Thus, we propose a mathematical model for a Multi-period Uncapacitated Multiple Allocation Hub Location Problem with Budget Constraint. The proposed model incorporates several features of practice, particularly from maritime and land transport practices. We also propose a meta-heuristic solution algorithm that produces high-quality solutions in a reasonable amount of time. By exploiting the decomposable structure of the model, we extended a Benders decomposition approach by proposing several improvements. Extensive computational experiments confirm the efficiency of the proposed methods and also show its limitations.

We present an integrated modelling framework for the joint problems of network design, fleet deployment and empty repositioning in liner shipping. In our problem the number of service routes and their design are an endogenous part of the problem. The cost of a route is a set function mapping a subset of edges, vessel types and quantities to deploy to the set of non-negative real numbers. Since such cost structures cannot be accommodated in a compact formulation, our modelling framework, which is based on the paradigm of the Benders reformulation, integrates separate problems aiming to obtain a solution to the integrated problem. In this work we look at the Benders approach as a tool for integrating separate optimization problems rather than decomposing an integrated holistic optimization problem. Our numerical experiments show that the method is very efficient in solving instances of this problem with respect to both the problem size and the computational time.

A new mathematical model is proposed for the Ring Spur Assignment Problem (RSAP) that arises in the design of next-generation telecommunication networks. In this problem, every node of the network lies either on a ring among a set of bounded disjoint local rings or is spurred by a single arc to another node on a local ring. A special ring, called a tertiary ring, interconnects the local rings. Our new integer programming model employs only O ( n 2 ) variables and has a stronger LP relaxation. Several classes of valid inequalities and corresponding separation procedures are presented giving rise to an efficient branch-and-cut solution algorithm. We report optimal solutions for all SNDLib instances including those that have not previously been solved to optimality.

All shipping liner companies divide their service regions into several rotations (strings) in order to operate their container vessels. A string is the ordered set of ports at which a container vessel will call. Each port is usually called at no more than twice along one string, although a single port may be called at several times on different strings. The size of string dictates the number of vessels required to offer a given frequency of service. In order to better use their shipping capacity, groups of Liner Service Providers sometimes make a short term agreement to merge some of their service routes (in a certain region) into one main ocean going rotation and p feeder rotations. In order to minimize the weighted sum of transit time, and fixed deployment costs, this paper proposes a mixed integer linear programming model of the network design, and an allocation of proper capacity size and frequency setting for every rotation. Given that none of the existing general-purpose MIP solvers is able to solve even very small problem instances in a reasonable time, we propose a Lagrangian decomposition approach which uses a heuristic procedure and is capable of obtaining practical and high quality solutions in reasonable times. The model will be applied on a real example, and we shall present some of the results obtained by our model which show how it facilitates a better use of assets and a significant reduction in the use of fuel, therefore allowing a more environmentally friendly service.

International audience; In this paper, we present the first model of co-opetition for a Hub Location Problem between two logistics service provider (LSPs) companies where the mother company is the owner of infrastructure. The LSPs would like to cooperate with each other by establishing joint edges with limited capacities connecting their service networks. Such services are in form of pendulum services (a direct service between two points) between nodes of different networks. Additional market can be generated as a result of joining the two networks. At the same time, a competition is taking place between the two operators to increase their share from the additional market generated. In order to solve this problem, we propose a matheuristic approach combining a local search algorithm and a Lagrangian relaxation-based approach. In our matheuristic algorithm, the neighbourhood solutions are evaluated using a Lagrangian relaxation-based approach. Numerical results of applying the proposed algorithm on a real case study of the problem are presented.

International audience; In this paper, we address a truck dock assignment problem with operational time constraint which has to be faced in the management of cross docks. More specifically, this problem is the subproblem of more involved problems with additional constraints and criteria. We propose a new integer programming model for this problem. The dimension of the polytope associated with the proposed model is identified by introducing a systematic way of generating linearly independent feasible solutions. Several classes of valid inequalities are also introduced. Some of them are proved to be facet-defining. Then, exact separation algorithms are described for separating cuts for classes with exponential number of constraints, and an efficient branch-and-cut algorithm solving real-life size instances in a reasonable time is provided. In most cases, the optimal solution is identified at the root node without requiring any branching.

International audience; In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo-hub allocations. We propose a mathematical model and a branch-and-cut algorithm based on Bendersdecomposition to solve the problem. To accelerate convergence, our solution framework embeds an efficientheuristic producing high-quality solutions in short computation times. In addition, we show how symmetrycan be exploited to accelerate and improve the performance of our method.

International audience; All shipping liner companies divide their service regions into several rotations (strings) inorder to operate their container vessels. A string is the ordered set of ports at which a container vessel will call. Each port is usually called at no more than twice along one string, although a single port may be called at several times on different strings. Moreover, hub-and-spoke operations is also the core of the operation and a major part of the trade volume is transhipped at least once along the origin-destination path. We present a mixed integer programming model which determines the location of transhipment ports and designs regional routes for the feeder serviens.\\As for even small instance size the problem becomes intractable, we will also present a decomposition scheme developed for solving instances of problem.