A Matheuristic for the Liner Shipping Network Design Problem with Transit Time Restrictions.
Berit Dangaard BrouerGuy DesaulniersChristian Vad KarstenDavid PisingerPublished in: ICCL (2015)
Keyphrases
- network design problem
- approximation algorithms
- network design
- benders decomposition
- minimal cost
- mixed integer programming
- branch and bound
- mixed integer
- transportation networks
- integer programming
- valid inequalities
- special case
- lagrangian heuristic
- lagrangian relaxation
- exact solution
- optimization problems
- evolutionary algorithm
- objective function