A heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows

Simple item page
dc.creatorNeale Smith Cornejo
dc.date2014
dc.date.accessioned2018-10-18T20:12:57Z
dc.date.available2018-10-18T20:12:57Z
dc.descriptionThis paper develops a heuristic algorithm for solving a routing and scheduling problem for tramp shipping with discretized time windows. The problem consists of determining the set of cargoes that should be served by each ship, the arrival, departure, and waiting times at each port, while minimizing total costs. The heuristic proposed is based on a variable neighborhood search, considering a number of neighborhood structures to find a solution to the problem. We present computational results, and, for comparison purposes, we consider instances that can be solved directly by CPLEX to test the performance of the proposed heuristic. The heuristics achieves good solution quality with reasonable computational times. Our computational results are encouraging and establish that our heuristic can be utilized to solve large real-size instances. © 2014 Krystel K. Castillo-Villar et al.
dc.identifier.doi10.1155/2014/750232
dc.identifier.issn1024123X
dc.identifier.urihttp://hdl.handle.net/11285/630335
dc.identifier.volume2014
dc.languageeng
dc.publisherHindawi Publishing Corporation
dc.relationhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84899910105&doi=10.1155%2f2014%2f750232&partnerID=40&md5=77027de5a01d5c98c48894514e5bafb8
dc.relationInvestigadores
dc.relationEstudiantes
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0
dc.sourceMathematical Problems in Engineering
dc.subjectHeuristic algorithms
dc.subjectHeuristic methods
dc.subjectScheduling
dc.subjectAlgorithm for solving
dc.subjectComputational results
dc.subjectComputational time
dc.subjectHeuristic procedures
dc.subjectNeighborhood structure
dc.subjectRouting and scheduling
dc.subjectSolution quality
dc.subjectVariable neighborhood search
dc.subjectShips
dc.subject.classification7 INGENIERÍA Y TECNOLOGÍA
dc.titleA heuristic procedure for a ship routing and scheduling problem with variable speed and discretized time windows
dc.typeArtículo
refterms.dateFOA2018-10-18T20:12:57Z

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
9784136.pdf
Size:
2.61 MB
Format:
Adobe Portable Document Format
Download

Collections

Artículo
logo

El usuario tiene la obligación de utilizar los servicios y contenidos proporcionados por la Universidad, en particular, los impresos y recursos electrónicos, de conformidad con la legislación vigente y los principios de buena fe y en general usos aceptados, sin contravenir con su realización el orden público, especialmente, en el caso en que, para el adecuado desempeño de su actividad, necesita reproducir, distribuir, comunicar y/o poner a disposición, fragmentos de obras impresas o susceptibles de estar en formato analógico o digital, ya sea en soporte papel o electrónico. Ley 23/2006, de 7 de julio, por la que se modifica el texto revisado de la Ley de Propiedad Intelectual, aprobado

DSpace software copyright © 2002-2026

Licencia