A multi-start local search heuristic for ship scheduling—a computational study

Brønmo, Geir; Christiansen, Marielle; Fagerholt, Kjetil; Nygreen, Bjørn

doi:10.1016/j.cor.2005.05.017

Cited by 74 publications

(64 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Additionally, Bakkehaug et al [46] applies the ANLS heuristic to a maritime setting, with a focus on fleet deployment and voyage (i.e., sailing on a route) separation. A multi-start local search heuristic was proposed by [47] for short-term ship scheduling problems in the tramp mode. The tabu search approach derived by [48] for ship routing and scheduling problems is tested and benchmarked against the multi-start heuristic [47]; the tabu search heuristic yields better solutions for large and tightly-constrained instances.…”

Section: Literature Reviewmentioning

confidence: 99%

“…A multi-start local search heuristic was proposed by [47] for short-term ship scheduling problems in the tramp mode. The tabu search approach derived by [48] for ship routing and scheduling problems is tested and benchmarked against the multi-start heuristic [47]; the tabu search heuristic yields better solutions for large and tightly-constrained instances. Another tabu search method, considering flexible cargo quantities, is proposed and presented by [49].…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Rodrigues

Morábito

Yamashita

et al. 2016

Systems

View full text Add to dashboard Cite

This paper examines a ship routing problem with pickup and delivery and time windows for maritime oil transportation, motivated by the production and logistics activities of an oil company operating in the Brazilian coast. The transportation costs from offshore platforms to coastal terminals are an important issue in the search for operational excellence in the oil industry, involving operations that demand agile and effective decision support systems. This paper presents an optimization approach to address this problem, based on a mixed integer programming (MIP) model and a novel and exploratory application of two tailor-made MIP heuristics, based on relax-and-fix and time decomposition procedures. The model minimizes fuel costs of a heterogeneous fleet of oil tankers and costs related to freighting contracts. The model also considers company-specific constraints for offshore oil transportation. Computational experiments based on the mathematical models and the related MIP heuristics are presented for a set of real data provided by the company, which confirm the potential of optimization-based methods to find good solutions for problems of moderate sizes.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Literature Reviewmentioning

confidence: 99%

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Rodrigues

Morábito

Yamashita

et al. 2016

Systems

View full text Add to dashboard Cite

show abstract

“…In such a case some of the cargoes can be serviced by spot charters, which are ships chartered for a single voyage. There exists several applications described in the literature for both tramp and industrial shipping where some of the cargoes might be serviced by spot charters, see for instance [7,19,25,56,133] …”

Section: 11mentioning

confidence: 99%

Industrial aspects and literature survey: Fleet composition and routing

Hoff

Andersson

Christiansen

et al. 2010

Computers & Operations Research

Self Cite

293

150

View full text Add to dashboard Cite

The purpose of this paper is to describe industrial aspects of combined fleet composition and routing in maritime and road-based transportation, and to present the current status of research in the form of a comprehensive literature review. With a backdrop of industrial aspects, a categorized survey of relevant literature since the first published papers in the 1950's is given. First, the literature review discusses some early seminal and application-oriented papers, presents a classification of problems, and then focuses on a basic definition of combined fleet composition and routing: the fleet size and mix vehicle routing problem. Three basic mathematical formulations from the literature are presented and compared. Further, the literature of extended and related problems is described and categorized. Surveys of application oriented research in road-based and maritime transportation conclude the review. Finally, we contrast the literature with aspects of industrial applications from a critical, but constructive stance. Major issues for future work are suggested.

show abstract

“…The details of the problem we discuss here are similar to those described by people like Desrosiers et al, 4 which include a multi-car collection and delivery problem. Korsvik and Fagerholt 5 offered a Tabu search heuristic algorithm, which is the opposite of the heuristics of people like Brønmo et al, 6 which allows for the infeasible solution window constraint on the capacity and time window of the ship. Tabu search heuristic is better than the local search heuristics model proposed by the people like Brønmo et al, 6 especially for larger and more constrained problems.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Korsvik and Fagerholt 5 offered a Tabu search heuristic algorithm, which is the opposite of the heuristics of people like Brønmo et al, 6 which allows for the infeasible solution window constraint on the capacity and time window of the ship. Tabu search heuristic is better than the local search heuristics model proposed by the people like Brønmo et al, 6 especially for larger and more constrained problems. In a recent paper, Malliappi et al 7 proposed a variable neighborhood search heuristic algorithm for a same problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Fleet routing and scheduling problem based on constraints of chance

Guan

Peng

Chen

et al. 2017

Advances in Mechanical Engineering

View full text Add to dashboard Cite

Tramp shipping transport is an important part of ocean transportation. However, facing the spot market with many uncertain conditions, it is not easy for fleet operators to plan vessel's routes and schedule in the later period time, especially considering the situation that loading time window for a lot of cargoes has strong randomness. This article designed a linear programming model with chance constraints for the time window of loading cargo. Before the optimization, a survey for the waiting time of ships for berths is carried out in some of the ports with large export volume. Combined with the degree of acceptance how long ship owners can wait for the berth, the uncertain time window constraints can be transformed into deterministic constraints. The model is solved by column generation optimization technique. The model and algorithm are verified by a case of Panamax bulker fleet planning in real market. The results show that the model and the algorithm proposed in the article can well work on large-scale problem and can achieve good precision. Also, via sensitivity analysis, we provide decision makers good reference to balance profit and risks coming from randomness.

show abstract

A multi-start local search heuristic for ship scheduling—a computational study

Cited by 74 publications

References 19 publications

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Ship Routing with Pickup and Delivery for a Maritime Oil Transportation System: MIP Model and Heuristics

Industrial aspects and literature survey: Fleet composition and routing

Fleet routing and scheduling problem based on constraints of chance

Contact Info

Product

Resources

About