A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows

Mostra el registre complet Registre parcial de l'ítem

  • dc.contributor.author De Armas, Jésica
  • dc.contributor.author Lalla-Ruiz, Eduardo
  • dc.contributor.author Expósito-Izquierdo, Christopher
  • dc.contributor.author Landa-Silva, Dario
  • dc.contributor.author Melián-Batista, Belén
  • dc.date.accessioned 2024-02-12T09:50:27Z
  • dc.date.available 2024-02-12T09:50:27Z
  • dc.date.issued 2015
  • dc.description.abstract This paper addresses the Ship Routing and Scheduling Problem with Discretized Time Windows. Being one of the most relevant and challenging problems faced by decision makers from shipping companies, this tramp shipping problem lies in determining the set of contracts that should be served by each ship and the time windows that ships should use to serve each contract, with the aim of minimizing total costs. The use of discretized time windows allows for the consideration of a broad variety of features and practical constraints in a simple way. In order to solve this problem we propose a hybridization of a Greedy Randomized Adaptive Search Procedure and a Variable Neighborhood Search, which improves previous heuristics results found in the literature and requires very short computational time. Moreover, this algorithm is able to achieve the optimal results for many instances, demonstrating its good performance.
  • dc.description.sponsorship This work has been partially funded by the European Regional Development Fund, the Spanish Ministry of Economy and Competitiveness (project TIN2012-32608) and the Tri-continental Campus of Excellence. Eduardo Lalla-Ruiz and Christopher Expósito-Izquierdo thank the Canary Government the financial support they receive through their doctoral grants.
  • dc.format.mimetype application/pdf
  • dc.identifier.citation de Armas J, Lalla-Ruiz E, Expósito-Izquierdo C, Landa-Silva D, Melián-Batista B. A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows. Eng Appl Artif Intell. 2015 Oct;45:350-60. DOI: 10.1016/j.engappai.2015.07.013
  • dc.identifier.doi http://dx.doi.org/10.1016/j.engappai.2015.07.013
  • dc.identifier.issn 0952-1976
  • dc.identifier.uri http://hdl.handle.net/10230/59078
  • dc.language.iso eng
  • dc.publisher Elsevier
  • dc.relation.ispartof Engineering Applications of Artificial Intelligence. 2015 Oct;45:350-60
  • dc.relation.projectID info:eu-repo/grantAgreement/ES/3PN/TIN2012-32608
  • dc.rights © Elsevier http://dx.doi.org/10.1016/j.engappai.2015.07.013
  • dc.rights.accessRights info:eu-repo/semantics/openAccess
  • dc.subject.keyword Ship routing and scheduling problem
  • dc.subject.keyword Tramp shipping
  • dc.subject.keyword GRASP
  • dc.subject.keyword Variable neighbourhood search
  • dc.title A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows
  • dc.type info:eu-repo/semantics/article
  • dc.type.version info:eu-repo/semantics/acceptedVersion

Col·leccions

Articles (Departament d'Economia)