Liner Service Network Design
The project aims at finding improved solutions to the network design through advanced heuristic algorithms and exploring mathematical models of the problem. The Cargo allocation problem and a greedy construction heuristic are parts of the project.
The Cargo Allocation Problem with Empty Repositioning (CAPER) is a mathematical model to determine the routing of full containers and empty equipment in a service network. It decides empty equipment flows and selects the most profitable cargo to transport. The article will be published in INFOR.
The Multiple Quadratic Knapsack Problem is used as model for the liner shipping network design problem applying a greedy heuristic to solve the problem. It was presented at TRISTAN VII.
The container network repositioning problem
Tackling the container network repositioning problem, in which container vessels are substituted for one another to create new services as well as to ensure all vessels follow a proper maintenance schedule.
This part of the container shipping network lies hidden from customers, but provides a great potential for environmental and cost savings. Solving the repositioning problem involves bridging the gap between classical artificial intelligence planning and mathematical optimization techniques.
For further information please contact Kevin Tierney, email@example.com
Optimization of container line networks with flexible demands
The project will investigate how a container shipping network should adjust to changes in the basic cost structure (Vessels, bunker, port costs, ..), by modeling and solving the Liner Shipping Network Design Problem, a representation of the operational and commercial rules governing liner shipping. This will be done using Operations research techniques such as column generation and metaheuristics. The work will expand on current state of the art results in the field and attempt to improve these methods and develop new ones, with a focus on how such a network should adjust to cost and demand changes.
For further information please contact Christian Plum, firstname.lastname@example.org