Single string planning problem arising in liner shipping industries: a heuristic approach

DOI10.1016/j.cor.2013.03.018zbMath1348.90088OpenAlexW2070108953WikidataQ58826355 ScholiaQ58826355MaRDI QIDQ336521

Shahin Gelareh, Philippe Mahey, David Pisinger, Rahimeh Neamatian Monemi, Nelson F. Maculan

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.03.018

zbMATH Keywords

metaheuristicnetwork designliner shippingmaritime

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Sustainable decision model for liner shipping industry

Uses Software

• VRP

Cites Work

• Unnamed Item
• The orienteering problem: a survey
• A metaheuristic for stochastic service network design
• Hub-and-spoke network design and fleet deployment for string planning of liner shipping
• A general heuristic for vehicle routing problems
• The selective travelling salesman problem
• Variable neighborhood search
• Variable neighborhood decomposition search
• A visual interactive approach to vehicle routing
• The Vehicle Routing Problem
• Routing Container Ships Using Lagrangean Relaxation and Decomposition
• A reactive tabu search for the vehicle routing problem
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership
• The orienteering problem
• Variable Neighborhood Search
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS