Laboratoire de Génie Informatique et d’Automatique de l’Artois

Fábio francisco DA COSTA FONTES

Ph.D. student
(Position when this person departed from the LGI2A)
Member of the research themes:
International journal with review committee
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure
International Journal of Production Research, IJPR, novembre 2019
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
A VNDS approach for the liner shipping transport in a structure of hub-and-spoke with sub-hub
16th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'2018, Bergamo, Italy, IFAC, juin 2018
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
A new hub network design integrating deep sea and short sea services at liner shipping operations
International Journal of Shipping and Transport Logistics, IJSTL, pp 580-600, Vol. 9, No. 5, Inderscience Publishers, septembre 2017
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
Hub Location and Routing Problem: a Variable Neighborhood Decomposition Search based solving approach
Proceedings of the 6th International Conference on Metaheuristics and Nature Inspired Computing, META'2016, Marrakech, Morocco, octobre 2016
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
A Variable Neighborhood Decomposition Search Applied to the Hierarchical Hub Location and Routing Problem
Sixth International Workshop on Model-based Metaheuristics, Matheuristics 2016, Bruxelles, Belgium, 4-7 September 2016, septembre 2016
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
Routing Problem with Pendular and Cyclic Service in a Hierarchical Structure of Hub and Spoke with Multiple Allocation of Sub-Hubs
International Conference on Industrial Engineering and Systems Management, IESM'2015, Seville, Spain, octobre 2015
Fábio francisco DA COSTA FONTES -- Gilles GONCALVES
Hub Location and Routing Problem with Alternative Paths
4th IEEE International Conference on Advanced Logistics and Transport, ICALT'2015, Valenciennes, France, mai 2015

Author of the Ph.D. thesis "Optimization Models and Algorithms for the design of Global Transportation Networks"

2013 - 2017

Development of efficient network structures for freight transport is fundamental in the current global market. Demands need to be fluid quickly, meet customer needs in shortest possible time, congestions and delays need to be minimized, CO2 emissions have to be controlled and lower transport costs must to be offered to customers. Hub-and-spoke structure is actual network model used both in regional transport as intercontinental, offering an economy of scale for aggregated demands in hub nodes. But, delays, congestions and long delivery time are drawbacks of this network. In this thesis, a new concept, “sub-hub”, is added to classic hub-and-spoke network. In the proposed network models, economy of scale and shorter alternative paths are implemented, minimizing the transport cost and delivery time. Sub-hub is a connection point between two routes from distinct and close regions. Transhipments without passing through hub nodes are possible in sub-hubs. Congestions are avoided and consequently delays are thus minimized. Four binary integer linear programming models of hub location and routing problem are developed in this thesis. Networks with sub-hub and networks without sub-hub taking into account circular hub routes or direct connections between hubs are compared. These models are composed of four sub-problems (location, allocation, service design and routing) that makes complex the solving. A cutting plane approach is tested to solve small instances of problem whereas a Variable Neighborhood Decomposition Search (VNDS) composed of exact methods (matheuristic) has been developed to solve large instances. Implemented VNDS explores each sub-problem by different operators. Important gains in objective function are provided by models with sub-hub thus confirming the development of more competitive networks.