An optimization model and its complexity on liner scheduling problem with customer choice

@article{Song2010AnOM,
  title={An optimization model and its complexity on liner scheduling problem with customer choice},
  author={Haiqing Song},
  journal={2010 International Conference on Logistics Systems and Intelligent Management (ICLSIM)},
  year={2010},
  volume={2},
  pages={775-778}
}
  • Haiqing Song
  • Published 2010 in
    2010 International Conference on Logistics…
In this paper, we study the liner scheduling problem with consideration of the customer choice which depends on the transportation time of a route. We provide a mixed integer model for the problem and show that it is NP-complete. We then provide two ideas on solving this model.