Ship routing problem with berthing time clash avoidance constraints

Research output: Journal article publicationJournal articleAcademic researchpeer-review

25 Citations (Scopus)

Abstract

We consider a ship routing problem in which multiple vessels have to perform pickups and deliveries of cargoes at various locations. The loading and unloading time of cargoes at pickup and delivery locations is significant, and at each of these locations we need to assign a time slot to each vessel to perform the loading/unloading task so as to avoid time clashes. This problem is motivated by the operations of feeder vessels and company-owned cargo terminals, where the shipping company wishes to coordinate the routing and the berthing time of its vessels. We develop a heuristic algorithm for the problem using set partitioning formulation and column generation techniques. The effectiveness of the heuristic is tested via extensive computational experiments.
Original languageEnglish
Pages (from-to)752-762
Number of pages11
JournalInternational Journal of Production Economics
Volume131
Issue number2
DOIs
Publication statusPublished - 1 Jun 2011

Keywords

  • Berthing time
  • Column generation
  • Dynamic programming
  • Pickup and delivery
  • Ship routing

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this