Modelling the Incomplete Intermodal Terminal Location Problem

03/03/2019
by   Oudani Mustapha, et al.
0

In this paper, we introduce and study the incomplete version of the intermodal terminal location problem. It's a generalization of the classical version by relaxing the assumption that the induced graph by located terminals is complete. We propose a mixed integer program to model the problem and we provide several extensions. All models are tested through validation in CPLEX solver. Numerical results are reported using well-known data set from the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2012

A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing Problem

This paper addresses a mixed integer programming (MIP) formulation for t...
research
05/07/2020

Continuous maximal covering location problems with interconnected facilities

In this paper we analyze a continuous version of the maximal covering lo...
research
01/10/2018

Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem

Metaheuristics are known to be strong in solving large-scale instances o...
research
05/22/2023

On the online path extension problem – Location and routing problems in board games

We consider an online version of a longest path problem in an undirected...
research
02/23/2020

Mixed Integer Programming for Searching Maximum Quasi-Bicliques

This paper is related to the problem of finding the maximal quasi-bicliq...
research
06/05/2023

Embedding Delay-Constrained VNF Forwarding Graphs into Reconfigurable WDM Optical Networks – Extended Version

Operators of reconfigurable wavelength-division multiplexed (WDM) optica...

Please sign up or login with your details

Forgot password? Click here to reset