Conference paper · 2012

On the optimal scheduling problem of the routing programming for container liner ship

Meiling Feng, Chen Chen, Junqing Sun, Fenglian Liu

Chinese Control Conference (CCC), 2526–2531 · Published 25 July 2012

View at the publisherCite this paper

In brief

“On the optimal scheduling problem of the routing programming for container liner ship” is a 2012 conference paper by Meiling Feng and 3 co-authors, published in Chinese Control Conference (CCC). OpenAlex counts 0 citations as of 19 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
4

Abstract

This paper addresses the optimization problem of a container liner ship's routing programming and scheduling. Firstly, the mathematical model of the container liner ship's routing programming and scheduling is proposed based on the mode of hub-and-spoke. The mathematical model aims to determine how to divide the set of all candidate ports into the hub port… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Feng, M., Chen, C., Sun, J., & Liu, F. (2012). On the optimal scheduling problem of the routing programming for container liner ship. Chinese Control Conference (CCC), 2526–2531. https://ieeexplore.ieee.org/document/6390350/

MLA 9

Feng, Meiling, et al. “On the optimal scheduling problem of the routing programming for container liner ship.” Chinese Control Conference (CCC), 2012, pp. 2526–2531. https://ieeexplore.ieee.org/document/6390350/.

Chicago

Feng, Meiling, Chen Chen, Junqing Sun, and Fenglian Liu. 2012. “On the optimal scheduling problem of the routing programming for container liner ship.” Chinese Control Conference (CCC): 2526–2531. https://ieeexplore.ieee.org/document/6390350/.

Harvard

Feng, M. et al. (2012) ‘On the optimal scheduling problem of the routing programming for container liner ship’, Chinese Control Conference (CCC), pp. 2526–2531. Available at: https://ieeexplore.ieee.org/document/6390350/.

IEEE

M. Feng, C. Chen, J. Sun, and F. Liu, “On the optimal scheduling problem of the routing programming for container liner ship,” Chinese Control Conference (CCC), pp. 2526–2531, 2012.

BibTeX

@inproceedings{feng2012optimal,
  title     = {{On the optimal scheduling problem of the routing programming for container liner ship}},
  author    = {Feng, Meiling and Chen, Chen and Sun, Junqing and Liu, Fenglian},
  booktitle = {Chinese Control Conference (CCC)},
  year      = {2012},
  pages     = {2526--2531},
  url       = {https://ieeexplore.ieee.org/document/6390350/}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Maritime Ports and Logistics

  • liner shipping
  • ship routing
  • hub-and-spoke networks
  • port selection
  • profit maximization
  • NP-hardness
  • ant colony optimization
  • heuristic scheduling

Work with this paper

Most-cited papers in Engineering

All highly cited Engineering papers

Questions about this paper

How do I cite this paper in APA style?

Feng, M., Chen, C., Sun, J., & Liu, F. (2012). On the optimal scheduling problem of the routing programming for container liner ship. Chinese Control Conference (CCC), 2526–2531. https://ieeexplore.ieee.org/document/6390350/

How many times has this paper been cited?

0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Meiling Feng, Chen Chen, Junqing Sun, Fenglian Liu.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.